{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T5YTM67XB3ZK2IYTGUA5ISTKPJ","short_pith_number":"pith:T5YTM67X","schema_version":"1.0","canonical_sha256":"9f71367bf70ef2ad23133501d44a6a7a72fe16c736b6dd21821fdfb33ae4a16a","source":{"kind":"arxiv","id":"2606.26893","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Learning for Parametric Prophet Inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anna Grebennikova, Jung-Hun Kim, Vianney Perchet","submitted_at":"2026-06-25T11:26:16Z","abstract_excerpt":"We study learning in prophet inequalities with i.i.d. rewards drawn from an exponential-type parametric family with an unknown parameter $\\theta$, a class that includes exponential, Pareto, and bounded-support power-family distributions. We first characterize the optimal full-information asymptotic competitive ratio for this family. In the unbounded-support case, the limit is $ {\\left({\\theta}/({\\theta-c_+})\\right)^{c_+/\\theta}}/ {\\Gamma(1-c_+/\\theta)},$ while in the bounded-support case, the limit is $1$. We then propose a confidence-based dynamic-programming policy for online learning. By ex"},"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":"2606.26893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-25T11:26:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"368fa00d525183f08fb91eb50591a1860190a451ec76ae6a250abb3c1f8f5181","abstract_canon_sha256":"ff1dab271773274b3bd9107c59a27197f66072b9af46a3c445d1483dda4a4549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:03.252578Z","signature_b64":"OGEht+m7VYIxKR3/VsOlE1eJi2jxD/9BzgiS44LBMQKcIvQkKVD9eL9DTM2OY1Fx19TWiVKSWG4fLbI+Gg19BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f71367bf70ef2ad23133501d44a6a7a72fe16c736b6dd21821fdfb33ae4a16a","last_reissued_at":"2026-06-26T01:16:03.252152Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:03.252152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Learning for Parametric Prophet Inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anna Grebennikova, Jung-Hun Kim, Vianney Perchet","submitted_at":"2026-06-25T11:26:16Z","abstract_excerpt":"We study learning in prophet inequalities with i.i.d. rewards drawn from an exponential-type parametric family with an unknown parameter $\\theta$, a class that includes exponential, Pareto, and bounded-support power-family distributions. We first characterize the optimal full-information asymptotic competitive ratio for this family. In the unbounded-support case, the limit is $ {\\left({\\theta}/({\\theta-c_+})\\right)^{c_+/\\theta}}/ {\\Gamma(1-c_+/\\theta)},$ while in the bounded-support case, the limit is $1$. We then propose a confidence-based dynamic-programming policy for online learning. By ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26893","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/2606.26893/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":"2606.26893","created_at":"2026-06-26T01:16:03.252216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26893v1","created_at":"2026-06-26T01:16:03.252216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26893","created_at":"2026-06-26T01:16:03.252216+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5YTM67XB3ZK","created_at":"2026-06-26T01:16:03.252216+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5YTM67XB3ZK2IYT","created_at":"2026-06-26T01:16:03.252216+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5YTM67X","created_at":"2026-06-26T01:16:03.252216+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/T5YTM67XB3ZK2IYTGUA5ISTKPJ","json":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ.json","graph_json":"https://pith.science/api/pith-number/T5YTM67XB3ZK2IYTGUA5ISTKPJ/graph.json","events_json":"https://pith.science/api/pith-number/T5YTM67XB3ZK2IYTGUA5ISTKPJ/events.json","paper":"https://pith.science/paper/T5YTM67X"},"agent_actions":{"view_html":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ","download_json":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ.json","view_paper":"https://pith.science/paper/T5YTM67X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26893&json=true","fetch_graph":"https://pith.science/api/pith-number/T5YTM67XB3ZK2IYTGUA5ISTKPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T5YTM67XB3ZK2IYTGUA5ISTKPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ/action/storage_attestation","attest_author":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ/action/author_attestation","sign_citation":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ/action/citation_signature","submit_replication":"https://pith.science/pith/T5YTM67XB3ZK2IYTGUA5ISTKPJ/action/replication_record"}},"created_at":"2026-06-26T01:16:03.252216+00:00","updated_at":"2026-06-26T01:16:03.252216+00:00"}