{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TZP35IFZQ2RTGR7DQZ5XYQ5TWF","short_pith_number":"pith:TZP35IFZ","schema_version":"1.0","canonical_sha256":"9e5fbea0b986a33347e3867b7c43b3b159078320954e036e1c62c2b85eddbcbb","source":{"kind":"arxiv","id":"1511.01604","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.01604","created_at":"2026-05-18T01:27:45.126637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01604v1","created_at":"2026-05-18T01:27:45.126637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01604","created_at":"2026-05-18T01:27:45.126637+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZP35IFZQ2RT","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZP35IFZQ2RTGR7D","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZP35IFZ","created_at":"2026-05-18T12:29:44.643036+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/TZP35IFZQ2RTGR7DQZ5XYQ5TWF","json":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF.json","graph_json":"https://pith.science/api/pith-number/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/graph.json","events_json":"https://pith.science/api/pith-number/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/events.json","paper":"https://pith.science/paper/TZP35IFZ"},"agent_actions":{"view_html":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF","download_json":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF.json","view_paper":"https://pith.science/paper/TZP35IFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01604&json=true","fetch_graph":"https://pith.science/api/pith-number/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/graph.json","fetch_events":"https://pith.science/api/pith-number/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/action/storage_attestation","attest_author":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/action/author_attestation","sign_citation":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/action/citation_signature","submit_replication":"https://pith.science/pith/TZP35IFZQ2RTGR7DQZ5XYQ5TWF/action/replication_record"}},"created_at":"2026-05-18T01:27:45.126637+00:00","updated_at":"2026-05-18T01:27:45.126637+00:00"}