{"as_of":"2026-08-14T09:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:976609a73bf0ed3b1b0b9d400548d182a0de5df8d2dd12a33cc59d6990d06853","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T16:33:07.092934Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.02177","last_updated":"2022-07-05T17:14:29Z","snapshot_observed_at":"2026-08-13T20:12:44.224804Z","submitted_at":"2022-07-05T17:14:29Z","title":"Learning Dynamic Graphs, Too Slow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.02177","snapshot_observed_at":"2026-08-01T16:33:07.092934Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26414","last_updated":"2026-07-29T02:56:25Z","snapshot_observed_at":"2026-08-01T23:24:54.546696Z","submitted_at":"2026-07-29T02:56:25Z","title":"Origins and mitigation of double descent in reduced order modeling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T16:33:07.092934Z"},"links":{"cited_paper":"/paper/2207.02177","citing_paper":"/paper/2607.26414"},"observation_digest":"sha256:43f8f4ae6440a3ef16053cd06c678f8ec30ef1937697edba9a26ff7525f6d778","observation_id":"a6e41d1c-b525-430c-aae7-6d2651366f79","resolution":{"observed_at":"2026-08-01T16:33:07.092934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2207.02177/citation-record","integrity":"/paper/2207.02177/integrity","json":"/paper/2207.02177/citation-record.json","paper":"/paper/2207.02177"},"outbound":[],"paper":{"arxiv_id":"2207.02177","last_updated":"2022-07-05T17:14:29Z","latest_version":1,"primary_category":"cond-mat.stat-mech","snapshot_observed_at":"2026-08-13T20:12:44.224804Z","submitted_at":"2022-07-05T17:14:29Z","title":"Learning Dynamic Graphs, Too Slow"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2207.02177."}