{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LQL23H2VN5THBPB5O5EN4S2CKE","short_pith_number":"pith:LQL23H2V","schema_version":"1.0","canonical_sha256":"5c17ad9f556f6670bc3d7748de4b42510aeb415d2883ba633758bbc68eecd5a4","source":{"kind":"arxiv","id":"1409.6773","version":2},"attestation_state":"computed","paper":{"title":"On a Stopping Game in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","q-fin.MF"],"primary_cat":"math.PR","authors_text":"Erhan Bayraktar, Zhou Zhou","submitted_at":"2014-09-23T23:36:58Z","abstract_excerpt":"We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games."},"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":"1409.6773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-09-23T23:36:58Z","cross_cats_sorted":["math.OC","q-fin.MF"],"title_canon_sha256":"cb5ba987425183e19fe0008aad0148b32aafb8afa4fc3f6ac745f832cbec2e12","abstract_canon_sha256":"a0b70a7168eccb4e899432a3bcd0d39e88128c1ff9a59e9a82f20031808e5ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:20.469677Z","signature_b64":"MSKMy5jJFg3tAOW197oZP1daeL0uSvGsgUy/z8sZR4kAxZ1vEh6xDaPnugt3Rktae3Qk1MlZ++5KtKAJg2ADAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c17ad9f556f6670bc3d7748de4b42510aeb415d2883ba633758bbc68eecd5a4","last_reissued_at":"2026-05-18T01:36:20.469250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:20.469250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Stopping Game in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","q-fin.MF"],"primary_cat":"math.PR","authors_text":"Erhan Bayraktar, Zhou Zhou","submitted_at":"2014-09-23T23:36:58Z","abstract_excerpt":"We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6773","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":""},"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":"1409.6773","created_at":"2026-05-18T01:36:20.469323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6773v2","created_at":"2026-05-18T01:36:20.469323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6773","created_at":"2026-05-18T01:36:20.469323+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQL23H2VN5TH","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQL23H2VN5THBPB5","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQL23H2V","created_at":"2026-05-18T12:28:38.356838+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/LQL23H2VN5THBPB5O5EN4S2CKE","json":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE.json","graph_json":"https://pith.science/api/pith-number/LQL23H2VN5THBPB5O5EN4S2CKE/graph.json","events_json":"https://pith.science/api/pith-number/LQL23H2VN5THBPB5O5EN4S2CKE/events.json","paper":"https://pith.science/paper/LQL23H2V"},"agent_actions":{"view_html":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE","download_json":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE.json","view_paper":"https://pith.science/paper/LQL23H2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6773&json=true","fetch_graph":"https://pith.science/api/pith-number/LQL23H2VN5THBPB5O5EN4S2CKE/graph.json","fetch_events":"https://pith.science/api/pith-number/LQL23H2VN5THBPB5O5EN4S2CKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE/action/storage_attestation","attest_author":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE/action/author_attestation","sign_citation":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE/action/citation_signature","submit_replication":"https://pith.science/pith/LQL23H2VN5THBPB5O5EN4S2CKE/action/replication_record"}},"created_at":"2026-05-18T01:36:20.469323+00:00","updated_at":"2026-05-18T01:36:20.469323+00:00"}