{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OVNINDKWOFLYCNYZPSOSK2N36U","short_pith_number":"pith:OVNINDKW","canonical_record":{"source":{"id":"2506.03085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T17:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"2a63be03ee546f0584bf65a88bcf877165eb2d2971c841a00e54331fae8fb849","abstract_canon_sha256":"7bb3dd32986cfc6f6dcd8aa94088567c3602a218f5116c4c69ac5f57019d876a"},"schema_version":"1.0"},"canonical_sha256":"755a868d5671578137197c9d2569bbf51ec17755b5a857ac2401570ed270cde7","source":{"kind":"arxiv","id":"2506.03085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03085","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03085v2","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03085","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"OVNINDKWOFLY","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_16","alias_value":"OVNINDKWOFLYCNYZ","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_8","alias_value":"OVNINDKW","created_at":"2026-07-05T11:17:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OVNINDKWOFLYCNYZPSOSK2N36U","target":"record","payload":{"canonical_record":{"source":{"id":"2506.03085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T17:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"2a63be03ee546f0584bf65a88bcf877165eb2d2971c841a00e54331fae8fb849","abstract_canon_sha256":"7bb3dd32986cfc6f6dcd8aa94088567c3602a218f5116c4c69ac5f57019d876a"},"schema_version":"1.0"},"canonical_sha256":"755a868d5671578137197c9d2569bbf51ec17755b5a857ac2401570ed270cde7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:00.176034Z","signature_b64":"ifJIXawrsnmRuWpex3g+syVJ6U89PUFEzmNBqUG7UyHFmhq6PxaZsIPZiyILZPwPGZTQiU6bVmMYcV0rvwQbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"755a868d5671578137197c9d2569bbf51ec17755b5a857ac2401570ed270cde7","last_reissued_at":"2026-07-05T11:17:00.175500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:00.175500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.03085","source_version":2,"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-05T11:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vSSoKGedQARVqg+D/pLHVsqSxqP4Pe03u7S4l2nx7OUyED9GHqOjRJhsBfpvGixXv6wBcpnHx99oqKEpYQ8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:13:18.981547Z"},"content_sha256":"4af4b7887874053afda104d48413350225228e38ca2b5f4caca0324e3ed8ff96","schema_version":"1.0","event_id":"sha256:4af4b7887874053afda104d48413350225228e38ca2b5f4caca0324e3ed8ff96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OVNINDKWOFLYCNYZPSOSK2N36U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Length Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tengyu Ma, Thomas Chen, Zhiyuan Li","submitted_at":"2025-06-03T17:09:34Z","abstract_excerpt":"Length generalization is the ability of a learning algorithm to learn a hypothesis which generalizes to longer inputs than the inputs in the training set. In this paper, we provide provable guarantees of length generalization for various classes of functions in an idealized setting. First, we formalize the framework of non-asymptotic length generalization, which requires a computable upper bound for the minimum input length that guarantees length generalization, as a function of the complexity of ground-truth function under some given complexity measure. We refer to this minimum input length t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03085","kind":"arxiv","version":2},"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/2506.03085/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-05T11:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJ5sI42+d5RHt+PO90R0ThN0eITSuTGxoktCMk15E7izlsbYL140RN/XHwLa0v7erwCJnPHex3G+vp7KFLCMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:13:18.982036Z"},"content_sha256":"242c7d6acb9542e52947ed7c6f8799d88272c532a1e5068f402752b33a026dc9","schema_version":"1.0","event_id":"sha256:242c7d6acb9542e52947ed7c6f8799d88272c532a1e5068f402752b33a026dc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVNINDKWOFLYCNYZPSOSK2N36U/bundle.json","state_url":"https://pith.science/pith/OVNINDKWOFLYCNYZPSOSK2N36U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVNINDKWOFLYCNYZPSOSK2N36U/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-07T22:13:18Z","links":{"resolver":"https://pith.science/pith/OVNINDKWOFLYCNYZPSOSK2N36U","bundle":"https://pith.science/pith/OVNINDKWOFLYCNYZPSOSK2N36U/bundle.json","state":"https://pith.science/pith/OVNINDKWOFLYCNYZPSOSK2N36U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVNINDKWOFLYCNYZPSOSK2N36U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OVNINDKWOFLYCNYZPSOSK2N36U","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":"7bb3dd32986cfc6f6dcd8aa94088567c3602a218f5116c4c69ac5f57019d876a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T17:09:34Z","title_canon_sha256":"2a63be03ee546f0584bf65a88bcf877165eb2d2971c841a00e54331fae8fb849"},"schema_version":"1.0","source":{"id":"2506.03085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03085","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03085v2","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03085","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"OVNINDKWOFLY","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_16","alias_value":"OVNINDKWOFLYCNYZ","created_at":"2026-07-05T11:17:00Z"},{"alias_kind":"pith_short_8","alias_value":"OVNINDKW","created_at":"2026-07-05T11:17:00Z"}],"graph_snapshots":[{"event_id":"sha256:242c7d6acb9542e52947ed7c6f8799d88272c532a1e5068f402752b33a026dc9","target":"graph","created_at":"2026-07-05T11:17:00Z","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/2506.03085/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Length generalization is the ability of a learning algorithm to learn a hypothesis which generalizes to longer inputs than the inputs in the training set. In this paper, we provide provable guarantees of length generalization for various classes of functions in an idealized setting. First, we formalize the framework of non-asymptotic length generalization, which requires a computable upper bound for the minimum input length that guarantees length generalization, as a function of the complexity of ground-truth function under some given complexity measure. We refer to this minimum input length t","authors_text":"Tengyu Ma, Thomas Chen, Zhiyuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T17:09:34Z","title":"Non-Asymptotic Length Generalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03085","kind":"arxiv","version":2},"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:4af4b7887874053afda104d48413350225228e38ca2b5f4caca0324e3ed8ff96","target":"record","created_at":"2026-07-05T11:17:00Z","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":"7bb3dd32986cfc6f6dcd8aa94088567c3602a218f5116c4c69ac5f57019d876a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-03T17:09:34Z","title_canon_sha256":"2a63be03ee546f0584bf65a88bcf877165eb2d2971c841a00e54331fae8fb849"},"schema_version":"1.0","source":{"id":"2506.03085","kind":"arxiv","version":2}},"canonical_sha256":"755a868d5671578137197c9d2569bbf51ec17755b5a857ac2401570ed270cde7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"755a868d5671578137197c9d2569bbf51ec17755b5a857ac2401570ed270cde7","first_computed_at":"2026-07-05T11:17:00.175500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:00.175500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ifJIXawrsnmRuWpex3g+syVJ6U89PUFEzmNBqUG7UyHFmhq6PxaZsIPZiyILZPwPGZTQiU6bVmMYcV0rvwQbBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:00.176034Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af4b7887874053afda104d48413350225228e38ca2b5f4caca0324e3ed8ff96","sha256:242c7d6acb9542e52947ed7c6f8799d88272c532a1e5068f402752b33a026dc9"],"state_sha256":"335b6e3943be927f3f538342ccad2649e731b6bbdc070d86b8c15f7823aecefd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRN5Esk98olny/+EfSFGOlOzwOgaS8Yuh3mHQ53PR9CFL/A/wLe1JA3aVaF8rj89Jz+7z4fsEWzosfkjKfEQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:13:18.986397Z","bundle_sha256":"c5ef6b9eb626e36353c7cd7c47287cd794bf26fcba65d6ad3c84aa11e1c5e0c2"}}