{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KRL3SS5HZG533EHCJ7XAQYKNL4","short_pith_number":"pith:KRL3SS5H","canonical_record":{"source":{"id":"1602.05232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T22:30:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37a58d4e696cdd25b411762eb3896d5c15269d1062c0db4ade138332b2128915","abstract_canon_sha256":"a8f0057ad0b9741add96bd7c10f6b4c0970cfab4f962ffccfa2a74bf11a6e23e"},"schema_version":"1.0"},"canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","source":{"kind":"arxiv","id":"1602.05232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05232","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05232v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05232","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"KRL3SS5HZG53","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRL3SS5HZG533EHC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRL3SS5H","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KRL3SS5HZG533EHCJ7XAQYKNL4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T22:30:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37a58d4e696cdd25b411762eb3896d5c15269d1062c0db4ade138332b2128915","abstract_canon_sha256":"a8f0057ad0b9741add96bd7c10f6b4c0970cfab4f962ffccfa2a74bf11a6e23e"},"schema_version":"1.0"},"canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:28.824874Z","signature_b64":"4r+7y/137ETtag+9CN0YUKrReYybh7mJdRUFLtJ641ysYZu+072nWIxKGCaAUVzUTI7s1dbpMXQdPc19sqN5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","last_reissued_at":"2026-05-18T01:20:28.824422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:28.824422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05232","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCOC4qM+LxnMW50AfZ1I6TIMNSLDTq9/1IRFzWC9e4WiiO2TZZGkdHHlhqqe6Pu9QDrHqrdS9HK8V+HrJtKrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:03:04.995224Z"},"content_sha256":"abcf730287a21296bf458cfc5085c4cf8c16f46cd15c826fe117f6a3fe38e998","schema_version":"1.0","event_id":"sha256:abcf730287a21296bf458cfc5085c4cf8c16f46cd15c826fe117f6a3fe38e998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KRL3SS5HZG533EHCJ7XAQYKNL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Work-Efficient Parallel and Incremental Graph Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Kanat Tangwongsan, Kun-Lung Wu, Natcha Simsiri, Srikanta Tirthapura","submitted_at":"2016-02-16T22:30:15Z","abstract_excerpt":"On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity problem, a fundamental and widely studied problem on graphs. We present the first shared-memory parallel algorithm for incremental graph connectivity that is both provably work-efficient and has polylogarithmic parallel depth. We also present a simpler algorithm with slightly worse theoretical properties, but which is easier to implement and has good practical performance. Our experiments show a throughput of hundreds of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05232","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-18T01:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9Zw2sd+5O2nxMT5toNLXCp/R8IikcgGgLo4kV9VRtoLxbQ6SY8GTdx9zwUN0rn/SJ/DQeOpI2BPAKYSumJZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:03:04.995577Z"},"content_sha256":"39072f501f8dfaeb70838749cab739af6fe5c6626bdd2a9f580dc6d9f9896f89","schema_version":"1.0","event_id":"sha256:39072f501f8dfaeb70838749cab739af6fe5c6626bdd2a9f580dc6d9f9896f89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/bundle.json","state_url":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/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-27T11:03:04Z","links":{"resolver":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4","bundle":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/bundle.json","state":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KRL3SS5HZG533EHCJ7XAQYKNL4","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":"a8f0057ad0b9741add96bd7c10f6b4c0970cfab4f962ffccfa2a74bf11a6e23e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T22:30:15Z","title_canon_sha256":"37a58d4e696cdd25b411762eb3896d5c15269d1062c0db4ade138332b2128915"},"schema_version":"1.0","source":{"id":"1602.05232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05232","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05232v1","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05232","created_at":"2026-05-18T01:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"KRL3SS5HZG53","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRL3SS5HZG533EHC","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRL3SS5H","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:39072f501f8dfaeb70838749cab739af6fe5c6626bdd2a9f580dc6d9f9896f89","target":"graph","created_at":"2026-05-18T01:20:28Z","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":"On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity problem, a fundamental and widely studied problem on graphs. We present the first shared-memory parallel algorithm for incremental graph connectivity that is both provably work-efficient and has polylogarithmic parallel depth. We also present a simpler algorithm with slightly worse theoretical properties, but which is easier to implement and has good practical performance. Our experiments show a throughput of hundreds of ","authors_text":"Kanat Tangwongsan, Kun-Lung Wu, Natcha Simsiri, Srikanta Tirthapura","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T22:30:15Z","title":"Work-Efficient Parallel and Incremental Graph Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05232","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:abcf730287a21296bf458cfc5085c4cf8c16f46cd15c826fe117f6a3fe38e998","target":"record","created_at":"2026-05-18T01:20:28Z","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":"a8f0057ad0b9741add96bd7c10f6b4c0970cfab4f962ffccfa2a74bf11a6e23e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T22:30:15Z","title_canon_sha256":"37a58d4e696cdd25b411762eb3896d5c15269d1062c0db4ade138332b2128915"},"schema_version":"1.0","source":{"id":"1602.05232","kind":"arxiv","version":1}},"canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","first_computed_at":"2026-05-18T01:20:28.824422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:28.824422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4r+7y/137ETtag+9CN0YUKrReYybh7mJdRUFLtJ641ysYZu+072nWIxKGCaAUVzUTI7s1dbpMXQdPc19sqN5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:28.824874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abcf730287a21296bf458cfc5085c4cf8c16f46cd15c826fe117f6a3fe38e998","sha256:39072f501f8dfaeb70838749cab739af6fe5c6626bdd2a9f580dc6d9f9896f89"],"state_sha256":"9bbebad7e49fc0d9f456f2f234f88ab04ac52e85fe74739c4f61f517a7fc0752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdnobN/8HRb0hVHwcqWXab4Z4DNE0fcID/MoTcpl47ojtrMyAOC3G+hpp3lKfi5reFjVY2s1dY/58NUZQYoZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T11:03:04.997620Z","bundle_sha256":"38bde11abcb356b5e65e1636ba2e323814f83ac2ec4772a964824c9e845e32d0"}}