{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HXLR3PAOCBCI5TE2XMJILB5UOP","short_pith_number":"pith:HXLR3PAO","canonical_record":{"source":{"id":"1310.6704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-10-24T18:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"bdef929ef8d890d8c35a821742cba11c661b85c8f9c1a49f7a8a5e3858fa702c","abstract_canon_sha256":"e7cbbf43224d0bcea7a9d0ce8b51cd97efc48de78b7dd4f034d9f619fc928c45"},"schema_version":"1.0"},"canonical_sha256":"3dd71dbc0e10448ecc9abb128587b473df8351879899eba7e7f0baadb86cad41","source":{"kind":"arxiv","id":"1310.6704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6704","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6704v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6704","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"HXLR3PAOCBCI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HXLR3PAOCBCI5TE2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HXLR3PAO","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HXLR3PAOCBCI5TE2XMJILB5UOP","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-10-24T18:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"bdef929ef8d890d8c35a821742cba11c661b85c8f9c1a49f7a8a5e3858fa702c","abstract_canon_sha256":"e7cbbf43224d0bcea7a9d0ce8b51cd97efc48de78b7dd4f034d9f619fc928c45"},"schema_version":"1.0"},"canonical_sha256":"3dd71dbc0e10448ecc9abb128587b473df8351879899eba7e7f0baadb86cad41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.379544Z","signature_b64":"epgoVxm8wFeCROq2v9DisIdvRcFnfY1HZvl1uwXBBV5nE6VfXr8G34oJix8WAyow+Bzykl5ekMvVcgY5P/JPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd71dbc0e10448ecc9abb128587b473df8351879899eba7e7f0baadb86cad41","last_reissued_at":"2026-05-18T03:09:00.378794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.378794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6704","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-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQOcVo113UJE+OugKFkfyuo0zW05SksS7kuBDS7WYNDYdRUqnkqT12d1tiaeYFgIQ015MP+6eR8Q+NouJNSJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:52.861721Z"},"content_sha256":"9d6eb2cbc7e191556ecd208ab2f5b9bc5ac312ae709e1744d06de1d995bee384","schema_version":"1.0","event_id":"sha256:9d6eb2cbc7e191556ecd208ab2f5b9bc5ac312ae709e1744d06de1d995bee384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HXLR3PAOCBCI5TE2XMJILB5UOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hierarchical Dynamic Programming Algorithm for Optimal Coalition Structure Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Meritxell Vinyals, Nicholas R. Jennings, Sarvapali Ramchurn, Thomas Voice","submitted_at":"2013-10-24T18:49:31Z","abstract_excerpt":"We present a new Dynamic Programming (DP) formulation of the Coalition Structure Generation (CSG) problem based on imposing a hierarchical organizational structure over the agents. We show the efficiency of this formulation by deriving DyPE, a new optimal DP algorithm which significantly outperforms current DP approaches in speed and memory usage. In the classic case, in which all coalitions are feasible, DyPE has half the memory requirements of other DP approaches. On graph-restricted CSG, in which feasibility is restricted by a (synergy) graph, DyPE has either the same or lower computational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6704","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-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdH5J/s9EmKaebJMPlHFbgCFeCaI51zmqvh02ap7cmL+c2iNetexm0atLy9cWmG3W5i8RuBR4a9bIzEPji7KDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:52.862366Z"},"content_sha256":"dcb5838dafc51b492ec17154991f532080d21adfcfaf437311c787c982919df3","schema_version":"1.0","event_id":"sha256:dcb5838dafc51b492ec17154991f532080d21adfcfaf437311c787c982919df3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/bundle.json","state_url":"https://pith.science/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/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-25T20:08:52Z","links":{"resolver":"https://pith.science/pith/HXLR3PAOCBCI5TE2XMJILB5UOP","bundle":"https://pith.science/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/bundle.json","state":"https://pith.science/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXLR3PAOCBCI5TE2XMJILB5UOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HXLR3PAOCBCI5TE2XMJILB5UOP","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":"e7cbbf43224d0bcea7a9d0ce8b51cd97efc48de78b7dd4f034d9f619fc928c45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-10-24T18:49:31Z","title_canon_sha256":"bdef929ef8d890d8c35a821742cba11c661b85c8f9c1a49f7a8a5e3858fa702c"},"schema_version":"1.0","source":{"id":"1310.6704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6704","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6704v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6704","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"HXLR3PAOCBCI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HXLR3PAOCBCI5TE2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HXLR3PAO","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:dcb5838dafc51b492ec17154991f532080d21adfcfaf437311c787c982919df3","target":"graph","created_at":"2026-05-18T03:09:00Z","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 present a new Dynamic Programming (DP) formulation of the Coalition Structure Generation (CSG) problem based on imposing a hierarchical organizational structure over the agents. We show the efficiency of this formulation by deriving DyPE, a new optimal DP algorithm which significantly outperforms current DP approaches in speed and memory usage. In the classic case, in which all coalitions are feasible, DyPE has half the memory requirements of other DP approaches. On graph-restricted CSG, in which feasibility is restricted by a (synergy) graph, DyPE has either the same or lower computational","authors_text":"Meritxell Vinyals, Nicholas R. Jennings, Sarvapali Ramchurn, Thomas Voice","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-10-24T18:49:31Z","title":"A Hierarchical Dynamic Programming Algorithm for Optimal Coalition Structure Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6704","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:9d6eb2cbc7e191556ecd208ab2f5b9bc5ac312ae709e1744d06de1d995bee384","target":"record","created_at":"2026-05-18T03:09:00Z","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":"e7cbbf43224d0bcea7a9d0ce8b51cd97efc48de78b7dd4f034d9f619fc928c45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-10-24T18:49:31Z","title_canon_sha256":"bdef929ef8d890d8c35a821742cba11c661b85c8f9c1a49f7a8a5e3858fa702c"},"schema_version":"1.0","source":{"id":"1310.6704","kind":"arxiv","version":1}},"canonical_sha256":"3dd71dbc0e10448ecc9abb128587b473df8351879899eba7e7f0baadb86cad41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dd71dbc0e10448ecc9abb128587b473df8351879899eba7e7f0baadb86cad41","first_computed_at":"2026-05-18T03:09:00.378794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.378794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"epgoVxm8wFeCROq2v9DisIdvRcFnfY1HZvl1uwXBBV5nE6VfXr8G34oJix8WAyow+Bzykl5ekMvVcgY5P/JPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.379544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d6eb2cbc7e191556ecd208ab2f5b9bc5ac312ae709e1744d06de1d995bee384","sha256:dcb5838dafc51b492ec17154991f532080d21adfcfaf437311c787c982919df3"],"state_sha256":"1a46e547acf094ce56157f9e962bce52c0405c37603925c13631d9f8c6f96682"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GifCrzLuUliLqkndo6JUVTBJ9uCd8W+tMmb2YjRzq7eywsn6Ab7EF6myKR5ZPYsChVcpaEoSDavgnr5pYFwRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:08:52.865794Z","bundle_sha256":"2757ea88cbfc3a6063a75b1dff7ec0eb89052a8af6b39b11d0a549ccd9f0dfc7"}}