{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MOFZFGWVLCGH5LSO7XNHORVRGX","short_pith_number":"pith:MOFZFGWV","canonical_record":{"source":{"id":"2008.03909","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-10T05:49:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de83b1d7acecf07f2b56467d9742d5df016a14c902093e7cab3dee684ddfdffc","abstract_canon_sha256":"a5f87554771dbbbe502e71cbe4aa4e8a7cac8492e5dc718b507a603fee62e21a"},"schema_version":"1.0"},"canonical_sha256":"638b929ad5588c7eae4efdda7746b135e441488f5e79b96e437f4bdaf9447001","source":{"kind":"arxiv","id":"2008.03909","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03909","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03909v4","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03909","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"MOFZFGWVLCGH","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_16","alias_value":"MOFZFGWVLCGH5LSO","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_8","alias_value":"MOFZFGWV","created_at":"2026-07-05T03:08:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MOFZFGWVLCGH5LSO7XNHORVRGX","target":"record","payload":{"canonical_record":{"source":{"id":"2008.03909","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-10T05:49:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de83b1d7acecf07f2b56467d9742d5df016a14c902093e7cab3dee684ddfdffc","abstract_canon_sha256":"a5f87554771dbbbe502e71cbe4aa4e8a7cac8492e5dc718b507a603fee62e21a"},"schema_version":"1.0"},"canonical_sha256":"638b929ad5588c7eae4efdda7746b135e441488f5e79b96e437f4bdaf9447001","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:08:05.986944Z","signature_b64":"i0nv4c0phd/HIhMV6Qsbt5rL9rJ8idTfzIYBONubw3gnk0HZ72CRQliXv+kzjGzaOBMVZTsInepo8yQAsh+1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638b929ad5588c7eae4efdda7746b135e441488f5e79b96e437f4bdaf9447001","last_reissued_at":"2026-07-05T03:08:05.986570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:08:05.986570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.03909","source_version":4,"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-07-05T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvkOuPniVAl7WCYZ8AJqGT8Bj9+XfsxFee6qwJ+sJ3kFQTgFISi1in6hO3JNvMPM8GDMxzb/LZrb/PBNbh/rAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:46:22.280798Z"},"content_sha256":"7d03050f25fc831cc6044c9d191707df8b0d53fa70685ef52ac2ddfe9a377ea9","schema_version":"1.0","event_id":"sha256:7d03050f25fc831cc6044c9d191707df8b0d53fa70685ef52ac2ddfe9a377ea9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MOFZFGWVLCGH5LSO7XNHORVRGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Changwan Hong, Julian Shun, Laxman Dhulipala","submitted_at":"2020-08-10T05:49:27Z","abstract_excerpt":"Connected components is a fundamental kernel in graph applications. The fastest existing parallel multicore algorithms for connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03909","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.03909/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RRw4TZh6lJ0phy89P3GforzB5GONWQyVC+vAKZXA8vcglifPfwn10JMmRJUOITKhlTe2HFRkms79xNUkWlPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:46:22.281530Z"},"content_sha256":"1ddc6f80aa7eac60ab34d0dd1fccd1423fe4548c7e087179dbc7fd922e8de060","schema_version":"1.0","event_id":"sha256:1ddc6f80aa7eac60ab34d0dd1fccd1423fe4548c7e087179dbc7fd922e8de060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/bundle.json","state_url":"https://pith.science/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/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-08-15T14:46:22Z","links":{"resolver":"https://pith.science/pith/MOFZFGWVLCGH5LSO7XNHORVRGX","bundle":"https://pith.science/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/bundle.json","state":"https://pith.science/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOFZFGWVLCGH5LSO7XNHORVRGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MOFZFGWVLCGH5LSO7XNHORVRGX","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":"a5f87554771dbbbe502e71cbe4aa4e8a7cac8492e5dc718b507a603fee62e21a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-10T05:49:27Z","title_canon_sha256":"de83b1d7acecf07f2b56467d9742d5df016a14c902093e7cab3dee684ddfdffc"},"schema_version":"1.0","source":{"id":"2008.03909","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03909","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03909v4","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03909","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"MOFZFGWVLCGH","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_16","alias_value":"MOFZFGWVLCGH5LSO","created_at":"2026-07-05T03:08:05Z"},{"alias_kind":"pith_short_8","alias_value":"MOFZFGWV","created_at":"2026-07-05T03:08:05Z"}],"graph_snapshots":[{"event_id":"sha256:1ddc6f80aa7eac60ab34d0dd1fccd1423fe4548c7e087179dbc7fd922e8de060","target":"graph","created_at":"2026-07-05T03:08:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.03909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Connected components is a fundamental kernel in graph applications. The fastest existing parallel multicore algorithms for connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to st","authors_text":"Changwan Hong, Julian Shun, Laxman Dhulipala","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-10T05:49:27Z","title":"ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03909","kind":"arxiv","version":4},"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:7d03050f25fc831cc6044c9d191707df8b0d53fa70685ef52ac2ddfe9a377ea9","target":"record","created_at":"2026-07-05T03:08:05Z","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":"a5f87554771dbbbe502e71cbe4aa4e8a7cac8492e5dc718b507a603fee62e21a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-10T05:49:27Z","title_canon_sha256":"de83b1d7acecf07f2b56467d9742d5df016a14c902093e7cab3dee684ddfdffc"},"schema_version":"1.0","source":{"id":"2008.03909","kind":"arxiv","version":4}},"canonical_sha256":"638b929ad5588c7eae4efdda7746b135e441488f5e79b96e437f4bdaf9447001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"638b929ad5588c7eae4efdda7746b135e441488f5e79b96e437f4bdaf9447001","first_computed_at":"2026-07-05T03:08:05.986570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:08:05.986570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i0nv4c0phd/HIhMV6Qsbt5rL9rJ8idTfzIYBONubw3gnk0HZ72CRQliXv+kzjGzaOBMVZTsInepo8yQAsh+1Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:08:05.986944Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.03909","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d03050f25fc831cc6044c9d191707df8b0d53fa70685ef52ac2ddfe9a377ea9","sha256:1ddc6f80aa7eac60ab34d0dd1fccd1423fe4548c7e087179dbc7fd922e8de060"],"state_sha256":"612eb335d8ca5ca5e7095e40bee48e7958e4b7736e82706cc7968a14a080a726"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ffKibU7CCsOIBEWP7Pxg+o+3GkTLOte65Ufm4vmclHk+j96w3uOccJSbVsRfGOsFxhlC8hyHH4/8SagHog7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:46:22.287634Z","bundle_sha256":"c062bcc2f7f5599e94f85685e8c005e5a6376eab98a7a238049d139dc46f4875"}}