{"as_of":"2026-08-11T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc00ee464e409b34cf25d58403fcca0e865cca22b4504b755e29b95dc01b27b7","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:42:46.294835Z","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:15.635238Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-10T21:42:46.294835Z","title":"Looped relu mlps may be all you need as practical programmable computers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.04299","last_updated":"2025-01-08T06:07:33Z","snapshot_observed_at":"2026-08-10T21:52:25.929392Z","submitted_at":"2025-01-08T06:07:33Z","title":"Circuit Complexity Bounds for Visual Autoregressive Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:42:46.294835Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2501.04299"},"observation_digest":"sha256:d09c7f088ab6b80397360d40906dfe4fa4b031ab91d58849e9bd20c5961c7648","observation_id":"d0f866bf-1256-434f-ac4c-0c49fdb16ad2","resolution":{"observed_at":"2026-08-10T21:42:46.294835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-10T21:42:28.231124Z","title":"Looped relu mlps may be all you need as practical programmable computers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.04377","last_updated":"2025-02-02T23:48:36Z","snapshot_observed_at":"2026-08-10T21:52:28.119513Z","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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:42:28.231124Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2501.04377"},"observation_digest":"sha256:ed689630b055e5766b57eef0a617b2360283df67d0f0f8a6558027b6be5685b1","observation_id":"205ec717-3e4c-4089-9a04-d613bc635e2b","resolution":{"observed_at":"2026-08-10T21:42:28.231124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-09T18:51:12.568700Z","title":"Looped relu mlps may be all you need as practical programmable computers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00500","last_updated":"2025-02-04T15:19:12Z","snapshot_observed_at":"2026-08-10T02:49:33.781140Z","submitted_at":"2025-02-01T17:40:11Z","title":"Video Latent Flow Matching: Optimal Polynomial Projections for Video Interpolation and Extrapolation","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T18:51:12.568700Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2502.00500"},"observation_digest":"sha256:e4269cd849f19a4a10256163612b54d84dbb828c654c74344120dabf468f2c3c","observation_id":"4b20c657-646f-4e98-b58d-a11c647ed748","resolution":{"observed_at":"2026-08-09T18:51:12.568700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-09T18:10:53.135095Z","title":"Looped relu mlps may be all you need as practical programmable computers","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":41,"source":"pdf_text","source_observed_at":"2026-08-09T18:10:53.135095Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2502.00688"},"observation_digest":"sha256:13985f1e58b7b886cbdb119210ea8fc63c8686dea840ca0c84a4e4772b4fa142","observation_id":"c4185a59-c14c-47f1-ac1a-796dd1a041dd","resolution":{"observed_at":"2026-08-09T18:10:53.135095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-08T16:39:14.232338Z","title":"Looped relu mlps may be all you need as practical programmable computers","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":41,"source":"pdf_text","source_observed_at":"2026-08-08T16:39:14.232338Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2502.06167"},"observation_digest":"sha256:aaee95b76cd1f1ce9c7632d9a98298134cff8b7e913f18a9514394a2f04b8b26","observation_id":"f6d0ff3a-b7c0-413e-a6ca-65fa0d4c7983","resolution":{"observed_at":"2026-08-08T16:39:14.232338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":"2410.09375","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-08T10:20:15.635238Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","venue":"cs.LG","work_id":"37d856c0-1add-47b8-94ba-4b75acdd6048","year":2024},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-08T10:20:15.410300Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2502.08150"},"observation_digest":"sha256:0c13bfc6642c3e5b10b34c1d8d9cde035c6fe3e4cde7ce74c69c4cffd1fa8b4f","observation_id":"64e1ecdf-5818-4dd3-b1d7-c6a8883d1ca9","resolution":{"observed_at":"2026-08-08T10:20:15.639583Z","resolver_source":"local_arxiv","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/2410.09375/citation-record","integrity":"/paper/2410.09375/integrity","json":"/paper/2410.09375/citation-record.json","paper":"/paper/2410.09375"},"outbound":[],"paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T18:03:24.702047Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2410.09375."}