{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IMYI5UNKKVZUHODDVYRPL3NN6L","short_pith_number":"pith:IMYI5UNK","schema_version":"1.0","canonical_sha256":"43308ed1aa557343b863ae22f5edadf2dd6a95949818f0794ab7d29c5ed69801","source":{"kind":"arxiv","id":"1511.02211","version":2},"attestation_state":"computed","paper":{"title":"A sharp lower bound for choosing the maximum of an independent sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jose A. Islas, Pieter C. Allaart","submitted_at":"2015-11-06T19:56:55Z","abstract_excerpt":"This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win probability. Precisely, if $X_1,\\dots,X_n$ are independent random variables with known continuous distributions and $V_n(X_1,\\dots,X_n):=\\sup_\\tau P(X_\\tau=M_n)$, where $M_n:=\\max\\{X_1,\\dots,X_n\\}$ and the supremum is over all stopping times adapted to $X_1,\\dots,X_n$, then $$V_n(X_1,\\dots,X_n)\\geq \\left(1-\\frac{1}{n}\\right)^{n-1},$$ and this bound is attained. 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":"1511.02211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-06T19:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"e21282741ed5a0e9084749213c14b0d60daf573ef35fec1db8540d902f9f536b","abstract_canon_sha256":"d741aa91990ef89807a81d343be3afdefab5ba97b2d9055387fd640f74ad1fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.404976Z","signature_b64":"yRGqmxXI16mVmgoNANeZMvpcO7y4LZeae+N4Tc/zeLgvIdzoa2b4/w8yImNFneGemWuyqpcG64nTAiPuYzAxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43308ed1aa557343b863ae22f5edadf2dd6a95949818f0794ab7d29c5ed69801","last_reissued_at":"2026-05-17T23:58:43.404459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.404459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp lower bound for choosing the maximum of an independent sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jose A. Islas, Pieter C. Allaart","submitted_at":"2015-11-06T19:56:55Z","abstract_excerpt":"This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win probability. Precisely, if $X_1,\\dots,X_n$ are independent random variables with known continuous distributions and $V_n(X_1,\\dots,X_n):=\\sup_\\tau P(X_\\tau=M_n)$, where $M_n:=\\max\\{X_1,\\dots,X_n\\}$ and the supremum is over all stopping times adapted to $X_1,\\dots,X_n$, then $$V_n(X_1,\\dots,X_n)\\geq \\left(1-\\frac{1}{n}\\right)^{n-1},$$ and this bound is attained. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02211","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":""},"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":"1511.02211","created_at":"2026-05-17T23:58:43.404538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02211v2","created_at":"2026-05-17T23:58:43.404538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02211","created_at":"2026-05-17T23:58:43.404538+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMYI5UNKKVZU","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMYI5UNKKVZUHODD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMYI5UNK","created_at":"2026-05-18T12:29:25.134429+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/IMYI5UNKKVZUHODDVYRPL3NN6L","json":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L.json","graph_json":"https://pith.science/api/pith-number/IMYI5UNKKVZUHODDVYRPL3NN6L/graph.json","events_json":"https://pith.science/api/pith-number/IMYI5UNKKVZUHODDVYRPL3NN6L/events.json","paper":"https://pith.science/paper/IMYI5UNK"},"agent_actions":{"view_html":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L","download_json":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L.json","view_paper":"https://pith.science/paper/IMYI5UNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02211&json=true","fetch_graph":"https://pith.science/api/pith-number/IMYI5UNKKVZUHODDVYRPL3NN6L/graph.json","fetch_events":"https://pith.science/api/pith-number/IMYI5UNKKVZUHODDVYRPL3NN6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L/action/storage_attestation","attest_author":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L/action/author_attestation","sign_citation":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L/action/citation_signature","submit_replication":"https://pith.science/pith/IMYI5UNKKVZUHODDVYRPL3NN6L/action/replication_record"}},"created_at":"2026-05-17T23:58:43.404538+00:00","updated_at":"2026-05-17T23:58:43.404538+00:00"}