{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G7UTEMKL5OUNC3YCMV7ZVSJBK2","short_pith_number":"pith:G7UTEMKL","canonical_record":{"source":{"id":"1301.0091","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-01T14:26:49Z","cross_cats_sorted":["cs.SY","math.OC","q-fin.PR"],"title_canon_sha256":"b73fd6405eed0d7b3a658dde78afef7b08d169ec98ff8e5fada90a273f45ae26","abstract_canon_sha256":"a427ca5fd8e082c7dc277dad304de5c3b657a2916fec50a84fefd48316dc725b"},"schema_version":"1.0"},"canonical_sha256":"37e932314beba8d16f02657f9ac921569cd1047ef33287134e561b7807470152","source":{"kind":"arxiv","id":"1301.0091","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0091","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0091v10","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0091","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"G7UTEMKL5OUN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G7UTEMKL5OUNC3YC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G7UTEMKL","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G7UTEMKL5OUNC3YCMV7ZVSJBK2","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0091","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-01T14:26:49Z","cross_cats_sorted":["cs.SY","math.OC","q-fin.PR"],"title_canon_sha256":"b73fd6405eed0d7b3a658dde78afef7b08d169ec98ff8e5fada90a273f45ae26","abstract_canon_sha256":"a427ca5fd8e082c7dc277dad304de5c3b657a2916fec50a84fefd48316dc725b"},"schema_version":"1.0"},"canonical_sha256":"37e932314beba8d16f02657f9ac921569cd1047ef33287134e561b7807470152","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.278813Z","signature_b64":"2khA9RNqMhSOHt1MesB+fVidBOnUnbybxjRJ1GbFsAAZCFqTYlXk1vNvmh9FgKrob4/GFTx/uWxb6niJEivwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37e932314beba8d16f02657f9ac921569cd1047ef33287134e561b7807470152","last_reissued_at":"2026-05-18T01:17:26.278401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.278401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0091","source_version":10,"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:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJOfarSt7RWuLYq6Awys3mCrmJzrKpaSXOULCL89Dcl/vkMSh/nV9BHKDa/n19XhzDTzR16Jcoi8IdUgZuHcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:26:06.827566Z"},"content_sha256":"1a8a2163ec72528c22c69d6840bd7de6eb55212cde156d7ecb0e913434471190","schema_version":"1.0","event_id":"sha256:1a8a2163ec72528c22c69d6840bd7de6eb55212cde156d7ecb0e913434471190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G7UTEMKL5OUNC3YCMV7ZVSJBK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Robust Optimal Stopping Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","q-fin.PR"],"primary_cat":"math.PR","authors_text":"Erhan Bayraktar, Song Yao","submitted_at":"2013-01-01T14:26:49Z","abstract_excerpt":"We study a robust optimal stopping problem with respect to a set $\\cP$ of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse player wants to minimize this payoff by choosing an evaluation criteria from $\\cP$. We show that the \\emph{upper Snell envelope $\\ol{Z}$} of the reward process $Y$ is a supermartingale with respect to an appropriately defined nonlinear expectation $\\ul{\\sE}$, and $\\ol{Z}$ is further an $\\ul{\\sE}-$martingale up to the first time $\\t^*$ when $\\ol{Z}$ meets $Y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0091","kind":"arxiv","version":10},"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:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUZFzjcD1pOAwYZm8R2maKrYtRmQhpou84SeMJlSvwjWanZv+7o/Tp/saOHIfoKBuUhMKrWg60ln/X+/QpjKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:26:06.827954Z"},"content_sha256":"b6c45d29f0334bede5b1beb10606a4d07ccc0b0bbd0f94ffc0b0fbfc7a875de8","schema_version":"1.0","event_id":"sha256:b6c45d29f0334bede5b1beb10606a4d07ccc0b0bbd0f94ffc0b0fbfc7a875de8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/bundle.json","state_url":"https://pith.science/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/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-05-21T10:26:06Z","links":{"resolver":"https://pith.science/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2","bundle":"https://pith.science/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/bundle.json","state":"https://pith.science/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7UTEMKL5OUNC3YCMV7ZVSJBK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G7UTEMKL5OUNC3YCMV7ZVSJBK2","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":"a427ca5fd8e082c7dc277dad304de5c3b657a2916fec50a84fefd48316dc725b","cross_cats_sorted":["cs.SY","math.OC","q-fin.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-01T14:26:49Z","title_canon_sha256":"b73fd6405eed0d7b3a658dde78afef7b08d169ec98ff8e5fada90a273f45ae26"},"schema_version":"1.0","source":{"id":"1301.0091","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0091","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0091v10","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0091","created_at":"2026-05-18T01:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"G7UTEMKL5OUN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G7UTEMKL5OUNC3YC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G7UTEMKL","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:b6c45d29f0334bede5b1beb10606a4d07ccc0b0bbd0f94ffc0b0fbfc7a875de8","target":"graph","created_at":"2026-05-18T01:17:26Z","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":"We study a robust optimal stopping problem with respect to a set $\\cP$ of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse player wants to minimize this payoff by choosing an evaluation criteria from $\\cP$. We show that the \\emph{upper Snell envelope $\\ol{Z}$} of the reward process $Y$ is a supermartingale with respect to an appropriately defined nonlinear expectation $\\ul{\\sE}$, and $\\ol{Z}$ is further an $\\ul{\\sE}-$martingale up to the first time $\\t^*$ when $\\ol{Z}$ meets $Y","authors_text":"Erhan Bayraktar, Song Yao","cross_cats":["cs.SY","math.OC","q-fin.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-01T14:26:49Z","title":"On the Robust Optimal Stopping Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0091","kind":"arxiv","version":10},"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:1a8a2163ec72528c22c69d6840bd7de6eb55212cde156d7ecb0e913434471190","target":"record","created_at":"2026-05-18T01:17:26Z","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":"a427ca5fd8e082c7dc277dad304de5c3b657a2916fec50a84fefd48316dc725b","cross_cats_sorted":["cs.SY","math.OC","q-fin.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-01T14:26:49Z","title_canon_sha256":"b73fd6405eed0d7b3a658dde78afef7b08d169ec98ff8e5fada90a273f45ae26"},"schema_version":"1.0","source":{"id":"1301.0091","kind":"arxiv","version":10}},"canonical_sha256":"37e932314beba8d16f02657f9ac921569cd1047ef33287134e561b7807470152","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37e932314beba8d16f02657f9ac921569cd1047ef33287134e561b7807470152","first_computed_at":"2026-05-18T01:17:26.278401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:26.278401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2khA9RNqMhSOHt1MesB+fVidBOnUnbybxjRJ1GbFsAAZCFqTYlXk1vNvmh9FgKrob4/GFTx/uWxb6niJEivwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:26.278813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0091","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a8a2163ec72528c22c69d6840bd7de6eb55212cde156d7ecb0e913434471190","sha256:b6c45d29f0334bede5b1beb10606a4d07ccc0b0bbd0f94ffc0b0fbfc7a875de8"],"state_sha256":"7f5afbe4e4a8ec78aefeb369c2280c8e2b2fe9791287c03035f77e1f62c3881a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+SJc+THgl1KTisPiXgHkXHvzAPrmeE4UqLXMA0yMqPSZqO47B5yRZk9MrHxUW0n2lF4uYSiZLls7Sw2nGyNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T10:26:06.830027Z","bundle_sha256":"1c844f44c420177419af872e190862b6d87c956f8dc02b3d5a5c2a6b5869608c"}}