{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WU74GY5KSGZEMCIRKWJSSMMGVF","short_pith_number":"pith:WU74GY5K","schema_version":"1.0","canonical_sha256":"b53fc363aa91b24609115593293186a95d33baac887da463b46120135a0c6956","source":{"kind":"arxiv","id":"2412.17620","version":2},"attestation_state":"computed","paper":{"title":"Multi-cyclic graphs in the random graph process with restricted budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel I\\v{l}kovi\\v{c}, Jared Le\\'on, Xichao Shu","submitted_at":"2024-12-23T14:44:45Z","abstract_excerpt":"We study a controlled random graph process introduced by Frieze, Krivelevich, and Michaeli. In this model, the edges of a complete graph are randomly ordered and revealed sequentially to a builder. For each edge revealed, the builder must irrevocably decide whether to purchase it. The process is subject to two constraints: the number of observed edges $t$ and the builder's budget $b$. The goal of the builder is to construct, with high probability, a graph possessing a desired property.\n  Previously, the optimal dependencies of the budget $b$ on $n$ and $t$ were established for constructing a g"},"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":"2412.17620","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T14:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"76dd82f294e2acf1ee2598cf41346d2bb76b5f6046b0d4d7fc480d201c4fd079","abstract_canon_sha256":"17f65e53d9efb53647ae10a52858b992ab6a5c8722c1af50520e772ec9e56a59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:35.100068Z","signature_b64":"Wbmn/ZvDUYhY+G59KeZaJ6/2F/zmIds5uXJMFrofBV0dR9nDDoE141NbcwbHZwMYPwRQkZZSJYAzCz6t4JPsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b53fc363aa91b24609115593293186a95d33baac887da463b46120135a0c6956","last_reissued_at":"2026-07-05T10:19:35.099590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:35.099590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-cyclic graphs in the random graph process with restricted budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel I\\v{l}kovi\\v{c}, Jared Le\\'on, Xichao Shu","submitted_at":"2024-12-23T14:44:45Z","abstract_excerpt":"We study a controlled random graph process introduced by Frieze, Krivelevich, and Michaeli. In this model, the edges of a complete graph are randomly ordered and revealed sequentially to a builder. For each edge revealed, the builder must irrevocably decide whether to purchase it. The process is subject to two constraints: the number of observed edges $t$ and the builder's budget $b$. The goal of the builder is to construct, with high probability, a graph possessing a desired property.\n  Previously, the optimal dependencies of the budget $b$ on $n$ and $t$ were established for constructing a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17620","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/2412.17620/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":"2412.17620","created_at":"2026-07-05T10:19:35.099647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17620v2","created_at":"2026-07-05T10:19:35.099647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17620","created_at":"2026-07-05T10:19:35.099647+00:00"},{"alias_kind":"pith_short_12","alias_value":"WU74GY5KSGZE","created_at":"2026-07-05T10:19:35.099647+00:00"},{"alias_kind":"pith_short_16","alias_value":"WU74GY5KSGZEMCIR","created_at":"2026-07-05T10:19:35.099647+00:00"},{"alias_kind":"pith_short_8","alias_value":"WU74GY5K","created_at":"2026-07-05T10:19:35.099647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.21565","citing_title":"Arithmetic progressions in a random set on a budget","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF","json":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF.json","graph_json":"https://pith.science/api/pith-number/WU74GY5KSGZEMCIRKWJSSMMGVF/graph.json","events_json":"https://pith.science/api/pith-number/WU74GY5KSGZEMCIRKWJSSMMGVF/events.json","paper":"https://pith.science/paper/WU74GY5K"},"agent_actions":{"view_html":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF","download_json":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF.json","view_paper":"https://pith.science/paper/WU74GY5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17620&json=true","fetch_graph":"https://pith.science/api/pith-number/WU74GY5KSGZEMCIRKWJSSMMGVF/graph.json","fetch_events":"https://pith.science/api/pith-number/WU74GY5KSGZEMCIRKWJSSMMGVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF/action/storage_attestation","attest_author":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF/action/author_attestation","sign_citation":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF/action/citation_signature","submit_replication":"https://pith.science/pith/WU74GY5KSGZEMCIRKWJSSMMGVF/action/replication_record"}},"created_at":"2026-07-05T10:19:35.099647+00:00","updated_at":"2026-07-05T10:19:35.099647+00:00"}