{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KSWWGR6B6I4WS32M4A4BKP2DJ6","short_pith_number":"pith:KSWWGR6B","canonical_record":{"source":{"id":"1311.5317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T06:24:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8f58563ea859ebb05347357dd6ad977b5d0b7d3b6a84e54750850d9720ab98e4","abstract_canon_sha256":"b1a86a93eff5c1ee0fcf08cdf1b9470fad3648bfe3c00e8d62f95c1fdfe62358"},"schema_version":"1.0"},"canonical_sha256":"54ad6347c1f239696f4ce038153f434f94bdfd00cd1a000774ab3a8efce9959b","source":{"kind":"arxiv","id":"1311.5317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5317","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5317v1","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5317","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"KSWWGR6B6I4W","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KSWWGR6B6I4WS32M","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KSWWGR6B","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KSWWGR6B6I4WS32M4A4BKP2DJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T06:24:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8f58563ea859ebb05347357dd6ad977b5d0b7d3b6a84e54750850d9720ab98e4","abstract_canon_sha256":"b1a86a93eff5c1ee0fcf08cdf1b9470fad3648bfe3c00e8d62f95c1fdfe62358"},"schema_version":"1.0"},"canonical_sha256":"54ad6347c1f239696f4ce038153f434f94bdfd00cd1a000774ab3a8efce9959b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:33.689613Z","signature_b64":"Tejw5N3MYxNPV7539/pWsNfER1w/7Qz2T+Xp2iJxQPuIa+cv2AyE3nw8XaehwpTkDHg8qUp1XnPwPlKn4ikkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ad6347c1f239696f4ce038153f434f94bdfd00cd1a000774ab3a8efce9959b","last_reissued_at":"2026-05-18T03:06:33.689048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:33.689048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5317","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:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRW8Swa8D/GLdDBLKb6W9oC1k6K698yAFF500b3KExC8ZfxhhsAxq6VJVoRaYHvTggH/gWmWkaf1IyDgUWcZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:12:33.543308Z"},"content_sha256":"7fcbc8897a1d0f338c2e485f5e78fecc7c5daf57d56883153bb05774c92d9b30","schema_version":"1.0","event_id":"sha256:7fcbc8897a1d0f338c2e485f5e78fecc7c5daf57d56883153bb05774c92d9b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KSWWGR6B6I4WS32M4A4BKP2DJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Connectivity Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Keren Censor-Hillel, Mohsen Ghaffari","submitted_at":"2013-11-21T06:24:20Z","abstract_excerpt":"We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve information flow with size close to the connectivity by parallelizing it along the trees. More specifically, our distributed decomposition algorithms are as follows:\n  (I) A decomposition of each undirected graph with vertex-connectivity $k$ into (fractionally) vertex-disjoint weighted dominating trees with total weight $\\Omega(\\frac{k}{\\log n})$, in $\\wide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5317","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:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBqhX+boa868cEGVSrCWh+o5MGujmXMqLDpqQBxRXEydJj8n2bcW1A30DNECe3b3KHWkKtyH6biPWB4DirZ4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:12:33.543715Z"},"content_sha256":"77f660f0df9c64f8543b127fe99a217531cda84144772660ed868f04b6b46c48","schema_version":"1.0","event_id":"sha256:77f660f0df9c64f8543b127fe99a217531cda84144772660ed868f04b6b46c48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/bundle.json","state_url":"https://pith.science/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/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-26T11:12:33Z","links":{"resolver":"https://pith.science/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6","bundle":"https://pith.science/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/bundle.json","state":"https://pith.science/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSWWGR6B6I4WS32M4A4BKP2DJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KSWWGR6B6I4WS32M4A4BKP2DJ6","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":"b1a86a93eff5c1ee0fcf08cdf1b9470fad3648bfe3c00e8d62f95c1fdfe62358","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T06:24:20Z","title_canon_sha256":"8f58563ea859ebb05347357dd6ad977b5d0b7d3b6a84e54750850d9720ab98e4"},"schema_version":"1.0","source":{"id":"1311.5317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5317","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5317v1","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5317","created_at":"2026-05-18T03:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"KSWWGR6B6I4W","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KSWWGR6B6I4WS32M","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KSWWGR6B","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:77f660f0df9c64f8543b127fe99a217531cda84144772660ed868f04b6b46c48","target":"graph","created_at":"2026-05-18T03:06:33Z","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 time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve information flow with size close to the connectivity by parallelizing it along the trees. More specifically, our distributed decomposition algorithms are as follows:\n  (I) A decomposition of each undirected graph with vertex-connectivity $k$ into (fractionally) vertex-disjoint weighted dominating trees with total weight $\\Omega(\\frac{k}{\\log n})$, in $\\wide","authors_text":"Fabian Kuhn, Keren Censor-Hillel, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T06:24:20Z","title":"Distributed Connectivity Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5317","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:7fcbc8897a1d0f338c2e485f5e78fecc7c5daf57d56883153bb05774c92d9b30","target":"record","created_at":"2026-05-18T03:06:33Z","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":"b1a86a93eff5c1ee0fcf08cdf1b9470fad3648bfe3c00e8d62f95c1fdfe62358","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-21T06:24:20Z","title_canon_sha256":"8f58563ea859ebb05347357dd6ad977b5d0b7d3b6a84e54750850d9720ab98e4"},"schema_version":"1.0","source":{"id":"1311.5317","kind":"arxiv","version":1}},"canonical_sha256":"54ad6347c1f239696f4ce038153f434f94bdfd00cd1a000774ab3a8efce9959b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ad6347c1f239696f4ce038153f434f94bdfd00cd1a000774ab3a8efce9959b","first_computed_at":"2026-05-18T03:06:33.689048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:33.689048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tejw5N3MYxNPV7539/pWsNfER1w/7Qz2T+Xp2iJxQPuIa+cv2AyE3nw8XaehwpTkDHg8qUp1XnPwPlKn4ikkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:33.689613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fcbc8897a1d0f338c2e485f5e78fecc7c5daf57d56883153bb05774c92d9b30","sha256:77f660f0df9c64f8543b127fe99a217531cda84144772660ed868f04b6b46c48"],"state_sha256":"e9a1dfa316b624aef28e22ce52605dd73093c6fa4bac28356ebdf49b6a81da71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAT/Z+AUFafzXW3XyZaZFWnjAjfy7IzOKqMIJZeDzmPgWSYWmIqymwNAhu8cNG7NR7ZV5VFCnGhVl8yd4Tm2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:12:33.546553Z","bundle_sha256":"2ce4d8f8d839a335d1315ea48eeda5d8d8ddc9f2b128c5b1985fb7a7daf2fa0f"}}