{"as_of":"2026-08-23T12:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:857b5bef7bfb8ea23fbafc737af6abed05a826e1e5adf007da77c9aac279c166","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:37:40.947736Z","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-05-18T00:45:33.091293Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.00760","last_updated":"2020-07-17T20:25:18Z","snapshot_observed_at":"2026-08-04T09:03:46.148324Z","submitted_at":"2019-10-02T03:28:16Z","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.00760","snapshot_observed_at":"2026-08-12T16:37:40.947736Z","title":"Hamilton, David Duvenaud, Raquel Urtasun, and Richard S","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2411.13358","last_updated":"2024-11-20T14:29:59Z","snapshot_observed_at":"2026-08-16T14:14:20.471795Z","submitted_at":"2024-11-20T14:29:59Z","title":"Vertical Validation: Evaluating Implicit Generative Models for Graphs on Thin Support Regions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T16:37:40.947736Z"},"links":{"cited_paper":"/paper/1910.00760","citing_paper":"/paper/2411.13358"},"observation_digest":"sha256:0c371eff1b6fd89ed78d3901c968dc101a317dca2f5dd68408ca8ee7870c8326","observation_id":"c7b1c91b-db71-49f5-9912-2b1666141f8a","resolution":{"observed_at":"2026-08-12T16:37:40.947736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00760","last_updated":"2020-07-17T20:25:18Z","snapshot_observed_at":"2026-08-04T09:03:46.148324Z","submitted_at":"2019-10-02T03:28:16Z","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","version":3},"cited_work":{"arxiv_id":"1910.00760","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.00760","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hamilton, David Duvenaud, Raquel Urtasun, and Richard S","venue":null,"work_id":"de95ba47-5060-4214-970d-df5f5b77a99c","year":2020},"citing_paper":{"arxiv_id":"2511.03015","last_updated":"2026-04-13T04:30:54Z","snapshot_observed_at":"2026-08-16T01:59:19.416700Z","submitted_at":"2025-11-04T21:25:51Z","title":"Discrete Bayesian Sample Inference for Graph Generation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-18T00:44:01.292176Z"},"links":{"cited_paper":"/paper/1910.00760","citing_paper":"/paper/2511.03015"},"observation_digest":"sha256:c9a578fe49e841a48fc3d0635b0f80bdd513800e3fd7051d720cc78446716ad9","observation_id":"a24e3827-c095-45a5-a4b9-13072475259f","resolution":{"observed_at":"2026-05-18T00:45:33.093966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00760","last_updated":"2020-07-17T20:25:18Z","snapshot_observed_at":"2026-08-04T09:03:46.148324Z","submitted_at":"2019-10-02T03:28:16Z","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.00760","snapshot_observed_at":"2026-08-03T08:15:23.414323Z","title":"Hamilton, David Duvenaud, Raquel Urtasun, and Richard S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.17717","last_updated":"2026-06-09T20:25:14Z","snapshot_observed_at":"2026-08-17T20:18:47.174609Z","submitted_at":"2026-01-25T06:40:25Z","title":"A Survey on Evaluating Quality and Trustworthiness in LLM-Generated Data","version":3},"reference_index":127,"source":"arxiv_source","source_observed_at":"2026-08-03T08:15:23.414323Z"},"links":{"cited_paper":"/paper/1910.00760","citing_paper":"/paper/2601.17717"},"observation_digest":"sha256:48c406e47d5b3d1930bea5c190f54f6c3e9b29e2a27a81703bc9042064ee1fdd","observation_id":"169a4f79-40e7-4f58-b24f-d9d8f6534687","resolution":{"observed_at":"2026-08-03T08:15:23.414323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1910.00760/citation-record","integrity":"/paper/1910.00760/integrity","json":"/paper/1910.00760/citation-record.json","paper":"/paper/1910.00760"},"outbound":[],"paper":{"arxiv_id":"1910.00760","last_updated":"2020-07-17T20:25:18Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T09:03:46.148324Z","submitted_at":"2019-10-02T03:28:16Z","title":"Efficient Graph Generation with Graph Recurrent Attention 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1910.00760."}