{"as_of":"2026-08-10T07:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7359ee43a506c96b873df86a87bb00ab906dcdf5056ca64b8510113b33afc3d4","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:10:53.088435Z","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-10T06:26:27.600677Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04377","snapshot_observed_at":"2026-08-09T18:10:53.088435Z","title":"On computational limits and provably efficient criteria of visual autoregressive models: A fine-grained complexity analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00688","last_updated":"2025-02-02T06:19:59Z","snapshot_observed_at":"2026-08-09T18:02:58.492461Z","submitted_at":"2025-02-02T06:19:59Z","title":"High-Order Matching for One-Step Shortcut Diffusion Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T18:10:53.088435Z"},"links":{"cited_paper":"/paper/2501.04377","citing_paper":"/paper/2502.00688"},"observation_digest":"sha256:e5cebd67944528818acf72beba797acda52009cf7e52d54333761ec80a0ca3fd","observation_id":"aa912837-7d5e-44c9-a4ad-189f99102a26","resolution":{"observed_at":"2026-08-09T18:10:53.088435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04377","snapshot_observed_at":"2026-08-08T16:39:14.192253Z","title":"On computational limits and provably efficient criteria of visual autoregressive models: A fine grained complexity analysis","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":29,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.192253Z"},"links":{"cited_paper":"/paper/2501.04377","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:716e4bddeb31127ba3ab8058fcb2610aed3ea76f3a292de3929bea6e0f639bbe","observation_id":"9bbd61db-9cfe-4124-aedd-fae90abb8a3f","resolution":{"observed_at":"2026-08-08T16:39:14.192253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04377","snapshot_observed_at":"2026-08-08T10:20:15.376383Z","title":"On computational limits and provably efficient criteria of visual autoregressive models: A fine-grained complexity analysis","venue":null,"work_id":null,"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":29,"source":"arxiv_source","source_observed_at":"2026-08-08T10:20:15.376383Z"},"links":{"cited_paper":"/paper/2501.04377","citing_paper":"/paper/2502.08150"},"observation_digest":"sha256:e81d7efa66d80dc56289ad18f798d45f0917d4c9dbc85daa73af2032cda8bf54","observation_id":"452bb941-a780-4011-bdcf-19c01c95c82a","resolution":{"observed_at":"2026-08-08T10:20:15.376383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04377","snapshot_observed_at":"2026-08-06T14:43:27.628258Z","title":"On computational limits and provably efficient criteria of visual autoregressive models: A fine-grained complexity analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.18107","last_updated":"2025-07-24T05:37:08Z","snapshot_observed_at":"2026-08-08T23:17:58.783602Z","submitted_at":"2025-07-24T05:37:08Z","title":"T2VWorldBench: A Benchmark for Evaluating World Knowledge in Text-to-Video Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:43:27.628258Z"},"links":{"cited_paper":"/paper/2501.04377","citing_paper":"/paper/2507.18107"},"observation_digest":"sha256:f2fa1f7d6be8e2c7979fcb2024342bb261bd921f7306fad549c09841031099b2","observation_id":"b4c53871-a608-4c6e-a2b8-531d646177a5","resolution":{"observed_at":"2026-08-06T14:43:27.628258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis","version":2},"cited_work":{"arxiv_id":"2501.04377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.04377","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On computational limits and provably efficient criteria of visual autoregressive mod- els: A fine-grained complexity analysis","venue":null,"work_id":"6ccbd3de-1c39-4033-881f-a417332d1d68","year":2025},"citing_paper":{"arxiv_id":"2604.17286","last_updated":"2026-04-19T06:59:34Z","snapshot_observed_at":"2026-08-03T04:25:48.631257Z","submitted_at":"2026-04-19T06:59:34Z","title":"Depth Adaptive Efficient Visual Autoregressive Modeling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T06:22:55.035749Z"},"links":{"cited_paper":"/paper/2501.04377","citing_paper":"/paper/2604.17286"},"observation_digest":"sha256:f98f18bf5fabe7b1f7d3f9316cd869692c8f5abda74059e753cb9804050d7629","observation_id":"372befcb-6b67-4192-ab97-fad09255e74c","resolution":{"observed_at":"2026-05-10T06:26:27.602083Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.04377/citation-record","integrity":"/paper/2501.04377/integrity","json":"/paper/2501.04377/citation-record.json","paper":"/paper/2501.04377"},"outbound":[],"paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:18:07.618215Z","submitted_at":"2025-01-08T09:34:15Z","title":"On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2501.04377."}