{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GZT2Q5OF2IAAH7RQ4M2M657MBL","short_pith_number":"pith:GZT2Q5OF","schema_version":"1.0","canonical_sha256":"3667a875c5d20003fe30e334cf77ec0af99e9670a78c3cad3d78a427604e649f","source":{"kind":"arxiv","id":"2605.18157","version":1},"attestation_state":"computed","paper":{"title":"A Tractable Class of Cooperative Games Defined by Directed Networks: Unanimity Decomposition and Shapley Value","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Directed network games decompose into unanimity games, giving closed-form Shapley values and a nonempty core.","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"David Ryz\\'ak, Tom\\'a\\v{s} Kroupa","submitted_at":"2026-05-18T10:02:55Z","abstract_excerpt":"We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming edges from outside the coalition. The resulting game has a convenient representation in terms of unanimity games. This representation enables closed-form polynomial-time formulas for the Shapley and Banzhaf values. We further establish that the game has a nonempty core and is totally balanced. The class of such games therefore provides an analytically and c"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.18157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-18T10:02:55Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"58328416ac728ef3dded7fe9b3e4efa9b8d14c77089e5429bc5af8bc9da1a100","abstract_canon_sha256":"9d7f95b8e1560443dde4035807e8dfc1796ff00594528592bbd5d6ee15966ce2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:48.659184Z","signature_b64":"pY9ZQOTsbUUbk0i3asv/1STG2ZR6r0+s2CeH7i71+s6Hj0i70NGTjne/eI8vpCpPScdwCr1BqDKGzEIYaaFZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3667a875c5d20003fe30e334cf77ec0af99e9670a78c3cad3d78a427604e649f","last_reissued_at":"2026-05-20T00:05:48.658529Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:48.658529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tractable Class of Cooperative Games Defined by Directed Networks: Unanimity Decomposition and Shapley Value","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Directed network games decompose into unanimity games, giving closed-form Shapley values and a nonempty core.","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"David Ryz\\'ak, Tom\\'a\\v{s} Kroupa","submitted_at":"2026-05-18T10:02:55Z","abstract_excerpt":"We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming edges from outside the coalition. The resulting game has a convenient representation in terms of unanimity games. This representation enables closed-form polynomial-time formulas for the Shapley and Banzhaf values. We further establish that the game has a nonempty core and is totally balanced. The class of such games therefore provides an analytically and c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting game has a convenient representation in terms of unanimity games. This representation enables closed-form polynomial-time formulas for the Shapley and Banzhaf values. We further establish that the game has a nonempty core and is totally balanced.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The coalitional value is defined to combine an internal interaction term given by the induced subgraph game with an external component based on minimal incoming edges from outside the coalition.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces directed network cooperative games with unanimity decomposition that admit closed-form Shapley and Banzhaf values and possess a nonempty core.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Directed network games decompose into unanimity games, giving closed-form Shapley values and a nonempty core.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"506a9cdb602018e6d0f3c0b9e37bf1a2dbb656d31be9817c1c550700ff6c86e9"},"source":{"id":"2605.18157","kind":"arxiv","version":1},"verdict":{"id":"a4bef856-f2ed-4989-90ba-3697a1b022ad","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:51:07.708986Z","strongest_claim":"The resulting game has a convenient representation in terms of unanimity games. This representation enables closed-form polynomial-time formulas for the Shapley and Banzhaf values. We further establish that the game has a nonempty core and is totally balanced.","one_line_summary":"Introduces directed network cooperative games with unanimity decomposition that admit closed-form Shapley and Banzhaf values and possess a nonempty core.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The coalitional value is defined to combine an internal interaction term given by the induced subgraph game with an external component based on minimal incoming edges from outside the coalition.","pith_extraction_headline":"Directed network games decompose into unanimity games, giving closed-form Shapley values and a nonempty core."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18157/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T00:03:17.960200Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.551566Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.079926Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.365726Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6b15fd2268e664a0109a6bf02d5301946efe912965a2184cd971d385396ff9ee"},"references":{"count":14,"sample":[{"doi":"","year":null,"title":"Trust in Shapley: A Cooperative Quest for Global Trust in P2P Network","work_id":"ac64aae3-2c2b-4d04-97c6-692d13eb52c8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Foundation for Autonomous Agents and Multiagent Systems","work_id":"b77b85f6-053d-48da-befe-28554529ae2a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1963,"title":"Olga N. Bondareva. Some applications of linear programming methods to the theory of cooperative games.Problemy Kybernetiki, 10:119–139, 1963. 13","work_id":"4bb5baa6-88ab-4048-9bc5-e33c94d98802","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Operations research games: A survey.TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 9:139–199, February 2001","work_id":"f69edd8e-85b4-4d3e-b560-010a755457f8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"The degree measure as utility function over positions in graphs and digraphs.European Journal of Operational Research, 299(3):1033–1044, 2022","work_id":"c419ee30-15cc-4969-a5e6-8dd7f827f1da","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"541573cb781a48f758737575c61dfed466c87dabacd6a3394067a89b0880523c","internal_anchors":1},"formal_canon":{"evidence_count":1,"snapshot_sha256":"94bff7a24213c980eeba8815f1a8c9dd0e57ee4e8960c3090ef58a894e10c632"},"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.18157","created_at":"2026-05-20T00:05:48.658630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18157v1","created_at":"2026-05-20T00:05:48.658630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18157","created_at":"2026-05-20T00:05:48.658630+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZT2Q5OF2IAA","created_at":"2026-05-20T00:05:48.658630+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZT2Q5OF2IAAH7RQ","created_at":"2026-05-20T00:05:48.658630+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZT2Q5OF","created_at":"2026-05-20T00:05:48.658630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL","json":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL.json","graph_json":"https://pith.science/api/pith-number/GZT2Q5OF2IAAH7RQ4M2M657MBL/graph.json","events_json":"https://pith.science/api/pith-number/GZT2Q5OF2IAAH7RQ4M2M657MBL/events.json","paper":"https://pith.science/paper/GZT2Q5OF"},"agent_actions":{"view_html":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL","download_json":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL.json","view_paper":"https://pith.science/paper/GZT2Q5OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18157&json=true","fetch_graph":"https://pith.science/api/pith-number/GZT2Q5OF2IAAH7RQ4M2M657MBL/graph.json","fetch_events":"https://pith.science/api/pith-number/GZT2Q5OF2IAAH7RQ4M2M657MBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL/action/storage_attestation","attest_author":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL/action/author_attestation","sign_citation":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL/action/citation_signature","submit_replication":"https://pith.science/pith/GZT2Q5OF2IAAH7RQ4M2M657MBL/action/replication_record"}},"created_at":"2026-05-20T00:05:48.658630+00:00","updated_at":"2026-05-20T00:05:48.658630+00:00"}