{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RBN3OX2AWVYGM7BA5V6WM5L5JX","short_pith_number":"pith:RBN3OX2A","schema_version":"1.0","canonical_sha256":"885bb75f40b570667c20ed7d66757d4dc21bfc25a4cb86d888661ceedd80677b","source":{"kind":"arxiv","id":"2006.01802","version":2},"attestation_state":"computed","paper":{"title":"Robust Multiple Stopping -- A Pathwise Duality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"math.PR","authors_text":"John G. M. Schoenmakers, Mitja Stadje, Nikolaus F. F. Schweizer, Roger J. A. Laeven","submitted_at":"2020-06-02T17:37:02Z","abstract_excerpt":"We develop a method to solve, theoretically and numerically, general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model uncertainty, and for general reward processes driven by multi-dimensional jump-diffusions. Our approach relies on first establishing robust martingale dual representation results for the multiple stopping problem that satisfy appealing pathwise optimality (i.e., almost sure) properties. Next, we exploit these theoretical results to develop upper and lower bounds 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":"2006.01802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-06-02T17:37:02Z","cross_cats_sorted":["q-fin.RM"],"title_canon_sha256":"5191c489b7a2ee06f24869b3b28bf184c60b14faccbfcd3b839615a306d0c9df","abstract_canon_sha256":"bd998db3d4b9370c30ad690d6e1e4fdca1869770e24eb726d38f55072a393f79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:21.997933Z","signature_b64":"f9JTIa8hTs8JRn/qBlGJZTR19063mtK12jbn8QvkG0XhowDYa2uU5WOsEk3hoac6b/+uGvSqaRiwI1r7fwYDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"885bb75f40b570667c20ed7d66757d4dc21bfc25a4cb86d888661ceedd80677b","last_reissued_at":"2026-07-05T03:13:21.997532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:21.997532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Multiple Stopping -- A Pathwise Duality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.RM"],"primary_cat":"math.PR","authors_text":"John G. M. Schoenmakers, Mitja Stadje, Nikolaus F. F. Schweizer, Roger J. A. Laeven","submitted_at":"2020-06-02T17:37:02Z","abstract_excerpt":"We develop a method to solve, theoretically and numerically, general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model uncertainty, and for general reward processes driven by multi-dimensional jump-diffusions. Our approach relies on first establishing robust martingale dual representation results for the multiple stopping problem that satisfy appealing pathwise optimality (i.e., almost sure) properties. Next, we exploit these theoretical results to develop upper and lower bounds t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.01802","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.01802/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.01802","created_at":"2026-07-05T03:13:21.997596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.01802v2","created_at":"2026-07-05T03:13:21.997596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.01802","created_at":"2026-07-05T03:13:21.997596+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBN3OX2AWVYG","created_at":"2026-07-05T03:13:21.997596+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBN3OX2AWVYGM7BA","created_at":"2026-07-05T03:13:21.997596+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBN3OX2A","created_at":"2026-07-05T03:13:21.997596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08264","citing_title":"`Regression Anytime' with Brute-Force SVD Truncation","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX","json":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX.json","graph_json":"https://pith.science/api/pith-number/RBN3OX2AWVYGM7BA5V6WM5L5JX/graph.json","events_json":"https://pith.science/api/pith-number/RBN3OX2AWVYGM7BA5V6WM5L5JX/events.json","paper":"https://pith.science/paper/RBN3OX2A"},"agent_actions":{"view_html":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX","download_json":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX.json","view_paper":"https://pith.science/paper/RBN3OX2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.01802&json=true","fetch_graph":"https://pith.science/api/pith-number/RBN3OX2AWVYGM7BA5V6WM5L5JX/graph.json","fetch_events":"https://pith.science/api/pith-number/RBN3OX2AWVYGM7BA5V6WM5L5JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX/action/storage_attestation","attest_author":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX/action/author_attestation","sign_citation":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX/action/citation_signature","submit_replication":"https://pith.science/pith/RBN3OX2AWVYGM7BA5V6WM5L5JX/action/replication_record"}},"created_at":"2026-07-05T03:13:21.997596+00:00","updated_at":"2026-07-05T03:13:21.997596+00:00"}