{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2XEYPZPCZJ5MSKJ7FGBVICYKVH","short_pith_number":"pith:2XEYPZPC","schema_version":"1.0","canonical_sha256":"d5c987e5e2ca7ac9293f2983540b0aa9d54975f1fe01646def5bce5e5024728f","source":{"kind":"arxiv","id":"2501.16285","version":1},"attestation_state":"computed","paper":{"title":"Small gaps in the Ulam sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Cl\\'ement, Stefan Steinerberger","submitted_at":"2025-01-27T18:22:25Z","abstract_excerpt":"The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts $1,2$ and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct earlier terms: this gives $1,2,3,4,6,8,11,\\dots$. Already in 1972 the great French poet Raymond Queneau wrote that it `gives an impression of great irregularity'. This irregularity appears to have a lot of structure which has inspired a great deal of work; nonetheless, very little is rigorously proven. We improve the best upper bound on its growth and show that at least some small gaps have to exist: for some $c>0$ and "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.16285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-27T18:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"f89330e82058c299e75a5b58b9296b5708524f2a9d9249b561c7c6454beb9720","abstract_canon_sha256":"f3b57b2ada0f125691e12e83bb8794e4de9697ba04080e5286e64d66789bd56b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:58.044033Z","signature_b64":"OeB5Ru9KkrgbxHX0d9KQUcz8DDUZIZCyZ6XelQHLPj8cfXcngMbJpeQfDGKX+DudONX4aeIhxhkEPHrgP8w6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5c987e5e2ca7ac9293f2983540b0aa9d54975f1fe01646def5bce5e5024728f","last_reissued_at":"2026-07-05T10:05:58.043498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:58.043498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small gaps in the Ulam sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Cl\\'ement, Stefan Steinerberger","submitted_at":"2025-01-27T18:22:25Z","abstract_excerpt":"The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts $1,2$ and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct earlier terms: this gives $1,2,3,4,6,8,11,\\dots$. Already in 1972 the great French poet Raymond Queneau wrote that it `gives an impression of great irregularity'. This irregularity appears to have a lot of structure which has inspired a great deal of work; nonetheless, very little is rigorously proven. We improve the best upper bound on its growth and show that at least some small gaps have to exist: for some $c>0$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16285","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/2501.16285/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.16285","created_at":"2026-07-05T10:05:58.043566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16285v1","created_at":"2026-07-05T10:05:58.043566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16285","created_at":"2026-07-05T10:05:58.043566+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XEYPZPCZJ5M","created_at":"2026-07-05T10:05:58.043566+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XEYPZPCZJ5MSKJ7","created_at":"2026-07-05T10:05:58.043566+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XEYPZPC","created_at":"2026-07-05T10:05:58.043566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH","json":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH.json","graph_json":"https://pith.science/api/pith-number/2XEYPZPCZJ5MSKJ7FGBVICYKVH/graph.json","events_json":"https://pith.science/api/pith-number/2XEYPZPCZJ5MSKJ7FGBVICYKVH/events.json","paper":"https://pith.science/paper/2XEYPZPC"},"agent_actions":{"view_html":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH","download_json":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH.json","view_paper":"https://pith.science/paper/2XEYPZPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16285&json=true","fetch_graph":"https://pith.science/api/pith-number/2XEYPZPCZJ5MSKJ7FGBVICYKVH/graph.json","fetch_events":"https://pith.science/api/pith-number/2XEYPZPCZJ5MSKJ7FGBVICYKVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH/action/storage_attestation","attest_author":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH/action/author_attestation","sign_citation":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH/action/citation_signature","submit_replication":"https://pith.science/pith/2XEYPZPCZJ5MSKJ7FGBVICYKVH/action/replication_record"}},"created_at":"2026-07-05T10:05:58.043566+00:00","updated_at":"2026-07-05T10:05:58.043566+00:00"}