{"as_of":"2026-08-07T23:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51c992bf71c372f787717cc7b16d1394bd67e8feab11759257f06b2b39e9e9c1","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:17:16.884599Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T05:17:18.223131Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.13085","last_updated":"2021-02-25T18:55:15Z","snapshot_observed_at":"2026-07-06T10:44:44.451935Z","submitted_at":"2021-02-25T18:55:15Z","title":"Towards Robust Graph Contrastive Learning","version":1},"cited_work":{"arxiv_id":"2102.13085","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.13085","snapshot_observed_at":"2026-08-07T05:17:18.223131Z","title":"Towards Robust Graph Contrastive Learning","venue":"cs.LG","work_id":"c73666bd-d179-4cb1-a4fc-51ecf1a7efaf","year":2021},"citing_paper":{"arxiv_id":"2506.08326","last_updated":"2025-06-10T01:27:19Z","snapshot_observed_at":"2026-08-07T05:11:09.756792Z","submitted_at":"2025-06-10T01:27:19Z","title":"Graph Prompting for Graph Learning Models: Recent Advances and Future Directions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:17:16.884599Z"},"links":{"cited_paper":"/paper/2102.13085","citing_paper":"/paper/2506.08326"},"observation_digest":"sha256:94bc473591bba22ec75daa1130deb09b7fa496c01dbf2daca16ec20511be332c","observation_id":"1cbb16a9-3cfc-49dc-9572-7cc847fd6af2","resolution":{"observed_at":"2026-08-07T05:17:18.228085Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.13085/citation-record","integrity":"/paper/2102.13085/integrity","json":"/paper/2102.13085/citation-record.json","paper":"/paper/2102.13085"},"outbound":[],"paper":{"arxiv_id":"2102.13085","last_updated":"2021-02-25T18:55:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:44:44.451935Z","submitted_at":"2021-02-25T18:55:15Z","title":"Towards Robust 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2102.13085."}