{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","short_pith_number":"pith:KXCEMGZW","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"},"canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","source":{"kind":"arxiv","id":"2607.21565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21565","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21565v1","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21565","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"KXCEMGZW3PYZ","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_16","alias_value":"KXCEMGZW3PYZWZPR","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_8","alias_value":"KXCEMGZW","created_at":"2026-07-24T01:24:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","target":"record","payload":{"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"},"canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","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"},"source_kind":"arxiv","source_id":"2607.21565","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-24T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dK9PWd9V1RtQeWmttoJJPtwdSbnQ3+OnrFuu+pK5WlT3XHvoXWLRcGeuzc0FNkr/WovZyxmqdJjGxH2ivC6sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:12:15.978258Z"},"content_sha256":"71f25038fec5ffbfab407a1a0bbe1a539298e00121bb5f917b9ad86b9e8bf2e0","schema_version":"1.0","event_id":"sha256:71f25038fec5ffbfab407a1a0bbe1a539298e00121bb5f917b9ad86b9e8bf2e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","target":"graph","payload":{"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"},"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-24T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJb+5sDtZpkaL+YFQS6W5wg0yaRz6BnasVRSuAkhS9O7Up3Zel3cyufkyDxWZACmySTzpUO3/+d0FlMrO1kpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:12:15.979071Z"},"content_sha256":"d099500a0b54d49735b6346aa371f98c92b8e05f427fd4aed3c7b630e7357031","schema_version":"1.0","event_id":"sha256:d099500a0b54d49735b6346aa371f98c92b8e05f427fd4aed3c7b630e7357031"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1112/jlms/s1-28.1.104 resolves to 'On Certain Sets of Integers'. A reader following the printed text alone cannot reach it.","snippet":"K. F. Roth. On certain sets of integers.J. Lond. Math. Soc., 28:104–109, 1953.doi:10.1112/jlms/s1-28. 1.104","arxiv_id":"2607.21565","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":"On Certain Sets of Integers","printed_excerpt":"10.1112/jlms/s1-28","reconstructed_doi":"10.1112/jlms/s1-28.1.104"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-01T07:18:30.236621Z","event_type":"pith.integrity.v1","detected_doi":"10.1112/jlms/s1-28.1.104","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"57f521a6d2f1670514a71f8eff95bffc07334f146958fad06b4f33bd4a028740","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On Certain Sets of Integers","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15369,"payload_sha256":"f85f36611c0c5d14c660927be37870f6f9ac331a65e626ac649c9133a81b4c15","signature_b64":"E2LHkSStUCXTzc3y6CLNJUDbYext/86g+BC41pWcpgNMHTJ+8GD03dqB26E5o23XHtevJaeHoUthihcWcFCyAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJFspNgx/b6tJhLlhP+pbblJcukJ7bdjbMh7CijnLcnE4fTmOVo3LCUSPsd+SE4vmpqoefkpe5xzGDWNN+FlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:12:15.981892Z"},"content_sha256":"ca330dafd8ad49889a4d24c15a2f4a9ee7d05115ba9265293b37115e3fb3baa5","schema_version":"1.0","event_id":"sha256:ca330dafd8ad49889a4d24c15a2f4a9ee7d05115ba9265293b37115e3fb3baa5"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5817/CZ.MUNI.EUROCOMB23-005) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"M. Anastos. Constructing hamilton cycles and perfect matchings efficiently (extended abstract). InPro- ceedings of the 12th European conference on combinatorics, graph theory and applications. EUROCOMB’23, Prague, August 28 – September 1, p","arxiv_id":"2607.21565","detector":"doi_compliance","evidence":{"ref_index":2,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.5817/cz.muni","reconstructed_doi":"10.5817/CZ.MUNI.EUROCOMB23-005"},"severity":"advisory","ref_index":2,"audited_at":"2026-08-01T07:18:30.236621Z","event_type":"pith.integrity.v1","detected_doi":"10.5817/CZ.MUNI.EUROCOMB23-005","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"1b3a38b134848bd532ea1096b9c14e6ea8e728bde99e5b279e440181c97e73ae","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15368,"payload_sha256":"539b806a67bfa4b2cdd94f9ca569c5c38e7790f51ff91339e284078c2f5d7c6b","signature_b64":"PNxnSAushfnZLWJFtHaiIu54dlWjkwY9XFrEjaltNzzQAWOexwPbHYOB8xKoXOfBtXrr70aaMBL/uNhO/z9YBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOfUVW6A09yxFpqA9Ui68JnsNs6awkmZHYBQGzojrFxHQXArZmDO4otwFu/xF5QN+TPe6XWxj99rOYMuIVwWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:12:15.982337Z"},"content_sha256":"cd2a33b71476b6f7612517c6e8f586b8f17bf5724613598facf5ba41ef924a37","schema_version":"1.0","event_id":"sha256:cd2a33b71476b6f7612517c6e8f586b8f17bf5724613598facf5ba41ef924a37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/bundle.json","state_url":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/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-23T17:12:15Z","links":{"resolver":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M","bundle":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/bundle.json","state":"https://pith.science/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXCEMGZW3PYZWZPR3HIKYYEU4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KXCEMGZW3PYZWZPR3HIKYYEU4M","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fee20fe07a56b5724c8a9e14b2fca643924cae5dfceb4cf0d1ba5a2bebac9acc","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-23T17:49:15Z","title_canon_sha256":"cf3b657a576807b4c65e76b341c96d586129575b3afd3fc1868d914a49a0e0ed"},"schema_version":"1.0","source":{"id":"2607.21565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21565","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21565v1","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21565","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"KXCEMGZW3PYZ","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_16","alias_value":"KXCEMGZW3PYZWZPR","created_at":"2026-07-24T01:24:39Z"},{"alias_kind":"pith_short_8","alias_value":"KXCEMGZW","created_at":"2026-07-24T01:24:39Z"}],"graph_snapshots":[{"event_id":"sha256:d099500a0b54d49735b6346aa371f98c92b8e05f427fd4aed3c7b630e7357031","target":"graph","created_at":"2026-07-24T01:24:39Z","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/2607.21565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Daniel I\\v{l}kovi\\v{c}, Jan Hladk\\'y, Jared Le\\'on, Xichao Shu","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-23T17:49:15Z","title":"Arithmetic progressions in a random set on a budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21565","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:71f25038fec5ffbfab407a1a0bbe1a539298e00121bb5f917b9ad86b9e8bf2e0","target":"record","created_at":"2026-07-24T01:24:39Z","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":"fee20fe07a56b5724c8a9e14b2fca643924cae5dfceb4cf0d1ba5a2bebac9acc","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-23T17:49:15Z","title_canon_sha256":"cf3b657a576807b4c65e76b341c96d586129575b3afd3fc1868d914a49a0e0ed"},"schema_version":"1.0","source":{"id":"2607.21565","kind":"arxiv","version":1}},"canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c4461b36dbf19b65f1d9d0ac6094e321f1968c187132e56b9321e9b3fa47ab","first_computed_at":"2026-07-24T01:24:39.975177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T01:24:39.975177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n/MpaLI03yHnQnxp14H9BWZTs9C+V2LZzZXDZU55Epq9rG1TqyQlsYOrEF6pT4ph3+MFQrZ1opkrl/t22yqWDQ==","signature_status":"signed_v1","signed_at":"2026-07-24T01:24:39.976080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.21565","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:ca330dafd8ad49889a4d24c15a2f4a9ee7d05115ba9265293b37115e3fb3baa5","sha256:cd2a33b71476b6f7612517c6e8f586b8f17bf5724613598facf5ba41ef924a37"]}],"invalid_events":[],"applied_event_ids":["sha256:71f25038fec5ffbfab407a1a0bbe1a539298e00121bb5f917b9ad86b9e8bf2e0","sha256:d099500a0b54d49735b6346aa371f98c92b8e05f427fd4aed3c7b630e7357031"],"state_sha256":"f561d38dddc8127aefd840dc7cbe0918108d8c399ae44785703803030f8e35bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Bea+yYOjL0mmoOF/m+vCstRGSmgk1ItJZSQynxLlZs94neqtFgmZ6vh2rBC4Y8fK0GLb8FTxewoVqS9eEl6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T17:12:15.984836Z","bundle_sha256":"00cdb839435508d0aee0a2652c84f38e968045e99b8fb02bd1446aac89dd75d5"}}