{"as_of":"2026-07-14T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ef941bd3697728ecfeba09046990e1bd5aa64d9a9cd8b1676e987e31daeea6e3","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T04:10:16.314596Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T04:13:04.977319Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-07-05T04:31:25.292708Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":"2110.02027","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-06-29T04:13:04.977319Z","title":"& others","venue":null,"work_id":"11ada82a-6828-4a83-bc18-b11f6c7cc70a","year":2021},"citing_paper":{"arxiv_id":"2510.00767","last_updated":"2025-10-01T10:59:35Z","snapshot_observed_at":"2026-05-24T23:01:03.417737Z","submitted_at":"2025-10-01T10:59:35Z","title":"Color2Struct: efficient and accurate deep-learning inverse design of structural color with controllable inference","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-05-22T12:08:33.250459Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2510.00767"},"observation_digest":"sha256:21f7dbbe911f920ee6c6c47d27c07903ac9515abe4f93f5ff849336c4ee82738","observation_id":"64c0bf57-b0b8-4ade-8682-e3c980276c1f","resolution":{"observed_at":"2026-05-22T12:11:31.215960Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"reason":"named_source_frontier_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-07-05T04:31:25.292708Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":"2110.02027","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-06-29T04:13:04.977319Z","title":"& others","venue":null,"work_id":"11ada82a-6828-4a83-bc18-b11f6c7cc70a","year":2021},"citing_paper":{"arxiv_id":"2606.27747","last_updated":"2026-06-26T06:03:33Z","snapshot_observed_at":"2026-07-01T23:15:33.673699Z","submitted_at":"2026-06-26T06:03:33Z","title":"UNICS: Multilingual Code Search via Unified Pseudocode and Contrastive Transfer Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T04:10:16.314596Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2606.27747"},"observation_digest":"sha256:3a7d8a91ff66a1bffc314f5f63b925756c9bf448a1c4c6eeed7318dff0b4efcd","observation_id":"ef546acc-24f4-4333-abc3-320491aa7dab","resolution":{"observed_at":"2026-06-29T04:13:04.978756Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"reason":"named_source_frontier_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2110.02027/citation-record","integrity":"/paper/2110.02027/integrity","json":"/paper/2110.02027/citation-record.json","paper":"/paper/2110.02027"},"outbound":[],"paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-05T04:31:25.292708Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[],"thesis":"As of 14 July 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.02027."}