{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KRL3SS5HZG533EHCJ7XAQYKNL4","short_pith_number":"pith:KRL3SS5H","schema_version":"1.0","canonical_sha256":"5457b94ba7c9bbbd90e24fee08614d5f243aeed5cde5b9e52aad82addb2a56cf","source":{"kind":"arxiv","id":"1602.05232","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05232","created_at":"2026-05-18T01:20:28.824496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05232v1","created_at":"2026-05-18T01:20:28.824496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05232","created_at":"2026-05-18T01:20:28.824496+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRL3SS5HZG53","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRL3SS5HZG533EHC","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRL3SS5H","created_at":"2026-05-18T12:30:29.479603+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/KRL3SS5HZG533EHCJ7XAQYKNL4","json":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4.json","graph_json":"https://pith.science/api/pith-number/KRL3SS5HZG533EHCJ7XAQYKNL4/graph.json","events_json":"https://pith.science/api/pith-number/KRL3SS5HZG533EHCJ7XAQYKNL4/events.json","paper":"https://pith.science/paper/KRL3SS5H"},"agent_actions":{"view_html":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4","download_json":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4.json","view_paper":"https://pith.science/paper/KRL3SS5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05232&json=true","fetch_graph":"https://pith.science/api/pith-number/KRL3SS5HZG533EHCJ7XAQYKNL4/graph.json","fetch_events":"https://pith.science/api/pith-number/KRL3SS5HZG533EHCJ7XAQYKNL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/action/storage_attestation","attest_author":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/action/author_attestation","sign_citation":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/action/citation_signature","submit_replication":"https://pith.science/pith/KRL3SS5HZG533EHCJ7XAQYKNL4/action/replication_record"}},"created_at":"2026-05-18T01:20:28.824496+00:00","updated_at":"2026-05-18T01:20:28.824496+00:00"}