{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XKLGJNNBGCFKDSMU2CJBXY3RRE","short_pith_number":"pith:XKLGJNNB","schema_version":"1.0","canonical_sha256":"ba9664b5a1308aa1c994d0921be37189295c1135f01dc778086fd97599fa26b6","source":{"kind":"arxiv","id":"2404.02605","version":2},"attestation_state":"computed","paper":{"title":"A Gauss-Seidel method for solving multi-leader-multi-follower games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Barbara Franci, Filippo Fabiani, Martin Schmidt, Mathias Staudigl","submitted_at":"2024-04-03T09:51:39Z","abstract_excerpt":"We design a computational approach to find equilibria in a class of Nash games possessing a hierarchical structure. By using tools from mixed-integer optimization and the characterization of variational equilibria in terms of the Karush-Kuhn-Tucker conditions, we propose a mixed-integer game formulation for solving this challenging class of problems. Besides providing an equivalent reformulation, we design a proximal Gauss--Seidel method with global convergence guarantees in case the game enjoys a potential structure. We finally corroborate the numerical performance of the algorithm on a novel"},"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":"2404.02605","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-04-03T09:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"d91464393b5a463c7974a56effc41c5c7e71c1fb1134da3653f0cc6b7cb5cc32","abstract_canon_sha256":"7114b542e8ca118a4c9ec31d50089bb100e967e6b5a4f140f685ef6ce2bbdbfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:30.465051Z","signature_b64":"c/a2yPD6Lrz3z738+b+FCawqIvQXEXFU7dPQyPDOof8IrwLQ1cD2LCmfrapEWQaivxesV4rBwXGsHaUc+MDDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba9664b5a1308aa1c994d0921be37189295c1135f01dc778086fd97599fa26b6","last_reissued_at":"2026-07-05T09:33:30.464550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:30.464550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Gauss-Seidel method for solving multi-leader-multi-follower games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Barbara Franci, Filippo Fabiani, Martin Schmidt, Mathias Staudigl","submitted_at":"2024-04-03T09:51:39Z","abstract_excerpt":"We design a computational approach to find equilibria in a class of Nash games possessing a hierarchical structure. By using tools from mixed-integer optimization and the characterization of variational equilibria in terms of the Karush-Kuhn-Tucker conditions, we propose a mixed-integer game formulation for solving this challenging class of problems. Besides providing an equivalent reformulation, we design a proximal Gauss--Seidel method with global convergence guarantees in case the game enjoys a potential structure. We finally corroborate the numerical performance of the algorithm on a novel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02605","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/2404.02605/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":"2404.02605","created_at":"2026-07-05T09:33:30.464614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.02605v2","created_at":"2026-07-05T09:33:30.464614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02605","created_at":"2026-07-05T09:33:30.464614+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKLGJNNBGCFK","created_at":"2026-07-05T09:33:30.464614+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKLGJNNBGCFKDSMU","created_at":"2026-07-05T09:33:30.464614+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKLGJNNB","created_at":"2026-07-05T09:33:30.464614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18284","citing_title":"Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00053","citing_title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2509.16941","citing_title":"SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE","json":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE.json","graph_json":"https://pith.science/api/pith-number/XKLGJNNBGCFKDSMU2CJBXY3RRE/graph.json","events_json":"https://pith.science/api/pith-number/XKLGJNNBGCFKDSMU2CJBXY3RRE/events.json","paper":"https://pith.science/paper/XKLGJNNB"},"agent_actions":{"view_html":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE","download_json":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE.json","view_paper":"https://pith.science/paper/XKLGJNNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.02605&json=true","fetch_graph":"https://pith.science/api/pith-number/XKLGJNNBGCFKDSMU2CJBXY3RRE/graph.json","fetch_events":"https://pith.science/api/pith-number/XKLGJNNBGCFKDSMU2CJBXY3RRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE/action/storage_attestation","attest_author":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE/action/author_attestation","sign_citation":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE/action/citation_signature","submit_replication":"https://pith.science/pith/XKLGJNNBGCFKDSMU2CJBXY3RRE/action/replication_record"}},"created_at":"2026-07-05T09:33:30.464614+00:00","updated_at":"2026-07-05T09:33:30.464614+00:00"}