{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I2Z65LYHSWTXZU4ZXNXTLQR5RM","short_pith_number":"pith:I2Z65LYH","schema_version":"1.0","canonical_sha256":"46b3eeaf0795a77cd399bb6f35c23d8b05552bea1d86c6e4f02dee14b32870ad","source":{"kind":"arxiv","id":"1212.1391","version":1},"attestation_state":"computed","paper":{"title":"New developments of the odds theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2012-12-06T17:43:35Z","abstract_excerpt":"The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance \"Bruss odds\" to obtain a quick overview.) Many extensions and modifications of the this result have appeared since publication in~2000. This article reviews the important gnew developments and applications in this field. The spectrum of application comprises as different fields as secretary problems, more general stopping problems, robotic maintenance problems, compassionate use "},"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":"1212.1391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-12-06T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"383d30a8127b3e19efa970c19ed16c1bad4000d351bc3dfd4ab91bc4dd70fb3a","abstract_canon_sha256":"186e8c4a69eefd60f3855b284dfb71b34a2e383182bc4987a472f6bff1224bbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:04.088994Z","signature_b64":"UEgdLkvSAjRJPTTjmDcqF9aOpYtxZZlv59WZuS0OL6HT1S6POixs34naQJmpK22dzZyTF39JXf6g6eY4PgU9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46b3eeaf0795a77cd399bb6f35c23d8b05552bea1d86c6e4f02dee14b32870ad","last_reissued_at":"2026-05-18T03:39:04.088448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:04.088448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New developments of the odds theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"R\\'emi Dendievel","submitted_at":"2012-12-06T17:43:35Z","abstract_excerpt":"The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance \"Bruss odds\" to obtain a quick overview.) Many extensions and modifications of the this result have appeared since publication in~2000. This article reviews the important gnew developments and applications in this field. The spectrum of application comprises as different fields as secretary problems, more general stopping problems, robotic maintenance problems, compassionate use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1391","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":""},"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":"1212.1391","created_at":"2026-05-18T03:39:04.088530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1391v1","created_at":"2026-05-18T03:39:04.088530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1391","created_at":"2026-05-18T03:39:04.088530+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2Z65LYHSWTX","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2Z65LYHSWTXZU4Z","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2Z65LYH","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07183","citing_title":"Stopping on the last success with unknown odds: Impossibility barriers and quantitative oracle bounds","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM","json":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM.json","graph_json":"https://pith.science/api/pith-number/I2Z65LYHSWTXZU4ZXNXTLQR5RM/graph.json","events_json":"https://pith.science/api/pith-number/I2Z65LYHSWTXZU4ZXNXTLQR5RM/events.json","paper":"https://pith.science/paper/I2Z65LYH"},"agent_actions":{"view_html":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM","download_json":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM.json","view_paper":"https://pith.science/paper/I2Z65LYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1391&json=true","fetch_graph":"https://pith.science/api/pith-number/I2Z65LYHSWTXZU4ZXNXTLQR5RM/graph.json","fetch_events":"https://pith.science/api/pith-number/I2Z65LYHSWTXZU4ZXNXTLQR5RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM/action/storage_attestation","attest_author":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM/action/author_attestation","sign_citation":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM/action/citation_signature","submit_replication":"https://pith.science/pith/I2Z65LYHSWTXZU4ZXNXTLQR5RM/action/replication_record"}},"created_at":"2026-05-18T03:39:04.088530+00:00","updated_at":"2026-05-18T03:39:04.088530+00:00"}