{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5ZU455F4XH3LUG4GNAB6PXOEYW","short_pith_number":"pith:5ZU455F4","canonical_record":{"source":{"id":"2407.03310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-03T17:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"a5b5cf00609d29295410ce6dc295c251b090ef91dda4b664d7e973739da38cbf","abstract_canon_sha256":"26e494a7e2ec7874c14766a0596847c31b229fec61559eaea6b7e0eec2bccc34"},"schema_version":"1.0"},"canonical_sha256":"ee69cef4bcb9f6ba1b866803e7ddc4c5a41810baeaec50fbd40089dac50596ed","source":{"kind":"arxiv","id":"2407.03310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03310","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03310v1","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03310","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"5ZU455F4XH3L","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_16","alias_value":"5ZU455F4XH3LUG4G","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_8","alias_value":"5ZU455F4","created_at":"2026-07-05T08:39:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5ZU455F4XH3LUG4GNAB6PXOEYW","target":"record","payload":{"canonical_record":{"source":{"id":"2407.03310","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-03T17:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"a5b5cf00609d29295410ce6dc295c251b090ef91dda4b664d7e973739da38cbf","abstract_canon_sha256":"26e494a7e2ec7874c14766a0596847c31b229fec61559eaea6b7e0eec2bccc34"},"schema_version":"1.0"},"canonical_sha256":"ee69cef4bcb9f6ba1b866803e7ddc4c5a41810baeaec50fbd40089dac50596ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:48.996894Z","signature_b64":"ExCwQWk4PR3fgcNERj5OIQUedeWoccKcBK3edrYwXPKgL5AOyIU7hgcjqC7eh3k8zjkpYpLVgjZGoxSfuC1kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee69cef4bcb9f6ba1b866803e7ddc4c5a41810baeaec50fbd40089dac50596ed","last_reissued_at":"2026-07-05T08:39:48.996488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:48.996488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.03310","source_version":1,"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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpQznVJGCthBYMwf3dgQZGXY2+Y1JaqCwkliSjCXy6nodX6CkJjf3sixen7mHatrueGRrv5x8qYv8gAA9X4kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:01:10.334265Z"},"content_sha256":"c7b00c301495d428ed00044311d8ea71777e3ee5506ffa5e3f28d3913f73bf7c","schema_version":"1.0","event_id":"sha256:c7b00c301495d428ed00044311d8ea71777e3ee5506ffa5e3f28d3913f73bf7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5ZU455F4XH3LUG4GNAB6PXOEYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Length Generalization with Turing Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Brandfonbrener, Eran Malach, Kaiying Hou, Samy Jelassi, Sham Kakade","submitted_at":"2024-07-03T17:53:44Z","abstract_excerpt":"Length generalization refers to the ability to extrapolate from short training sequences to long test sequences and is a challenge for current large language models. While prior work has proposed some architecture or data format changes to achieve length generalization, these proposals typically apply to a limited set of tasks. Building on prior scratchpad and Chain-of-Thought (CoT) techniques, we propose Turing Programs, a novel CoT strategy that decomposes an algorithmic task into steps mimicking the computation of a Turing Machine. This framework is both universal, as it can accommodate any"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03310","kind":"arxiv","version":1},"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/2407.03310/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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoR3HiwUkTVLZhgOFds0uxxYDf5DPSHGLL2NyilTuXVEiGyOIJElfSlCLdN27YJY+4KOhN/bqeSFUKiAV7YdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:01:10.334770Z"},"content_sha256":"2fc66fd6299c2046cf9bd9781365f3dc30b672a1751840be62256f034696ccde","schema_version":"1.0","event_id":"sha256:2fc66fd6299c2046cf9bd9781365f3dc30b672a1751840be62256f034696ccde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/bundle.json","state_url":"https://pith.science/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/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-08-06T22:01:10Z","links":{"resolver":"https://pith.science/pith/5ZU455F4XH3LUG4GNAB6PXOEYW","bundle":"https://pith.science/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/bundle.json","state":"https://pith.science/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZU455F4XH3LUG4GNAB6PXOEYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5ZU455F4XH3LUG4GNAB6PXOEYW","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":"26e494a7e2ec7874c14766a0596847c31b229fec61559eaea6b7e0eec2bccc34","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-03T17:53:44Z","title_canon_sha256":"a5b5cf00609d29295410ce6dc295c251b090ef91dda4b664d7e973739da38cbf"},"schema_version":"1.0","source":{"id":"2407.03310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03310","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03310v1","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03310","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"5ZU455F4XH3L","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_16","alias_value":"5ZU455F4XH3LUG4G","created_at":"2026-07-05T08:39:48Z"},{"alias_kind":"pith_short_8","alias_value":"5ZU455F4","created_at":"2026-07-05T08:39:48Z"}],"graph_snapshots":[{"event_id":"sha256:2fc66fd6299c2046cf9bd9781365f3dc30b672a1751840be62256f034696ccde","target":"graph","created_at":"2026-07-05T08:39:48Z","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/2407.03310/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Length generalization refers to the ability to extrapolate from short training sequences to long test sequences and is a challenge for current large language models. While prior work has proposed some architecture or data format changes to achieve length generalization, these proposals typically apply to a limited set of tasks. Building on prior scratchpad and Chain-of-Thought (CoT) techniques, we propose Turing Programs, a novel CoT strategy that decomposes an algorithmic task into steps mimicking the computation of a Turing Machine. This framework is both universal, as it can accommodate any","authors_text":"David Brandfonbrener, Eran Malach, Kaiying Hou, Samy Jelassi, Sham Kakade","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-03T17:53:44Z","title":"Universal Length Generalization with Turing Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03310","kind":"arxiv","version":1},"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:c7b00c301495d428ed00044311d8ea71777e3ee5506ffa5e3f28d3913f73bf7c","target":"record","created_at":"2026-07-05T08:39:48Z","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":"26e494a7e2ec7874c14766a0596847c31b229fec61559eaea6b7e0eec2bccc34","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-03T17:53:44Z","title_canon_sha256":"a5b5cf00609d29295410ce6dc295c251b090ef91dda4b664d7e973739da38cbf"},"schema_version":"1.0","source":{"id":"2407.03310","kind":"arxiv","version":1}},"canonical_sha256":"ee69cef4bcb9f6ba1b866803e7ddc4c5a41810baeaec50fbd40089dac50596ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee69cef4bcb9f6ba1b866803e7ddc4c5a41810baeaec50fbd40089dac50596ed","first_computed_at":"2026-07-05T08:39:48.996488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:48.996488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ExCwQWk4PR3fgcNERj5OIQUedeWoccKcBK3edrYwXPKgL5AOyIU7hgcjqC7eh3k8zjkpYpLVgjZGoxSfuC1kAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:48.996894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.03310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7b00c301495d428ed00044311d8ea71777e3ee5506ffa5e3f28d3913f73bf7c","sha256:2fc66fd6299c2046cf9bd9781365f3dc30b672a1751840be62256f034696ccde"],"state_sha256":"ee81cd7ebfa6c52517257438fa4d418a2773b4df7e4ba83d55e4c9681e28ba67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VlDvrBCKHHHmkL1DSAdU2s1WYp1vGaR4uL3y2DjF4bqupZVtrM9Kq0H7HzWgaENVbAp8jGcSGoTST0IoDBkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:01:10.339851Z","bundle_sha256":"a275f48bcf7bc962d857d39d05664dd0cc47d3a57de0c3a89629a1f996813aba"}}