{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HKHR2J3AOI6AZFBYLN4ROJYFAA","short_pith_number":"pith:HKHR2J3A","schema_version":"1.0","canonical_sha256":"3a8f1d2760723c0c94385b79172705002e9f806517d88abdd9109765a5c56de9","source":{"kind":"arxiv","id":"1102.1747","version":1},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.1747","created_at":"2026-05-18T04:29:44.234672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1747v1","created_at":"2026-05-18T04:29:44.234672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1747","created_at":"2026-05-18T04:29:44.234672+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKHR2J3AOI6A","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKHR2J3AOI6AZFBY","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKHR2J3A","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA","json":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA.json","graph_json":"https://pith.science/api/pith-number/HKHR2J3AOI6AZFBYLN4ROJYFAA/graph.json","events_json":"https://pith.science/api/pith-number/HKHR2J3AOI6AZFBYLN4ROJYFAA/events.json","paper":"https://pith.science/paper/HKHR2J3A"},"agent_actions":{"view_html":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA","download_json":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA.json","view_paper":"https://pith.science/paper/HKHR2J3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1747&json=true","fetch_graph":"https://pith.science/api/pith-number/HKHR2J3AOI6AZFBYLN4ROJYFAA/graph.json","fetch_events":"https://pith.science/api/pith-number/HKHR2J3AOI6AZFBYLN4ROJYFAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/action/storage_attestation","attest_author":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/action/author_attestation","sign_citation":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/action/citation_signature","submit_replication":"https://pith.science/pith/HKHR2J3AOI6AZFBYLN4ROJYFAA/action/replication_record"}},"created_at":"2026-05-18T04:29:44.234672+00:00","updated_at":"2026-05-18T04:29:44.234672+00:00"}