{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CN2HCT2ECAW44BHJAR2UAGKOAC","short_pith_number":"pith:CN2HCT2E","schema_version":"1.0","canonical_sha256":"1374714f44102dce04e9047540194e00a1712d3b1aea6d02d075923f6cced163","source":{"kind":"arxiv","id":"2607.08892","version":1},"attestation_state":"computed","paper":{"title":"Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Mukesh Kumar, Panagiotis Tsiotras, Yue Guan","submitted_at":"2026-07-09T19:33:01Z","abstract_excerpt":"Computing Nash equilibrium policies in multi-agent Pursuit-Evasion games (PEG) is challenging due to the exponential growth of the joint state and action spaces with the number of agents. Existing approaches either rely on offline equilibrium approximations, which may lack adaptability during execution, or online planning methods, which suffer from large branching factors. In this work, we propose Primitive-Guided Tree Search (PGTS), a hybrid framework that integrates offline exact Nash equilibrium computation with online tree search: PGTS first solves a collection of smaller, tractable sub-ga"},"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":"2607.08892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-07-09T19:33:01Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"871b7e5c91f84b650e77f38041e1f30f31e4b8b31ca9b32ea766c1c1eb67a82e","abstract_canon_sha256":"ee7739a420a0ff33fd1d294b92786d08dc404ca186689b32bdf47f83d8ef942a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T00:17:25.249338Z","signature_b64":"VGKVevMegumgMbUfT53/FXVXNL5JOyOTwynfhtYAdlTGNDI6U6AG9SMQ8mEkHj5rI343LXjORVIeRMjNwt5fDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1374714f44102dce04e9047540194e00a1712d3b1aea6d02d075923f6cced163","last_reissued_at":"2026-07-13T00:17:25.248195Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T00:17:25.248195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Mukesh Kumar, Panagiotis Tsiotras, Yue Guan","submitted_at":"2026-07-09T19:33:01Z","abstract_excerpt":"Computing Nash equilibrium policies in multi-agent Pursuit-Evasion games (PEG) is challenging due to the exponential growth of the joint state and action spaces with the number of agents. Existing approaches either rely on offline equilibrium approximations, which may lack adaptability during execution, or online planning methods, which suffer from large branching factors. In this work, we propose Primitive-Guided Tree Search (PGTS), a hybrid framework that integrates offline exact Nash equilibrium computation with online tree search: PGTS first solves a collection of smaller, tractable sub-ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08892","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.08892/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.08892","created_at":"2026-07-13T00:17:25.248788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08892v1","created_at":"2026-07-13T00:17:25.248788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08892","created_at":"2026-07-13T00:17:25.248788+00:00"},{"alias_kind":"pith_short_12","alias_value":"CN2HCT2ECAW4","created_at":"2026-07-13T00:17:25.248788+00:00"},{"alias_kind":"pith_short_16","alias_value":"CN2HCT2ECAW44BHJ","created_at":"2026-07-13T00:17:25.248788+00:00"},{"alias_kind":"pith_short_8","alias_value":"CN2HCT2E","created_at":"2026-07-13T00:17:25.248788+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/CN2HCT2ECAW44BHJAR2UAGKOAC","json":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC.json","graph_json":"https://pith.science/api/pith-number/CN2HCT2ECAW44BHJAR2UAGKOAC/graph.json","events_json":"https://pith.science/api/pith-number/CN2HCT2ECAW44BHJAR2UAGKOAC/events.json","paper":"https://pith.science/paper/CN2HCT2E"},"agent_actions":{"view_html":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC","download_json":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC.json","view_paper":"https://pith.science/paper/CN2HCT2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08892&json=true","fetch_graph":"https://pith.science/api/pith-number/CN2HCT2ECAW44BHJAR2UAGKOAC/graph.json","fetch_events":"https://pith.science/api/pith-number/CN2HCT2ECAW44BHJAR2UAGKOAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC/action/storage_attestation","attest_author":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC/action/author_attestation","sign_citation":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC/action/citation_signature","submit_replication":"https://pith.science/pith/CN2HCT2ECAW44BHJAR2UAGKOAC/action/replication_record"}},"created_at":"2026-07-13T00:17:25.248788+00:00","updated_at":"2026-07-13T00:17:25.248788+00:00"}