{"as_of":"2026-08-13T14:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0488898379630bcf63463188ea191e2c9515a091e5bcb4adf816d1214cb8bf04","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":"2026-08-13T06:32:02.005865+00:00","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-08-11T21:52:06.832971Z","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-11T20:00:34.558738Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.08541","last_updated":"2021-06-16T03:56:03Z","snapshot_observed_at":"2026-08-13T03:08:09.766586Z","submitted_at":"2021-06-16T03:56:03Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.08541","snapshot_observed_at":"2026-08-11T21:52:06.832971Z","title":"Distilling Self - Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages , June 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04064","last_updated":"2024-12-05T10:59:20Z","snapshot_observed_at":"2026-08-13T06:07:11.790228Z","submitted_at":"2024-12-05T10:59:20Z","title":"Graph Neural Networks Need Cluster-Normalize-Activate Modules","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T21:52:06.832971Z"},"links":{"cited_paper":"/paper/2106.08541","citing_paper":"/paper/2412.04064"},"observation_digest":"sha256:b5314a9947f1af5ec4748318f594277abb0b584fdf7ae9fd7d55bbb3aa0c2305","observation_id":"dd114a47-5a85-4f7f-96f1-28cebcf4d0a2","resolution":{"observed_at":"2026-08-11T21:52:06.832971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08541","last_updated":"2021-06-16T03:56:03Z","snapshot_observed_at":"2026-08-13T03:08:09.766586Z","submitted_at":"2021-06-16T03:56:03Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","version":1},"cited_work":{"arxiv_id":"2106.08541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.08541","snapshot_observed_at":"2026-08-11T20:00:34.558738Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","venue":"cs.LG","work_id":"65e8d281-1600-4de9-8aa0-71c6ce6e2ffd","year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.331434Z"},"links":{"cited_paper":"/paper/2106.08541","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:9faa7beaffed3171945ca029692483e60ba435a0c1807c6d2f907183d8bf544c","observation_id":"82946a4a-ae0b-42ca-aa11-07efeab1ba73","resolution":{"observed_at":"2026-08-11T20:00:34.564193Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.08541/citation-record","integrity":"/paper/2106.08541/integrity","json":"/paper/2106.08541/citation-record.json","paper":"/paper/2106.08541"},"outbound":[],"paper":{"arxiv_id":"2106.08541","last_updated":"2021-06-16T03:56:03Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T03:08:09.766586Z","submitted_at":"2021-06-16T03:56:03Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.08541."}