{"as_of":"2026-08-05T22:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f48693d7056dd1b57b79cfbb3b3f4b7e601241c0012555613367fb4ba096448","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:31:49.256416Z","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-07-03T11:18:03.211693Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-04T07:30:51.188041Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":4},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-05-15T07:43:11.620446Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2510.25741"},"observation_digest":"sha256:1cf9bff13107ac69643c724b60592f56fb97a47a46e218b804cb797ff37f99aa","observation_id":"4795f215-a575-4255-99cb-a7da638fba73","resolution":{"observed_at":"2026-05-15T07:43:11.752374Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-08-04T07:31:49.256416Z","title":"Transformers, parallel computation, and logarithmic depth","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-04T07:30:51.188041Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":5},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-04T07:31:49.256416Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2510.25741"},"observation_digest":"sha256:c05edf81d8a4d458bbaf02d561d5840be6cedd1bcf0fce344209427595698a4e","observation_id":"b287e471-de71-4da2-8c35-00b51f7fa60c","resolution":{"observed_at":"2026-08-04T07:31:49.256416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2603.26554","last_updated":"2026-04-28T07:36:37Z","snapshot_observed_at":"2026-07-06T22:50:46.243903Z","submitted_at":"2026-03-27T16:13:18Z","title":"Sharp Capacity Scaling of Spectral Optimizers in Learning Associative Memory","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-14T23:37:33.106390Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2603.26554"},"observation_digest":"sha256:603b221d7bd58fcf95ed15aa031e9219a5d5a9b44ec99d9eb7a41690d392153e","observation_id":"008b7f8f-7945-4c3e-ad8a-2123a4bb20e1","resolution":{"observed_at":"2026-05-14T23:38:16.437964Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2604.17935","last_updated":"2026-04-20T08:15:17Z","snapshot_observed_at":"2026-07-06T23:04:55.190916Z","submitted_at":"2026-04-20T08:15:17Z","title":"How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T05:17:52.344313Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2604.17935"},"observation_digest":"sha256:c3d653e11f45e739b5e530a8d8378a070867d6e5ffc4d2b6f68bd84b46462ca3","observation_id":"0ea6c3b7-73dc-4237-862e-3ae78d4a7e37","resolution":{"observed_at":"2026-05-10T09:28:39.196418Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2604.21691","last_updated":"2026-04-23T13:58:12Z","snapshot_observed_at":"2026-08-02T12:48:50.592713Z","submitted_at":"2026-04-23T13:58:12Z","title":"There Will Be a Scientific Theory of Deep Learning","version":1},"reference_index":245,"source":"arxiv_source","source_observed_at":"2026-05-09T20:11:17.616190Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2604.21691"},"observation_digest":"sha256:b08a0629a681c152808c35ee22735b359edbc52b3eb4d01bfca9107e06fa0856","observation_id":"6fe944a4-c69a-4f0d-91b1-702e31184b13","resolution":{"observed_at":"2026-05-11T15:21:08.869630Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2604.24878","last_updated":"2026-04-27T18:04:11Z","snapshot_observed_at":"2026-08-02T13:55:47.294240Z","submitted_at":"2026-04-27T18:04:11Z","title":"Transformer Approximations from ReLUs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T04:02:37.785615Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2604.24878"},"observation_digest":"sha256:1d69974a3f8110c1406906297de62d526e309a9ef07a80ce85bc0f20b23bfeb7","observation_id":"e1af48db-cec8-4cc4-81c1-a229ba5be22f","resolution":{"observed_at":"2026-05-11T21:51:30.235337Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2605.22471","last_updated":"2026-05-21T13:32:20Z","snapshot_observed_at":"2026-08-02T11:52:59.155097Z","submitted_at":"2026-05-21T13:32:20Z","title":"Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-22T07:03:52.438466Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2605.22471"},"observation_digest":"sha256:66ae0b58a77b41a36c99434c69c2af8c2af340bfff78527f0533b51d5a5e4522","observation_id":"f1e7a1e4-cf99-4443-8a46-9ee9405a8274","resolution":{"observed_at":"2026-05-22T07:04:41.417376Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth","version":1},"cited_work":{"arxiv_id":"2402.09268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09268","snapshot_observed_at":"2026-07-03T11:18:03.211693Z","title":"arXiv preprint arXiv:2402.09268 , year=","venue":null,"work_id":"8dcbe092-d753-4f4f-a4c1-4348615bf637","year":2024},"citing_paper":{"arxiv_id":"2606.11673","last_updated":"2026-06-18T08:19:42Z","snapshot_observed_at":"2026-08-05T11:52:05.012162Z","submitted_at":"2026-06-10T05:33:12Z","title":"Higher-Order Token Interactions via Quantum Attention","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:40:42.581423Z"},"links":{"cited_paper":"/paper/2402.09268","citing_paper":"/paper/2606.11673"},"observation_digest":"sha256:56d77f8280e2c5b86f176e773a980fcf3e8119770818dbee9a7693d45be4e702","observation_id":"8b2a5a20-3c25-48d6-a28c-d383d34b606c","resolution":{"observed_at":"2026-07-03T11:18:03.213135Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09268/citation-record","integrity":"/paper/2402.09268/integrity","json":"/paper/2402.09268/citation-record.json","paper":"/paper/2402.09268"},"outbound":[],"paper":{"arxiv_id":"2402.09268","last_updated":"2024-02-14T15:54:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:30:03.953345Z","submitted_at":"2024-02-14T15:54:55Z","title":"Transformers, parallel computation, and logarithmic depth"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2402.09268."}