{"as_of":"2026-08-09T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e43b7ca3079e0465cc77424b57ec78603e19ceb9f1fc240d948d8998bd55a46","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":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":46,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:22:33.083474Z","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-03T20:58:58.552877Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2412.06769","last_updated":"2025-11-03T00:53:34Z","snapshot_observed_at":"2026-08-07T06:05:27.895209Z","submitted_at":"2024-12-09T18:55:56Z","title":"Training Large Language Models to Reason in a Continuous Latent Space","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-11T10:29:05.384381Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2412.06769"},"observation_digest":"sha256:1e2e252d7dd46b213b17c83af9918808ca608fad809e00126d5bff077baf6147","observation_id":"2f9c2cad-b5e1-4ab0-b5a8-390798bd0e5b","resolution":{"observed_at":"2026-05-11T10:29:05.785952Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-09T05:22:33.083474Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03275","last_updated":"2025-09-01T18:25:38Z","snapshot_observed_at":"2026-08-09T05:15:11.459630Z","submitted_at":"2025-02-05T15:33:00Z","title":"Token Assorted: Mixing Latent and Text Tokens for Improved Language Model Reasoning","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T05:22:33.083474Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2502.03275"},"observation_digest":"sha256:a50448563ec3897ad9b78b0ea42080fae2888a8af3d4fd661b78d6ab2a78e52e","observation_id":"d8b59338-403d-40bd-8971-6425ee665355","resolution":{"observed_at":"2026-08-09T05:22:33.083474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":141,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:89db2fb886bb2e3492d8169c1bba5b70a1cee59ca55d9d26c6b6829769f8a3ad","observation_id":"df247a5a-d8d6-4116-a3b1-fb8cb5459c95","resolution":{"observed_at":"2026-05-14T01:29:56.685051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-07T14:27:39.319606Z","title":"Let’s think dot by dot: Hidden computation in transformer language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18962","last_updated":"2025-05-31T15:08:41Z","snapshot_observed_at":"2026-08-09T13:11:14.871776Z","submitted_at":"2025-05-25T03:35:49Z","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:39.319606Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2505.18962"},"observation_digest":"sha256:02073e67d6a3a9b87b69e697a5e598ea543ad45383436f3273b05a34f64679b5","observation_id":"4693b956-7d98-4bf8-a54a-9b9992f85407","resolution":{"observed_at":"2026-08-07T14:27:39.319606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-07T12:35:20.647972Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24362","last_updated":"2025-06-02T10:26:59Z","snapshot_observed_at":"2026-08-08T05:50:25.456514Z","submitted_at":"2025-05-30T08:54:28Z","title":"Knowing Before Saying: LLM Representations Encode Information About Chain-of-Thought Success Before Completion","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.647972Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2505.24362"},"observation_digest":"sha256:35e41832fb7cf49552a5f7a93b3013833397d72219507eb6394d5fec118656cb","observation_id":"08632386-54fd-492a-b9b8-4e09eae1a1c4","resolution":{"observed_at":"2026-08-07T12:35:20.647972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2506.11274","last_updated":"2026-05-12T18:56:11Z","snapshot_observed_at":"2026-07-06T21:41:24.021272Z","submitted_at":"2025-06-12T20:28:54Z","title":"Learning a Continue-Thinking Token for Enhanced Test-Time Scaling","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T09:09:08.270936Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2506.11274"},"observation_digest":"sha256:9ab22d14afb6767ffaf68d490f2280f2e2dd9eca14a66350facfa822347c3cfe","observation_id":"db05feb9-54b6-4203-8c5c-699fc4108da5","resolution":{"observed_at":"2026-05-19T09:12:14.870372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-07T00:57:02.090047Z","title":"Let’s think dot by dot: Hidden computation in transformer language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12353","last_updated":"2025-06-14T05:30:09Z","snapshot_observed_at":"2026-08-07T08:59:45.729814Z","submitted_at":"2025-06-14T05:30:09Z","title":"Efficient Reasoning Through Suppression of Self-Affirmation Reflections in Large Reasoning Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:57:02.090047Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2506.12353"},"observation_digest":"sha256:fb7509d12e46bfee190f70874ae7d70fc3008f7038596af1c77e14ec55e7f3c5","observation_id":"20782098-b0fb-492a-abd4-0c5c67f22e62","resolution":{"observed_at":"2026-08-07T00:57:02.090047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-06T17:54:17.584595Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09662","last_updated":"2025-07-13T14:51:59Z","snapshot_observed_at":"2026-08-07T01:15:50.475193Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":151,"source":"arxiv_source","source_observed_at":"2026-08-06T17:54:17.584595Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:c9fbf335e40b1ae1068c3526d2b16741f9d002a48c602da67fc9d5930cf78224","observation_id":"0d36e93d-40fb-420b-8d44-7e5f1603eac7","resolution":{"observed_at":"2026-08-06T17:54:17.584595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-04T22:25:54.891821Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.07339","last_updated":"2025-09-09T02:31:16Z","snapshot_observed_at":"2026-08-08T07:12:41.500683Z","submitted_at":"2025-09-09T02:31:16Z","title":"Performative Thinking? The Brittle Correlation Between CoT Length and Problem Complexity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T22:25:54.891821Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2509.07339"},"observation_digest":"sha256:06358467bd658795adb0f3088f99417070bce9bf25a24f149312e2231881bec5","observation_id":"e03ea8b4-ab42-4168-af01-b52f9b633829","resolution":{"observed_at":"2026-08-04T22:25:54.891821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2510.09592","last_updated":"2026-05-10T15:21:35Z","snapshot_observed_at":"2026-07-06T22:32:22.953630Z","submitted_at":"2025-10-10T17:50:59Z","title":"Mind-Paced Speaking: A Dual-Brain Approach to Real-Time Reasoning in Spoken Language Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T07:43:23.913399Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2510.09592"},"observation_digest":"sha256:58c25d58fc72c765714e7146e6b8fbdd75dae02f468e1058f9d878c96659dec0","observation_id":"0e096682-f5c6-4c12-a0c8-90468a4103e8","resolution":{"observed_at":"2026-05-18T07:46:03.529211Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2510.24941","last_updated":"2026-05-26T22:58:09Z","snapshot_observed_at":"2026-08-08T14:16:18.113872Z","submitted_at":"2025-10-28T20:14:02Z","title":"Can Aha Moments Be Fake? Towards Quantifying Decorative and True Thinking in Chain-of-Thought","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T02:44:48.729794Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2510.24941"},"observation_digest":"sha256:62d28006763d783f77ad6d67289da4bb675dd463684c3f2a50f5cf4721914464","observation_id":"dd317f51-d7b9-4f65-8241-71acc5ec96be","resolution":{"observed_at":"2026-05-18T02:45:46.226074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-04T07:43:10.510909Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24941","last_updated":"2026-05-26T22:58:09Z","snapshot_observed_at":"2026-08-08T14:16:18.113872Z","submitted_at":"2025-10-28T20:14:02Z","title":"Can Aha Moments Be Fake? Towards Quantifying Decorative and True Thinking in Chain-of-Thought","version":4},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-04T07:43:10.510909Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2510.24941"},"observation_digest":"sha256:a4b7b4f7de38e1c6f45ec1a019d489c1076cfa18449f1faa721a54b0bb638e76","observation_id":"a2a03e77-a100-486e-8598-260ef2650e3b","resolution":{"observed_at":"2026-08-04T07:43:10.510909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2511.09149","last_updated":"2026-07-13T02:48:50Z","snapshot_observed_at":"2026-08-07T23:49:30.050581Z","submitted_at":"2025-11-12T09:37:22Z","title":"Enabling Agents to Communicate Entirely in Latent Space","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:23.723712Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2511.09149"},"observation_digest":"sha256:8b20ba2cd9a01c76d5e4e43cb653bb68834dd835494260782f9ee07c28323026","observation_id":"d7bca8da-8e30-4df5-9f02-9c859435b5b3","resolution":{"observed_at":"2026-05-17T23:42:13.095987Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-03T22:48:26.260010Z","title":"Chau Pham, Boyi Liu, Yingxiang Yang, Zhengyu Chen, Tianyi Liu, Jianbo Yuan, Bryan A Plummer, Zhaoran Wang, and Hongxia Yang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.09149","last_updated":"2026-07-13T02:48:50Z","snapshot_observed_at":"2026-08-07T23:49:30.050581Z","submitted_at":"2025-11-12T09:37:22Z","title":"Enabling Agents to Communicate Entirely in Latent Space","version":5},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T22:48:26.260010Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2511.09149"},"observation_digest":"sha256:72f73cecbb2b0d83e2f909a7bbe0ef87923d7ad6e1ba2a9aa69ff8d9a47847a3","observation_id":"2bfe0816-717a-4cd9-8202-89b20d29a6c8","resolution":{"observed_at":"2026-08-03T22:48:26.260010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-02T23:26:30.391525Z","title":"Archiki Prasad, Swarnadeep Saha, Xiang Zhou, and Mo- hit Bansal","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.13904","last_updated":"2026-07-23T02:27:49Z","snapshot_observed_at":"2026-08-07T20:41:50.134795Z","submitted_at":"2026-02-14T21:53:47Z","title":"Diagnosing Pathological Chain-of-Thought in Reasoning Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T23:26:30.391525Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2602.13904"},"observation_digest":"sha256:c9cae541567b3631d66d13e6a325271cb9761ff80723ec28a6923ffdbf153ab7","observation_id":"c310a12e-841a-4c0a-b0dc-8c8ec13a3316","resolution":{"observed_at":"2026-08-02T23:26:30.391525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-02T23:21:34.496686Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14095","last_updated":"2026-07-06T07:40:26Z","snapshot_observed_at":"2026-08-09T00:10:29.296236Z","submitted_at":"2026-02-15T11:05:18Z","title":"NEST: Nascent Encoded Steganographic Thoughts","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T23:21:34.496686Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2602.14095"},"observation_digest":"sha256:ea96b152184c2f8e987d9d5187887d060db06726ac15069a400d64b70a6564e5","observation_id":"f01a3207-56e3-46db-8380-a4b26eca4a47","resolution":{"observed_at":"2026-08-02T23:21:34.496686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-13T14:03:01.974171Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.02029","last_updated":"2026-06-05T06:21:20Z","snapshot_observed_at":"2026-07-30T23:04:23.206455Z","submitted_at":"2026-04-02T13:36:37Z","title":"The Latent Space: Foundation, Evolution, Mechanism, Ability, and Outlook","version":2},"reference_index":162,"source":"pdf_text","source_observed_at":"2026-07-13T14:03:01.974171Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2604.02029"},"observation_digest":"sha256:c3150663a61766a68a10104aab634a0cbb18ad11fa7ccbaa9684c81c79a6bf72","observation_id":"ba280d59-bc6c-4202-9d25-bd8dfbd683cc","resolution":{"observed_at":"2026-07-13T14:03:01.974171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2604.02073","last_updated":"2026-04-20T03:16:36Z","snapshot_observed_at":"2026-07-06T22:51:40.181565Z","submitted_at":"2026-04-02T14:04:53Z","title":"PLUME: Latent Reasoning Based Universal Multimodal Embedding","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-13T21:48:40.722921Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2604.02073"},"observation_digest":"sha256:8cff4797f12d07b761481b9abd131a895438c522c68fca323d22e8e778fcc7e3","observation_id":"40a95346-5555-4576-ad42-fa5c1ddb6c42","resolution":{"observed_at":"2026-05-13T21:53:20.031713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2604.08299","last_updated":"2026-04-19T12:06:32Z","snapshot_observed_at":"2026-07-06T22:57:26.678728Z","submitted_at":"2026-04-09T14:32:07Z","title":"SeLaR: Selective Latent Reasoning in Large Language Models","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-10T18:27:36.132030Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2604.08299"},"observation_digest":"sha256:f84046651fbc3918c4d91a016f6d9c64140079803c2931d55622d3a689087725","observation_id":"b9364ff2-526f-4e4c-b08c-4ba388f830e5","resolution":{"observed_at":"2026-05-11T00:35:49.536966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2604.15726","last_updated":"2026-04-17T05:59:08Z","snapshot_observed_at":"2026-08-01T01:44:21.919940Z","submitted_at":"2026-04-17T05:59:08Z","title":"LLM Reasoning Is Latent, Not the Chain of Thought","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T08:49:05.178087Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2604.15726"},"observation_digest":"sha256:f528d52737e75e20c53a52d5bff211be6b4080d67d6ba75a4f03cd9e240226d1","observation_id":"87c7244e-4814-4342-9a2c-894b1da98917","resolution":{"observed_at":"2026-05-10T08:53:04.655705Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.02442","last_updated":"2026-05-04T10:42:26Z","snapshot_observed_at":"2026-07-30T10:52:38.632184Z","submitted_at":"2026-05-04T10:42:26Z","title":"Measuring AI Reasoning: A Guide for Researchers","version":1},"reference_index":134,"source":"arxiv_source","source_observed_at":"2026-05-08T18:53:18.586923Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.02442"},"observation_digest":"sha256:f2868a3725b16cc7a9a8544ffb348ad60f87ac9e37cbca0a8276d25313e2f08a","observation_id":"3f408342-7b1d-4181-a8ae-18af0645e78d","resolution":{"observed_at":"2026-05-09T06:05:36.693608Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:403fa0b07bc1a807fecd7c74cfccfa7c0d64f03dd45f10172ba77b2fe364c7f7","observation_id":"1ff86c47-0257-4883-9501-b2a2f3590bff","resolution":{"observed_at":"2026-05-11T20:06:09.743012Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.07307","last_updated":"2026-05-08T06:15:50Z","snapshot_observed_at":"2026-07-06T23:19:41.053744Z","submitted_at":"2026-05-08T06:15:50Z","title":"Rethinking Dense Sequential Chains: Reasoning Language Models Can Extract Answers from Sparse, Order-Shuffling Chain-of-Thoughts","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-11T02:11:19.295354Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.07307"},"observation_digest":"sha256:d042eb1b51f46d12c9b913908de50702bd9f1c64ad7a4a8f578f6d08f25e1852","observation_id":"58887614-f3d7-42cc-827b-337fee00533d","resolution":{"observed_at":"2026-05-11T03:50:57.499759Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.08221","last_updated":"2026-05-06T13:58:55Z","snapshot_observed_at":"2026-07-06T23:20:28.875586Z","submitted_at":"2026-05-06T13:58:55Z","title":"NoisyCoconut: Counterfactual Consensus via Latent Space Reasoning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-12T00:51:40.815981Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.08221"},"observation_digest":"sha256:3c5bea4e791822eed0bb6097f3bf9f40ed4c61adae039dfee4c509e914944183","observation_id":"4fee061a-8949-4e14-ac3a-409f70b884e6","resolution":{"observed_at":"2026-05-12T08:41:24.240276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.10799","last_updated":"2026-05-15T04:05:16Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:26:50Z","title":"The Last Word Often Wins: A Format Confound in Chain-of-Thought Corruption Studies","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:03.117347Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.10799"},"observation_digest":"sha256:985939893f6d2240e3448c27f986858723224d5b1471febb76c1c1439ada81be","observation_id":"3beedbf2-1335-4883-9e3f-ba4e1946b432","resolution":{"observed_at":"2026-05-12T07:06:26.203675Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.10799","last_updated":"2026-05-15T04:05:16Z","snapshot_observed_at":"2026-07-06T23:22:42.512039Z","submitted_at":"2026-05-11T16:26:50Z","title":"The Last Word Often Wins: A Format Confound in Chain-of-Thought Corruption Studies","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T17:24:53.084270Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.10799"},"observation_digest":"sha256:4074b817ecc7832693287bba7165d3b59a4733516bafde099068158b2581f616","observation_id":"0a9f92d5-0ef4-430f-9fe9-9206575aed1a","resolution":{"observed_at":"2026-05-19T17:27:41.352482Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.20075","last_updated":"2026-05-19T16:28:53Z","snapshot_observed_at":"2026-08-01T16:11:19.969726Z","submitted_at":"2026-05-19T16:28:53Z","title":"CopT: Contrastive On-Policy Thinking with Continuous Spaces for General and Agentic Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T05:25:51.655208Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.20075"},"observation_digest":"sha256:10dca8c09058b22da4554aab71b355967ccc4d64be1ba588b1ebfe2f52c6691b","observation_id":"d2c2985e-1e67-4217-9a14-cbf345cf0bb3","resolution":{"observed_at":"2026-05-20T05:28:04.872871Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.23872","last_updated":"2026-05-22T17:31:16Z","snapshot_observed_at":"2026-07-06T23:33:59.210165Z","submitted_at":"2026-05-22T17:31:16Z","title":"Training-Free Looped Transformers","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-25T04:36:10.278337Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.23872"},"observation_digest":"sha256:a839c9947002fffc303c0ca4a051ee115e31208bca74c732acd36d5b141e633a","observation_id":"6f6c4b37-a154-48ac-b36a-7c27ac0932b5","resolution":{"observed_at":"2026-05-25T04:36:36.795609Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.24396","last_updated":"2026-05-23T04:42:45Z","snapshot_observed_at":"2026-08-08T23:48:46.091037Z","submitted_at":"2026-05-23T04:42:45Z","title":"Understanding and Mitigating Premature Confidence for Better LLM Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-30T14:03:25.913615Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.24396"},"observation_digest":"sha256:3b1c1289a342c6a36a5049761a582decc7e49a281263d56d7cbf6e626e0b4bc3","observation_id":"5e4fe772-d203-4124-ba14-358bc358bc46","resolution":{"observed_at":"2026-06-30T14:04:44.423161Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.26795","last_updated":"2026-07-27T09:24:10Z","snapshot_observed_at":"2026-08-02T13:08:36.594565Z","submitted_at":"2026-05-26T10:10:01Z","title":"What Does Chain-of-Thought Contribute at Probe Time? Evidence for Local Co-Occurrence Activation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T17:24:32.401230Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.26795"},"observation_digest":"sha256:39581bc94eda27f373a156ddf60f46203eaee84a0db151b0e3e263696d3e7ea7","observation_id":"1be094ae-b060-47d9-9aac-a3f6f6ea333b","resolution":{"observed_at":"2026-06-29T17:33:45.509891Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-02T13:08:39.771469Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26795","last_updated":"2026-07-27T09:24:10Z","snapshot_observed_at":"2026-08-02T13:08:36.594565Z","submitted_at":"2026-05-26T10:10:01Z","title":"What Does Chain-of-Thought Contribute at Probe Time? Evidence for Local Co-Occurrence Activation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T13:08:39.771469Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.26795"},"observation_digest":"sha256:c3aea3406050dd6cb9ee1c7d6f1838d18dd5a52e4993c721e0a5fc017c86cd0d","observation_id":"af8cf6c3-ab12-4979-a2de-fcc235b3dfc2","resolution":{"observed_at":"2026-08-02T13:08:39.771469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.26797","last_updated":"2026-05-26T10:10:26Z","snapshot_observed_at":"2026-08-02T14:13:01.459974Z","submitted_at":"2026-05-26T10:10:26Z","title":"Latent Recurrent Transformer: Architecture Exploration, Training Strategies, and Scaling Behavior","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T19:36:13.559393Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.26797"},"observation_digest":"sha256:bf0bc493284da9536a848562586337bc0c1fd03afe4c4949af47d5a6e9bed9d3","observation_id":"efb1b40d-02f1-405a-85e2-3ba3052b2561","resolution":{"observed_at":"2026-06-29T19:43:54.963801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.28006","last_updated":"2026-05-27T05:56:35Z","snapshot_observed_at":"2026-08-03T00:45:38.933613Z","submitted_at":"2026-05-27T05:56:35Z","title":"Integrated and Cross-Architecture Interpretation of LLM Reasoning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-29T13:14:27.768440Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.28006"},"observation_digest":"sha256:88714856076c6a0127e2311de97c1a250898cbb6e2262fa8d1ca6d4448f5b6db","observation_id":"4c7a9297-289e-45ce-9162-17ef0b4d8911","resolution":{"observed_at":"2026-06-29T13:23:28.353037Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.28292","last_updated":"2026-05-27T10:40:46Z","snapshot_observed_at":"2026-08-07T02:35:48.098199Z","submitted_at":"2026-05-27T10:40:46Z","title":"CIRF: Tokenizing Chain-of-Thoughts into Reusable Functional Units for Efficient Latent Reasoning in Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T13:17:41.969393Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.28292"},"observation_digest":"sha256:fe9ed3d656245f34a0590f8d60087d623ececbc99f05428bcdc1122eecb64af8","observation_id":"57a09f09-ba93-4dc9-a71b-ed50f84c72a4","resolution":{"observed_at":"2026-06-29T13:23:28.179571Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.28600","last_updated":"2026-05-27T15:17:06Z","snapshot_observed_at":"2026-08-05T23:04:48.328422Z","submitted_at":"2026-05-27T15:17:06Z","title":"Transformers Provably Learn to Internalize Chain-of-Thought","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-29T14:29:10.010212Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.28600"},"observation_digest":"sha256:42aaee03f4bb0a7d726780af1cfacb31ee6ea96edc5c9b18ab989433c1bc82aa","observation_id":"01b44cc3-95c4-4d3f-b357-f4e32a50adc9","resolution":{"observed_at":"2026-06-29T14:33:30.620196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2605.30343","last_updated":"2026-05-28T17:59:49Z","snapshot_observed_at":"2026-08-05T07:14:37.369119Z","submitted_at":"2026-05-28T17:59:49Z","title":"Unlocking the Working Memory of Large Language Models for Latent Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T08:02:05.390732Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2605.30343"},"observation_digest":"sha256:832d63a37b31c64146c4e98f8a1664302052eba6b0d266926535567755b0212e","observation_id":"bcbf571f-fc54-4d72-a004-570c97277fb9","resolution":{"observed_at":"2026-06-29T08:03:13.919517Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2606.04678","last_updated":"2026-06-03T10:01:45Z","snapshot_observed_at":"2026-08-03T02:32:14.203182Z","submitted_at":"2026-06-03T10:01:45Z","title":"Test-Time Compute Scaling for ASR with Depth-Conditioned Looped Transformers","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T06:56:57.423463Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2606.04678"},"observation_digest":"sha256:7c0fa4ae4c5675ad22ba6a81be5e2cd3f3777e11fd18a3a794fad34f3b53d029","observation_id":"82bb867e-f6f6-4f13-8b34-77640d020827","resolution":{"observed_at":"2026-07-02T07:26:45.909324Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2606.13106","last_updated":"2026-06-11T09:33:40Z","snapshot_observed_at":"2026-07-06T23:51:55.044440Z","submitted_at":"2026-06-11T09:33:40Z","title":"Demystifying Hidden-State Recurrence: Switchable Latent Reasoning with On-Policy Reinforcement Learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-27T07:20:38.534666Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2606.13106"},"observation_digest":"sha256:80616a370b2d22a160b61d8c067c137036c51e62f743658414d0f9ddc6e53462","observation_id":"c8340cde-cf43-4286-97ee-d94decc9351f","resolution":{"observed_at":"2026-07-03T13:58:22.077657Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2606.17924","last_updated":"2026-06-16T13:38:03Z","snapshot_observed_at":"2026-08-08T15:58:38.583682Z","submitted_at":"2026-06-16T13:38:03Z","title":"PearlVLA: Progressive Embodied Action-Plan Refinement in Latent Space","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T00:57:58.312567Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2606.17924"},"observation_digest":"sha256:25956a29b77bb1a010e391bc6c281d8912816e039a590ea8672a20a723b82837","observation_id":"8b739a62-c2db-4974-9af8-31002b685716","resolution":{"observed_at":"2026-07-03T20:58:58.554410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2606.30128","last_updated":"2026-06-29T11:06:46Z","snapshot_observed_at":"2026-08-03T10:56:31.923714Z","submitted_at":"2026-06-29T11:06:46Z","title":"Does Verbose Chain-of-Thought Really Help? In-Distribution Evidence that Content, Not Length, Matters","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T06:45:56.613559Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2606.30128"},"observation_digest":"sha256:c8b666f5fad35621ea96d305d71c09818e418a8d36ef38764dba3926df2d761d","observation_id":"72d591b1-d100-49f5-a9a7-d55f01b25c91","resolution":{"observed_at":"2026-06-30T06:54:21.081707Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2607.00341","last_updated":"2026-07-27T05:15:18Z","snapshot_observed_at":"2026-08-02T09:18:41.625301Z","submitted_at":"2026-07-01T02:32:02Z","title":"DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-02T13:46:59.407102Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.00341"},"observation_digest":"sha256:24f46f39f449e757a54c3eec4cf2d1fbd1ec7f033e4a099b422fd232cc30596f","observation_id":"92b91c18-1988-4afa-945c-609ce301c984","resolution":{"observed_at":"2026-07-02T13:56:59.329578Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-02T09:18:44.427622Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.00341","last_updated":"2026-07-27T05:15:18Z","snapshot_observed_at":"2026-08-02T09:18:41.625301Z","submitted_at":"2026-07-01T02:32:02Z","title":"DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoning","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T09:18:44.427622Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.00341"},"observation_digest":"sha256:7e555417a22437e07180bd4ca97faa5722a46b0cd0b5c0e324330eb29e0a0218","observation_id":"a303873d-7de6-468d-ae20-8bb05f3b38b8","resolution":{"observed_at":"2026-08-02T09:18:44.427622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":"2404.15758","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-07-03T20:58:58.552877Z","title":"Let’s think dot by dot: Hidden computation in transformer language models.arXiv preprint arXiv:2404.15758","venue":null,"work_id":"745f12c5-dbd0-4b89-a2aa-e78d08e61bf1","year":2024},"citing_paper":{"arxiv_id":"2607.01047","last_updated":"2026-07-01T15:08:02Z","snapshot_observed_at":"2026-08-07T14:53:02.059078Z","submitted_at":"2026-07-01T15:08:02Z","title":"Conversable Complexity: Agentic LLM Collectives as Interpretable Substrates","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-02T12:46:40.700728Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.01047"},"observation_digest":"sha256:9380ed94552123439d9bcd6f8192e360e7388fb8fe61f053e7f67a445a467388","observation_id":"3b8542ff-28be-499d-9c0c-815e6a1a4953","resolution":{"observed_at":"2026-07-02T12:46:56.207324Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-01T19:29:06.397389Z","title":"naacl-main.168/","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16972","last_updated":"2026-07-18T21:32:06Z","snapshot_observed_at":"2026-08-08T23:35:25.936577Z","submitted_at":"2026-07-18T21:32:06Z","title":"Training Continuous Chain of Thought Models: A Tale of Two Regimes","version":1},"reference_index":168,"source":"pdf_text","source_observed_at":"2026-08-01T19:29:06.397389Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.16972"},"observation_digest":"sha256:e157030f54fc9971aab83037c08c8b7cd5364ad467160d6f9f94531d2c5da799","observation_id":"de7e11ce-22d6-48ca-98a7-3ea4928b7b90","resolution":{"observed_at":"2026-08-01T19:29:06.397389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-01T06:14:11.133634Z","title":"org/abs/2404.15758","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21981","last_updated":"2026-07-24T04:57:30Z","snapshot_observed_at":"2026-08-08T00:29:17.472793Z","submitted_at":"2026-07-24T04:57:30Z","title":"J-CoT: Chain-of-Thought in J-Space","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T06:14:11.133634Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.21981"},"observation_digest":"sha256:802d98936fbe9acf64a1d9d72c8d87f03a9881673a92e71761504c6245452a1c","observation_id":"fb0ee4df-1eb3-46a7-8116-08306c40ab80","resolution":{"observed_at":"2026-08-01T06:14:11.133634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.15758","snapshot_observed_at":"2026-08-01T04:14:45.133222Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22925","last_updated":"2026-07-24T21:32:48Z","snapshot_observed_at":"2026-08-08T05:49:21.548828Z","submitted_at":"2026-07-24T21:32:48Z","title":"Not All LLM Reasoning is Visible in the Chain-of-Thought","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T04:14:45.133222Z"},"links":{"cited_paper":"/paper/2404.15758","citing_paper":"/paper/2607.22925"},"observation_digest":"sha256:60d558925e66cc6562e1d45694a9e955814a7db92253c3f7ccd54370c6ea9067","observation_id":"96743c93-651d-4dee-9e82-3687c717c4de","resolution":{"observed_at":"2026-08-01T04:14:45.133222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.15758/citation-record","integrity":"/paper/2404.15758/integrity","json":"/paper/2404.15758/citation-record.json","paper":"/paper/2404.15758"},"outbound":[],"paper":{"arxiv_id":"2404.15758","last_updated":"2024-04-24T09:30:00Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T08:29:56.806569Z","submitted_at":"2024-04-24T09:30:00Z","title":"Let's Think Dot by Dot: Hidden Computation in Transformer Language Models"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 46 inbound Pith citation observations for arXiv:2404.15758."}