{"as_of":"2026-08-11T14:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a29d0ca26435be6bf612b2993bb72ce37b1ba82263b2967bb04e5a72234248b0","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-11T06:34:44.6726+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-07-09T11:39:24.051110Z","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-07-09T11:46:12.990712Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.06757","last_updated":"2021-05-27T21:33:59Z","snapshot_observed_at":"2026-07-06T08:57:43.424984Z","submitted_at":"2020-02-17T03:33:41Z","title":"Relational Message Passing for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"2002.06757","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.06757","snapshot_observed_at":"2026-07-09T11:46:12.990712Z","title":"Relational Message Passing for Knowledge Graph Completion","venue":"cs.LG","work_id":"df15f85b-c144-490f-8602-a02f31ef9034","year":2020},"citing_paper":{"arxiv_id":"2605.29346","last_updated":"2026-05-28T04:37:24Z","snapshot_observed_at":"2026-08-06T08:05:18.925385Z","submitted_at":"2026-05-28T04:37:24Z","title":"Understanding and Reducing Metadata-Driven Host Overheads in Sampling-Based GNN Training","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T05:59:41.958293Z"},"links":{"cited_paper":"/paper/2002.06757","citing_paper":"/paper/2605.29346"},"observation_digest":"sha256:f04a89d14f39b3c35ca02c9968611b9c5171285d570dee004ff8fff1130b7ac3","observation_id":"51636bff-3369-414f-82d4-83b4c319fc04","resolution":{"observed_at":"2026-06-29T06:03:08.461751Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.06757","last_updated":"2021-05-27T21:33:59Z","snapshot_observed_at":"2026-07-06T08:57:43.424984Z","submitted_at":"2020-02-17T03:33:41Z","title":"Relational Message Passing for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":"2002.06757","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.06757","snapshot_observed_at":"2026-07-09T11:46:12.990712Z","title":"Relational Message Passing for Knowledge Graph Completion","venue":"cs.LG","work_id":"df15f85b-c144-490f-8602-a02f31ef9034","year":2020},"citing_paper":{"arxiv_id":"2607.07422","last_updated":"2026-07-08T13:49:44Z","snapshot_observed_at":"2026-08-08T07:22:47.541211Z","submitted_at":"2026-07-08T13:49:44Z","title":"InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T11:39:24.051110Z"},"links":{"cited_paper":"/paper/2002.06757","citing_paper":"/paper/2607.07422"},"observation_digest":"sha256:f06bca7c3067eb60419a31190bf5dcdf59b5607b00b7fef2d2359f57c1322690","observation_id":"b1abefd4-c7bb-49e5-bdeb-63d28fa4abad","resolution":{"observed_at":"2026-07-09T11:46:12.992012Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.06757/citation-record","integrity":"/paper/2002.06757/integrity","json":"/paper/2002.06757/citation-record.json","paper":"/paper/2002.06757"},"outbound":[],"paper":{"arxiv_id":"2002.06757","last_updated":"2021-05-27T21:33:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:57:43.424984Z","submitted_at":"2020-02-17T03:33:41Z","title":"Relational Message Passing for Knowledge Graph Completion"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2002.06757."}