{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OBAHQ3FAOAMUHQRIAFSEG76PBZ","short_pith_number":"pith:OBAHQ3FA","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"},"canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","source":{"kind":"arxiv","id":"1101.1007","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1007","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1007v6","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1007","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"OBAHQ3FAOAMU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBAHQ3FAOAMUHQRI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBAHQ3FA","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OBAHQ3FAOAMUHQRIAFSEG76PBZ","target":"record","payload":{"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"},"canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","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"},"source_kind":"arxiv","source_id":"1101.1007","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QotAOIxpIQ2QGvFUy0YRaSxvtKGcmX82AhpmpXZAWEy/OFumQBpnoaUyAEa+aVBk/SJo1e9DZMNxj393Xc9uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:49:58.714266Z"},"content_sha256":"cf8d48fffd69d45c9db662eafc8eb297d4343fa466297c536745f261b2c867fd","schema_version":"1.0","event_id":"sha256:cf8d48fffd69d45c9db662eafc8eb297d4343fa466297c536745f261b2c867fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OBAHQ3FAOAMUHQRIAFSEG76PBZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEAVzpT3j8WFKiWbDgbZTlmwkRMfJPrVeOf64nb0P6J2oAxSDiHqju1tRjrJg1xj9CpaB1CMrGU1Fb6yYCC/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:49:58.715024Z"},"content_sha256":"d732ded41e790a3ada87f9e25facb2acdcaa3a25f37d21b49365b72010f5674a","schema_version":"1.0","event_id":"sha256:d732ded41e790a3ada87f9e25facb2acdcaa3a25f37d21b49365b72010f5674a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/bundle.json","state_url":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T06:49:58Z","links":{"resolver":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ","bundle":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/bundle.json","state":"https://pith.science/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBAHQ3FAOAMUHQRIAFSEG76PBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OBAHQ3FAOAMUHQRIAFSEG76PBZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"78f767306275283dc038361967063562e571bdca2d40c05d1aca305164352cd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-05T15:41:33Z","title_canon_sha256":"4dcc6de52b62e063573bec8c65c86e2ed5db6069941a704114223719c992f69c"},"schema_version":"1.0","source":{"id":"1101.1007","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1007","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1007v6","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1007","created_at":"2026-05-18T04:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"OBAHQ3FAOAMU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBAHQ3FAOAMUHQRI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBAHQ3FA","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:d732ded41e790a3ada87f9e25facb2acdcaa3a25f37d21b49365b72010f5674a","target":"graph","created_at":"2026-05-18T04:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bart de Keijzer, Haris Aziz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-05T15:41:33Z","title":"Complexity of coalition structure generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1007","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf8d48fffd69d45c9db662eafc8eb297d4343fa466297c536745f261b2c867fd","target":"record","created_at":"2026-05-18T04:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"78f767306275283dc038361967063562e571bdca2d40c05d1aca305164352cd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-05T15:41:33Z","title_canon_sha256":"4dcc6de52b62e063573bec8c65c86e2ed5db6069941a704114223719c992f69c"},"schema_version":"1.0","source":{"id":"1101.1007","kind":"arxiv","version":6}},"canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7040786ca0701943c2280164437fcf0e4f6db581cfea19818a1121d2a7839b9d","first_computed_at":"2026-05-18T04:19:43.449513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:43.449513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CWoBb+9FlWMyGq3l3h/OjFw8RWtJY8j/rxAnbHnWXvZQitzpYALHGReay0NoqZsRvTYUo9tNwjqaknbmDN2zCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:43.450139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1007","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf8d48fffd69d45c9db662eafc8eb297d4343fa466297c536745f261b2c867fd","sha256:d732ded41e790a3ada87f9e25facb2acdcaa3a25f37d21b49365b72010f5674a"],"state_sha256":"56dcdeedb13aa5885dbba717bc39a5f89e56e416a5cdec7f46a658a222dab02b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GhLnG/KPIprklDWVeVBrD+DlMEu7OHcbM2Uh1SDQMR3t8TLYLDky34fGEHnq8otXsn/Wx18PtYuaLDwYiLPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:49:58.719450Z","bundle_sha256":"1a9e819f58455d851790e5f1121b2b5903f316db5ca7860633ec60b2d6b0dbf6"}}