{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N4P4QQ4L326W3RCVZIXEIXJ4YE","short_pith_number":"pith:N4P4QQ4L","canonical_record":{"source":{"id":"1807.10727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-27T16:53:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96935afdc729a00375d52b8f9c81112b12ee898979511ec552768e40d1e652e3","abstract_canon_sha256":"d3d7bacd2e2ba32dbdef81218255a904c5478bb3325f222f570f908fdbc10329"},"schema_version":"1.0"},"canonical_sha256":"6f1fc8438bdebd6dc455ca2e445d3cc125d2b439d8ce3eaca4b42b60a701f3a3","source":{"kind":"arxiv","id":"1807.10727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10727","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10727v1","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10727","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"N4P4QQ4L326W","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4P4QQ4L326W3RCV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4P4QQ4L","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N4P4QQ4L326W3RCVZIXEIXJ4YE","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-27T16:53:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96935afdc729a00375d52b8f9c81112b12ee898979511ec552768e40d1e652e3","abstract_canon_sha256":"d3d7bacd2e2ba32dbdef81218255a904c5478bb3325f222f570f908fdbc10329"},"schema_version":"1.0"},"canonical_sha256":"6f1fc8438bdebd6dc455ca2e445d3cc125d2b439d8ce3eaca4b42b60a701f3a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:39.703456Z","signature_b64":"6o71rSCWywKtwOJH33+YVvvZYUH57kcL9N3/0UtsvPAW1QdfpAO9KMxCR90l66OyIBN8UjF3W/epziBPdT5xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1fc8438bdebd6dc455ca2e445d3cc125d2b439d8ce3eaca4b42b60a701f3a3","last_reissued_at":"2026-05-18T00:09:39.702816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:39.702816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10727","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-18T00:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3b1nkR7D8UPQmiSrlU+FOF8nnP+mcnBJvyOlxDACkSQkmV8hBBQm8xrjjBUMuOs9cRZeRaxrys7x8aaimEpKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:24:22.030850Z"},"content_sha256":"58895fc4b6d542c4d77c5faa11a538b57e85340ab3c678aba83f29f33fa3c7aa","schema_version":"1.0","event_id":"sha256:58895fc4b6d542c4d77c5faa11a538b57e85340ab3c678aba83f29f33fa3c7aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N4P4QQ4L326W3RCVZIXEIXJ4YE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Components at Scale via Local Contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Jakub {\\L}\\k{a}cki, Micha{\\l} W{\\l}odarczyk, Vahab Mirrokni","submitted_at":"2018-07-27T16:53:45Z","abstract_excerpt":"As a fundamental tool in hierarchical graph clustering, computing connected components has been a central problem in large-scale data mining. While many known algorithms have been developed for this problem, they are either not scalable in practice or lack strong theoretical guarantees on the parallel running time, that is, the number of communication rounds. So far, the best proven guarantee is $\\Oh(\\log n)$, which matches the running time in the PRAM model.\n  In this paper, we aim to design a distributed algorithm for this problem that works well in theory and practice. In particular, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10727","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-18T00:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADR9JDqOVCjSXld2SmxUMC6VltQrZJGJKkzvLl6KHi+GFUboNK9fpJPWXq49jd64tXrYqV77Gn+Yb4iIF5aaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:24:22.031242Z"},"content_sha256":"98b9769e2c38f8969cf2acabf82b820f9788631a491a0cc1408a31a072243e5a","schema_version":"1.0","event_id":"sha256:98b9769e2c38f8969cf2acabf82b820f9788631a491a0cc1408a31a072243e5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/bundle.json","state_url":"https://pith.science/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/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-25T19:24:22Z","links":{"resolver":"https://pith.science/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE","bundle":"https://pith.science/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/bundle.json","state":"https://pith.science/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4P4QQ4L326W3RCVZIXEIXJ4YE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N4P4QQ4L326W3RCVZIXEIXJ4YE","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":"d3d7bacd2e2ba32dbdef81218255a904c5478bb3325f222f570f908fdbc10329","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-27T16:53:45Z","title_canon_sha256":"96935afdc729a00375d52b8f9c81112b12ee898979511ec552768e40d1e652e3"},"schema_version":"1.0","source":{"id":"1807.10727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10727","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10727v1","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10727","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"N4P4QQ4L326W","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N4P4QQ4L326W3RCV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N4P4QQ4L","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:98b9769e2c38f8969cf2acabf82b820f9788631a491a0cc1408a31a072243e5a","target":"graph","created_at":"2026-05-18T00:09:39Z","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":"As a fundamental tool in hierarchical graph clustering, computing connected components has been a central problem in large-scale data mining. While many known algorithms have been developed for this problem, they are either not scalable in practice or lack strong theoretical guarantees on the parallel running time, that is, the number of communication rounds. So far, the best proven guarantee is $\\Oh(\\log n)$, which matches the running time in the PRAM model.\n  In this paper, we aim to design a distributed algorithm for this problem that works well in theory and practice. In particular, we pre","authors_text":"Jakub {\\L}\\k{a}cki, Micha{\\l} W{\\l}odarczyk, Vahab Mirrokni","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-27T16:53:45Z","title":"Connected Components at Scale via Local Contractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10727","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:58895fc4b6d542c4d77c5faa11a538b57e85340ab3c678aba83f29f33fa3c7aa","target":"record","created_at":"2026-05-18T00:09:39Z","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":"d3d7bacd2e2ba32dbdef81218255a904c5478bb3325f222f570f908fdbc10329","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-27T16:53:45Z","title_canon_sha256":"96935afdc729a00375d52b8f9c81112b12ee898979511ec552768e40d1e652e3"},"schema_version":"1.0","source":{"id":"1807.10727","kind":"arxiv","version":1}},"canonical_sha256":"6f1fc8438bdebd6dc455ca2e445d3cc125d2b439d8ce3eaca4b42b60a701f3a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1fc8438bdebd6dc455ca2e445d3cc125d2b439d8ce3eaca4b42b60a701f3a3","first_computed_at":"2026-05-18T00:09:39.702816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:39.702816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6o71rSCWywKtwOJH33+YVvvZYUH57kcL9N3/0UtsvPAW1QdfpAO9KMxCR90l66OyIBN8UjF3W/epziBPdT5xAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:39.703456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58895fc4b6d542c4d77c5faa11a538b57e85340ab3c678aba83f29f33fa3c7aa","sha256:98b9769e2c38f8969cf2acabf82b820f9788631a491a0cc1408a31a072243e5a"],"state_sha256":"9783e19de11ce2acb7c94f34460edd4148fa6d408ca0a69e073877cb878296cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83SsYxjInMLTBc5l3nxQt7eK/eg8j/eICNeYb1XB7ym/xd3q108gUP8XqhvdF9iw8o53iKyyC+QtMrULsCGaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:24:22.033860Z","bundle_sha256":"0a8220ba7640f1b1ac3d6549786ff0e84269e279c3b82e6eb11bbae5bc9a95f7"}}