{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X7JKCCYPFBUIREYCMBH6KIOMG2","short_pith_number":"pith:X7JKCCYP","schema_version":"1.0","canonical_sha256":"bfd2a10b0f2868889302604fe521cc36876f582827b24c579c506e700099ed15","source":{"kind":"arxiv","id":"1505.05697","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05697","created_at":"2026-05-18T00:47:59.389261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05697v2","created_at":"2026-05-18T00:47:59.389261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05697","created_at":"2026-05-18T00:47:59.389261+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7JKCCYPFBUI","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7JKCCYPFBUIREYC","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7JKCCYP","created_at":"2026-05-18T12:29:50.041715+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/X7JKCCYPFBUIREYCMBH6KIOMG2","json":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2.json","graph_json":"https://pith.science/api/pith-number/X7JKCCYPFBUIREYCMBH6KIOMG2/graph.json","events_json":"https://pith.science/api/pith-number/X7JKCCYPFBUIREYCMBH6KIOMG2/events.json","paper":"https://pith.science/paper/X7JKCCYP"},"agent_actions":{"view_html":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2","download_json":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2.json","view_paper":"https://pith.science/paper/X7JKCCYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05697&json=true","fetch_graph":"https://pith.science/api/pith-number/X7JKCCYPFBUIREYCMBH6KIOMG2/graph.json","fetch_events":"https://pith.science/api/pith-number/X7JKCCYPFBUIREYCMBH6KIOMG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/action/storage_attestation","attest_author":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/action/author_attestation","sign_citation":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/action/citation_signature","submit_replication":"https://pith.science/pith/X7JKCCYPFBUIREYCMBH6KIOMG2/action/replication_record"}},"created_at":"2026-05-18T00:47:59.389261+00:00","updated_at":"2026-05-18T00:47:59.389261+00:00"}