{"as_of":"2026-08-10T10:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48cbfd2b81676f4bf90e1df12d96438b6305cf2c9e2eee3af2ade3a35292d9ca","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:23:57.989726Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:57:09.438395Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"cited_work":{"arxiv_id":"2502.02393","doi":"10.48550/arxiv.2502.02393","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02393","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard- Attention Transformers","venue":"ArXiv.org","work_id":"fa7b8622-f7b8-4333-abc3-59fe90af0c6d","year":2025},"citing_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-08-08T22:33:20.124926Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.02393","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:544652ba1e623d52a45b21a7b32d18cbc193226acc5ead0c68ab351bec13e5d8","observation_id":"f0ea446a-36d9-4569-9757-835e1ba637ff","resolution":{"observed_at":"2026-05-12T08:40:41.311770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02393","snapshot_observed_at":"2026-08-03T20:57:09.438395Z","title":"Lower bounds for chain-of-thought reasoning in hard-attention transformers, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.17852","last_updated":"2026-08-06T09:30:47Z","snapshot_observed_at":"2026-08-09T23:09:22.568411Z","submitted_at":"2025-11-22T00:38:43Z","title":"Transformers with RL or SFT Provably Learn Sparse Boolean Functions, But Differently","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T20:57:09.438395Z"},"links":{"cited_paper":"/paper/2502.02393","citing_paper":"/paper/2511.17852"},"observation_digest":"sha256:0caa9cc91bfef5254875d7a34d897b1043cbc608ff653f8cfb0fd0e4bd03b5aa","observation_id":"4030c640-1a10-41e9-9fc0-0e6efc0c3cd3","resolution":{"observed_at":"2026-08-03T20:57:09.438395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"cited_work":{"arxiv_id":"2502.02393","doi":"10.48550/arxiv.2502.02393","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02393","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard- Attention Transformers","venue":"ArXiv.org","work_id":"fa7b8622-f7b8-4333-abc3-59fe90af0c6d","year":2025},"citing_paper":{"arxiv_id":"2602.01651","last_updated":"2026-04-21T07:48:12Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T05:11:48Z","title":"On the Spatiotemporal Dynamics of Generalization in Neural Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T08:59:44.016444Z"},"links":{"cited_paper":"/paper/2502.02393","citing_paper":"/paper/2602.01651"},"observation_digest":"sha256:ffebcd2ad72e1e702571ddf1a742c0ff171c8a87243a62bd443446adbdcab86f","observation_id":"d57bf956-5b30-4e9a-80dc-8d8181c248be","resolution":{"observed_at":"2026-05-16T09:00:46.785226Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"cited_work":{"arxiv_id":"2502.02393","doi":"10.48550/arxiv.2502.02393","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02393","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard- Attention Transformers","venue":"ArXiv.org","work_id":"fa7b8622-f7b8-4333-abc3-59fe90af0c6d","year":2025},"citing_paper":{"arxiv_id":"2606.00183","last_updated":"2026-05-29T14:58:03Z","snapshot_observed_at":"2026-07-06T23:40:56.510371Z","submitted_at":"2026-05-29T14:58:03Z","title":"Agentic Transformers Provably Learn to Search via Reinforcement Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T23:26:28.158991Z"},"links":{"cited_paper":"/paper/2502.02393","citing_paper":"/paper/2606.00183"},"observation_digest":"sha256:ce0a091aa54d16f33bccf9a8d283c6af69ecfebb6a0e5bd455554ee6e2e23d9c","observation_id":"d415cefe-afb7-4efa-87d2-7840d60e20f9","resolution":{"observed_at":"2026-06-28T23:42:49.970053Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2502.02393/citation-record","integrity":"/paper/2502.02393/integrity","json":"/paper/2502.02393/citation-record.json","paper":"/paper/2502.02393"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.662467Z","title":"The situation is different for parallel computation as performed by transformers: Many problems do have direct parallel solutions","venue":null,"work_id":"077afe7d-facd-416a-9bc8-18646c5975c0","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.834409Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:731ab608a98fdc599ddf66aac72d1b8e5cfa567aaa87fe54b084f6d89a82f8f7","observation_id":"2ed6408d-2aa5-4927-a47f-17693ea09256","resolution":{"observed_at":"2026-08-09T12:23:58.667527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.648597Z","title":null,"venue":null,"work_id":"abdfc2a4-8934-4a50-bace-db7e1922eae6","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.839052Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:74d207ea296211a9aa3f9d9119d6656e081a4ebe288fa24c54f5dd0e1f965c76","observation_id":"7e24c091-8eae-44d9-aa3f-9e05bf61ecb7","resolution":{"observed_at":"2026-08-09T12:23:58.652970Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02975","last_updated":"2024-12-04T02:37:31Z","snapshot_observed_at":"2026-08-08T18:12:49.793504Z","submitted_at":"2024-12-04T02:37:31Z","title":"Theoretical limitations of multi-layer Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02975","snapshot_observed_at":"2026-08-09T12:23:57.804636Z","title":"Chen, L., Peng, B., and Wu, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.804636Z"},"links":{"cited_paper":"/paper/2412.02975","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:492ad16a9e9f4662bbf981f2db11031ed12129ef8d7390ef90680145c1fa8ba7","observation_id":"2fff638b-a1a9-4bbf-af5d-92983cb89be9","resolution":{"observed_at":"2026-08-09T12:23:57.804636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.618301Z","title":null,"venue":null,"work_id":"84be2c0c-68eb-4142-b6be-632165a12873","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.849779Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:4147ba6581f5f275aaf7140e8628869dcbb80fcbb35c7c43517f2e9b4d737efe","observation_id":"41e8c9a9-6673-437b-9213-253eef0872b1","resolution":{"observed_at":"2026-08-09T12:23:58.623062Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13857","last_updated":"2025-06-21T09:18:16Z","snapshot_observed_at":"2026-07-06T19:35:30.732080Z","submitted_at":"2024-10-17T17:59:35Z","title":"How Numerical Precision Affects Arithmetical Reasoning Capabilities of LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13857","snapshot_observed_at":"2026-08-09T12:23:57.814261Z","title":"Feng, G., Yang, K., Gu, Y ., Ai, X., Luo, S., Sun, J., He, D., Li, Z., and Wang, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.814261Z"},"links":{"cited_paper":"/paper/2410.13857","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:aa7ca507ea4cb9c0ce2648bbeca739f505816eb65c9421162b5efb5ed51e8526","observation_id":"a20aa124-19bc-45f0-874c-eda0e7b4521b","resolution":{"observed_at":"2026-08-09T12:23:57.814261Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20195","last_updated":"2024-12-28T16:09:25Z","snapshot_observed_at":"2026-08-09T19:53:22.429771Z","submitted_at":"2024-12-28T16:09:25Z","title":"Lower bounds on transformers with infinite precision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20195","snapshot_observed_at":"2026-08-09T12:23:57.818820Z","title":"11 Lower Bounds for CoT Reasoning Kim, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.818820Z"},"links":{"cited_paper":"/paper/2412.20195","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:2e1c0847345e5086fbb30f5b06d80ed2513a3b84acbc5a4ab863ddf52f6fc368","observation_id":"e0ae232d-ede8-4e86-b337-a761520ba6f4","resolution":{"observed_at":"2026-08-09T12:23:57.818820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01992","last_updated":"2025-02-20T22:43:15Z","snapshot_observed_at":"2026-08-09T20:12:14.055866Z","submitted_at":"2024-11-04T11:26:38Z","title":"Ask, and it shall be given: On the Turing completeness of prompting","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01992","snapshot_observed_at":"2026-08-09T12:23:57.824032Z","title":"Qiu, R., Xu, Z., Bao, W., and Tong, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.824032Z"},"links":{"cited_paper":"/paper/2411.01992","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:abda5d429d6b29bde9e4bc89cbf33c43d389a1ef83c3d2fb73e4762e757dff85","observation_id":"f41969af-0b35-486d-b939-d9d04147137e","resolution":{"observed_at":"2026-08-09T12:23:57.824032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03212","last_updated":"2023-08-21T18:54:56Z","snapshot_observed_at":"2026-08-10T09:23:13.726246Z","submitted_at":"2023-08-06T21:23:22Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03212","snapshot_observed_at":"2026-08-09T12:23:57.829205Z","title":"URL https: //doi.org/10.48550/arXiv.2308.03212","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.829205Z"},"links":{"cited_paper":"/paper/2308.03212","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:e0955fd6241a4ae902bbb903cf7e702891f7bf99c1dd90353e8a8284a86b1ec1","observation_id":"5e8362be-6f0a-4a8c-9a01-03e2a3e326b5","resolution":{"observed_at":"2026-08-09T12:23:57.829205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.542991Z","title":null,"venue":null,"work_id":"1d0bdbee-f21f-40fc-8d9c-76aa566b5573","year":2020},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.873748Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:546baee11e7e573ddb8280e3c6af74cc4e6b3d50eefb658045c00bbc0d2e194b","observation_id":"d68a1469-0d65-4685-b3b6-2b12c737b463","resolution":{"observed_at":"2026-08-09T12:23:58.547854Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.633739Z","title":null,"venue":null,"work_id":"878ea6e1-c82a-44eb-8035-aefd536f1cd0","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.844116Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:b12b3f54ac8a99e134d850ec47939a4d70ff0d9b47cf6df1cc7ccc02733645d1","observation_id":"160a6dfd-a02d-4545-95f5-a77718590eb3","resolution":{"observed_at":"2026-08-09T12:23:58.638548Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.602451Z","title":"For instance, PARITY is a simple example of state tracking, a family of reasoning problems that have been of substantial interests and that still pose challenges for LLMs (e.g","venue":null,"work_id":"fc191452-eb4f-4a17-90cc-9ef13e113761","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.854368Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:b474064ae65f89c21143e537cd30112d182f24d20237455c66c3c30b15cc0e4b","observation_id":"e7bc93ff-3c56-4480-8101-d3fd7ec7f248","resolution":{"observed_at":"2026-08-09T12:23:58.607322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.587106Z","title":"Why? The input alphabet needs to be finite for Theorem 3.3 to go through, because the proof of Lemma B.3 by Hahn (2020) involves a union bound over the alphabet","venue":null,"work_id":"7bc6b917-8d36-4694-bb1f-d2a1e09a15fb","year":2020},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.859618Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:5246e73440373db1bbf7d1f54b582ba0710b656769dfdcff554f45f95ab8fc77","observation_id":"3289191e-3553-4a60-8361-1998690b9f9b","resolution":{"observed_at":"2026-08-09T12:23:58.592084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.572213Z","title":"Isn’t this unrealistic? What about the role of length generalization? It is true that, in practice, one will expect transformers to perform the tasks across input lengths","venue":null,"work_id":"e0c03642-1123-4c8a-a002-e37ac9078444","year":2023},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.864309Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:c4660e5b4ae9922287757f5a3564cda3f7783849c4524ee811810c3cf6f4ba9e","observation_id":"7c68ef69-46b5-46f5-bab8-be4058460db9","resolution":{"observed_at":"2026-08-09T12:23:58.577022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.557875Z","title":"In particular, UHAT is bounded by AC 0, whereas softmax transformers are bounded by T C0","venue":null,"work_id":"a47de818-75f5-4468-a8d1-8e1f3ff4cc3d","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.869089Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:e2a882e2a0641c71f13bfdb54c7a8d46f985674e5eb327bdcdc54918710f6684","observation_id":"88fcc03d-6a11-4ca2-81fb-b5e14441d394","resolution":{"observed_at":"2026-08-09T12:23:58.562746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.528606Z","title":null,"venue":null,"work_id":"09e7dbf4-a39b-402e-a658-b8a1fbdea898","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.878498Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:452a47f5ece1486fafb8a15cb8011a562e8e9ad0e5634aa91a0f4a8e4933fd6c","observation_id":"47cca165-cb83-40e6-a3f9-4ada7330bf89","resolution":{"observed_at":"2026-08-09T12:23:58.533204Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.515326Z","title":"By applying Lemma B.3 iteratively, L times","venue":null,"work_id":"f69d0b8b-46c4-4e89-838b-df95aeb4f13a","year":2020},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.883160Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:aa595f4a978dc60b9d43a836949bdac27b46cf3b308fed7adee6c81fafa8d82c","observation_id":"42643bd6-9925-4fc4-9560-f1cbd1d9b4ec","resolution":{"observed_at":"2026-08-09T12:23:58.519420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.501104Z","title":"Here, “ρ(3)” corresponds to the restriction ρ′ from the statement of the lemma","venue":null,"work_id":"948df836-6e36-451b-a2ba-f3253c2dfb47","year":2020},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.887702Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:226f03238192fe53cf12a0d02bc8bbb66b6071acc6044b15e314d9dcb22e0cd6","observation_id":"054c180d-0d4d-4765-8f39-b5cc456cfa41","resolution":{"observed_at":"2026-08-09T12:23:58.505231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.487358Z","title":"First, we obtain a restriction ρ(0), and integers c, k from Lemma 3.4, applying T only on the input x ∈ Σ∗ itself","venue":null,"work_id":"c2651c2a-9daa-46dc-9ec5-f5fefd584b50","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.892312Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:ff4d32dc7db35205e1c9df7eed09c828db7ca18ea4b3ac5096cf26fff9e80470","observation_id":"790de37a-4d11-4b3b-944d-1e5f35be3cb4","resolution":{"observed_at":"2026-08-09T12:23:58.491288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.474209Z","title":null,"venue":null,"work_id":"183d57ba-931c-441e-b34b-7253c38bc619","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.896962Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:4f9c31cf1d63f230a2244ee0ba19bfbb6a19d86fa0674c95b8e4f8a2c0385d65","observation_id":"13642b46-bee7-4ff2-8aa0-272493bd69ef","resolution":{"observed_at":"2026-08-09T12:23:58.478548Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.459967Z","title":"dot-by-dot CoT","venue":null,"work_id":"0fb6b0ed-7367-41c2-b656-fe9875a3e736","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.901255Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:c335a0a0e07b2d1dc3b548c9fb783a888fd88557a400311fe5271b66bc7fd4fb","observation_id":"08664bc3-d590-4078-949c-1d84e1a8de71","resolution":{"observed_at":"2026-08-09T12:23:58.464323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.445866Z","title":null,"venue":null,"work_id":"8b3ab613-977c-406d-9f5f-9b993b8cea63","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.905295Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:bc32d948ead73dc171d0bc6f44c4c5a93ee544c66753cdefb7e423065ff6e87e","observation_id":"157215f7-71d2-406a-af1f-a882e090f143","resolution":{"observed_at":"2026-08-09T12:23:58.450359Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.431351Z","title":null,"venue":null,"work_id":"693af849-1372-48b0-af8e-a0065cf7c622","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.909350Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:181f2aebe9340fd579dd0067992bf0ba9e94954e4d582cea1317d6870bfe9030","observation_id":"f1e57c3a-99c7-4b0a-9693-54c9964c5094","resolution":{"observed_at":"2026-08-09T12:23:58.436030Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.416939Z","title":null,"venue":null,"work_id":"7c16da44-db17-402e-b524-6475787030f5","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.913248Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:74e63bc6bf62a556ac24f0636d9075938aa8a8bc28709813bc94f5b26339e04c","observation_id":"65cecb05-ccae-44f3-83c6-aaebec03afa6","resolution":{"observed_at":"2026-08-09T12:23:58.421806Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.401229Z","title":null,"venue":null,"work_id":"7da373c8-7f7a-4aee-a765-e6d2591335a4","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.917270Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:69c24a47725861691c02e3002204d43d06f4901dd68592faf7efd57cf24778d4","observation_id":"54acb11d-eeab-4eef-be72-c0bc16b5b5ae","resolution":{"observed_at":"2026-08-09T12:23:58.406030Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.386316Z","title":null,"venue":null,"work_id":"38e67490-c042-4262-af9b-35eb7ec4fe0b","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.921603Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:f2a083491002527add8df827bcebe52cda5954277d3910aa7baec8f4af3f2fa5","observation_id":"4899fcfa-a50e-4ef0-a77b-72c5578f60e1","resolution":{"observed_at":"2026-08-09T12:23:58.390936Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.371730Z","title":null,"venue":null,"work_id":"d2705d5a-b112-4056-a2e7-b0c1a241ec73","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.925755Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:e78f6b496a5c63f3cd1af7bc787ceb75c8e8a9edaf59cfada19c43c0ccd987f8","observation_id":"1e5201c1-c51b-4ff7-955b-58cb8b844950","resolution":{"observed_at":"2026-08-09T12:23:58.376170Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.357090Z","title":null,"venue":null,"work_id":"2895ffdf-b981-4c24-88d2-2755f54f1f93","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.930196Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:afbf5ddeb5ed2c6fb89c78d2bd774442cfed89fb83d88f9adb90550baeb996d7","observation_id":"1fbb4e47-c178-4452-b2c6-e2e43406cb73","resolution":{"observed_at":"2026-08-09T12:23:58.361906Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.342436Z","title":"All remaining tape positions hold a blank symbol BLANK ∈ Σ","venue":null,"work_id":"19680eb8-ab9d-4baa-8919-04d3f2f8fcd3","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.934369Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:715fda7f8c9fbf0c58429ea41d531f89bf9c8794cd016139a2999402cc4c9f6d","observation_id":"ba150e93-b063-4aa8-94f4-3767c6da8f63","resolution":{"observed_at":"2026-08-09T12:23:58.347133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.327466Z","title":null,"venue":null,"work_id":"39b0e967-ce39-4b98-a274-cf576adf1aaf","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.938533Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:ce12539b6e0efa089bae2508639696d73b38a2574450e8483867ba514532b8be","observation_id":"231408a6-7c7f-469b-8fcb-43f2c04743ea","resolution":{"observed_at":"2026-08-09T12:23:58.332312Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.312201Z","title":null,"venue":null,"work_id":"f3cdedf5-e0c5-45da-a297-39da35d5534f","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.942478Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:3e13ae930a2f1ec7e258631ea18f7dd8295487d7e5b808a31617d7f04bc59bb3","observation_id":"d93dc880-48ae-4efa-88f2-0c6d7b894b6a","resolution":{"observed_at":"2026-08-09T12:23:58.317110Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.298081Z","title":"We first encode the input word as a string over the input alphabet Σ, followed by a separator symbol","venue":null,"work_id":"3cf37421-8208-48e3-a0d8-082af3ea078a","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.946265Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:54a1e4b758fe309abd9502db892ba20bd9ef0274cfebd9be857336d6a337eb9a","observation_id":"66396782-3b8a-482b-8ed3-2229c4503236","resolution":{"observed_at":"2026-08-09T12:23:58.302892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.284138Z","title":"19 Lower Bounds for CoT Reasoning","venue":null,"work_id":"671fba36-ec6a-4cf1-9e1c-ca9768024652","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.950263Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:8ef9040b7f243c0c825d42caba2db7cba93ff8be0e7ef18339c6564663c762c2","observation_id":"624657ac-bbaf-4f47-bfac-da67bbce207e","resolution":{"observed_at":"2026-08-09T12:23:58.288385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.269962Z","title":"Turing programs","venue":null,"work_id":"5c27ca6b-f209-4992-b522-f4d2121509c0","year":2022},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.954478Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:e0a0328794015a4a001e72841691f292869cc4c3a75d75fb32613419d8bd6b62","observation_id":"4fdc6f53-e880-4772-ae9d-898d2da33c02","resolution":{"observed_at":"2026-08-09T12:23:58.274603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.255208Z","title":null,"venue":null,"work_id":"99331c36-4ef6-47d8-9cc3-c8f00a05d666","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.958591Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:cdf4bb682f809e52adf5451c35db93861c634f45b1fee447011c776993369f39","observation_id":"21395cfc-2124-44c7-b7da-3d1181b7e691","resolution":{"observed_at":"2026-08-09T12:23:58.260035Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.240094Z","title":"We show this using the characterization of regular languages in AC 0 by Barrington et al","venue":null,"work_id":"9d197a53-e187-4f1b-8924-ae69f3a349d0","year":1992},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.962409Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:8cdbd9cbf6850857bec0a836bf8b95772f8e5941951b8ffa54bd6df2458012f9","observation_id":"ea12ce18-32fd-4b26-b059-4e16490af1a1","resolution":{"observed_at":"2026-08-09T12:23:58.244879Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.224793Z","title":", M2N (and analogously for addition) in parallel","venue":null,"work_id":"7cbf952e-42cd-4fae-ba07-1663ccb3c565","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.966599Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:91959ddef74f28487c9edb565ca240474a0ea22790e39c276563afae27052516","observation_id":"951fa4a9-3778-4454-a0c6-52528dc742bd","resolution":{"observed_at":"2026-08-09T12:23:58.229227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.208164Z","title":"M2N (and analogously for addition)","venue":null,"work_id":"c76cb83f-f8a7-4eeb-8dc9-420db26681a9","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.970479Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:89f5c79c286447681a925ddfc388b97faffb490be2532b1f50e569d84a67af1f","observation_id":"59588778-f524-46d8-9af1-93f369e2cef7","resolution":{"observed_at":"2026-08-09T12:23:58.212842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.191980Z","title":"We expect that this setup will make the task feasible for transformers","venue":null,"work_id":"222d8d8f-25e5-414c-b971-1bdbc7e32e5d","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.974999Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:6c833f06475f5019009976a05df04548e4c3c20a871eb6aa639ed41129f477db","observation_id":"e59177fa-2132-437b-865d-e0afb470c97e","resolution":{"observed_at":"2026-08-09T12:23:58.197213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.176193Z","title":"increment-by-1","venue":null,"work_id":"49b650ed-71db-4648-9e5b-dfe5a1735cd5","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.979667Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:ef1b0420e7d97f4e049fa760ede2747db1277f935d355e523f7865de5143c453","observation_id":"63b5920b-757d-43c4-8014-479ad69567c4","resolution":{"observed_at":"2026-08-09T12:23:58.181087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.159657Z","title":"Conjecture E.2 thus provides a more optimistic prediction here than our results","venue":null,"work_id":"11be198a-9d53-4629-afef-279c43d89e1a","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.984971Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:85ecfa67af5aa5f9f66da470b61355e5e0848bef859cb99466fd66d63055906d","observation_id":"a3f84ea5-440e-45b7-85c9-69f409b1830e","resolution":{"observed_at":"2026-08-09T12:23:58.164516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.143122Z","title":"(2024) requires a linear-length CoT by Theorem 3.3, and can also be shown to not be representable at sub-linear average sensitivity under a reasonable input encoding","venue":null,"work_id":"4f70f00d-80a7-4172-b3f9-29eb209f3f69","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.989726Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:df7e7e257c4034b00aeca5a629fbac0fd11d4f18ed26880415dee6faaa873df0","observation_id":"1083912c-4c02-44b4-8733-ddba00e93559","resolution":{"observed_at":"2026-08-09T12:23:58.148411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:23:58.677286Z","title":"Abb´e, E., Bengio, S., Lotfi, A., Sandon, C., and Saremi, O","venue":null,"work_id":"26f6c9e2-f46b-4984-8e8e-b865dbfe68c7","year":null},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.794912Z"},"links":{"citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:16728177ec2405c6a2dac15dd1af0f904f5f3e92c01f04621a1b36bf76d9205c","observation_id":"ff1f9449-eced-40e6-aaca-1e4c845ba365","resolution":{"observed_at":"2026-08-09T12:23:58.682081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04910","last_updated":"2025-03-05T08:37:17Z","snapshot_observed_at":"2026-08-10T09:22:34.135097Z","submitted_at":"2024-12-06T10:05:10Z","title":"Learning High-Degree Parities: The Crucial Role of the Initialization","version":3},"cited_work":{"arxiv_id":"2412.04910","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.04910","snapshot_observed_at":"2026-08-09T12:23:58.124801Z","title":"Learning High-Degree Parities: The Crucial Role of the Initialization","venue":"cs.LG","work_id":"69fef89e-6be0-43b8-ab29-927855b08ef0","year":2024},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.799757Z"},"links":{"cited_paper":"/paper/2412.04910","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:c79686c3f84c303e5490ce375fd5087134c170eddd6712dfbbe9ed6c7ab9935e","observation_id":"5ef45449-9471-4a80-b362-2a02d7e0eaa6","resolution":{"observed_at":"2026-08-09T12:23:58.131874Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.15787","last_updated":"2025-04-17T08:18:02Z","snapshot_observed_at":"2026-07-06T19:36:54.626904Z","submitted_at":"2024-10-21T08:49:51Z","title":"Arithmetic Transformers Can Length-Generalize in Both Operand Length and Count","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.15787","snapshot_observed_at":"2026-08-09T12:23:57.809581Z","title":"Chiang, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers","version":3},"reference_index":8856,"source":"pdf_text","source_observed_at":"2026-08-09T12:23:57.809581Z"},"links":{"cited_paper":"/paper/2410.15787","citing_paper":"/paper/2502.02393"},"observation_digest":"sha256:18f9cce210db2ab7dd67a1cfd19b27b6a6124bd72c9ed75caac1aab925a7fd52","observation_id":"62b6c806-972d-42b7-bc7e-9af5a335e79c","resolution":{"observed_at":"2026-08-09T12:23:57.809581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.02393","last_updated":"2025-07-12T18:49:06Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T09:22:56.267459Z","submitted_at":"2025-02-04T15:14:01Z","title":"Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":4,"unresolved":17,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 4 inbound Pith citation observations for arXiv:2502.02393."}