{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:W6HL2ABBDKS6DFQIHYE3NWSGB5","short_pith_number":"pith:W6HL2ABB","canonical_record":{"source":{"id":"2309.06979","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-13T14:15:03Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4d1f92712891b48b223613da7a502dcef447b03611962d843750a11386bd9958","abstract_canon_sha256":"07bf4ce554688eac9226a01b21826640cdb2823f649090eab0ab3461cd4d484b"},"schema_version":"1.0"},"canonical_sha256":"b78ebd00211aa5e196083e09b6da460f5e5176bb9143b0829fb25d8db5932aab","source":{"kind":"arxiv","id":"2309.06979","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.06979","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"arxiv_version","alias_value":"2309.06979v3","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.06979","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_12","alias_value":"W6HL2ABBDKS6","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_16","alias_value":"W6HL2ABBDKS6DFQI","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_8","alias_value":"W6HL2ABB","created_at":"2026-07-05T08:49:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:W6HL2ABBDKS6DFQIHYE3NWSGB5","target":"record","payload":{"canonical_record":{"source":{"id":"2309.06979","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-13T14:15:03Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4d1f92712891b48b223613da7a502dcef447b03611962d843750a11386bd9958","abstract_canon_sha256":"07bf4ce554688eac9226a01b21826640cdb2823f649090eab0ab3461cd4d484b"},"schema_version":"1.0"},"canonical_sha256":"b78ebd00211aa5e196083e09b6da460f5e5176bb9143b0829fb25d8db5932aab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:51.462372Z","signature_b64":"S0LTsq7UZKXejpFklRS60RdaISub6JV6Lf8IwdGwdntv/0c82if1N+opC9QgYgUbiw108q+yDwOtWa0bvAPVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78ebd00211aa5e196083e09b6da460f5e5176bb9143b0829fb25d8db5932aab","last_reissued_at":"2026-07-05T08:49:51.461910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:51.461910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.06979","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:49:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2J9syCKlo2xQhi3uHcqHn7m4Z9A5kGBpppqG48FETZ2CbnX0VduYRAammkRRsCNnxaSbibfXQ2Zz+GxLPwXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:59:05.184609Z"},"content_sha256":"7a3eae841be1ad92100261b7dd9cc570976451809393e6e703986702a85ef469","schema_version":"1.0","event_id":"sha256:7a3eae841be1ad92100261b7dd9cc570976451809393e6e703986702a85ef469"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:W6HL2ABBDKS6DFQIHYE3NWSGB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auto-Regressive Next-Token Predictors are Universal Learners","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Eran Malach","submitted_at":"2023-09-13T14:15:03Z","abstract_excerpt":"Large language models display remarkable capabilities in logical and mathematical reasoning, allowing them to solve complex tasks. Interestingly, these abilities emerge in networks trained on the simple task of next-token prediction. In this work, we present a theoretical framework for studying auto-regressive next-token predictors. We demonstrate that even simple models such as linear next-token predictors, trained on Chain-of-Thought (CoT) data, can approximate any function efficiently computed by a Turing machine. We introduce a new complexity measure -- length complexity -- which measures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.06979","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.06979/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:49:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLmMXPoVKQByWhL0cpJQ3dmc8o4GARIDRp+nObfvzHqKLflF5bQ2VF7c+jeT4wgvVzgKPMNGUH2PqtMe+Tj7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T03:59:05.184966Z"},"content_sha256":"301bd632869faadf1b3fce4ac08e791568d7f2881c31668c41c69f27120cb054","schema_version":"1.0","event_id":"sha256:301bd632869faadf1b3fce4ac08e791568d7f2881c31668c41c69f27120cb054"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/bundle.json","state_url":"https://pith.science/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-17T03:59:05Z","links":{"resolver":"https://pith.science/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5","bundle":"https://pith.science/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/bundle.json","state":"https://pith.science/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6HL2ABBDKS6DFQIHYE3NWSGB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:W6HL2ABBDKS6DFQIHYE3NWSGB5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07bf4ce554688eac9226a01b21826640cdb2823f649090eab0ab3461cd4d484b","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-13T14:15:03Z","title_canon_sha256":"4d1f92712891b48b223613da7a502dcef447b03611962d843750a11386bd9958"},"schema_version":"1.0","source":{"id":"2309.06979","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.06979","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"arxiv_version","alias_value":"2309.06979v3","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.06979","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_12","alias_value":"W6HL2ABBDKS6","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_16","alias_value":"W6HL2ABBDKS6DFQI","created_at":"2026-07-05T08:49:51Z"},{"alias_kind":"pith_short_8","alias_value":"W6HL2ABB","created_at":"2026-07-05T08:49:51Z"}],"graph_snapshots":[{"event_id":"sha256:301bd632869faadf1b3fce4ac08e791568d7f2881c31668c41c69f27120cb054","target":"graph","created_at":"2026-07-05T08:49:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.06979/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models display remarkable capabilities in logical and mathematical reasoning, allowing them to solve complex tasks. Interestingly, these abilities emerge in networks trained on the simple task of next-token prediction. In this work, we present a theoretical framework for studying auto-regressive next-token predictors. We demonstrate that even simple models such as linear next-token predictors, trained on Chain-of-Thought (CoT) data, can approximate any function efficiently computed by a Turing machine. We introduce a new complexity measure -- length complexity -- which measures ","authors_text":"Eran Malach","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-13T14:15:03Z","title":"Auto-Regressive Next-Token Predictors are Universal Learners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.06979","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7a3eae841be1ad92100261b7dd9cc570976451809393e6e703986702a85ef469","target":"record","created_at":"2026-07-05T08:49:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07bf4ce554688eac9226a01b21826640cdb2823f649090eab0ab3461cd4d484b","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-13T14:15:03Z","title_canon_sha256":"4d1f92712891b48b223613da7a502dcef447b03611962d843750a11386bd9958"},"schema_version":"1.0","source":{"id":"2309.06979","kind":"arxiv","version":3}},"canonical_sha256":"b78ebd00211aa5e196083e09b6da460f5e5176bb9143b0829fb25d8db5932aab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b78ebd00211aa5e196083e09b6da460f5e5176bb9143b0829fb25d8db5932aab","first_computed_at":"2026-07-05T08:49:51.461910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:49:51.461910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S0LTsq7UZKXejpFklRS60RdaISub6JV6Lf8IwdGwdntv/0c82if1N+opC9QgYgUbiw108q+yDwOtWa0bvAPVCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:49:51.462372Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.06979","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a3eae841be1ad92100261b7dd9cc570976451809393e6e703986702a85ef469","sha256:301bd632869faadf1b3fce4ac08e791568d7f2881c31668c41c69f27120cb054"],"state_sha256":"7bf8660d195e2da2e83ab9c59a0439dc62fc39393c8d34fb1a1af94f4b97493f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaUfea/nzpUVk1kC1Ee0GJnwcgBynzEf8tOUCECheD7Z+zMTk3WrjnEg/xFvxhJu+phRee8Rygb4tVh0SHIeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T03:59:05.187025Z","bundle_sha256":"5b1282a65529d7a7ca1ca155534da2971ceb22ada12f2a54186e003e39de5a02"}}