{"as_of":"2026-08-15T12:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f82b52d156d3a0d639e3d00537559ad68f27341d78ebcef0e3a3324bd435eaa","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-15T06:32:42.880941+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-12T10:46:14.421975Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":11,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","snapshot_observed_at":"2026-08-14T16:44:29.194747Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.08745","snapshot_observed_at":"2026-08-12T05:43:50.209457Z","title":"edgnn: a simple and powerful gnn for directed labeled graphs, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00241","last_updated":"2024-12-10T08:27:38Z","snapshot_observed_at":"2026-08-15T07:47:13.303264Z","submitted_at":"2024-11-29T20:15:18Z","title":"Multigraph Message Passing with Bi-Directional Multi-Edge Aggregations","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T05:43:50.209457Z"},"links":{"cited_paper":"/paper/1904.08745","citing_paper":"/paper/2412.00241"},"observation_digest":"sha256:3b3213cf83d8c91f5d2641b740abfcac1b9f9bb1695d8f427b3cc4de23767cb9","observation_id":"507e9190-8125-4344-be69-739d1bf56676","resolution":{"observed_at":"2026-08-12T05:43:50.209457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","snapshot_observed_at":"2026-08-14T16:44:29.194747Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.08745","snapshot_observed_at":"2026-08-12T10:46:14.421975Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.01849","last_updated":"2024-12-11T08:28:37Z","snapshot_observed_at":"2026-08-15T05:12:02.160484Z","submitted_at":"2024-11-28T06:09:12Z","title":"Towards Data-centric Machine Learning on Directed Graphs: a Survey","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T10:46:14.421975Z"},"links":{"cited_paper":"/paper/1904.08745","citing_paper":"/paper/2412.01849"},"observation_digest":"sha256:f2034cc5695dbbf6a78555d4d40b1991c18b7cae899fb40c7158cc020c1091a6","observation_id":"11e61ab8-e89a-4ec0-9e1b-420a2631ff5b","resolution":{"observed_at":"2026-08-12T10:46:14.421975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","snapshot_observed_at":"2026-08-14T16:44:29.194747Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","version":2},"cited_work":{"arxiv_id":"1904.08745","doi":"10.48550/arxiv.1904.08745","metadata_source":"arxiv_reference","pith_arxiv_id":"1904.08745","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jaume, A.-p","venue":"arXiv (Cornell University)","work_id":"f452de6c-28ac-4830-8762-8ebea83307e0","year":1904},"citing_paper":{"arxiv_id":"2604.02899","last_updated":"2026-04-03T09:14:39Z","snapshot_observed_at":"2026-08-03T17:05:55.935192Z","submitted_at":"2026-04-03T09:14:39Z","title":"Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T20:52:59.566447Z"},"links":{"cited_paper":"/paper/1904.08745","citing_paper":"/paper/2604.02899"},"observation_digest":"sha256:831f1d057df4b4ebd10fd6ffa05abebde9d82ecdcb6b97ea7546b0651de5710c","observation_id":"c762f7d5-a3a9-4421-a038-71d49ff1e1cc","resolution":{"observed_at":"2026-05-13T20:53:15.027571Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","snapshot_observed_at":"2026-08-14T16:44:29.194747Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs","version":2},"cited_work":{"arxiv_id":"1904.08745","doi":"10.48550/arxiv.1904.08745","metadata_source":"arxiv_reference","pith_arxiv_id":"1904.08745","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jaume, A.-p","venue":"arXiv (Cornell University)","work_id":"f452de6c-28ac-4830-8762-8ebea83307e0","year":1904},"citing_paper":{"arxiv_id":"2605.26243","last_updated":"2026-05-25T18:10:20Z","snapshot_observed_at":"2026-08-12T11:01:20.564268Z","submitted_at":"2026-05-25T18:10:20Z","title":"Provably Communication-Efficient and Privacy-Preserving Federated Graph Neural Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T23:04:43.841278Z"},"links":{"cited_paper":"/paper/1904.08745","citing_paper":"/paper/2605.26243"},"observation_digest":"sha256:718b2945206517ff1580d14c43e5ac70453a00396868d6dc598956af5ebdee28","observation_id":"9a85a0d4-4a47-4e54-a005-64a2068917df","resolution":{"observed_at":"2026-06-29T23:14:02.130019Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.08745/citation-record","integrity":"/paper/1904.08745/integrity","json":"/paper/1904.08745/citation-record.json","paper":"/paper/1904.08745"},"outbound":[],"paper":{"arxiv_id":"1904.08745","last_updated":"2019-12-04T12:03:18Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:44:29.194747Z","submitted_at":"2019-04-18T13:04:56Z","title":"edGNN: a Simple and Powerful GNN for Directed Labeled Graphs"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1904.08745."}