{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HKHR2J3AOI6AZFBYLN4ROJYFAA","short_pith_number":"pith:HKHR2J3A","canonical_record":{"source":{"id":"1102.1747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:13:58Z","cross_cats_sorted":["cs.AI","cs.CC","cs.GT","cs.MA"],"title_canon_sha256":"73f648144e799e533c6751d77bb5e1f14a414c55b6e525f94c4c8c6c01949e8f","abstract_canon_sha256":"ec18a661ce1e2f13772bab56ce254ddcc7553adbb7763b7c655ffbcb223299b8"},"schema_version":"1.0"},"canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","source":{"kind":"arxiv","id":"1102.1747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1747","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1747v1","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1747","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"HKHR2J3AOI6A","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKHR2J3AOI6AZFBY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKHR2J3A","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HKHR2J3AOI6AZFBYLN4ROJYFAA","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:13:58Z","cross_cats_sorted":["cs.AI","cs.CC","cs.GT","cs.MA"],"title_canon_sha256":"73f648144e799e533c6751d77bb5e1f14a414c55b6e525f94c4c8c6c01949e8f","abstract_canon_sha256":"ec18a661ce1e2f13772bab56ce254ddcc7553adbb7763b7c655ffbcb223299b8"},"schema_version":"1.0"},"canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.235193Z","signature_b64":"ehC3sjf2aZYV3Kbve1G4X7DGKGSCNHCCwkZRVjsuOwLhW+qqLYVNK46B0CUlMYPlUQthVQq4BN0SBzX/9OQNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","last_reissued_at":"2026-05-18T04:29:44.234579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.234579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1747","source_version":1,"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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F7qgDUnbT7ESgxc9YGOJM6+O/h1em49bcAF/5ZfiNZvXpuG/6JGquMGEf6Nw3udwMI/vcIT/GylEWn6H6xRxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:19:44.246534Z"},"content_sha256":"56d08aec8dd4201febdd6f55a0c0e2bff2c29a00a2e9fb3f4b11a2dd163d95db","schema_version":"1.0","event_id":"sha256:56d08aec8dd4201febdd6f55a0c0e2bff2c29a00a2e9fb3f4b11a2dd163d95db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HKHR2J3AOI6AZFBYLN4ROJYFAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Coalition Structure Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.GT","cs.MA"],"primary_cat":"cs.DS","authors_text":"Maria Polukarov, Nicholas R. Jennings, Thomas D. Voice","submitted_at":"2011-02-08T23:13:58Z","abstract_excerpt":"We give the first analysis of the computational complexity of {\\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\\rightarrow\\RR$ over the subsets of nodes, the problem is to find a partition of $N$ into connected subsets, that maximises the sum of the components' values. This problem is generally NP--complete; in particular, it is hard for a defined class of valuation functions which are {\\it independent of disconnected members}---that is, two nodes have no effect on each other's marginal contribution to their vertex separator. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1747","kind":"arxiv","version":1},"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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OW+EIQAi3NMF1p7w/JEecNK0SrhJ9FqUgjzesk1ndRyvaDgOCNcYRF47uY5NJsx4rrGvkOi1hhe0BRWjR/gSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:19:44.247222Z"},"content_sha256":"65772cf3ca0bc9173ba4006f7afa72013bf5bde55c28bc77023baf5620dcd4e4","schema_version":"1.0","event_id":"sha256:65772cf3ca0bc9173ba4006f7afa72013bf5bde55c28bc77023baf5620dcd4e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/bundle.json","state_url":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/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-27T10:19:44Z","links":{"resolver":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA","bundle":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/bundle.json","state":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HKHR2J3AOI6AZFBYLN4ROJYFAA","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":"ec18a661ce1e2f13772bab56ce254ddcc7553adbb7763b7c655ffbcb223299b8","cross_cats_sorted":["cs.AI","cs.CC","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:13:58Z","title_canon_sha256":"73f648144e799e533c6751d77bb5e1f14a414c55b6e525f94c4c8c6c01949e8f"},"schema_version":"1.0","source":{"id":"1102.1747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1747","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1747v1","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1747","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"HKHR2J3AOI6A","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HKHR2J3AOI6AZFBY","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HKHR2J3A","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:65772cf3ca0bc9173ba4006f7afa72013bf5bde55c28bc77023baf5620dcd4e4","target":"graph","created_at":"2026-05-18T04:29:44Z","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 give the first analysis of the computational complexity of {\\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\\rightarrow\\RR$ over the subsets of nodes, the problem is to find a partition of $N$ into connected subsets, that maximises the sum of the components' values. This problem is generally NP--complete; in particular, it is hard for a defined class of valuation functions which are {\\it independent of disconnected members}---that is, two nodes have no effect on each other's marginal contribution to their vertex separator. ","authors_text":"Maria Polukarov, Nicholas R. Jennings, Thomas D. Voice","cross_cats":["cs.AI","cs.CC","cs.GT","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:13:58Z","title":"Graph Coalition Structure Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1747","kind":"arxiv","version":1},"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:56d08aec8dd4201febdd6f55a0c0e2bff2c29a00a2e9fb3f4b11a2dd163d95db","target":"record","created_at":"2026-05-18T04:29:44Z","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":"ec18a661ce1e2f13772bab56ce254ddcc7553adbb7763b7c655ffbcb223299b8","cross_cats_sorted":["cs.AI","cs.CC","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-08T23:13:58Z","title_canon_sha256":"73f648144e799e533c6751d77bb5e1f14a414c55b6e525f94c4c8c6c01949e8f"},"schema_version":"1.0","source":{"id":"1102.1747","kind":"arxiv","version":1}},"canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","first_computed_at":"2026-05-18T04:29:44.234579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:44.234579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehC3sjf2aZYV3Kbve1G4X7DGKGSCNHCCwkZRVjsuOwLhW+qqLYVNK46B0CUlMYPlUQthVQq4BN0SBzX/9OQNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:44.235193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56d08aec8dd4201febdd6f55a0c0e2bff2c29a00a2e9fb3f4b11a2dd163d95db","sha256:65772cf3ca0bc9173ba4006f7afa72013bf5bde55c28bc77023baf5620dcd4e4"],"state_sha256":"6ecccc2dcdc6fae3f3a780eaf9b87e74185a507bb518a8501d70da37e7dd3da5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCP72ukKGWfDJ9ptEmGO01YMKmhlcTz0lbV0BJt8Ulv9fHZJrb5ge5QfFIVajJzSpg4FGvsGkTC6l3iWp7duDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:19:44.251493Z","bundle_sha256":"58c89db76ffdd372a87b5bfbea109da0ec7793904588f86f3617cec25f59a718"}}