{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2DW6CA2WNNLX7P6FJAQLRN7E7Y","short_pith_number":"pith:2DW6CA2W","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"},"canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","source":{"kind":"arxiv","id":"1511.05094","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05094","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05094v4","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05094","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"2DW6CA2WNNLX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DW6CA2WNNLX7P6F","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DW6CA2W","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2DW6CA2WNNLX7P6FJAQLRN7E7Y","target":"record","payload":{"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"},"canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","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"},"source_kind":"arxiv","source_id":"1511.05094","source_version":4,"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-05-18T01:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDFihSZcWer2Prq701qiTVXobM2Pw02hThkNp1WtsH1Kwoc2QegM8kA+fkDmMI0F4uYNNm7KAgMOvR7Ly2pjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:39:25.724562Z"},"content_sha256":"a1e769fc455ccd4072043359c7def2bbaabbfa316a8368befd1a2b0bdedd48ea","schema_version":"1.0","event_id":"sha256:a1e769fc455ccd4072043359c7def2bbaabbfa316a8368befd1a2b0bdedd48ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2DW6CA2WNNLX7P6FJAQLRN7E7Y","target":"graph","payload":{"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"},"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-05-18T01:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6ACcDPVSxpPoltQjitc0DEgD8DzTVUjcLnmR4InEA7er8JzoBm0GNbfMjGTxPMPwvfLIfWZkqCp1WswWsACDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:39:25.724909Z"},"content_sha256":"8b5a80aefc927c5d88946a675746a03914f9fe5fb54a14d4932155b5aa39d2fd","schema_version":"1.0","event_id":"sha256:8b5a80aefc927c5d88946a675746a03914f9fe5fb54a14d4932155b5aa39d2fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/bundle.json","state_url":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/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-06-21T10:39:25Z","links":{"resolver":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y","bundle":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/bundle.json","state":"https://pith.science/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DW6CA2WNNLX7P6FJAQLRN7E7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2DW6CA2WNNLX7P6FJAQLRN7E7Y","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":"01a94c7f3a99fe4990e718d2573eb4c541b8d4d692623f91a9fdf02b707805eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-16T19:22:47Z","title_canon_sha256":"7c2543df55ce5bdba655f96048125c5665d48392c1a62919f47234e1c783b206"},"schema_version":"1.0","source":{"id":"1511.05094","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05094","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05094v4","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05094","created_at":"2026-05-18T01:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"2DW6CA2WNNLX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2DW6CA2WNNLX7P6F","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2DW6CA2W","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:8b5a80aefc927c5d88946a675746a03914f9fe5fb54a14d4932155b5aa39d2fd","target":"graph","created_at":"2026-05-18T01:03:36Z","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"},"paper":{"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","authors_text":"R\\'emi Dendievel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-16T19:22:47Z","title":"The Unified Approach for the Best Choice Problem Applied to Alternative-Choice Selection Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05094","kind":"arxiv","version":4},"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:a1e769fc455ccd4072043359c7def2bbaabbfa316a8368befd1a2b0bdedd48ea","target":"record","created_at":"2026-05-18T01:03:36Z","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":"01a94c7f3a99fe4990e718d2573eb4c541b8d4d692623f91a9fdf02b707805eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-16T19:22:47Z","title_canon_sha256":"7c2543df55ce5bdba655f96048125c5665d48392c1a62919f47234e1c783b206"},"schema_version":"1.0","source":{"id":"1511.05094","kind":"arxiv","version":4}},"canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0ede103566b577fbfc54820b8b7e4fe0eaa1bf3050104edce72255fb52b0851","first_computed_at":"2026-05-18T01:03:36.774839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:36.774839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IioEoCPQSp43s6l04L4No8rC+0fLV4iUNEs+JqVLwDctAe5D6R7Zj/0zxiINtw7Ze0VBJMvgD6Pqp+2rZMVAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:36.775465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05094","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1e769fc455ccd4072043359c7def2bbaabbfa316a8368befd1a2b0bdedd48ea","sha256:8b5a80aefc927c5d88946a675746a03914f9fe5fb54a14d4932155b5aa39d2fd"],"state_sha256":"35c8b1425798395f6e38ef87f2deb75ec27292fb06917f62024e68041eb29865"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQi2DPirpV1cN/xH4knemOLhcgBUJavrkKZgTF3Px4Sd1k0Q2IOL74RK131K8zlQzbPg85SzY17vkUCMiEz1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:39:25.726809Z","bundle_sha256":"556d54aa9ece32e0f2c2121471bc8d9157f9096af39cd082a280a6fdaae72917"}}