{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","short_pith_number":"pith:KXCEMGZW","schema_version":"1.0","canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","source":{"kind":"arxiv","id":"2607.21565","version":1},"attestation_state":"computed","paper":{"title":"Arithmetic progressions in a random set on a budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Daniel I\\v{l}kovi\\v{c}, Jan Hladk\\'y, Jared Le\\'on, Xichao Shu","submitted_at":"2026-07-23T17:49:15Z","abstract_excerpt":"A restricted-budget version of the random graph process, introduced by Frieze, Krivelevich, and Michaeli in 2025, studies the construction of structures by an online player who can purchase only a limited number of random edges. In this paper, we transfer this framework from random graphs to random subsets of integers, focusing on the construction of $k$-term arithmetic progressions. A player, Builder, is presented with a sequence of $t$ integers drawn uniformly at random from $[n]$. As the elements are revealed one by one, Builder must immediately and irrevocably decide whether to select the "},"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":"2607.21565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-23T17:49:15Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"cf3b657a576807b4c65e76b341c96d586129575b3afd3fc1868d914a49a0e0ed","abstract_canon_sha256":"fee20fe07a56b5724c8a9e14b2fca643924cae5dfceb4cf0d1ba5a2bebac9acc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:39.976080Z","signature_b64":"n/MpaLI03yHnQnxp14H9BWZTs9C+V2LZzZXDZU55Epq9rG1TqyQlsYOrEF6pT4ph3+MFQrZ1opkrl/t22yqWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","last_reissued_at":"2026-07-24T01:24:39.975177Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:39.975177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic progressions in a random set on a budget","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Daniel I\\v{l}kovi\\v{c}, Jan Hladk\\'y, Jared Le\\'on, Xichao Shu","submitted_at":"2026-07-23T17:49:15Z","abstract_excerpt":"A restricted-budget version of the random graph process, introduced by Frieze, Krivelevich, and Michaeli in 2025, studies the construction of structures by an online player who can purchase only a limited number of random edges. In this paper, we transfer this framework from random graphs to random subsets of integers, focusing on the construction of $k$-term arithmetic progressions. A player, Builder, is presented with a sequence of $t$ integers drawn uniformly at random from $[n]$. As the elements are revealed one by one, Builder must immediately and irrevocably decide whether to select the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21565","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/2607.21565/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":"2607.21565","created_at":"2026-07-24T01:24:39.975652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.21565v1","created_at":"2026-07-24T01:24:39.975652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21565","created_at":"2026-07-24T01:24:39.975652+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXCEMGZW3PYZ","created_at":"2026-07-24T01:24:39.975652+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXCEMGZW3PYZWZPR","created_at":"2026-07-24T01:24:39.975652+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXCEMGZW","created_at":"2026-07-24T01:24:39.975652+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/KXCEMGZW3PYZWZPR3HIKYYEU4M","json":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M.json","graph_json":"https://pith.science/api/pith-number/KXCEMGZW3PYZWZPR3HIKYYEU4M/graph.json","events_json":"https://pith.science/api/pith-number/KXCEMGZW3PYZWZPR3HIKYYEU4M/events.json","paper":"https://pith.science/paper/KXCEMGZW"},"agent_actions":{"view_html":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M","download_json":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M.json","view_paper":"https://pith.science/paper/KXCEMGZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.21565&json=true","fetch_graph":"https://pith.science/api/pith-number/KXCEMGZW3PYZWZPR3HIKYYEU4M/graph.json","fetch_events":"https://pith.science/api/pith-number/KXCEMGZW3PYZWZPR3HIKYYEU4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/action/storage_attestation","attest_author":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/action/author_attestation","sign_citation":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/action/citation_signature","submit_replication":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/action/replication_record"}},"created_at":"2026-07-24T01:24:39.975652+00:00","updated_at":"2026-07-24T01:24:39.975652+00:00"}