{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7AYDBMJTZGIRFGPLNBM2KF2QDW","short_pith_number":"pith:7AYDBMJT","schema_version":"1.0","canonical_sha256":"f83030b133c9911299eb6859a517501db76e68fe4a3b0132745149103fed8d94","source":{"kind":"arxiv","id":"2607.05085","version":1},"attestation_state":"computed","paper":{"title":"Multi Choice Min Prophet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amos Fiat, Itamar Biran, Yossi Azar","submitted_at":"2026-07-06T13:48:42Z","abstract_excerpt":"We study the minimization counterpart of the classic prophet inequality, often termed the min prophet or cost prophet inequality. Unlike the maximization setting, where simple threshold algorithms achieve half of the prophet's value, the minimization setting is significantly harder, with an exponential lower bound even for i.i.d.\\ variables.\n  We study a multi-choice relaxation in which the algorithm may select multiple variables and gets to choose the best amongst them (the minimum amongst those selected). Our goal is to minimize the expected number of selections while achieving a constant co"},"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.05085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-06T13:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"b298807e6ca7a920643c2988fa72f0e5135a89bbbfce8a77aa85785b083e7fca","abstract_canon_sha256":"76c18f89ddcec74e76fdb308a6fe100e74b845dceb5c0a3ab30330c4424e7e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:19:15.560670Z","signature_b64":"0Rtjq0bZqtVQA1yO6PlHW7D5iL3uhgcnmd+VDzwtlzbI4CHsmX0Y/QHJEkEWQlOjFlZxTK9NEBPLkeX4ERWjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f83030b133c9911299eb6859a517501db76e68fe4a3b0132745149103fed8d94","last_reissued_at":"2026-07-07T03:19:15.560107Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:19:15.560107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi Choice Min Prophet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amos Fiat, Itamar Biran, Yossi Azar","submitted_at":"2026-07-06T13:48:42Z","abstract_excerpt":"We study the minimization counterpart of the classic prophet inequality, often termed the min prophet or cost prophet inequality. Unlike the maximization setting, where simple threshold algorithms achieve half of the prophet's value, the minimization setting is significantly harder, with an exponential lower bound even for i.i.d.\\ variables.\n  We study a multi-choice relaxation in which the algorithm may select multiple variables and gets to choose the best amongst them (the minimum amongst those selected). Our goal is to minimize the expected number of selections while achieving a constant co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05085","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.05085/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.05085","created_at":"2026-07-07T03:19:15.560176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05085v1","created_at":"2026-07-07T03:19:15.560176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05085","created_at":"2026-07-07T03:19:15.560176+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AYDBMJTZGIR","created_at":"2026-07-07T03:19:15.560176+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AYDBMJTZGIRFGPL","created_at":"2026-07-07T03:19:15.560176+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AYDBMJT","created_at":"2026-07-07T03:19:15.560176+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/7AYDBMJTZGIRFGPLNBM2KF2QDW","json":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW.json","graph_json":"https://pith.science/api/pith-number/7AYDBMJTZGIRFGPLNBM2KF2QDW/graph.json","events_json":"https://pith.science/api/pith-number/7AYDBMJTZGIRFGPLNBM2KF2QDW/events.json","paper":"https://pith.science/paper/7AYDBMJT"},"agent_actions":{"view_html":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW","download_json":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW.json","view_paper":"https://pith.science/paper/7AYDBMJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05085&json=true","fetch_graph":"https://pith.science/api/pith-number/7AYDBMJTZGIRFGPLNBM2KF2QDW/graph.json","fetch_events":"https://pith.science/api/pith-number/7AYDBMJTZGIRFGPLNBM2KF2QDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW/action/storage_attestation","attest_author":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW/action/author_attestation","sign_citation":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW/action/citation_signature","submit_replication":"https://pith.science/pith/7AYDBMJTZGIRFGPLNBM2KF2QDW/action/replication_record"}},"created_at":"2026-07-07T03:19:15.560176+00:00","updated_at":"2026-07-07T03:19:15.560176+00:00"}