{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IFBSPKLNLPBPUTWF5UBES3OBZY","short_pith_number":"pith:IFBSPKLN","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"},"canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","source":{"kind":"arxiv","id":"2402.11084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11084","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11084v2","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11084","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"IFBSPKLNLPBP","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"IFBSPKLNLPBPUTWF","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"IFBSPKLN","created_at":"2026-07-05T07:48:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IFBSPKLNLPBPUTWF5UBES3OBZY","target":"record","payload":{"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"},"canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","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"},"source_kind":"arxiv","source_id":"2402.11084","source_version":2,"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-05T07:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDrS0IyjpZp4YIqQ0edDlWDz/3Zq/0w5sxWNTh8BmZ542w6CqgWt/E9yyzCjMIL9LMjayMx8c3NMUevnxcJ7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:41:02.139577Z"},"content_sha256":"a5e581234cbb6e316f43f4fc451a2771eb2d0d577f0863a5e4382f649fc0bf78","schema_version":"1.0","event_id":"sha256:a5e581234cbb6e316f43f4fc451a2771eb2d0d577f0863a5e4382f649fc0bf78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IFBSPKLNLPBPUTWF5UBES3OBZY","target":"graph","payload":{"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"},"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-05T07:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e75HOl44hcdpMYImczIgFLMzYzrcuUYyHcj4Qi8Z2FjsPe2AWEjwP4LawQfqMreNAAdey9OA+ki03y6n3lOECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:41:02.140149Z"},"content_sha256":"8418cfe2d062c1191139b01c8db3c2aa3e781bcf2ab143721218f0e25d716007","schema_version":"1.0","event_id":"sha256:8418cfe2d062c1191139b01c8db3c2aa3e781bcf2ab143721218f0e25d716007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/bundle.json","state_url":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/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-22T01:41:02Z","links":{"resolver":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY","bundle":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/bundle.json","state":"https://pith.science/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFBSPKLNLPBPUTWF5UBES3OBZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IFBSPKLNLPBPUTWF5UBES3OBZY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a94cb91bf21e34b37443de2cc62cc99e0175bec44f05ba30e1e339abfc2c7df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-16T21:19:04Z","title_canon_sha256":"b037bada9e7f6b42148099d52e83f763e86194fab63507790229697208de9271"},"schema_version":"1.0","source":{"id":"2402.11084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11084","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11084v2","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11084","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"IFBSPKLNLPBP","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"IFBSPKLNLPBPUTWF","created_at":"2026-07-05T07:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"IFBSPKLN","created_at":"2026-07-05T07:48:03Z"}],"graph_snapshots":[{"event_id":"sha256:8418cfe2d062c1191139b01c8db3c2aa3e781bcf2ab143721218f0e25d716007","target":"graph","created_at":"2026-07-05T07:48:03Z","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/2402.11084/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Johannes Brustle, Jos\\'e Correa, Michal Feldman, Paul D\\\"utting, Tomer Ezra, Victor Verdugo","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-16T21:19:04Z","title":"The Competition Complexity of Prophet Inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11084","kind":"arxiv","version":2},"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:a5e581234cbb6e316f43f4fc451a2771eb2d0d577f0863a5e4382f649fc0bf78","target":"record","created_at":"2026-07-05T07:48:03Z","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":"4a94cb91bf21e34b37443de2cc62cc99e0175bec44f05ba30e1e339abfc2c7df","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-16T21:19:04Z","title_canon_sha256":"b037bada9e7f6b42148099d52e83f763e86194fab63507790229697208de9271"},"schema_version":"1.0","source":{"id":"2402.11084","kind":"arxiv","version":2}},"canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414327a96d5bc2fa4ec5ed02496dc1ce1bf626886053f03acf25f7b83317ab53","first_computed_at":"2026-07-05T07:48:03.920587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:48:03.920587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TQW0yjptqWAfWVK0/fvRBh4y4YJZcvgQFv7FTG+W4moxxokFK8WJiiYEfMtj42gPN8mB6w+FaL6kBtoi2DGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:48:03.921200Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.11084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5e581234cbb6e316f43f4fc451a2771eb2d0d577f0863a5e4382f649fc0bf78","sha256:8418cfe2d062c1191139b01c8db3c2aa3e781bcf2ab143721218f0e25d716007"],"state_sha256":"460b735b437b7bb1889acab22fd995265cb22e2b8713d738489a9c9545b93f52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mar03S/53dilmxTir0BhWK/t2eUuWxKxrfmMahoyYfTQP7JSP+b25I6z1hY2+n1+4UrumkzoqoizPjG/o/zuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T01:41:02.144076Z","bundle_sha256":"5ce94c02e71c052269330b9fc80d54ec195a9067e9e8e75436fde1cffb5a27e6"}}