{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ULMTFW2A73YZIPWUKDXDH57I7N","short_pith_number":"pith:ULMTFW2A","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"},"canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","source":{"kind":"arxiv","id":"0912.0615","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0615","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0615v3","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0615","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULMTFW2A73YZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULMTFW2A73YZIPWU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULMTFW2A","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ULMTFW2A73YZIPWUKDXDH57I7N","target":"record","payload":{"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"},"canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","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"},"source_kind":"arxiv","source_id":"0912.0615","source_version":3,"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-18T03:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBQLwBcOpTNglhHXX9GTR8nxUExqtFz5Dxrh0dC5KGtrNGu7A09gFxaNwoUJEMzakpMf4DTSRfnXXRkjbJRTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:46:59.852147Z"},"content_sha256":"be4ca945645a9442d3395b26eecce94f4b4a6883f0a20e1dd62e27ab1401a060","schema_version":"1.0","event_id":"sha256:be4ca945645a9442d3395b26eecce94f4b4a6883f0a20e1dd62e27ab1401a060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ULMTFW2A73YZIPWUKDXDH57I7N","target":"graph","payload":{"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"},"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-18T03:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZnLYnC+UiFKvecWtQLebGiUd49CTjW9jCtXkUaFwU61ykDfYfri3wDvd8IoPMS/FHjA+7DBqwt7101VZ27CBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:46:59.852524Z"},"content_sha256":"e516860007063c4e64227d7fc87e0730ae1c9d14cb6244d300bdc9d95b1e6538","schema_version":"1.0","event_id":"sha256:e516860007063c4e64227d7fc87e0730ae1c9d14cb6244d300bdc9d95b1e6538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/bundle.json","state_url":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULMTFW2A73YZIPWUKDXDH57I7N/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-23T15:46:59Z","links":{"resolver":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N","bundle":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/bundle.json","state":"https://pith.science/pith/ULMTFW2A73YZIPWUKDXDH57I7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULMTFW2A73YZIPWUKDXDH57I7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ULMTFW2A73YZIPWUKDXDH57I7N","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":"468cb22d63ab7b6dc72b0562b2eaede8944b929f781cdbbce04b385f7402f693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-12-03T10:06:19Z","title_canon_sha256":"2d3a61e4e9a77167b4ea6f2796acf74bcc20791a5eaabe0ca754099a0a0e5af5"},"schema_version":"1.0","source":{"id":"0912.0615","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0615","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0615v3","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0615","created_at":"2026-05-18T03:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULMTFW2A73YZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULMTFW2A73YZIPWU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULMTFW2A","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:e516860007063c4e64227d7fc87e0730ae1c9d14cb6244d300bdc9d95b1e6538","target":"graph","created_at":"2026-05-18T03:59:47Z","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":"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","authors_text":"Pieter C. Allaart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-12-03T10:06:19Z","title":"Predicting the supremum: optimality of \"stop at once or not at all\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0615","kind":"arxiv","version":3},"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:be4ca945645a9442d3395b26eecce94f4b4a6883f0a20e1dd62e27ab1401a060","target":"record","created_at":"2026-05-18T03:59:47Z","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":"468cb22d63ab7b6dc72b0562b2eaede8944b929f781cdbbce04b385f7402f693","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-12-03T10:06:19Z","title_canon_sha256":"2d3a61e4e9a77167b4ea6f2796acf74bcc20791a5eaabe0ca754099a0a0e5af5"},"schema_version":"1.0","source":{"id":"0912.0615","kind":"arxiv","version":3}},"canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2d932db40fef1943ed450ee33f7e8fb509e2820e5325158e523d054cedbc93b","first_computed_at":"2026-05-18T03:59:47.988867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:47.988867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Icv3NJpBhuoO3RAFHF0cLEjoOVzGEkA9vKz8EgHvYzFVwF06JEHXKRseNGg9iZAsLFZYLs5Tn7GDesGwN7fhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:47.989588Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0615","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4ca945645a9442d3395b26eecce94f4b4a6883f0a20e1dd62e27ab1401a060","sha256:e516860007063c4e64227d7fc87e0730ae1c9d14cb6244d300bdc9d95b1e6538"],"state_sha256":"51d0bfbd7426ff70b05960a598ef7fe18b118c11946dd130a8fbdba9cd3444a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sE0DzfBp7dFtdueIi0/XSpc+cOHkqll9RjZ/+9AAm1iasfypRD5ni4QuSbNY6Iu4bzE8AmJYPyQRztaKWATvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:46:59.854461Z","bundle_sha256":"27ea3f032c05f73d3858c054b56cde2b841bac347f5f9c7f2240d27858a894cd"}}