{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YOMB6KJ6VXLZ2NFFMDX2RE2ZKC","short_pith_number":"pith:YOMB6KJ6","schema_version":"1.0","canonical_sha256":"c3981f293eadd79d34a560efa8935950be86ce3e834df69f90d045b9a6237a38","source":{"kind":"arxiv","id":"1108.5248","version":2},"attestation_state":"computed","paper":{"title":"Optimal Coalition Structures in Cooperative Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Morteza Zadimoghaddam, Pushmeet Kohli, Vladimir Kolmogorov, Yoram Bachrach","submitted_at":"2011-08-26T06:24:53Z","abstract_excerpt":"Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inherent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple yet expressive Weighted Graph Games (WGGs) representation [14], which maintains knowledge about synergies between agents in the form of an edge weighted graph.\n  We consider the problem of finding the optimal coalition structure in WGGs. The agents in such games are vertices in a"},"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":"1108.5248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-08-26T06:24:53Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"981bfe68b8387361c41ef1a861384777d4dd43537b18728cb2ddd76872edebab","abstract_canon_sha256":"da7896262d4a2fea617578027764064445060e7d71f200a73bf0da8813fb8318"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:37.055302Z","signature_b64":"3fRUZG4apZyWmWgu9iJ/DYow53tM2Saen8T3npYusU6A1nLylEHBXF87yu8d9Buc/lcsGvDtKSFZ7of83sjSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3981f293eadd79d34a560efa8935950be86ce3e834df69f90d045b9a6237a38","last_reissued_at":"2026-05-18T02:21:37.054785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:37.054785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Coalition Structures in Cooperative Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Morteza Zadimoghaddam, Pushmeet Kohli, Vladimir Kolmogorov, Yoram Bachrach","submitted_at":"2011-08-26T06:24:53Z","abstract_excerpt":"Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inherent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple yet expressive Weighted Graph Games (WGGs) representation [14], which maintains knowledge about synergies between agents in the form of an edge weighted graph.\n  We consider the problem of finding the optimal coalition structure in WGGs. The agents in such games are vertices in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5248","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":""},"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":"1108.5248","created_at":"2026-05-18T02:21:37.054866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5248v2","created_at":"2026-05-18T02:21:37.054866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5248","created_at":"2026-05-18T02:21:37.054866+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOMB6KJ6VXLZ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOMB6KJ6VXLZ2NFF","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOMB6KJ6","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02354","citing_title":"Compound Attrition Games: A Unified Model for Inter- and Intra-Coalition Rivalry","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC","json":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC.json","graph_json":"https://pith.science/api/pith-number/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/graph.json","events_json":"https://pith.science/api/pith-number/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/events.json","paper":"https://pith.science/paper/YOMB6KJ6"},"agent_actions":{"view_html":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC","download_json":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC.json","view_paper":"https://pith.science/paper/YOMB6KJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5248&json=true","fetch_graph":"https://pith.science/api/pith-number/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/graph.json","fetch_events":"https://pith.science/api/pith-number/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/action/storage_attestation","attest_author":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/action/author_attestation","sign_citation":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/action/citation_signature","submit_replication":"https://pith.science/pith/YOMB6KJ6VXLZ2NFFMDX2RE2ZKC/action/replication_record"}},"created_at":"2026-05-18T02:21:37.054866+00:00","updated_at":"2026-05-18T02:21:37.054866+00:00"}