{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FGYQFYA2QGHFP2V3NQMSAIJ64S","short_pith_number":"pith:FGYQFYA2","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"},"canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","source":{"kind":"arxiv","id":"1305.7372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7372","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7372v2","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7372","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"FGYQFYA2QGHF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGYQFYA2QGHFP2V3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGYQFYA2","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FGYQFYA2QGHFP2V3NQMSAIJ64S","target":"record","payload":{"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"},"canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","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"},"source_kind":"arxiv","source_id":"1305.7372","source_version":2,"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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Ik/tVL+jcQ7YUvKTmd0RAy7BckvWOJ6qlheBmq45Rczh14pqRP4lsde8Ao1g9+z+vVLTb1CSIh3SPAzrLCACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:16:36.421166Z"},"content_sha256":"6ee6c40737efe3fe148f03da69f64c7bd886cafa1596ed794be952eef1acb63e","schema_version":"1.0","event_id":"sha256:6ee6c40737efe3fe148f03da69f64c7bd886cafa1596ed794be952eef1acb63e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FGYQFYA2QGHFP2V3NQMSAIJ64S","target":"graph","payload":{"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"},"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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6OvBpvaWpMTp8QdM8xVY8HK2Ht6D42IGxYaYL8D23W+BT8902+cU8airGnat8W4eg3eSwFCnVOP5n0HPw2y7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:16:36.421937Z"},"content_sha256":"908c947e103bd377aa279d601a658fbc60a423eaf23a621e43ae5315bcd3f030","schema_version":"1.0","event_id":"sha256:908c947e103bd377aa279d601a658fbc60a423eaf23a621e43ae5315bcd3f030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/bundle.json","state_url":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/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-11T07:16:36Z","links":{"resolver":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S","bundle":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/bundle.json","state":"https://pith.science/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGYQFYA2QGHFP2V3NQMSAIJ64S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FGYQFYA2QGHFP2V3NQMSAIJ64S","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":"2c29eae86c6924b10440d7241e28d4b88895762b90a722312b43e1bc34a56a3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2013-05-31T12:01:33Z","title_canon_sha256":"4593b82f6b98d58a0d6cb090d717c7043d7b89044aadcbc16f3033eac4b61ba9"},"schema_version":"1.0","source":{"id":"1305.7372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7372","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7372v2","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7372","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"FGYQFYA2QGHF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGYQFYA2QGHFP2V3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGYQFYA2","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:908c947e103bd377aa279d601a658fbc60a423eaf23a621e43ae5315bcd3f030","target":"graph","created_at":"2026-05-18T03:18:07Z","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 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","authors_text":"Armin Schikorra, Qing Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2013-05-31T12:01:33Z","title":"A Game-Tree approach to discrete infinity Laplacian with running costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7372","kind":"arxiv","version":2},"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:6ee6c40737efe3fe148f03da69f64c7bd886cafa1596ed794be952eef1acb63e","target":"record","created_at":"2026-05-18T03:18:07Z","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":"2c29eae86c6924b10440d7241e28d4b88895762b90a722312b43e1bc34a56a3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2013-05-31T12:01:33Z","title_canon_sha256":"4593b82f6b98d58a0d6cb090d717c7043d7b89044aadcbc16f3033eac4b61ba9"},"schema_version":"1.0","source":{"id":"1305.7372","kind":"arxiv","version":2}},"canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b102e01a818e57eabb6c1920213ee4b0d0196852568000ca3b650987f264e4","first_computed_at":"2026-05-18T03:18:07.862420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.862420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EwrZP4bWY5ik1XZh5oSZgjZtIqRImqqevjLYP0MCCqNR/105sZPpU8OzVQ92ul+v0o2zHOELwiarny+n8UjCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.863270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee6c40737efe3fe148f03da69f64c7bd886cafa1596ed794be952eef1acb63e","sha256:908c947e103bd377aa279d601a658fbc60a423eaf23a621e43ae5315bcd3f030"],"state_sha256":"6fd6a2a3809a1354f6821613b351023755d9f6943d26139df5935ae7d1dc22c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yosUaNbY2t/7t9kHU1exwjGker8z+FiSHF3UyMEPyT+Egn1ob8woXbv4feGvaJCswXyc1ExW7yLHRmnjHktAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:16:36.425891Z","bundle_sha256":"8e4009fb55eda68d9f590fd199d98e756065f1fbe1ab4cb72b692c14f5b2be16"}}