{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IZUIAPNHDUBI2JLG2LJCRUE25H","short_pith_number":"pith:IZUIAPNH","schema_version":"1.0","canonical_sha256":"4668803da71d028d2566d2d228d09ae9f29fee67382d7f0a1923a89fa7468ec0","source":{"kind":"arxiv","id":"2602.01568","version":2},"attestation_state":"computed","paper":{"title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.GT","authors_text":"Christian Ellis, David Fridovich-Keil, Dong Ho Lee, Hamzah Khan, Jesse Milzman, Jingqi Li, Tianyu Qiu, Wesley Suttle","submitted_at":"2026-02-02T03:03:29Z","abstract_excerpt":"Multi-robot coordination often exhibits hierarchical structure, with some robots' decisions depending on the planned behaviors of others. While game theory provides a principled framework for such interactions, existing solvers struggle to handle mixed information structures that combine simultaneous (Nash) and hierarchical (Stackelberg) decision-making. We study N-robot forest-structured mixed-hierarchy games, in which each robot acts as a Stackelberg leader over its subtree while robots in different branches interact via Nash equilibria. We derive the Karush-Kuhn-Tucker (KKT) first-order opt"},"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":"2602.01568","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-02T03:03:29Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"1d5a21fb6a3db479a4ef88410d68bad3822d517b60ec1c36761d2a4645654183","abstract_canon_sha256":"71411a20130e7ecfdc5231146fe7cf1c174c6e1e4da04a4375406c4adb0ca212"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:33.168934Z","signature_b64":"KP1+q/7ljvweSQdl7LuvNjNxIUehdzTiVwNhxLpj/NZc0qed9bgYzucsvTYCjrDs/eHBCIPb2bv662s8fjYVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4668803da71d028d2566d2d228d09ae9f29fee67382d7f0a1923a89fa7468ec0","last_reissued_at":"2026-05-20T00:00:33.168340Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:33.168340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.GT","authors_text":"Christian Ellis, David Fridovich-Keil, Dong Ho Lee, Hamzah Khan, Jesse Milzman, Jingqi Li, Tianyu Qiu, Wesley Suttle","submitted_at":"2026-02-02T03:03:29Z","abstract_excerpt":"Multi-robot coordination often exhibits hierarchical structure, with some robots' decisions depending on the planned behaviors of others. While game theory provides a principled framework for such interactions, existing solvers struggle to handle mixed information structures that combine simultaneous (Nash) and hierarchical (Stackelberg) decision-making. We study N-robot forest-structured mixed-hierarchy games, in which each robot acts as a Stackelberg leader over its subtree while robots in different branches interact via Nash equilibria. We derive the Karush-Kuhn-Tucker (KKT) first-order opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.01568","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.01568/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":"2602.01568","created_at":"2026-05-20T00:00:33.168449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.01568v2","created_at":"2026-05-20T00:00:33.168449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01568","created_at":"2026-05-20T00:00:33.168449+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZUIAPNHDUBI","created_at":"2026-05-20T00:00:33.168449+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZUIAPNHDUBI2JLG","created_at":"2026-05-20T00:00:33.168449+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZUIAPNH","created_at":"2026-05-20T00:00:33.168449+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/IZUIAPNHDUBI2JLG2LJCRUE25H","json":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H.json","graph_json":"https://pith.science/api/pith-number/IZUIAPNHDUBI2JLG2LJCRUE25H/graph.json","events_json":"https://pith.science/api/pith-number/IZUIAPNHDUBI2JLG2LJCRUE25H/events.json","paper":"https://pith.science/paper/IZUIAPNH"},"agent_actions":{"view_html":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H","download_json":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H.json","view_paper":"https://pith.science/paper/IZUIAPNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.01568&json=true","fetch_graph":"https://pith.science/api/pith-number/IZUIAPNHDUBI2JLG2LJCRUE25H/graph.json","fetch_events":"https://pith.science/api/pith-number/IZUIAPNHDUBI2JLG2LJCRUE25H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H/action/storage_attestation","attest_author":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H/action/author_attestation","sign_citation":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H/action/citation_signature","submit_replication":"https://pith.science/pith/IZUIAPNHDUBI2JLG2LJCRUE25H/action/replication_record"}},"created_at":"2026-05-20T00:00:33.168449+00:00","updated_at":"2026-05-20T00:00:33.168449+00:00"}