{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O5GJZYWQMSF65SZDSBLMBJAGYE","short_pith_number":"pith:O5GJZYWQ","schema_version":"1.0","canonical_sha256":"774c9ce2d0648beecb239056c0a406c117fdcc9a86c8c29144b172d049185d80","source":{"kind":"arxiv","id":"1806.00345","version":1},"attestation_state":"computed","paper":{"title":"A probabilistic verification theorem for the finite horizon two-player zero-sum optimal switching game in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"John Moriarty, Randall Martyr, Said Hamad\\`ene","submitted_at":"2018-06-01T13:51:24Z","abstract_excerpt":"In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the players' switching controls."},"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":"1806.00345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-01T13:51:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"bbdd15414fa5f7dc0cf879dd89e30ea088a23c7ea2f358fbfc3b583967c791ca","abstract_canon_sha256":"e8aedadf5918b84d29ef0b01230b46abe73a5e0067ad4b77cd198ff41b6f8356"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:23.938369Z","signature_b64":"chRJZFAYRRc2fiJiTRaOpRWtauVemv74teBG0da+xIlkCNhh7hqtJ5mGHwrM1IwrTmnTGZzkZJent/oqGmlcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774c9ce2d0648beecb239056c0a406c117fdcc9a86c8c29144b172d049185d80","last_reissued_at":"2026-05-18T00:14:23.937615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:23.937615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A probabilistic verification theorem for the finite horizon two-player zero-sum optimal switching game in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"John Moriarty, Randall Martyr, Said Hamad\\`ene","submitted_at":"2018-06-01T13:51:24Z","abstract_excerpt":"In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the players' switching controls."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00345","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":"1806.00345","created_at":"2026-05-18T00:14:23.937742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00345v1","created_at":"2026-05-18T00:14:23.937742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00345","created_at":"2026-05-18T00:14:23.937742+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5GJZYWQMSF6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5GJZYWQMSF65SZD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5GJZYWQ","created_at":"2026-05-18T12:32:43.782077+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/O5GJZYWQMSF65SZDSBLMBJAGYE","json":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE.json","graph_json":"https://pith.science/api/pith-number/O5GJZYWQMSF65SZDSBLMBJAGYE/graph.json","events_json":"https://pith.science/api/pith-number/O5GJZYWQMSF65SZDSBLMBJAGYE/events.json","paper":"https://pith.science/paper/O5GJZYWQ"},"agent_actions":{"view_html":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE","download_json":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE.json","view_paper":"https://pith.science/paper/O5GJZYWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00345&json=true","fetch_graph":"https://pith.science/api/pith-number/O5GJZYWQMSF65SZDSBLMBJAGYE/graph.json","fetch_events":"https://pith.science/api/pith-number/O5GJZYWQMSF65SZDSBLMBJAGYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE/action/storage_attestation","attest_author":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE/action/author_attestation","sign_citation":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE/action/citation_signature","submit_replication":"https://pith.science/pith/O5GJZYWQMSF65SZDSBLMBJAGYE/action/replication_record"}},"created_at":"2026-05-18T00:14:23.937742+00:00","updated_at":"2026-05-18T00:14:23.937742+00:00"}