{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:66HLBGBLSWXX23JZ7EY6COSHQF","short_pith_number":"pith:66HLBGBL","canonical_record":{"source":{"id":"1607.06156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T00:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"beaf838aa40863bf3bd92506ac3989d043449381563398c70494f41c138907b7","abstract_canon_sha256":"e90dbbd213e6e850d56b78ec7add467d3b49ebd99e2f03eddd8c34949421577d"},"schema_version":"1.0"},"canonical_sha256":"f78eb0982b95af7d6d39f931e13a4781769c8ee9457fe6066b10b2ee5d0694b3","source":{"kind":"arxiv","id":"1607.06156","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06156","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06156v3","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06156","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"66HLBGBLSWXX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66HLBGBLSWXX23JZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66HLBGBL","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:66HLBGBLSWXX23JZ7EY6COSHQF","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T00:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"beaf838aa40863bf3bd92506ac3989d043449381563398c70494f41c138907b7","abstract_canon_sha256":"e90dbbd213e6e850d56b78ec7add467d3b49ebd99e2f03eddd8c34949421577d"},"schema_version":"1.0"},"canonical_sha256":"f78eb0982b95af7d6d39f931e13a4781769c8ee9457fe6066b10b2ee5d0694b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:52.132523Z","signature_b64":"DHEGiptE2Irky3ueVHV0EQ18RzaDKGwmXp/LzAzPGGN/7eLhjg6mCEkp+dUrLcAy5N0YIlJLjZ0m3IRJKHsYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78eb0982b95af7d6d39f931e13a4781769c8ee9457fe6066b10b2ee5d0694b3","last_reissued_at":"2026-05-18T00:50:52.131900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:52.131900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06156","source_version":3,"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:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UiR/HuWJeIyKdohIqAfmfMIL7hQH3DBKstvOa7fLdEhiLK3RZUcevMflGd3Rsxx6J0JqpM6QQw9sfzy43/UsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:25:00.859427Z"},"content_sha256":"e571ad4f9bd0c853d2583ef215dd0bb10d7fa868a070d5bdccec39e207508e32","schema_version":"1.0","event_id":"sha256:e571ad4f9bd0c853d2583ef215dd0bb10d7fa868a070d5bdccec39e207508e32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:66HLBGBLSWXX23JZ7EY6COSHQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive Parallel Algorithm for Computing Connected Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chirag Jain, Oded Green, Patrick Flick, Srinivas Aluru, Tony Pan","submitted_at":"2016-07-21T00:03:40Z","abstract_excerpt":"We present an efficient distributed memory parallel algorithm for computing connected components in undirected graphs based on Shiloach-Vishkin's PRAM approach. We discuss multiple optimization techniques that reduce communication volume as well as load-balance the algorithm. We also note that the efficiency of the parallel graph connectivity algorithm depends on the underlying graph topology. Particularly for short diameter graph components, we observe that parallel Breadth First Search (BFS) method offers better performance. However, running parallel BFS is not efficient for computing large "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06156","kind":"arxiv","version":3},"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:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRR4776oqiQ88peXTL6aRNj2xH+7vkuqOZBBxiDva6LNvPoLIpCzzQDf3lWld4xXr4twxMXfiUWdjW+DrIlmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:25:00.859771Z"},"content_sha256":"d13f881114a797f84ab7b586496484ef7286b3862df0759477203a7ccae7d1a6","schema_version":"1.0","event_id":"sha256:d13f881114a797f84ab7b586496484ef7286b3862df0759477203a7ccae7d1a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66HLBGBLSWXX23JZ7EY6COSHQF/bundle.json","state_url":"https://pith.science/pith/66HLBGBLSWXX23JZ7EY6COSHQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66HLBGBLSWXX23JZ7EY6COSHQF/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-09T16:25:00Z","links":{"resolver":"https://pith.science/pith/66HLBGBLSWXX23JZ7EY6COSHQF","bundle":"https://pith.science/pith/66HLBGBLSWXX23JZ7EY6COSHQF/bundle.json","state":"https://pith.science/pith/66HLBGBLSWXX23JZ7EY6COSHQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66HLBGBLSWXX23JZ7EY6COSHQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:66HLBGBLSWXX23JZ7EY6COSHQF","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":"e90dbbd213e6e850d56b78ec7add467d3b49ebd99e2f03eddd8c34949421577d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T00:03:40Z","title_canon_sha256":"beaf838aa40863bf3bd92506ac3989d043449381563398c70494f41c138907b7"},"schema_version":"1.0","source":{"id":"1607.06156","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06156","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06156v3","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06156","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"66HLBGBLSWXX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66HLBGBLSWXX23JZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66HLBGBL","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:d13f881114a797f84ab7b586496484ef7286b3862df0759477203a7ccae7d1a6","target":"graph","created_at":"2026-05-18T00:50:52Z","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":"We present an efficient distributed memory parallel algorithm for computing connected components in undirected graphs based on Shiloach-Vishkin's PRAM approach. We discuss multiple optimization techniques that reduce communication volume as well as load-balance the algorithm. We also note that the efficiency of the parallel graph connectivity algorithm depends on the underlying graph topology. Particularly for short diameter graph components, we observe that parallel Breadth First Search (BFS) method offers better performance. However, running parallel BFS is not efficient for computing large ","authors_text":"Chirag Jain, Oded Green, Patrick Flick, Srinivas Aluru, Tony Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T00:03:40Z","title":"An Adaptive Parallel Algorithm for Computing Connected Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06156","kind":"arxiv","version":3},"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:e571ad4f9bd0c853d2583ef215dd0bb10d7fa868a070d5bdccec39e207508e32","target":"record","created_at":"2026-05-18T00:50:52Z","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":"e90dbbd213e6e850d56b78ec7add467d3b49ebd99e2f03eddd8c34949421577d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T00:03:40Z","title_canon_sha256":"beaf838aa40863bf3bd92506ac3989d043449381563398c70494f41c138907b7"},"schema_version":"1.0","source":{"id":"1607.06156","kind":"arxiv","version":3}},"canonical_sha256":"f78eb0982b95af7d6d39f931e13a4781769c8ee9457fe6066b10b2ee5d0694b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f78eb0982b95af7d6d39f931e13a4781769c8ee9457fe6066b10b2ee5d0694b3","first_computed_at":"2026-05-18T00:50:52.131900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:52.131900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DHEGiptE2Irky3ueVHV0EQ18RzaDKGwmXp/LzAzPGGN/7eLhjg6mCEkp+dUrLcAy5N0YIlJLjZ0m3IRJKHsYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:52.132523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06156","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e571ad4f9bd0c853d2583ef215dd0bb10d7fa868a070d5bdccec39e207508e32","sha256:d13f881114a797f84ab7b586496484ef7286b3862df0759477203a7ccae7d1a6"],"state_sha256":"d18effa8bdb3cf884336bc94310ae3e3e8ef520a38c64825a3bcd914cd5a5323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80DR3kvthFlNOGp82155WkYC8YP9OYGtEjYP059JLQs7gP7BjPRxx+f4zLwTU/K1PFJlcuXKWekneADOHHbpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:25:00.861644Z","bundle_sha256":"4b4d787331f8f3a1215f280d86e0d87cbfab95500af52b65693c99252994baea"}}