{"as_of":"2026-08-10T00:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07cd8360edb02efffe10a27a6437738cb2d647173839bb635a53133088bccbeb","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-06T18:45:18.110678Z","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-06T15:58:47.431024Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.11334","last_updated":"2020-04-07T21:39:59Z","snapshot_observed_at":"2026-07-06T08:24:23.463202Z","submitted_at":"2019-09-25T08:15:41Z","title":"Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.11334","snapshot_observed_at":"2026-08-06T18:45:18.110678Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07595","last_updated":"2025-07-10T09:54:37Z","snapshot_observed_at":"2026-08-09T04:07:20.143114Z","submitted_at":"2025-07-10T09:54:37Z","title":"Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:45:18.110678Z"},"links":{"cited_paper":"/paper/1909.11334","citing_paper":"/paper/2507.07595"},"observation_digest":"sha256:43217d636aa5d9544b1d5e6f6adedefe298c8f75ff0f266e7d711facf510aae1","observation_id":"078adedd-cb95-4700-b93c-93d0ecc3d982","resolution":{"observed_at":"2026-08-06T18:45:18.110678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.11334","last_updated":"2020-04-07T21:39:59Z","snapshot_observed_at":"2026-07-06T08:24:23.463202Z","submitted_at":"2019-09-25T08:15:41Z","title":"Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning","version":3},"cited_work":{"arxiv_id":"1909.11334","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.11334","snapshot_observed_at":"2026-08-06T15:58:47.431024Z","title":"Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning","venue":"cs.AI","work_id":"b63acae2-62d0-4bdd-99ea-57381cb48f1b","year":2019},"citing_paper":{"arxiv_id":"2507.14468","last_updated":"2025-07-22T04:03:12Z","snapshot_observed_at":"2026-08-06T15:52:46.064089Z","submitted_at":"2025-07-19T04:03:42Z","title":"BioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T15:58:46.715926Z"},"links":{"cited_paper":"/paper/1909.11334","citing_paper":"/paper/2507.14468"},"observation_digest":"sha256:7c70f006b0b75fecb986170c1a1b76a90b694a35a6f47a387bec6ea9fc562853","observation_id":"3305b621-cf24-4887-ad80-0230f7e6eaf9","resolution":{"observed_at":"2026-08-06T15:58:47.531519Z","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/1909.11334/citation-record","integrity":"/paper/1909.11334/integrity","json":"/paper/1909.11334/citation-record.json","paper":"/paper/1909.11334"},"outbound":[],"paper":{"arxiv_id":"1909.11334","last_updated":"2020-04-07T21:39:59Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T08:24:23.463202Z","submitted_at":"2019-09-25T08:15:41Z","title":"Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1909.11334."}