{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ULMTFW2A73YZIPWUKDXDH57I7N","short_pith_number":"pith:ULMTFW2A","schema_version":"1.0","canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","source":{"kind":"arxiv","id":"0912.0615","version":3},"attestation_state":"computed","paper":{"title":"Predicting the supremum: optimality of \"stop at once or not at all\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pieter C. Allaart","submitted_at":"2009-12-03T10:06:19Z","abstract_excerpt":"Let X_t, 0<=t<=T be a one-dimensional stochastic process with independent and stationary increments. This paper considers the problem of stopping the process X_t \"as close as possible\" to its eventual supremum M_T:=sup{X_t: 0<=t<=T}, when the reward for stopping with a stopping time tau<=T is a nonincreasing convex function of M_T-X_tau. Under fairly general conditions on the process X_t, it is shown that the optimal stopping time tau is of \"bang-bang\" form: it is either optimal to stop at time 0 or at time T. For the case of random walk, the rule tau=T is optimal if the steps of the walk stoc"},"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":"0912.0615","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-12-03T10:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d3a61e4e9a77167b4ea6f2796acf74bcc20791a5eaabe0ca754099a0a0e5af5","abstract_canon_sha256":"468cb22d63ab7b6dc72b0562b2eaede8944b929f781cdbbce04b385f7402f693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:47.989588Z","signature_b64":"Icv3NJpBhuoO3RAFHF0cLEjoOVzGEkA9vKz8EgHvYzFVwF06JEHXKRseNGg9iZAsLFZYLs5Tn7GDesGwN7fhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","last_reissued_at":"2026-05-18T03:59:47.988867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:47.988867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting the supremum: optimality of \"stop at once or not at all\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pieter C. Allaart","submitted_at":"2009-12-03T10:06:19Z","abstract_excerpt":"Let X_t, 0<=t<=T be a one-dimensional stochastic process with independent and stationary increments. This paper considers the problem of stopping the process X_t \"as close as possible\" to its eventual supremum M_T:=sup{X_t: 0<=t<=T}, when the reward for stopping with a stopping time tau<=T is a nonincreasing convex function of M_T-X_tau. Under fairly general conditions on the process X_t, it is shown that the optimal stopping time tau is of \"bang-bang\" form: it is either optimal to stop at time 0 or at time T. For the case of random walk, the rule tau=T is optimal if the steps of the walk stoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0615","kind":"arxiv","version":3},"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":"0912.0615","created_at":"2026-05-18T03:59:47.988974+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.0615v3","created_at":"2026-05-18T03:59:47.988974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0615","created_at":"2026-05-18T03:59:47.988974+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULMTFW2A73YZ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULMTFW2A73YZIPWU","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULMTFW2A","created_at":"2026-05-18T12:26:02.257875+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/ULMTFW2A73YZIPWUKDXDH57I7N","json":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N.json","graph_json":"https://pith.science/api/pith-number/ULMTFW2A73YZIPWUKDXDH57I7N/graph.json","events_json":"https://pith.science/api/pith-number/ULMTFW2A73YZIPWUKDXDH57I7N/events.json","paper":"https://pith.science/paper/ULMTFW2A"},"agent_actions":{"view_html":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N","download_json":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N.json","view_paper":"https://pith.science/paper/ULMTFW2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.0615&json=true","fetch_graph":"https://pith.science/api/pith-number/ULMTFW2A73YZIPWUKDXDH57I7N/graph.json","fetch_events":"https://pith.science/api/pith-number/ULMTFW2A73YZIPWUKDXDH57I7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/action/storage_attestation","attest_author":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/action/author_attestation","sign_citation":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/action/citation_signature","submit_replication":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/action/replication_record"}},"created_at":"2026-05-18T03:59:47.988974+00:00","updated_at":"2026-05-18T03:59:47.988974+00:00"}