{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O3GGWWVS3ZAFQPA7SQQSHOZXJ5","short_pith_number":"pith:O3GGWWVS","canonical_record":{"source":{"id":"1005.4540","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-25T11:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"5658bc2031d03510457e99511112faaa8cd8b958352ba229aafed5690efec596","abstract_canon_sha256":"cb928b56a51928ba858ab3617cdcd364a0603092ca28f99db2009de1aa9e4c2a"},"schema_version":"1.0"},"canonical_sha256":"76cc6b5ab2de40583c1f942123bb374f790892c9fcbc888d460c3befe77aac0a","source":{"kind":"arxiv","id":"1005.4540","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4540","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4540v3","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4540","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"O3GGWWVS3ZAF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3GGWWVS3ZAFQPA7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3GGWWVS","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O3GGWWVS3ZAFQPA7SQQSHOZXJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1005.4540","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-25T11:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"5658bc2031d03510457e99511112faaa8cd8b958352ba229aafed5690efec596","abstract_canon_sha256":"cb928b56a51928ba858ab3617cdcd364a0603092ca28f99db2009de1aa9e4c2a"},"schema_version":"1.0"},"canonical_sha256":"76cc6b5ab2de40583c1f942123bb374f790892c9fcbc888d460c3befe77aac0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:57.490414Z","signature_b64":"QhscDKOeV6j6sTjSNzAKoYc/Zt5nyzgqGLhPM56vHBpJz4Fhfu4y2M8iVWd4A4gXYh/Y2S6B+sg02eSl0vO3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76cc6b5ab2de40583c1f942123bb374f790892c9fcbc888d460c3befe77aac0a","last_reissued_at":"2026-05-18T02:27:57.489855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:57.489855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.4540","source_version":3,"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-18T02:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNfdFzcu6l91kiMxNe81vC20xhPGsuX0aeJbuMww+Y0jxCseZoELXNj0xwstH8+wlzeknRoso6J8Zn0aG2siDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:47:12.324721Z"},"content_sha256":"0ba11328ec51de06dbdc24cc1bec5b0e7da61b5c31fa1b5d1c05442205fa205c","schema_version":"1.0","event_id":"sha256:0ba11328ec51de06dbdc24cc1bec5b0e7da61b5c31fa1b5d1c05442205fa205c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O3GGWWVS3ZAFQPA7SQQSHOZXJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Partitions in Additively Separable Hedonic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Felix Brandt, Hans Georg Seedig, Haris Aziz","submitted_at":"2010-05-25T11:38:41Z","abstract_excerpt":"We conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be found in polynomial time while verifying whether a given partition is Pareto optimal is coNP-complete, even when preferences are symmetric and strict. Moreover, computing a partition with maximum egalitarian or utilitarian social welfare or one which is both Pareto optimal and individually rational is NP-hard. We also prove that checking whether there exists a partition which is both Pareto optimal and envy-free is $\\S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4540","kind":"arxiv","version":3},"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-18T02:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZI+HsdbIonRjLPyJK9dL6qNXRCqf6C0rnTfUJLGjWdhqhEn4NvU/YhWQgAYyK6gNKzZ93DF6qI9U1vF09LoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:47:12.325067Z"},"content_sha256":"e660d531d239a865b09e5a26651cc860a562d736ffe0e162db112fc52c61716d","schema_version":"1.0","event_id":"sha256:e660d531d239a865b09e5a26651cc860a562d736ffe0e162db112fc52c61716d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/bundle.json","state_url":"https://pith.science/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/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-05-28T06:47:12Z","links":{"resolver":"https://pith.science/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5","bundle":"https://pith.science/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/bundle.json","state":"https://pith.science/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3GGWWVS3ZAFQPA7SQQSHOZXJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O3GGWWVS3ZAFQPA7SQQSHOZXJ5","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":"cb928b56a51928ba858ab3617cdcd364a0603092ca28f99db2009de1aa9e4c2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-25T11:38:41Z","title_canon_sha256":"5658bc2031d03510457e99511112faaa8cd8b958352ba229aafed5690efec596"},"schema_version":"1.0","source":{"id":"1005.4540","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.4540","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"1005.4540v3","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4540","created_at":"2026-05-18T02:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"O3GGWWVS3ZAF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O3GGWWVS3ZAFQPA7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O3GGWWVS","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e660d531d239a865b09e5a26651cc860a562d736ffe0e162db112fc52c61716d","target":"graph","created_at":"2026-05-18T02:27:57Z","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 conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be found in polynomial time while verifying whether a given partition is Pareto optimal is coNP-complete, even when preferences are symmetric and strict. Moreover, computing a partition with maximum egalitarian or utilitarian social welfare or one which is both Pareto optimal and individually rational is NP-hard. We also prove that checking whether there exists a partition which is both Pareto optimal and envy-free is $\\S","authors_text":"Felix Brandt, Hans Georg Seedig, Haris Aziz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-25T11:38:41Z","title":"Optimal Partitions in Additively Separable Hedonic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4540","kind":"arxiv","version":3},"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:0ba11328ec51de06dbdc24cc1bec5b0e7da61b5c31fa1b5d1c05442205fa205c","target":"record","created_at":"2026-05-18T02:27:57Z","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":"cb928b56a51928ba858ab3617cdcd364a0603092ca28f99db2009de1aa9e4c2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-05-25T11:38:41Z","title_canon_sha256":"5658bc2031d03510457e99511112faaa8cd8b958352ba229aafed5690efec596"},"schema_version":"1.0","source":{"id":"1005.4540","kind":"arxiv","version":3}},"canonical_sha256":"76cc6b5ab2de40583c1f942123bb374f790892c9fcbc888d460c3befe77aac0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76cc6b5ab2de40583c1f942123bb374f790892c9fcbc888d460c3befe77aac0a","first_computed_at":"2026-05-18T02:27:57.489855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:57.489855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QhscDKOeV6j6sTjSNzAKoYc/Zt5nyzgqGLhPM56vHBpJz4Fhfu4y2M8iVWd4A4gXYh/Y2S6B+sg02eSl0vO3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:57.490414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.4540","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba11328ec51de06dbdc24cc1bec5b0e7da61b5c31fa1b5d1c05442205fa205c","sha256:e660d531d239a865b09e5a26651cc860a562d736ffe0e162db112fc52c61716d"],"state_sha256":"d7b31ff1b03a03cb82bac1ce1f9ec8e36e7d0ea7c86a9b3ed5fb8ddfe9e8b48d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAXQ1nZKrC8HW103kAYZRazA8Gi0HYFJd/8gdYkrIm8B7aWEEPhg4nBLQWHfJimJYsldASHmDY4RJ/uI+NaBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:47:12.327094Z","bundle_sha256":"4654f9a41a8d825dbd8d0ba05f93ce6ed5e4715b0e21dd0d378520cefd1b0949"}}