{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LTF2WSGVDXP2KPF7QW4LJHSYD5","short_pith_number":"pith:LTF2WSGV","schema_version":"1.0","canonical_sha256":"5ccbab48d51ddfa53cbf85b8b49e581f510aa738fb263d46cee4e41ac84d69f8","source":{"kind":"arxiv","id":"2502.20870","version":2},"attestation_state":"computed","paper":{"title":"Graph factors and powers of Hamilton cycles in the budget-constrained random graph process","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Frederik Garbe, T\\'assio Naia, Zak Smith","submitted_at":"2025-02-28T09:13:12Z","abstract_excerpt":"We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of $K_n$ one by one, chosen uniformly at random. Builder may purchase at most $b$ of these edges, and must (irrevocably) decide whether to purchase each edge as soon as it is offered. Builder's goal is to construct a graph which satisfies a certain property; we investigate the properties of containing different $F$-factors or powers of Hamilton cycles.\n  We obtain general lower bounds on the budget $b$, as a function of"},"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":"2502.20870","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-28T09:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"e713aabea0a0a182befae5b028bf3e55cdd45d311882277ac954ef089d1fae76","abstract_canon_sha256":"3e07c66199141547b08e7212e542728d932f451ffd5c6d39aa755620aca134d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:11.947551Z","signature_b64":"kmE3UCkPhHXDFUovDW3kkXRBl8vvsO6QRw8553QRMtG/x30pzcCKN3AyP0SYJto1AXGjKqYUylCnk+CLAbJGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ccbab48d51ddfa53cbf85b8b49e581f510aa738fb263d46cee4e41ac84d69f8","last_reissued_at":"2026-07-02T01:17:11.947054Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:11.947054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph factors and powers of Hamilton cycles in the budget-constrained random graph process","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto Espuny D\\'iaz, Frederik Garbe, T\\'assio Naia, Zak Smith","submitted_at":"2025-02-28T09:13:12Z","abstract_excerpt":"We consider the following budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli. A player, called Builder, is presented with $t$ distinct edges of $K_n$ one by one, chosen uniformly at random. Builder may purchase at most $b$ of these edges, and must (irrevocably) decide whether to purchase each edge as soon as it is offered. Builder's goal is to construct a graph which satisfies a certain property; we investigate the properties of containing different $F$-factors or powers of Hamilton cycles.\n  We obtain general lower bounds on the budget $b$, as a function of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.20870","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/2502.20870/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":"2502.20870","created_at":"2026-07-02T01:17:11.947110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.20870v2","created_at":"2026-07-02T01:17:11.947110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.20870","created_at":"2026-07-02T01:17:11.947110+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTF2WSGVDXP2","created_at":"2026-07-02T01:17:11.947110+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTF2WSGVDXP2KPF7","created_at":"2026-07-02T01:17:11.947110+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTF2WSGV","created_at":"2026-07-02T01:17:11.947110+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/LTF2WSGVDXP2KPF7QW4LJHSYD5","json":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5.json","graph_json":"https://pith.science/api/pith-number/LTF2WSGVDXP2KPF7QW4LJHSYD5/graph.json","events_json":"https://pith.science/api/pith-number/LTF2WSGVDXP2KPF7QW4LJHSYD5/events.json","paper":"https://pith.science/paper/LTF2WSGV"},"agent_actions":{"view_html":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5","download_json":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5.json","view_paper":"https://pith.science/paper/LTF2WSGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.20870&json=true","fetch_graph":"https://pith.science/api/pith-number/LTF2WSGVDXP2KPF7QW4LJHSYD5/graph.json","fetch_events":"https://pith.science/api/pith-number/LTF2WSGVDXP2KPF7QW4LJHSYD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5/action/storage_attestation","attest_author":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5/action/author_attestation","sign_citation":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5/action/citation_signature","submit_replication":"https://pith.science/pith/LTF2WSGVDXP2KPF7QW4LJHSYD5/action/replication_record"}},"created_at":"2026-07-02T01:17:11.947110+00:00","updated_at":"2026-07-02T01:17:11.947110+00:00"}