{"as_of":"2026-08-10T06:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41870a2d467fcf08c6f578d579b2af689936ea0943beefb7c2d05fd02dce0380","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-09T06:31:02.800959+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-06T14:52:18.895251Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T12:53:26.614858Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.04804","last_updated":"2021-10-08T19:54:45Z","snapshot_observed_at":"2026-08-05T06:00:44.699819Z","submitted_at":"2020-06-08T14:57:39Z","title":"Optimal Transport Graph Neural Networks","version":6},"cited_work":{"arxiv_id":"2006.04804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.04804","snapshot_observed_at":"2026-06-29T12:53:26.614858Z","title":"Optimal transport graph neural networks","venue":null,"work_id":"20618728-4fe2-4772-aa65-bd8d5038c12a","year":2006},"citing_paper":{"arxiv_id":"2404.15261","last_updated":"2026-04-07T18:06:42Z","snapshot_observed_at":"2026-07-06T18:04:30.291363Z","submitted_at":"2024-04-23T17:50:52Z","title":"Resistance Distance and Linearized Optimal Transport on Graphs","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T02:12:14.035507Z"},"links":{"cited_paper":"/paper/2006.04804","citing_paper":"/paper/2404.15261"},"observation_digest":"sha256:a09a9794c133fa275c3efee96e594906434a09eccad4c70aabe3ff6fd4e4549e","observation_id":"ca1ee9b3-62b2-45db-ac7b-162687ae8825","resolution":{"observed_at":"2026-05-24T02:13:44.975869Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04804","last_updated":"2021-10-08T19:54:45Z","snapshot_observed_at":"2026-08-05T06:00:44.699819Z","submitted_at":"2020-06-08T14:57:39Z","title":"Optimal Transport Graph Neural Networks","version":6},"cited_work":{"arxiv_id":"2006.04804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.04804","snapshot_observed_at":"2026-06-29T12:53:26.614858Z","title":"Optimal transport graph neural networks","venue":null,"work_id":"20618728-4fe2-4772-aa65-bd8d5038c12a","year":2006},"citing_paper":{"arxiv_id":"2501.17443","last_updated":"2026-05-13T04:42:02Z","snapshot_observed_at":"2026-08-01T21:57:33.150500Z","submitted_at":"2025-01-29T06:48:59Z","title":"Gradual Domain Adaptation for Graph Learning","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T04:41:18.375923Z"},"links":{"cited_paper":"/paper/2006.04804","citing_paper":"/paper/2501.17443"},"observation_digest":"sha256:3272a00ffaeaae1e0252cf53f8efa3daf36c3aad81a4cc6435878800b16ab1ef","observation_id":"504f9740-0fa5-48fa-93cb-0bc23c99c603","resolution":{"observed_at":"2026-05-23T04:42:33.523577Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04804","last_updated":"2021-10-08T19:54:45Z","snapshot_observed_at":"2026-08-05T06:00:44.699819Z","submitted_at":"2020-06-08T14:57:39Z","title":"Optimal Transport Graph Neural Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04804","snapshot_observed_at":"2026-08-06T14:52:18.895251Z","title":"& Jaakkola, T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.17509","last_updated":"2025-07-23T13:47:38Z","snapshot_observed_at":"2026-08-09T23:16:18.148458Z","submitted_at":"2025-07-23T13:47:38Z","title":"Graph Neural Network Approach to Predicting Magnetization in Quasi-One-Dimensional Ising Systems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:52:18.895251Z"},"links":{"cited_paper":"/paper/2006.04804","citing_paper":"/paper/2507.17509"},"observation_digest":"sha256:5e88d3bd9a7c56552406974a06a8f42bf9b97b3a7a4e78f83d69cc56eebd79e1","observation_id":"db6cb3c2-adcb-4024-8bf3-46ccbd4dd013","resolution":{"observed_at":"2026-08-06T14:52:18.895251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04804","last_updated":"2021-10-08T19:54:45Z","snapshot_observed_at":"2026-08-05T06:00:44.699819Z","submitted_at":"2020-06-08T14:57:39Z","title":"Optimal Transport Graph Neural Networks","version":6},"cited_work":{"arxiv_id":"2006.04804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.04804","snapshot_observed_at":"2026-06-29T12:53:26.614858Z","title":"Optimal transport graph neural networks","venue":null,"work_id":"20618728-4fe2-4772-aa65-bd8d5038c12a","year":2006},"citing_paper":{"arxiv_id":"2605.27931","last_updated":"2026-05-27T04:03:22Z","snapshot_observed_at":"2026-08-08T13:14:09.670128Z","submitted_at":"2026-05-27T04:03:22Z","title":"DiagramRAG: A Lightweight Framework to Retrieve Scientific Diagram for Figure Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T12:48:30.924487Z"},"links":{"cited_paper":"/paper/2006.04804","citing_paper":"/paper/2605.27931"},"observation_digest":"sha256:387238c82fe7495484b17602e6784fa9b0201b64f727684be83ddc85fd24348a","observation_id":"0515adca-b01b-4950-a045-0ce36c82ef77","resolution":{"observed_at":"2026-06-29T12:53:26.616326Z","resolver_source":"arxiv_id","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/2006.04804/citation-record","integrity":"/paper/2006.04804/integrity","json":"/paper/2006.04804/citation-record.json","paper":"/paper/2006.04804"},"outbound":[],"paper":{"arxiv_id":"2006.04804","last_updated":"2021-10-08T19:54:45Z","latest_version":6,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-05T06:00:44.699819Z","submitted_at":"2020-06-08T14:57:39Z","title":"Optimal Transport Graph Neural Networks"},"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 4 inbound Pith citation observations for arXiv:2006.04804."}