{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IFBSPKLNLPBPUTWF5UBES3OBZY","short_pith_number":"pith:IFBSPKLN","schema_version":"1.0","canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","source":{"kind":"arxiv","id":"2402.11084","version":2},"attestation_state":"computed","paper":{"title":"The Competition Complexity of Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Johannes Brustle, Jos\\'e Correa, Michal Feldman, Paul D\\\"utting, Tomer Ezra, Victor Verdugo","submitted_at":"2024-02-16T21:19:04Z","abstract_excerpt":"We study the classic single-choice prophet inequality problem through a resource augmentation lens. Our goal is to bound the $(1-\\varepsilon)$-competition complexity of different types of online algorithms. This metric asks for the smallest $k$ such that the expected value of the online algorithm on $k$ copies of the original instance, is at least a $(1-\\varepsilon)$-approximation to the expected offline optimum on a single copy.\n  We show that block threshold algorithms, which set one threshold per copy, are optimal and give a tight bound of $k = \\Theta(\\log \\log 1/\\varepsilon)$. This shows t"},"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":"2402.11084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-16T21:19:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b037bada9e7f6b42148099d52e83f763e86194fab63507790229697208de9271","abstract_canon_sha256":"4a94cb91bf21e34b37443de2cc62cc99e0175bec44f05ba30e1e339abfc2c7df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:03.921200Z","signature_b64":"8TQW0yjptqWAfWVK0/fvRBh4y4YJZcvgQFv7FTG+W4moxxokFK8WJiiYEfMtj42gPN8mB6w+FaL6kBtoi2DGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","last_reissued_at":"2026-07-05T07:48:03.920587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:03.920587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Competition Complexity of Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Johannes Brustle, Jos\\'e Correa, Michal Feldman, Paul D\\\"utting, Tomer Ezra, Victor Verdugo","submitted_at":"2024-02-16T21:19:04Z","abstract_excerpt":"We study the classic single-choice prophet inequality problem through a resource augmentation lens. Our goal is to bound the $(1-\\varepsilon)$-competition complexity of different types of online algorithms. This metric asks for the smallest $k$ such that the expected value of the online algorithm on $k$ copies of the original instance, is at least a $(1-\\varepsilon)$-approximation to the expected offline optimum on a single copy.\n  We show that block threshold algorithms, which set one threshold per copy, are optimal and give a tight bound of $k = \\Theta(\\log \\log 1/\\varepsilon)$. This shows t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11084","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/2402.11084/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":"2402.11084","created_at":"2026-07-05T07:48:03.920648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11084v2","created_at":"2026-07-05T07:48:03.920648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11084","created_at":"2026-07-05T07:48:03.920648+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFBSPKLNLPBP","created_at":"2026-07-05T07:48:03.920648+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFBSPKLNLPBPUTWF","created_at":"2026-07-05T07:48:03.920648+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFBSPKLN","created_at":"2026-07-05T07:48:03.920648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10892","citing_title":"The Competition Complexity of Prophet Secretary","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY","json":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY.json","graph_json":"https://pith.science/api/pith-number/IFBSPKLNLPBPUTWF5UBES3OBZY/graph.json","events_json":"https://pith.science/api/pith-number/IFBSPKLNLPBPUTWF5UBES3OBZY/events.json","paper":"https://pith.science/paper/IFBSPKLN"},"agent_actions":{"view_html":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY","download_json":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY.json","view_paper":"https://pith.science/paper/IFBSPKLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11084&json=true","fetch_graph":"https://pith.science/api/pith-number/IFBSPKLNLPBPUTWF5UBES3OBZY/graph.json","fetch_events":"https://pith.science/api/pith-number/IFBSPKLNLPBPUTWF5UBES3OBZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/action/storage_attestation","attest_author":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/action/author_attestation","sign_citation":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/action/citation_signature","submit_replication":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/action/replication_record"}},"created_at":"2026-07-05T07:48:03.920648+00:00","updated_at":"2026-07-05T07:48:03.920648+00:00"}