{"as_of":"2026-08-09T19:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:43c5400be3cd79fa42551e12c1fe7d83eed99374cbb129654f201ac482549f5e","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-09T06:31:02.800959+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-09T12:05:55.648037Z","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:00:55.727358Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.00976","last_updated":"2024-10-14T14:11:22Z","snapshot_observed_at":"2026-07-06T16:13:38.508734Z","submitted_at":"2023-09-02T16:20:41Z","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00976","snapshot_observed_at":"2026-08-09T12:05:55.648037Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02479","last_updated":"2025-02-04T16:54:28Z","snapshot_observed_at":"2026-08-09T18:26:41.757443Z","submitted_at":"2025-02-04T16:54:28Z","title":"Using Random Noise Equivariantly to Boost Graph Neural Networks Universally","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T12:05:55.648037Z"},"links":{"cited_paper":"/paper/2309.00976","citing_paper":"/paper/2502.02479"},"observation_digest":"sha256:84dd02239ca18c8d4bbfbae699a81d19a161fdd045590d7a896cbc28ce3c8f45","observation_id":"d77687cc-aee9-47a1-aac2-fd8e05ec80a6","resolution":{"observed_at":"2026-08-09T12:05:55.648037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00976","last_updated":"2024-10-14T14:11:22Z","snapshot_observed_at":"2026-07-06T16:13:38.508734Z","submitted_at":"2023-09-02T16:20:41Z","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","version":4},"cited_work":{"arxiv_id":"2309.00976","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.00976","snapshot_observed_at":"2026-08-07T05:00:55.727358Z","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","venue":"cs.LG","work_id":"cfe51fe1-e6f9-4993-a44f-819f9b3a29e9","year":2023},"citing_paper":{"arxiv_id":"2506.09234","last_updated":"2025-06-10T20:42:41Z","snapshot_observed_at":"2026-08-09T19:25:31.956338Z","submitted_at":"2025-06-10T20:42:41Z","title":"Transaction Categorization with Relational Deep Learning in QuickBooks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:00:55.468292Z"},"links":{"cited_paper":"/paper/2309.00976","citing_paper":"/paper/2506.09234"},"observation_digest":"sha256:c8c56f83a6570c2e7e1655ff3172f82eee78381a21aa21ca14b07c0c2fb1e2de","observation_id":"29509268-852a-43aa-a39c-317329b9f6f7","resolution":{"observed_at":"2026-08-07T05:00:55.731025Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.00976/citation-record","integrity":"/paper/2309.00976/integrity","json":"/paper/2309.00976/citation-record.json","paper":"/paper/2309.00976"},"outbound":[],"paper":{"arxiv_id":"2309.00976","last_updated":"2024-10-14T14:11:22Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:13:38.508734Z","submitted_at":"2023-09-02T16:20:41Z","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2309.00976."}