{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6ESW3PMH4AR4VMCJ3JNXICCXWK","short_pith_number":"pith:6ESW3PMH","canonical_record":{"source":{"id":"1103.1157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-06T18:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"6fa26b016658a5c04da6bcccaf32977fe3db312e8cca02ffebd7aa812b23bfb5","abstract_canon_sha256":"fe7aab1a5c6c9aa206aeb189bebfde293384787fec03dc21fb0cf0d4f10c0435"},"schema_version":"1.0"},"canonical_sha256":"f1256dbd87e023cab049da5b740857b287b2216b980186d17794ad5c6e7e595b","source":{"kind":"arxiv","id":"1103.1157","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1157","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1157v2","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1157","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"6ESW3PMH4AR4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6ESW3PMH4AR4VMCJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6ESW3PMH","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6ESW3PMH4AR4VMCJ3JNXICCXWK","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-06T18:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"6fa26b016658a5c04da6bcccaf32977fe3db312e8cca02ffebd7aa812b23bfb5","abstract_canon_sha256":"fe7aab1a5c6c9aa206aeb189bebfde293384787fec03dc21fb0cf0d4f10c0435"},"schema_version":"1.0"},"canonical_sha256":"f1256dbd87e023cab049da5b740857b287b2216b980186d17794ad5c6e7e595b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:06.159984Z","signature_b64":"92ZvlqnOqosIPG5XpjY6uVPruUIowsZet2pMHe7ucNX+BrE2ByyBb1ILulDeBiTll1WPZeuyaUqzkK7VKPXfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1256dbd87e023cab049da5b740857b287b2216b980186d17794ad5c6e7e595b","last_reissued_at":"2026-05-18T04:27:06.159208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:06.159208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1157","source_version":2,"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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2C+D8C6jiUpGJnDhoGPTDEHtq/4cDsWV8fr/hkeIb3h9LQNp/1Fk0tbqNibJtWlrmbZhy6ZTF+K/pK7/ipVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:03:14.970162Z"},"content_sha256":"f8819bd8d8f87522eeff817ed3bf52d554bbfe85f45e5d97d7e0ab779dab0a3a","schema_version":"1.0","event_id":"sha256:f8819bd8d8f87522eeff817ed3bf52d554bbfe85f45e5d97d7e0ab779dab0a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6ESW3PMH4AR4VMCJ3JNXICCXWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GRASP and path-relinking for Coalition Structure Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Floriana Esposito, Nicola Di Mauro, Stefano Ferilli, Teresa M.A. Basile","submitted_at":"2011-03-06T18:54:04Z","abstract_excerpt":"In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a social welfare, of a set of entities involved in a system into exhaustive and disjoint coalitions. The solution of the CSG problem finds applications in many fields such as Machine Learning (covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation), Semantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1157","kind":"arxiv","version":2},"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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/XSm7bfgELN0gMCt3KGNicKS3VHFkEBAfqALh0Wxl+4d5S/bsCFYULbev94em+jLFlHa/Pymc8bR3ccg4lfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:03:14.970810Z"},"content_sha256":"147fc0cbd67f3370444f4bf30a48a31113973c1fb9766e9510da264b154c4792","schema_version":"1.0","event_id":"sha256:147fc0cbd67f3370444f4bf30a48a31113973c1fb9766e9510da264b154c4792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/bundle.json","state_url":"https://pith.science/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/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-27T10:03:14Z","links":{"resolver":"https://pith.science/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK","bundle":"https://pith.science/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/bundle.json","state":"https://pith.science/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ESW3PMH4AR4VMCJ3JNXICCXWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6ESW3PMH4AR4VMCJ3JNXICCXWK","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":"fe7aab1a5c6c9aa206aeb189bebfde293384787fec03dc21fb0cf0d4f10c0435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-06T18:54:04Z","title_canon_sha256":"6fa26b016658a5c04da6bcccaf32977fe3db312e8cca02ffebd7aa812b23bfb5"},"schema_version":"1.0","source":{"id":"1103.1157","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1157","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1157v2","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1157","created_at":"2026-05-18T04:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"6ESW3PMH4AR4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6ESW3PMH4AR4VMCJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6ESW3PMH","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:147fc0cbd67f3370444f4bf30a48a31113973c1fb9766e9510da264b154c4792","target":"graph","created_at":"2026-05-18T04:27:06Z","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":"In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a social welfare, of a set of entities involved in a system into exhaustive and disjoint coalitions. The solution of the CSG problem finds applications in many fields such as Machine Learning (covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation), Semantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition ","authors_text":"Floriana Esposito, Nicola Di Mauro, Stefano Ferilli, Teresa M.A. Basile","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-06T18:54:04Z","title":"GRASP and path-relinking for Coalition Structure Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1157","kind":"arxiv","version":2},"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:f8819bd8d8f87522eeff817ed3bf52d554bbfe85f45e5d97d7e0ab779dab0a3a","target":"record","created_at":"2026-05-18T04:27:06Z","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":"fe7aab1a5c6c9aa206aeb189bebfde293384787fec03dc21fb0cf0d4f10c0435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-03-06T18:54:04Z","title_canon_sha256":"6fa26b016658a5c04da6bcccaf32977fe3db312e8cca02ffebd7aa812b23bfb5"},"schema_version":"1.0","source":{"id":"1103.1157","kind":"arxiv","version":2}},"canonical_sha256":"f1256dbd87e023cab049da5b740857b287b2216b980186d17794ad5c6e7e595b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1256dbd87e023cab049da5b740857b287b2216b980186d17794ad5c6e7e595b","first_computed_at":"2026-05-18T04:27:06.159208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:06.159208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"92ZvlqnOqosIPG5XpjY6uVPruUIowsZet2pMHe7ucNX+BrE2ByyBb1ILulDeBiTll1WPZeuyaUqzkK7VKPXfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:06.159984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1157","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8819bd8d8f87522eeff817ed3bf52d554bbfe85f45e5d97d7e0ab779dab0a3a","sha256:147fc0cbd67f3370444f4bf30a48a31113973c1fb9766e9510da264b154c4792"],"state_sha256":"adaf5c52d2a711409bf741d5458b46f4086f0a6614d5eb64f188f3e70f17fe8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aySyTiMzdPSRsFsnkrlcP7fo5foezVpfY0Pdl5s76htd91i+Tgtgh775Dz0KaMUCmCny5dGpXCXKVKu2toHYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:03:14.977359Z","bundle_sha256":"18e9e82ec85061f39c1830d602ab08a541733f10446430ad91f939465d65c80a"}}