{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:X7JKCCYPFBUIREYCMBH6KIOMG2","short_pith_number":"pith:X7JKCCYP","canonical_record":{"source":{"id":"1505.05697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-21T12:22:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"355573bd1701031181805828f5d69e555fef3bcf1df419c52c62404cf1fad317","abstract_canon_sha256":"bf50187494d069c3bfcb0f904eede54ce2f1f3fe0dfae9950ea4ae902c6b506a"},"schema_version":"1.0"},"canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","source":{"kind":"arxiv","id":"1505.05697","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05697","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05697v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05697","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"X7JKCCYPFBUI","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"X7JKCCYPFBUIREYC","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"X7JKCCYP","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:X7JKCCYPFBUIREYCMBH6KIOMG2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-21T12:22:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"355573bd1701031181805828f5d69e555fef3bcf1df419c52c62404cf1fad317","abstract_canon_sha256":"bf50187494d069c3bfcb0f904eede54ce2f1f3fe0dfae9950ea4ae902c6b506a"},"schema_version":"1.0"},"canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.389712Z","signature_b64":"swOiQ5WLlLAJOTvBr1d8moNIuvABrdkvBRo9WgvGTNtpS8GVBQxA/3igZjg0hP44e7G/uAonhR+ik5Ni1nQpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","last_reissued_at":"2026-05-18T00:47:59.389182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.389182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05697","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-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELgROhTtctO2ltBD/pTHGrGD3GlPrfer4IdGe/1O75lJsVBzHcpLVAeJnWi1t9vjEvTHKAf2slYCAm/qyWIMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:43.956638Z"},"content_sha256":"7d669a7282276ac5a6d271d02adf8a55c7644c6d4cebf7f0f96ecbd3631abe5f","schema_version":"1.0","event_id":"sha256:7d669a7282276ac5a6d271d02adf8a55c7644c6d4cebf7f0f96ecbd3631abe5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:X7JKCCYPFBUIREYCMBH6KIOMG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Cyril Gavoille, Leonid Barenboim, Michael Elkin","submitted_at":"2015-05-21T12:22:07Z","abstract_excerpt":"A partition $(C_1,C_2,...,C_q)$ of $G = (V,E)$ into clusters of strong (respectively, weak) diameter $d$, such that the supergraph obtained by contracting each $C_i$ is $\\ell$-colorable is called a strong (resp., weak) $(d, \\ell)$-network-decomposition. Network-decompositions were introduced in a seminal paper by Awerbuch, Goldberg, Luby and Plotkin in 1989. Awerbuch et al. showed that strong $(exp\\{O(\\sqrt{ \\log n \\log \\log n})\\}, exp\\{O(\\sqrt{ \\log n \\log \\log n})\\})$-network-decompositions can be computed in distributed deterministic time $exp\\{O(\\sqrt{ \\log n \\log \\log n})\\}$.\n  The result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05697","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-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4kO5DhfCdRJWCB5L2N1/oa+UH9tRFesSakhmBEX0LVXEcqFqJYIv2RshZGwmXxN4wy5X5ZcW2dBE6Or2S9vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:43.956976Z"},"content_sha256":"a044fba441ed08a6e3f5aac4c3835111ec9506dd4a55fa7ceb2ab511cb42e93c","schema_version":"1.0","event_id":"sha256:a044fba441ed08a6e3f5aac4c3835111ec9506dd4a55fa7ceb2ab511cb42e93c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/bundle.json","state_url":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/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-01T19:00:43Z","links":{"resolver":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2","bundle":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/bundle.json","state":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:X7JKCCYPFBUIREYCMBH6KIOMG2","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":"bf50187494d069c3bfcb0f904eede54ce2f1f3fe0dfae9950ea4ae902c6b506a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-21T12:22:07Z","title_canon_sha256":"355573bd1701031181805828f5d69e555fef3bcf1df419c52c62404cf1fad317"},"schema_version":"1.0","source":{"id":"1505.05697","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05697","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05697v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05697","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"X7JKCCYPFBUI","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"X7JKCCYPFBUIREYC","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"X7JKCCYP","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:a044fba441ed08a6e3f5aac4c3835111ec9506dd4a55fa7ceb2ab511cb42e93c","target":"graph","created_at":"2026-05-18T00:47:59Z","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":"A partition $(C_1,C_2,...,C_q)$ of $G = (V,E)$ into clusters of strong (respectively, weak) diameter $d$, such that the supergraph obtained by contracting each $C_i$ is $\\ell$-colorable is called a strong (resp., weak) $(d, \\ell)$-network-decomposition. Network-decompositions were introduced in a seminal paper by Awerbuch, Goldberg, Luby and Plotkin in 1989. Awerbuch et al. showed that strong $(exp\\{O(\\sqrt{ \\log n \\log \\log n})\\}, exp\\{O(\\sqrt{ \\log n \\log \\log n})\\})$-network-decompositions can be computed in distributed deterministic time $exp\\{O(\\sqrt{ \\log n \\log \\log n})\\}$.\n  The result","authors_text":"Cyril Gavoille, Leonid Barenboim, Michael Elkin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-21T12:22:07Z","title":"A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05697","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:7d669a7282276ac5a6d271d02adf8a55c7644c6d4cebf7f0f96ecbd3631abe5f","target":"record","created_at":"2026-05-18T00:47:59Z","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":"bf50187494d069c3bfcb0f904eede54ce2f1f3fe0dfae9950ea4ae902c6b506a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-21T12:22:07Z","title_canon_sha256":"355573bd1701031181805828f5d69e555fef3bcf1df419c52c62404cf1fad317"},"schema_version":"1.0","source":{"id":"1505.05697","kind":"arxiv","version":2}},"canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","first_computed_at":"2026-05-18T00:47:59.389182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:59.389182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swOiQ5WLlLAJOTvBr1d8moNIuvABrdkvBRo9WgvGTNtpS8GVBQxA/3igZjg0hP44e7G/uAonhR+ik5Ni1nQpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:59.389712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05697","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d669a7282276ac5a6d271d02adf8a55c7644c6d4cebf7f0f96ecbd3631abe5f","sha256:a044fba441ed08a6e3f5aac4c3835111ec9506dd4a55fa7ceb2ab511cb42e93c"],"state_sha256":"6b86053ed5a687b38c6a288f6e98f99f4b8b7d6a05b9a7533882049e15c996d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GREPMhKEh7+lHT3YAsBMAxIPXxNxYpmWlRUGxeFEB6N4lFq39adFNw7zErpyA8mryauwwzb6162oYfca/LbfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:43.958822Z","bundle_sha256":"665a2588448084240f4cde864874b8843b830ee63af94864114351a51298bf44"}}