{"as_of":"2026-08-20T07:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2178d583d263b14783729dbb822367659e32944a5196cc109e86683b8c1e9dd1","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:51:16.201976Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":107,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-16T10:13:40.612661Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-11T10:51:16.201976Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16144","last_updated":"2024-12-20T18:48:46Z","snapshot_observed_at":"2026-08-14T02:27:42.092097Z","submitted_at":"2024-12-20T18:48:46Z","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T10:51:16.201976Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2412.16144"},"observation_digest":"sha256:40eb96995667e55ad6f98cf9247ff4bc620ccf57c0a6dfa82424b52e9d2f34ec","observation_id":"83709793-6896-4cff-9d3b-1d0a40a0e15c","resolution":{"observed_at":"2026-08-11T10:51:16.201976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-16T10:13:40.612661Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-10T22:30:02.059327Z","title":"Thabet, and Bernard Ghanem","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-17T07:59:10.142231Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.059327Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:5a6ee7a20c2fe20502c835857e8940cf2f08179d37df015ee36172946728edf8","observation_id":"f3091f10-9246-4af9-bea5-28cc717fa7e2","resolution":{"observed_at":"2026-08-10T22:30:02.059327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-16T10:13:40.612661Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-06T12:59:46.985294Z","title":"Deepgcns: Can gcns go as deep as cnns?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.21271","last_updated":"2025-07-28T18:54:04Z","snapshot_observed_at":"2026-08-13T02:30:59.927730Z","submitted_at":"2025-07-28T18:54:04Z","title":"Generating Highly Structured Test Inputs Leveraging Constraint-Guided Graph Refinement","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T12:59:46.985294Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2507.21271"},"observation_digest":"sha256:82e3391e49b46d5197b9116717245262e1bb4afd98132a65b44797d804a39c2e","observation_id":"792144a5-07d8-4188-a73e-1e5e2a44cdf8","resolution":{"observed_at":"2026-08-06T12:59:46.985294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-16T10:13:40.612661Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":"1904.03751","doi":"10.48550/arxiv.1904.03751","metadata_source":"pith","pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","venue":"cs.CV","work_id":"cbea8799-3f23-4079-b714-9f9f4992d8fd","year":2019},"citing_paper":{"arxiv_id":"2607.24314","last_updated":"2026-07-27T11:58:56Z","snapshot_observed_at":"2026-08-17T19:37:06.766053Z","submitted_at":"2026-07-27T11:58:56Z","title":"MEGA-CL: A Molecular Foundation Model for Generalizable ADMET Prediction through Graph External Attention and Contrastive Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T18:33:46.013009Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2607.24314"},"observation_digest":"sha256:49fe999f3c14ae2ffd42e0fbeb5060ab2586685015bf59ef63081c7a66febf11","observation_id":"64791012-9a76-46e6-a786-4c9e73e8d592","resolution":{"observed_at":"2026-07-31T18:35:53.483324Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.03751/citation-record","integrity":"/paper/1904.03751/integrity","json":"/paper/1904.03751/citation-record.json","paper":"/paper/1904.03751"},"outbound":[],"paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T10:13:40.612661Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1904.03751."}