{"as_of":"2026-08-18T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed4025eee6bdc93142ca66e9c4c5fb9358f3fd5cc48acc5a1e20d9da3c75cd30","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:50.205352Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":44,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-16T17:51:47.039950Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-07T15:29:50.205352Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15103","last_updated":"2025-08-08T06:14:32Z","snapshot_observed_at":"2026-08-15T21:37:39.620167Z","submitted_at":"2025-05-21T04:54:18Z","title":"Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.205352Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:4172bcb863e57b8b3db9f312425342f9f90a7d1a99dff5346964098ca93dab52","observation_id":"d2b2d989-01dd-4aed-a77d-91c843222df4","resolution":{"observed_at":"2026-08-07T15:29:50.205352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-16T17:51:47.039950Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-06T16:24:07.925617Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-08T06:44:13.884566Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.925617Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:3827167a887a87bea75562e5d6d0279eda44ea8396fca84b220dc981adb7b796","observation_id":"0cf8a243-4289-4293-84a4-8f696d876cb9","resolution":{"observed_at":"2026-08-06T16:24:07.925617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-16T17:51:47.039950Z","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":"10.48550/arxiv.2110.02027","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"& others","venue":"arXiv (Cornell University)","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-08-17T18:40:56.539904Z","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:76a8d295a5f428762237ea891ae5ec0e82c33f8c0660c2bf99436236a8586e34","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":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-16T17:51:47.039950Z","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":"10.48550/arxiv.2110.02027","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"& others","venue":"arXiv (Cornell University)","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-31T00:36:38.847403Z","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:d29d204d53fea9e673f626346d2ca3c3806c8bf79b3bf4ae6ffeab8026ce7a10","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":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"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-08-16T17:51:47.039950Z","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":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2110.02027."}