{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TJPM7NMFQ3W4GUGLU4VLAAKGX3","short_pith_number":"pith:TJPM7NMF","schema_version":"1.0","canonical_sha256":"9a5ecfb58586edc350cba72ab00146bef5ea3fa42a588e4a0856d59548aaf8af","source":{"kind":"arxiv","id":"1309.2860","version":2},"attestation_state":"computed","paper":{"title":"Weber's optimal stopping problem and generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2013-09-11T15:33:27Z","abstract_excerpt":"One way to interpret the classical secretary problem (CSP) is to consider it as a special case of the following problem. We observe $n$ independent indicator variables $I_1,I_2,\\dotsc,I_n$ sequentially and we try to stop on the last variable being equal to 1. If $I_k=1$ it means that the $k$-th observed secretary has smaller rank than all previous ones (and therefore is a better secretary). In the CSP $p_k=E(I_k)=1/k$ and the last $k$ with $I_k=1$ stands for the best candidate. The more general problem of stopping on a last \"1\" was studied by Bruss(2000). In what we will call Weber's problem 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":"1309.2860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T15:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"ff9c93125c63091999c40ebb74a3f12f9c2cfb0ee86946fe85395ac5a385a4af","abstract_canon_sha256":"a02c31fea7eb4f118a41a71fa87cc47dc7332ccea68a6796167def34e41a92d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:33.319583Z","signature_b64":"im3FJcgEtfTXZhV8IT8hRJnQzNaHckQNQAW/jql4EPjhdixYRSBVRJZ9ZUMkuLu2nzlmb/XiyaD3oxJXtLb1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5ecfb58586edc350cba72ab00146bef5ea3fa42a588e4a0856d59548aaf8af","last_reissued_at":"2026-05-18T03:13:33.318982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:33.318982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weber's optimal stopping problem and generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2013-09-11T15:33:27Z","abstract_excerpt":"One way to interpret the classical secretary problem (CSP) is to consider it as a special case of the following problem. We observe $n$ independent indicator variables $I_1,I_2,\\dotsc,I_n$ sequentially and we try to stop on the last variable being equal to 1. If $I_k=1$ it means that the $k$-th observed secretary has smaller rank than all previous ones (and therefore is a better secretary). In the CSP $p_k=E(I_k)=1/k$ and the last $k$ with $I_k=1$ stands for the best candidate. The more general problem of stopping on a last \"1\" was studied by Bruss(2000). In what we will call Weber's problem t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2860","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":"1309.2860","created_at":"2026-05-18T03:13:33.319069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2860v2","created_at":"2026-05-18T03:13:33.319069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2860","created_at":"2026-05-18T03:13:33.319069+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJPM7NMFQ3W4","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJPM7NMFQ3W4GUGL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJPM7NMF","created_at":"2026-05-18T12:28:02.375192+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/TJPM7NMFQ3W4GUGLU4VLAAKGX3","json":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3.json","graph_json":"https://pith.science/api/pith-number/TJPM7NMFQ3W4GUGLU4VLAAKGX3/graph.json","events_json":"https://pith.science/api/pith-number/TJPM7NMFQ3W4GUGLU4VLAAKGX3/events.json","paper":"https://pith.science/paper/TJPM7NMF"},"agent_actions":{"view_html":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3","download_json":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3.json","view_paper":"https://pith.science/paper/TJPM7NMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2860&json=true","fetch_graph":"https://pith.science/api/pith-number/TJPM7NMFQ3W4GUGLU4VLAAKGX3/graph.json","fetch_events":"https://pith.science/api/pith-number/TJPM7NMFQ3W4GUGLU4VLAAKGX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3/action/storage_attestation","attest_author":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3/action/author_attestation","sign_citation":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3/action/citation_signature","submit_replication":"https://pith.science/pith/TJPM7NMFQ3W4GUGLU4VLAAKGX3/action/replication_record"}},"created_at":"2026-05-18T03:13:33.319069+00:00","updated_at":"2026-05-18T03:13:33.319069+00:00"}