{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TZP35IFZQ2RTGR7DQZ5XYQ5TWF","short_pith_number":"pith:TZP35IFZ","canonical_record":{"source":{"id":"1511.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-11-05T04:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"720d47515ea2b4c2209b57cc8eff82b0bc20160cf15b38e81d29c0f6688ab582","abstract_canon_sha256":"0cd354c589886725fa0961887e9de2a8996d4a16981f886679c6f96f7b0621b9"},"schema_version":"1.0"},"canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","source":{"kind":"arxiv","id":"1511.01604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01604","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01604v1","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01604","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"TZP35IFZQ2RT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZP35IFZQ2RTGR7D","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZP35IFZ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TZP35IFZQ2RTGR7DQZ5XYQ5TWF","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-11-05T04:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"720d47515ea2b4c2209b57cc8eff82b0bc20160cf15b38e81d29c0f6688ab582","abstract_canon_sha256":"0cd354c589886725fa0961887e9de2a8996d4a16981f886679c6f96f7b0621b9"},"schema_version":"1.0"},"canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:45.127105Z","signature_b64":"xM8qeAOibKpggWNzFYFUVzNF63Yco6NLi5z7eEw4TCLuFKvlSM95h/c8cat1Wb9nkbFpqzPIz2QHr2PEN1SZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","last_reissued_at":"2026-05-18T01:27:45.126551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:45.126551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01604","source_version":1,"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:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Crp2qcr5A5bQj7yW8mL1pfYwcIL+fWBHWu1kKZqKj700qTFRTx+JkvGL3+8Sk9PyfL3GASd+GHY13ztu0ZK+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:44:04.096637Z"},"content_sha256":"46cc4d093b24a71bbb569b65cb07668585553e175439710e93d68cefa60a4335","schema_version":"1.0","event_id":"sha256:46cc4d093b24a71bbb569b65cb07668585553e175439710e93d68cefa60a4335"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TZP35IFZQ2RTGR7DQZ5XYQ5TWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete approximations to the double-obstacle prtoblem, and optimal stopping of tug-of-war games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Juan Manfredi, Luca Codenotti, Marta Lewicka","submitted_at":"2015-11-05T04:10:11Z","abstract_excerpt":"We study the double-obstacle problem for the p-Laplace operator, p 2 [2;1). We prove that for Lipschitz boundary data and Lipschitz obstacles, viscosity solutions are unique and coincide with variational solutions. They are also uniform limits of solutions to discrete min-max problems that can be interpreted as the dynamic programming principle for appropriate tug-ofwar games with noise. In these games, both players in addition to choosing their strategies, are also allowed to choose stopping times. The solutions to the double-obstacle problems are limits of values of these games, when the ste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01604","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"},"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:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"af/5nUP4qimi5Dzp7wullAQzIF1BFIW+Zimbu/MAnZjaDFwS3Gl5DbN2fjNoz+TCrUmMDK8NmAD37s5UuT9fCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:44:04.096980Z"},"content_sha256":"5537827896ac8f7f65ba178a7fddf8b73b631d9e9018db67e9b928df17111af1","schema_version":"1.0","event_id":"sha256:5537827896ac8f7f65ba178a7fddf8b73b631d9e9018db67e9b928df17111af1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/bundle.json","state_url":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/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-01T20:44:04Z","links":{"resolver":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF","bundle":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/bundle.json","state":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TZP35IFZQ2RTGR7DQZ5XYQ5TWF","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":"0cd354c589886725fa0961887e9de2a8996d4a16981f886679c6f96f7b0621b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-11-05T04:10:11Z","title_canon_sha256":"720d47515ea2b4c2209b57cc8eff82b0bc20160cf15b38e81d29c0f6688ab582"},"schema_version":"1.0","source":{"id":"1511.01604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01604","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01604v1","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01604","created_at":"2026-05-18T01:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"TZP35IFZQ2RT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"TZP35IFZQ2RTGR7D","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"TZP35IFZ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:5537827896ac8f7f65ba178a7fddf8b73b631d9e9018db67e9b928df17111af1","target":"graph","created_at":"2026-05-18T01:27:45Z","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 the double-obstacle problem for the p-Laplace operator, p 2 [2;1). We prove that for Lipschitz boundary data and Lipschitz obstacles, viscosity solutions are unique and coincide with variational solutions. They are also uniform limits of solutions to discrete min-max problems that can be interpreted as the dynamic programming principle for appropriate tug-ofwar games with noise. In these games, both players in addition to choosing their strategies, are also allowed to choose stopping times. The solutions to the double-obstacle problems are limits of values of these games, when the ste","authors_text":"Juan Manfredi, Luca Codenotti, Marta Lewicka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-11-05T04:10:11Z","title":"Discrete approximations to the double-obstacle prtoblem, and optimal stopping of tug-of-war games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01604","kind":"arxiv","version":1},"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:46cc4d093b24a71bbb569b65cb07668585553e175439710e93d68cefa60a4335","target":"record","created_at":"2026-05-18T01:27:45Z","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":"0cd354c589886725fa0961887e9de2a8996d4a16981f886679c6f96f7b0621b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-11-05T04:10:11Z","title_canon_sha256":"720d47515ea2b4c2209b57cc8eff82b0bc20160cf15b38e81d29c0f6688ab582"},"schema_version":"1.0","source":{"id":"1511.01604","kind":"arxiv","version":1}},"canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","first_computed_at":"2026-05-18T01:27:45.126551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:45.126551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xM8qeAOibKpggWNzFYFUVzNF63Yco6NLi5z7eEw4TCLuFKvlSM95h/c8cat1Wb9nkbFpqzPIz2QHr2PEN1SZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:45.127105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46cc4d093b24a71bbb569b65cb07668585553e175439710e93d68cefa60a4335","sha256:5537827896ac8f7f65ba178a7fddf8b73b631d9e9018db67e9b928df17111af1"],"state_sha256":"531de855f0d5ed2bdfcd8cf03296d7f913cf6d0d67030a0ebad6bc1676c3effa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9R5h1xFkQHLbp9Zmg25v0ZzR/wx9P1aWePYF25zt5qoMwX1TDB1YbE2LbtOB1/fF4gtQaXli1QofpMEEbTrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:44:04.098911Z","bundle_sha256":"d9c3942fc8582f285249fddebc2c566957f9d73367efb96d3a0c4085fb153414"}}