{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OBAHQ3FAOAMUHQRIAFSEG76PBZ","short_pith_number":"pith:OBAHQ3FA","schema_version":"1.0","canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","source":{"kind":"arxiv","id":"1101.1007","version":6},"attestation_state":"computed","paper":{"title":"Complexity of coalition structure generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Bart de Keijzer, Haris Aziz","submitted_at":"2011-01-05T15:41:33Z","abstract_excerpt":"We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types is bounded by a constant. As a corollary, we obtain a polynomial-time algorithm to compute an optimal partition for weighted voting games with a constant number of weight values and for coalitional skill games with a constant number of skills. W"},"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":"1101.1007","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-05T15:41:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4dcc6de52b62e063573bec8c65c86e2ed5db6069941a704114223719c992f69c","abstract_canon_sha256":"78f767306275283dc038361967063562e571bdca2d40c05d1aca305164352cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:43.450139Z","signature_b64":"CWoBb+9FlWMyGq3l3h/OjFw8RWtJY8j/rxAnbHnWXvZQitzpYALHGReay0NoqZsRvTYUo9tNwjqaknbmDN2zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","last_reissued_at":"2026-05-18T04:19:43.449513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:43.449513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of coalition structure generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Bart de Keijzer, Haris Aziz","submitted_at":"2011-01-05T15:41:33Z","abstract_excerpt":"We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types is bounded by a constant. As a corollary, we obtain a polynomial-time algorithm to compute an optimal partition for weighted voting games with a constant number of weight values and for coalitional skill games with a constant number of skills. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1007","kind":"arxiv","version":6},"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":"1101.1007","created_at":"2026-05-18T04:19:43.449592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1007v6","created_at":"2026-05-18T04:19:43.449592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1007","created_at":"2026-05-18T04:19:43.449592+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBAHQ3FAOAMU","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBAHQ3FAOAMUHQRI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBAHQ3FA","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.14066","citing_title":"A Benchmark for Multi-Party Negotiation Games from Real Negotiation Data","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ","json":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ.json","graph_json":"https://pith.science/api/pith-number/OBAHQ3FAOAMUHQRIAFSEG76PBZ/graph.json","events_json":"https://pith.science/api/pith-number/OBAHQ3FAOAMUHQRIAFSEG76PBZ/events.json","paper":"https://pith.science/paper/OBAHQ3FA"},"agent_actions":{"view_html":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ","download_json":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ.json","view_paper":"https://pith.science/paper/OBAHQ3FA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1007&json=true","fetch_graph":"https://pith.science/api/pith-number/OBAHQ3FAOAMUHQRIAFSEG76PBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OBAHQ3FAOAMUHQRIAFSEG76PBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/action/storage_attestation","attest_author":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/action/author_attestation","sign_citation":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/action/citation_signature","submit_replication":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/action/replication_record"}},"created_at":"2026-05-18T04:19:43.449592+00:00","updated_at":"2026-05-18T04:19:43.449592+00:00"}