{"as_of":"2026-08-10T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d4d7198db9cd91db938841785c400414fdd5f5c7cd7f9e03f0d36e6bcf5db92","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:37:40.682061Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-09T17:37:40.682061Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01694","last_updated":"2025-03-01T10:27:24Z","snapshot_observed_at":"2026-08-09T20:41:13.212163Z","submitted_at":"2025-02-02T18:19:14Z","title":"Metastable Dynamics of Chain-of-Thought Reasoning: Provable Benefits of Search, RL and Distillation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T17:37:40.682061Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2502.01694"},"observation_digest":"sha256:dfadaa3b055578cfbfb278f5274382f641cbf9ee50252775ced274de1379989f","observation_id":"5faf387d-a41d-4915-a41a-42faf968e9ea","resolution":{"observed_at":"2026-08-09T17:37:40.682061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-08T14:33:15.961026Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.961026Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:eadd220f6f8e2874bfa86de3087919f949657722b582aedb0690529dbbe54cfb","observation_id":"e50a8057-42ac-4f97-ad9d-e92a09eb5f9e","resolution":{"observed_at":"2026-08-08T14:33:15.961026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-07T12:46:36.416475Z","title":"Transformers provably solve parity efficiently with chain of thought.arXiv preprint arXiv:2410.08633, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23683","last_updated":"2025-05-29T17:22:00Z","snapshot_observed_at":"2026-08-07T21:59:35.039840Z","submitted_at":"2025-05-29T17:22:00Z","title":"Learning Compositional Functions with Transformers from Easy-to-Hard Data","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:46:36.416475Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2505.23683"},"observation_digest":"sha256:076deb9ce2f64c763da9f69f43cb6580bb509d4110590e689f79aab9fef397d1","observation_id":"2322fda7-1f28-4a84-bb51-4dec2ba0ffc8","resolution":{"observed_at":"2026-08-07T12:46:36.416475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-07T11:21:41.931755Z","title":"Transformers provably solve parity efficiently with chain of thought.arXiv preprint arXiv:2410.08633, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02726","last_updated":"2025-06-03T10:36:38Z","snapshot_observed_at":"2026-08-08T11:50:57.510769Z","submitted_at":"2025-06-03T10:36:38Z","title":"RACE-Align: Retrieval-Augmented and Chain-of-Thought Enhanced Preference Alignment for Large Language Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:21:41.931755Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2506.02726"},"observation_digest":"sha256:bbfb0713d9f37373c0a577fa8f5d67e60e5ac6071e84ef5c9e4c0a03dc0812f9","observation_id":"09bcebd1-1f60-478e-90b7-79b246d1c87f","resolution":{"observed_at":"2026-08-07T11:21:41.931755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T22:10:17.500880Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07571","last_updated":"2025-08-19T11:54:07Z","snapshot_observed_at":"2026-08-07T21:59:26.623348Z","submitted_at":"2025-08-11T03:05:36Z","title":"Towards Theoretical Understanding of Transformer Test-Time Computing: Investigation on In-Context Linear Regression","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T22:10:17.500880Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2508.07571"},"observation_digest":"sha256:369a2b4972eaa593eed64705f5f76e053e92af5b79e7438a356531feae41e54f","observation_id":"761845ca-59b7-41cb-b021-e26d2f542296","resolution":{"observed_at":"2026-08-05T22:10:17.500880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-02T23:11:54.462324Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.14872","last_updated":"2026-06-29T01:04:09Z","snapshot_observed_at":"2026-08-02T23:11:47.613570Z","submitted_at":"2026-02-16T16:03:08Z","title":"On the Emergence of Implicit Curriculum in RLVR Learning Dynamics","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T23:11:54.462324Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2602.14872"},"observation_digest":"sha256:562e222358497cac305d04f6fd5716292093fdfd54adfb522e8b15b767fab303","observation_id":"ef7b5b22-72aa-4beb-a331-eb51b3ce4e25","resolution":{"observed_at":"2026-08-02T23:11:54.462324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","year":2024},"citing_paper":{"arxiv_id":"2604.22951","last_updated":"2026-07-08T19:29:03Z","snapshot_observed_at":"2026-07-12T23:17:30.297545Z","submitted_at":"2026-04-24T18:49:08Z","title":"The Power of Power Law: Asymmetry Enables Compositional Reasoning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-08T11:49:49.787123Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2604.22951"},"observation_digest":"sha256:ac134ab6715964f2e220ac5c285d64ca48d3a65aac1f4ad717b886cde89a551d","observation_id":"dc5a69b5-2553-4fb8-bd71-9f739f2bdc06","resolution":{"observed_at":"2026-05-11T19:31:08.235090Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-07-12T18:26:05.728364Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.22951","last_updated":"2026-07-08T19:29:03Z","snapshot_observed_at":"2026-07-12T23:17:30.297545Z","submitted_at":"2026-04-24T18:49:08Z","title":"The Power of Power Law: Asymmetry Enables Compositional Reasoning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-12T18:26:05.728364Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2604.22951"},"observation_digest":"sha256:8f0c1cbaabb49386a6339a51ad18a585ae37929164d004025da0077d8f7e8dd2","observation_id":"309d9737-4ca8-40b9-936c-65dd0430c10a","resolution":{"observed_at":"2026-07-12T18:26:05.728364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","year":2024},"citing_paper":{"arxiv_id":"2604.24737","last_updated":"2026-04-27T17:43:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-27T17:43:44Z","title":"Learning to Think from Multiple Thinkers","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T03:55:02.562122Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2604.24737"},"observation_digest":"sha256:b678d13199292bfa5727c240da4cdbf87dfda8c46e45e443ffb8f9d39a0733f0","observation_id":"7e7bb8b7-8911-4419-a4cf-5553b441b1e2","resolution":{"observed_at":"2026-05-11T21:56:10.679647Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","year":2024},"citing_paper":{"arxiv_id":"2605.06819","last_updated":"2026-05-07T18:21:05Z","snapshot_observed_at":"2026-07-06T23:19:15.382283Z","submitted_at":"2026-05-07T18:21:05Z","title":"A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-11T00:52:10.419984Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2605.06819"},"observation_digest":"sha256:f09f02daf98b19189ccd714180d5111689d3596db5a8954d5675fc95e19ec5e6","observation_id":"46afb2d4-fd10-401b-8945-4c748efa40c2","resolution":{"observed_at":"2026-05-11T05:05:58.591059Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","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":24,"source":"arxiv_source","source_observed_at":"2026-06-29T14:29:10.010212Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2605.28600"},"observation_digest":"sha256:f206390584ff602651030d877431bb14096fedc0c170def61490f90463d31ef5","observation_id":"b21e1c4a-dd87-4bde-bdd1-3a38f86547f5","resolution":{"observed_at":"2026-06-29T14:33:30.608253Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","year":2024},"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":31,"source":"arxiv_source","source_observed_at":"2026-06-28T23:26:28.158991Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2606.00183"},"observation_digest":"sha256:4d00661f80fd87ce9ffc069357ba8c60688d0c39a998b6646f6aa2d7992006f8","observation_id":"669df209-6638-45a9-8514-ef59b29132a0","resolution":{"observed_at":"2026-06-28T23:42:49.908741Z","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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":"2410.08633","doi":"10.48550/arxiv.2410.08633","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Transformers provably solve parity efficiently with chain of thought","venue":"arXiv (Cornell University)","work_id":"260baae0-e14b-4596-8fea-f21c9afbae18","year":2024},"citing_paper":{"arxiv_id":"2606.20937","last_updated":"2026-06-18T21:01:42Z","snapshot_observed_at":"2026-08-02T17:33:10.336044Z","submitted_at":"2026-06-18T21:01:42Z","title":"Learning through Internalization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-26T17:43:18.915404Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2606.20937"},"observation_digest":"sha256:5ceaf254ee21496553f57e3384b80eeae0e02991480ec5d4227a7976fa1f0591","observation_id":"f58d5fc5-fedc-4321-a2b9-bf18c2a9f70b","resolution":{"observed_at":"2026-06-26T17:49:40.652802Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.08633/citation-record","integrity":"/paper/2410.08633/integrity","json":"/paper/2410.08633/citation-record.json","paper":"/paper/2410.08633"},"outbound":[],"paper":{"arxiv_id":"2410.08633","last_updated":"2025-03-11T14:26:41Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2410.08633."}