{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FGYQFYA2QGHFP2V3NQMSAIJ64S","short_pith_number":"pith:FGYQFYA2","schema_version":"1.0","canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","source":{"kind":"arxiv","id":"1305.7372","version":2},"attestation_state":"computed","paper":{"title":"A Game-Tree approach to discrete infinity Laplacian with running costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Armin Schikorra, Qing Liu","submitted_at":"2013-05-31T12:01:33Z","abstract_excerpt":"We give a self-contained and elementary proof for boundedness, existence, and uniqueness of solutions to dynamic programming principles (DPP) for biased tug-of-war games with running costs. The domain we work in is very general, and as a special case contains metric spaces. Technically, we introduce game-trees and show that a discretized flow converges uniformly, from which we obtain not only the existence, but also the uniqueness. Our arguments are entirely deterministic, and also do not rely on (semi-)continuity in any way; in particular, we do not need to mollify the DPP at the boundary for"},"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":"1305.7372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2013-05-31T12:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"4593b82f6b98d58a0d6cb090d717c7043d7b89044aadcbc16f3033eac4b61ba9","abstract_canon_sha256":"2c29eae86c6924b10440d7241e28d4b88895762b90a722312b43e1bc34a56a3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.863270Z","signature_b64":"EwrZP4bWY5ik1XZh5oSZgjZtIqRImqqevjLYP0MCCqNR/105sZPpU8OzVQ92ul+v0o2zHOELwiarny+n8UjCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","last_reissued_at":"2026-05-18T03:18:07.862420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.862420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game-Tree approach to discrete infinity Laplacian with running costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Armin Schikorra, Qing Liu","submitted_at":"2013-05-31T12:01:33Z","abstract_excerpt":"We give a self-contained and elementary proof for boundedness, existence, and uniqueness of solutions to dynamic programming principles (DPP) for biased tug-of-war games with running costs. The domain we work in is very general, and as a special case contains metric spaces. Technically, we introduce game-trees and show that a discretized flow converges uniformly, from which we obtain not only the existence, but also the uniqueness. Our arguments are entirely deterministic, and also do not rely on (semi-)continuity in any way; in particular, we do not need to mollify the DPP at the boundary for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7372","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":"1305.7372","created_at":"2026-05-18T03:18:07.862571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.7372v2","created_at":"2026-05-18T03:18:07.862571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7372","created_at":"2026-05-18T03:18:07.862571+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGYQFYA2QGHF","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGYQFYA2QGHFP2V3","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGYQFYA2","created_at":"2026-05-18T12:27:45.050594+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/FGYQFYA2QGHFP2V3NQMSAIJ64S","json":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S.json","graph_json":"https://pith.science/api/pith-number/FGYQFYA2QGHFP2V3NQMSAIJ64S/graph.json","events_json":"https://pith.science/api/pith-number/FGYQFYA2QGHFP2V3NQMSAIJ64S/events.json","paper":"https://pith.science/paper/FGYQFYA2"},"agent_actions":{"view_html":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S","download_json":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S.json","view_paper":"https://pith.science/paper/FGYQFYA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.7372&json=true","fetch_graph":"https://pith.science/api/pith-number/FGYQFYA2QGHFP2V3NQMSAIJ64S/graph.json","fetch_events":"https://pith.science/api/pith-number/FGYQFYA2QGHFP2V3NQMSAIJ64S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/action/storage_attestation","attest_author":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/action/author_attestation","sign_citation":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/action/citation_signature","submit_replication":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/action/replication_record"}},"created_at":"2026-05-18T03:18:07.862571+00:00","updated_at":"2026-05-18T03:18:07.862571+00:00"}