{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N5H5KJ2BP4TMZ2IE6JWQPXMLGN","short_pith_number":"pith:N5H5KJ2B","schema_version":"1.0","canonical_sha256":"6f4fd527417f26cce904f26d07dd8b334281a0acfe763745a59091b254d3ca53","source":{"kind":"arxiv","id":"2605.19954","version":1},"attestation_state":"computed","paper":{"title":"Equilibria in Multiplayer Graph Games: An Algorithmic Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL","cs.MA"],"primary_cat":"cs.GT","authors_text":"L\\'eonard Brice","submitted_at":"2026-05-19T15:05:52Z","abstract_excerpt":"To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an unpredictable environment, a useful abstraction is to model the situation as a two-player zero-sum game. The goal is then to find a strategy for the system that guarantees the specification against any strategy of the environment. However, to model more complex situations, such as multiple systems with different objectives or an environment composed of variou"},"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":"2605.19954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-19T15:05:52Z","cross_cats_sorted":["cs.FL","cs.MA"],"title_canon_sha256":"81c54b3e3a5bcfa6ee94c5b24d759bc2e85cde6973e667e491327c430c7ef6f7","abstract_canon_sha256":"0b20481dbad3d4b457de60e8da91637b8cfbc3d205c22a03d6b970bb2cffda81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:56.823268Z","signature_b64":"xXRjz/1dpeggM3X6j5FAUqCHFpJRPpW1XtpLhK0lFQOw4XSxfiGPV5pLAf90//YKcF+y/Qnl3RmczyfnyftUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f4fd527417f26cce904f26d07dd8b334281a0acfe763745a59091b254d3ca53","last_reissued_at":"2026-05-20T02:05:56.822536Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:56.822536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equilibria in Multiplayer Graph Games: An Algorithmic Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL","cs.MA"],"primary_cat":"cs.GT","authors_text":"L\\'eonard Brice","submitted_at":"2026-05-19T15:05:52Z","abstract_excerpt":"To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an unpredictable environment, a useful abstraction is to model the situation as a two-player zero-sum game. The goal is then to find a strategy for the system that guarantees the specification against any strategy of the environment. However, to model more complex situations, such as multiple systems with different objectives or an environment composed of variou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19954","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/2605.19954/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":"2605.19954","created_at":"2026-05-20T02:05:56.822644+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19954v1","created_at":"2026-05-20T02:05:56.822644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19954","created_at":"2026-05-20T02:05:56.822644+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5H5KJ2BP4TM","created_at":"2026-05-20T02:05:56.822644+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5H5KJ2BP4TMZ2IE","created_at":"2026-05-20T02:05:56.822644+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5H5KJ2B","created_at":"2026-05-20T02:05:56.822644+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/N5H5KJ2BP4TMZ2IE6JWQPXMLGN","json":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN.json","graph_json":"https://pith.science/api/pith-number/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/graph.json","events_json":"https://pith.science/api/pith-number/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/events.json","paper":"https://pith.science/paper/N5H5KJ2B"},"agent_actions":{"view_html":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN","download_json":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN.json","view_paper":"https://pith.science/paper/N5H5KJ2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19954&json=true","fetch_graph":"https://pith.science/api/pith-number/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/graph.json","fetch_events":"https://pith.science/api/pith-number/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/action/storage_attestation","attest_author":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/action/author_attestation","sign_citation":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/action/citation_signature","submit_replication":"https://pith.science/pith/N5H5KJ2BP4TMZ2IE6JWQPXMLGN/action/replication_record"}},"created_at":"2026-05-20T02:05:56.822644+00:00","updated_at":"2026-05-20T02:05:56.822644+00:00"}