{"as_of":"2026-08-09T06:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49be568d4c202577bd4b742c24d3c06edaf7a543dac0f38acf6281b439fd99e8","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:39:14.195490Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T10:20:16.152612Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.04299","last_updated":"2025-01-08T06:07:33Z","snapshot_observed_at":"2026-07-06T20:18:03.181364Z","submitted_at":"2025-01-08T06:07:33Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04299","snapshot_observed_at":"2026-08-08T16:39:14.195490Z","title":"Circuit complexity bounds for visual autoregressive model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06167","last_updated":"2025-02-10T05:36:30Z","snapshot_observed_at":"2026-08-09T01:42:08.911908Z","submitted_at":"2025-02-10T05:36:30Z","title":"Universal Approximation of Visual Autoregressive Transformers","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.195490Z"},"links":{"cited_paper":"/paper/2501.04299","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:50a42b5e5041aaf807710838f8cc20ee68714812b6a54c5fc81d38048ced89dc","observation_id":"38e644f0-c408-416f-b060-c5eb52bde7e6","resolution":{"observed_at":"2026-08-08T16:39:14.195490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04299","last_updated":"2025-01-08T06:07:33Z","snapshot_observed_at":"2026-07-06T20:18:03.181364Z","submitted_at":"2025-01-08T06:07:33Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model","version":1},"cited_work":{"arxiv_id":"2501.04299","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.04299","snapshot_observed_at":"2026-08-08T10:20:16.152612Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model","venue":"stat.ML","work_id":"a9e459d5-6685-45bb-8486-ecf324479a88","year":2025},"citing_paper":{"arxiv_id":"2502.08150","last_updated":"2025-02-12T06:30:01Z","snapshot_observed_at":"2026-08-09T01:42:36.516995Z","submitted_at":"2025-02-12T06:30:01Z","title":"Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T10:20:15.380593Z"},"links":{"cited_paper":"/paper/2501.04299","citing_paper":"/paper/2502.08150"},"observation_digest":"sha256:842c6bd2dad32abf80d82daf710cd9493f1bab2f563f6cf3531fdad0d451a728","observation_id":"2ac00036-95dc-4b19-9f42-dc10bcac59ef","resolution":{"observed_at":"2026-08-08T10:20:16.156769Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.04299/citation-record","integrity":"/paper/2501.04299/integrity","json":"/paper/2501.04299/citation-record.json","paper":"/paper/2501.04299"},"outbound":[],"paper":{"arxiv_id":"2501.04299","last_updated":"2025-01-08T06:07:33Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T20:18:03.181364Z","submitted_at":"2025-01-08T06:07:33Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2501.04299."}