{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5YVU3INKOPMQKP2GOF5JGFXC7Z","short_pith_number":"pith:5YVU3INK","schema_version":"1.0","canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","source":{"kind":"arxiv","id":"1203.5387","version":2},"attestation_state":"computed","paper":{"title":"Finding Connected Components on Map-reduce in Logarithmic Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Anish Das Sarma, Ashwin Machanavajjhala, Laukik Chitnis, Vibhor Rastogi","submitted_at":"2012-03-24T05:16:27Z","abstract_excerpt":"Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fundamental trade-off exists between the number of map-reduce rounds and the communication of each round. Denoting d the diameter of the graph, and n the number of nodes in the largest component, all prior map-reduce techniques either require d rounds, or require about n|V| + |E| communication per round. We propose two randomized map-reduce algorithms -- (i) Hash-Greater-To-Min, which provably requires at most 3log(n) "},"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":"1203.5387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-24T05:16:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"78d35809677a97542541631464aefccde59cf9dfe1b53e02eea6b01625bcea6c","abstract_canon_sha256":"bb7a54c57332f4da1543f419bd4b36b5089d7b70b787add63007f391a15439e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:01.181775Z","signature_b64":"FEpqiGjCPyAfIAUgGZgilI3EV9A3tyhtJRrjijY0oYH1haXJgb9jhc3XaY26Rw7Sa8Hnoa4QP23cXWLWV5L+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","last_reissued_at":"2026-05-18T03:41:01.181158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:01.181158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Connected Components on Map-reduce in Logarithmic Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Anish Das Sarma, Ashwin Machanavajjhala, Laukik Chitnis, Vibhor Rastogi","submitted_at":"2012-03-24T05:16:27Z","abstract_excerpt":"Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fundamental trade-off exists between the number of map-reduce rounds and the communication of each round. Denoting d the diameter of the graph, and n the number of nodes in the largest component, all prior map-reduce techniques either require d rounds, or require about n|V| + |E| communication per round. We propose two randomized map-reduce algorithms -- (i) Hash-Greater-To-Min, which provably requires at most 3log(n) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5387","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":"1203.5387","created_at":"2026-05-18T03:41:01.181251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5387v2","created_at":"2026-05-18T03:41:01.181251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5387","created_at":"2026-05-18T03:41:01.181251+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YVU3INKOPMQ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YVU3INKOPMQKP2G","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YVU3INK","created_at":"2026-05-18T12:26:56.085431+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/5YVU3INKOPMQKP2GOF5JGFXC7Z","json":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z.json","graph_json":"https://pith.science/api/pith-number/5YVU3INKOPMQKP2GOF5JGFXC7Z/graph.json","events_json":"https://pith.science/api/pith-number/5YVU3INKOPMQKP2GOF5JGFXC7Z/events.json","paper":"https://pith.science/paper/5YVU3INK"},"agent_actions":{"view_html":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z","download_json":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z.json","view_paper":"https://pith.science/paper/5YVU3INK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5387&json=true","fetch_graph":"https://pith.science/api/pith-number/5YVU3INKOPMQKP2GOF5JGFXC7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/5YVU3INKOPMQKP2GOF5JGFXC7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/action/storage_attestation","attest_author":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/action/author_attestation","sign_citation":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/action/citation_signature","submit_replication":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/action/replication_record"}},"created_at":"2026-05-18T03:41:01.181251+00:00","updated_at":"2026-05-18T03:41:01.181251+00:00"}