{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PXOODZP3FUVA4KMGBZPOSE3X7S","short_pith_number":"pith:PXOODZP3","schema_version":"1.0","canonical_sha256":"7ddce1e5fb2d2a0e29860e5ee91377fc81555c1e2f5b037cf4475ab899a26454","source":{"kind":"arxiv","id":"1704.05836","version":3},"attestation_state":"computed","paper":{"title":"Beating 1-1/e for Ordered Prophets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brendan Lucier, Hosein Esfandiari, Melika Abolhasani, MohammadTaghi Hajiaghayi, Robert Kleinberg, Soheil Ehsani","submitted_at":"2017-04-19T17:44:35Z","abstract_excerpt":"Hill and Kertz studied the prophet inequality on iid distributions [The Annals of Probability 1982]. They proved a theoretical bound of $1-\\frac{1}{e}$ on the approximation factor of their algorithm. They conjectured that the best approximation factor for arbitrarily large n is $\\frac{1}{1+1/e} \\approx 0.731$. This conjecture remained open prior to this paper for over 30 years. In this paper we present a threshold-based algorithm for the prophet inequality with n iid distributions. Using a nontrivial and novel approach we show that our algorithm is a 0.738-approximation algorithm. By beating 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":"1704.05836","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T17:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"d3b9ead917c84effacf66c2dd652e4214fd82cce58983ede3f71d7e3b3d9355c","abstract_canon_sha256":"cb40d0574b540988f3a29e1fd329311d871e929c0ccc0e45cb451a5dcb0a6db3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.478108Z","signature_b64":"u39bksv/t+vmKQEbcII11kGAgcIrhbe+9WRD4BXWq5di9so4LXeAu+pHABxoghJpXMrwi9C9mYJeNtRB3iRDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ddce1e5fb2d2a0e29860e5ee91377fc81555c1e2f5b037cf4475ab899a26454","last_reissued_at":"2026-05-18T00:43:20.477627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.477627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating 1-1/e for Ordered Prophets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brendan Lucier, Hosein Esfandiari, Melika Abolhasani, MohammadTaghi Hajiaghayi, Robert Kleinberg, Soheil Ehsani","submitted_at":"2017-04-19T17:44:35Z","abstract_excerpt":"Hill and Kertz studied the prophet inequality on iid distributions [The Annals of Probability 1982]. They proved a theoretical bound of $1-\\frac{1}{e}$ on the approximation factor of their algorithm. They conjectured that the best approximation factor for arbitrarily large n is $\\frac{1}{1+1/e} \\approx 0.731$. This conjecture remained open prior to this paper for over 30 years. In this paper we present a threshold-based algorithm for the prophet inequality with n iid distributions. Using a nontrivial and novel approach we show that our algorithm is a 0.738-approximation algorithm. By beating t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05836","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1704.05836","created_at":"2026-05-18T00:43:20.477694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05836v3","created_at":"2026-05-18T00:43:20.477694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05836","created_at":"2026-05-18T00:43:20.477694+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXOODZP3FUVA","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXOODZP3FUVA4KMG","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXOODZP3","created_at":"2026-05-18T12:31:37.085036+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/PXOODZP3FUVA4KMGBZPOSE3X7S","json":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S.json","graph_json":"https://pith.science/api/pith-number/PXOODZP3FUVA4KMGBZPOSE3X7S/graph.json","events_json":"https://pith.science/api/pith-number/PXOODZP3FUVA4KMGBZPOSE3X7S/events.json","paper":"https://pith.science/paper/PXOODZP3"},"agent_actions":{"view_html":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S","download_json":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S.json","view_paper":"https://pith.science/paper/PXOODZP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05836&json=true","fetch_graph":"https://pith.science/api/pith-number/PXOODZP3FUVA4KMGBZPOSE3X7S/graph.json","fetch_events":"https://pith.science/api/pith-number/PXOODZP3FUVA4KMGBZPOSE3X7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S/action/storage_attestation","attest_author":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S/action/author_attestation","sign_citation":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S/action/citation_signature","submit_replication":"https://pith.science/pith/PXOODZP3FUVA4KMGBZPOSE3X7S/action/replication_record"}},"created_at":"2026-05-18T00:43:20.477694+00:00","updated_at":"2026-05-18T00:43:20.477694+00:00"}