{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NXCTDIVVQS3U62LOGUF4MSTKKT","short_pith_number":"pith:NXCTDIVV","canonical_record":{"source":{"id":"2607.24219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-27T09:50:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"858e97a883e571c03516e0b6ba7b90acbb95425c6fde8724c9fbb686cb95c96c","abstract_canon_sha256":"a00f824ff52d07feb5cd3a2c650c81785e52d1510166ecf433042eeff0abbd4e"},"schema_version":"1.0"},"canonical_sha256":"6dc531a2b584b74f696e350bc64a6a54f6d4bc9ddb99477b4f42f1be89fc08c6","source":{"kind":"arxiv","id":"2607.24219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24219","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24219v1","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24219","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_12","alias_value":"NXCTDIVVQS3U","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_16","alias_value":"NXCTDIVVQS3U62LO","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_8","alias_value":"NXCTDIVV","created_at":"2026-07-28T02:23:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NXCTDIVVQS3U62LOGUF4MSTKKT","target":"record","payload":{"canonical_record":{"source":{"id":"2607.24219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-27T09:50:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"858e97a883e571c03516e0b6ba7b90acbb95425c6fde8724c9fbb686cb95c96c","abstract_canon_sha256":"a00f824ff52d07feb5cd3a2c650c81785e52d1510166ecf433042eeff0abbd4e"},"schema_version":"1.0"},"canonical_sha256":"6dc531a2b584b74f696e350bc64a6a54f6d4bc9ddb99477b4f42f1be89fc08c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:51.661431Z","signature_b64":"cOzA2JWcLBNiTAOie+9cNbEXSoKARNtLME4F2rgouj2cJzkJoRFNgp4c2uCQNqGZWIlu1/zfppN0Rj5drIfgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc531a2b584b74f696e350bc64a6a54f6d4bc9ddb99477b4f42f1be89fc08c6","last_reissued_at":"2026-07-28T02:23:51.660646Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:51.660646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.24219","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-07-28T02:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxuR37YqEi4c2Tsicb8yNpxJIzeTe7h7DrDV2v4VfXuQkC4GQIeNlbhyPWNYH7i4nEuOfL4ISE9KrbPvwpDHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:11:10.479648Z"},"content_sha256":"09839c04056a1eae28595e09ae7de58d01ffdf149fece4fedeb2ca9eabba0051","schema_version":"1.0","event_id":"sha256:09839c04056a1eae28595e09ae7de58d01ffdf149fece4fedeb2ca9eabba0051"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NXCTDIVVQS3U62LOGUF4MSTKKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Equilibria in Concurrent Stopping Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"K. S. Thejaswini, L\\'eonard Brice, Thomas A. Henzinger","submitted_at":"2026-07-27T09:50:25Z","abstract_excerpt":"Concurrent games are a standard model for multi-agent systems, with Nash equilibrium as their central solution concept. The associated \\emph{constrained existence problem}---does a game admit a Nash equilibrium whose expected payoff lies within a prescribed interval for every player?---is undecidable, and remains so even for 10-player \\emph{stopping} games, in which a terminal state is reached almost surely under every strategy profile. We give two routes to tractability.\n  We first relax exactness and consider the problem of approximate constrained existence problem, parametrised by $\\varepsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24219","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.24219/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-28T02:23:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/C10ZpYclXBBCjbN3VV9V01JzesqmO6rrN2TPS2bEdhYvXeQGkq6gGagl6NMi+nOK4mQ6RO0DTHZiokOZafDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:11:10.480614Z"},"content_sha256":"e37e9c395c17ff58abc42cec17eac714c42ce4706dcb0e9f1101090958d111a5","schema_version":"1.0","event_id":"sha256:e37e9c395c17ff58abc42cec17eac714c42ce4706dcb0e9f1101090958d111a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/bundle.json","state_url":"https://pith.science/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/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-08-12T21:11:10Z","links":{"resolver":"https://pith.science/pith/NXCTDIVVQS3U62LOGUF4MSTKKT","bundle":"https://pith.science/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/bundle.json","state":"https://pith.science/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXCTDIVVQS3U62LOGUF4MSTKKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NXCTDIVVQS3U62LOGUF4MSTKKT","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":"a00f824ff52d07feb5cd3a2c650c81785e52d1510166ecf433042eeff0abbd4e","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-27T09:50:25Z","title_canon_sha256":"858e97a883e571c03516e0b6ba7b90acbb95425c6fde8724c9fbb686cb95c96c"},"schema_version":"1.0","source":{"id":"2607.24219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24219","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24219v1","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24219","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_12","alias_value":"NXCTDIVVQS3U","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_16","alias_value":"NXCTDIVVQS3U62LO","created_at":"2026-07-28T02:23:51Z"},{"alias_kind":"pith_short_8","alias_value":"NXCTDIVV","created_at":"2026-07-28T02:23:51Z"}],"graph_snapshots":[{"event_id":"sha256:e37e9c395c17ff58abc42cec17eac714c42ce4706dcb0e9f1101090958d111a5","target":"graph","created_at":"2026-07-28T02:23:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.24219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Concurrent games are a standard model for multi-agent systems, with Nash equilibrium as their central solution concept. The associated \\emph{constrained existence problem}---does a game admit a Nash equilibrium whose expected payoff lies within a prescribed interval for every player?---is undecidable, and remains so even for 10-player \\emph{stopping} games, in which a terminal state is reached almost surely under every strategy profile. We give two routes to tractability.\n  We first relax exactness and consider the problem of approximate constrained existence problem, parametrised by $\\varepsi","authors_text":"K. S. Thejaswini, L\\'eonard Brice, Thomas A. Henzinger","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-27T09:50:25Z","title":"Algorithms for Equilibria in Concurrent Stopping Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24219","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:09839c04056a1eae28595e09ae7de58d01ffdf149fece4fedeb2ca9eabba0051","target":"record","created_at":"2026-07-28T02:23:51Z","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":"a00f824ff52d07feb5cd3a2c650c81785e52d1510166ecf433042eeff0abbd4e","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-27T09:50:25Z","title_canon_sha256":"858e97a883e571c03516e0b6ba7b90acbb95425c6fde8724c9fbb686cb95c96c"},"schema_version":"1.0","source":{"id":"2607.24219","kind":"arxiv","version":1}},"canonical_sha256":"6dc531a2b584b74f696e350bc64a6a54f6d4bc9ddb99477b4f42f1be89fc08c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dc531a2b584b74f696e350bc64a6a54f6d4bc9ddb99477b4f42f1be89fc08c6","first_computed_at":"2026-07-28T02:23:51.660646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:23:51.660646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOzA2JWcLBNiTAOie+9cNbEXSoKARNtLME4F2rgouj2cJzkJoRFNgp4c2uCQNqGZWIlu1/zfppN0Rj5drIfgDg==","signature_status":"signed_v1","signed_at":"2026-07-28T02:23:51.661431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09839c04056a1eae28595e09ae7de58d01ffdf149fece4fedeb2ca9eabba0051","sha256:e37e9c395c17ff58abc42cec17eac714c42ce4706dcb0e9f1101090958d111a5"],"state_sha256":"2b5a8f62e5c300c510e018a07d759e1afd248c2cc5688522355e420d7b4f1e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tpEFi5o2OGZZPbDllqIDEn1+aGC+ZWSV+TbxZUHUnTqG+ZOM4WMZq2WePD5GAGf5H6GUk+IEhCHj2fyzVqXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:11:10.499915Z","bundle_sha256":"af3f8c4817c49a9f8d93108213b92f59268dc6444cf6fc9a65f26cf4fbf83f39"}}