{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5YVU3INKOPMQKP2GOF5JGFXC7Z","short_pith_number":"pith:5YVU3INK","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"},"canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","source":{"kind":"arxiv","id":"1203.5387","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5387","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5387v2","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5387","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"5YVU3INKOPMQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5YVU3INKOPMQKP2G","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5YVU3INK","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5YVU3INKOPMQKP2GOF5JGFXC7Z","target":"record","payload":{"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"},"canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","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"},"source_kind":"arxiv","source_id":"1203.5387","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-18T03:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtvINm4upPcmyaGn5yxd3I/sLZuM3gOnoV68cUIwLetFz7cpprcv0/zHwI1HO6Pu86WNZEr/ERZNLU9LMkotAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:32:40.661063Z"},"content_sha256":"efbcbfd3ba69a1e1b0ad609e491a98e9d2f95b06ac27c8b8bdb268904292dab4","schema_version":"1.0","event_id":"sha256:efbcbfd3ba69a1e1b0ad609e491a98e9d2f95b06ac27c8b8bdb268904292dab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5YVU3INKOPMQKP2GOF5JGFXC7Z","target":"graph","payload":{"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"},"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:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ON+lsFZGOOoU200upTKjvpyXJ9nt+F0xZ941nFGEMs9/P4XZ5lmVzMdZkO0L+RZSoPdnsdG9m+tV6whuG5OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:32:40.661760Z"},"content_sha256":"72bf5bfc6d963056da5831b592dbec5f62220766fd8c701b24b96722840ab06d","schema_version":"1.0","event_id":"sha256:72bf5bfc6d963056da5831b592dbec5f62220766fd8c701b24b96722840ab06d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/bundle.json","state_url":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/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:32:40Z","links":{"resolver":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z","bundle":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/bundle.json","state":"https://pith.science/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YVU3INKOPMQKP2GOF5JGFXC7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5YVU3INKOPMQKP2GOF5JGFXC7Z","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":"bb7a54c57332f4da1543f419bd4b36b5089d7b70b787add63007f391a15439e2","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-24T05:16:27Z","title_canon_sha256":"78d35809677a97542541631464aefccde59cf9dfe1b53e02eea6b01625bcea6c"},"schema_version":"1.0","source":{"id":"1203.5387","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5387","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5387v2","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5387","created_at":"2026-05-18T03:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"5YVU3INKOPMQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5YVU3INKOPMQKP2G","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5YVU3INK","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:72bf5bfc6d963056da5831b592dbec5f62220766fd8c701b24b96722840ab06d","target":"graph","created_at":"2026-05-18T03:41:01Z","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":"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) ","authors_text":"Anish Das Sarma, Ashwin Machanavajjhala, Laukik Chitnis, Vibhor Rastogi","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-24T05:16:27Z","title":"Finding Connected Components on Map-reduce in Logarithmic Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5387","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:efbcbfd3ba69a1e1b0ad609e491a98e9d2f95b06ac27c8b8bdb268904292dab4","target":"record","created_at":"2026-05-18T03:41:01Z","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":"bb7a54c57332f4da1543f419bd4b36b5089d7b70b787add63007f391a15439e2","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-24T05:16:27Z","title_canon_sha256":"78d35809677a97542541631464aefccde59cf9dfe1b53e02eea6b01625bcea6c"},"schema_version":"1.0","source":{"id":"1203.5387","kind":"arxiv","version":2}},"canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee2b4da1aa73d9053f46717a9316e2fe7e9940f25d69feb84c45a303434bd4f5","first_computed_at":"2026-05-18T03:41:01.181158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:01.181158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FEpqiGjCPyAfIAUgGZgilI3EV9A3tyhtJRrjijY0oYH1haXJgb9jhc3XaY26Rw7Sa8Hnoa4QP23cXWLWV5L+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:01.181775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5387","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efbcbfd3ba69a1e1b0ad609e491a98e9d2f95b06ac27c8b8bdb268904292dab4","sha256:72bf5bfc6d963056da5831b592dbec5f62220766fd8c701b24b96722840ab06d"],"state_sha256":"a93c39b9444be59f8124f1789351750f55a839d708e4fab149e48df104cf5971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gimK+isU2TmUytoFgULhR3npUhF7RT6lWImnShFH3a6Q3+yccaIfBUre1POmSWktreY7/VMLgvRGt6XsnJNEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:32:40.666074Z","bundle_sha256":"ddcb1fdf798027d7df17278aed3e26aaf1144073779168baf2cadb52e61432b4"}}