{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2DW6CA2WNNLX7P6FJAQLRN7E7Y","short_pith_number":"pith:2DW6CA2W","schema_version":"1.0","canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","source":{"kind":"arxiv","id":"1511.05094","version":4},"attestation_state":"computed","paper":{"title":"The Unified Approach for the Best Choice Problem Applied to Alternative-Choice Selection Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2015-11-16T19:22:47Z","abstract_excerpt":"The objective of this paper is to show that the so-called unified approach to stopping problems with unknown cardinality introduced in Bruss (1984) proves to be efficient for solving other types of best-choice problems. We show that what we will call the alternative-choice stopping problem, which will be exemplified right away in Section 1, can be seen as a \"two-sided\" Secretary problem. This problem is instigated by a former problem of R. R. Weber (Cambridge University). Our approach yields for unknown cardinality the sharp lower bound $1/2$ for the probability of success. This problem is, at"},"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.05094","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-16T19:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"7c2543df55ce5bdba655f96048125c5665d48392c1a62919f47234e1c783b206","abstract_canon_sha256":"01a94c7f3a99fe4990e718d2573eb4c541b8d4d692623f91a9fdf02b707805eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:36.775465Z","signature_b64":"IioEoCPQSp43s6l04L4No8rC+0fLV4iUNEs+JqVLwDctAe5D6R7Zj/0zxiINtw7Ze0VBJMvgD6Pqp+2rZMVAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","last_reissued_at":"2026-05-18T01:03:36.774839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:36.774839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Unified Approach for the Best Choice Problem Applied to Alternative-Choice Selection Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2015-11-16T19:22:47Z","abstract_excerpt":"The objective of this paper is to show that the so-called unified approach to stopping problems with unknown cardinality introduced in Bruss (1984) proves to be efficient for solving other types of best-choice problems. We show that what we will call the alternative-choice stopping problem, which will be exemplified right away in Section 1, can be seen as a \"two-sided\" Secretary problem. This problem is instigated by a former problem of R. R. Weber (Cambridge University). Our approach yields for unknown cardinality the sharp lower bound $1/2$ for the probability of success. This problem is, at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05094","kind":"arxiv","version":4},"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.05094","created_at":"2026-05-18T01:03:36.774915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05094v4","created_at":"2026-05-18T01:03:36.774915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05094","created_at":"2026-05-18T01:03:36.774915+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DW6CA2WNNLX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DW6CA2WNNLX7P6F","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DW6CA2W","created_at":"2026-05-18T12:28:59.999130+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/2DW6CA2WNNLX7P6FJAQLRN7E7Y","json":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y.json","graph_json":"https://pith.science/api/pith-number/2DW6CA2WNNLX7P6FJAQLRN7E7Y/graph.json","events_json":"https://pith.science/api/pith-number/2DW6CA2WNNLX7P6FJAQLRN7E7Y/events.json","paper":"https://pith.science/paper/2DW6CA2W"},"agent_actions":{"view_html":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y","download_json":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y.json","view_paper":"https://pith.science/paper/2DW6CA2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05094&json=true","fetch_graph":"https://pith.science/api/pith-number/2DW6CA2WNNLX7P6FJAQLRN7E7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/2DW6CA2WNNLX7P6FJAQLRN7E7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/action/storage_attestation","attest_author":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/action/author_attestation","sign_citation":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/action/citation_signature","submit_replication":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/action/replication_record"}},"created_at":"2026-05-18T01:03:36.774915+00:00","updated_at":"2026-05-18T01:03:36.774915+00:00"}