{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZONHIEQEKSKU2DFRBRF3ZDK2NC","short_pith_number":"pith:ZONHIEQE","schema_version":"1.0","canonical_sha256":"cb9a74120454954d0cb10c4bbc8d5a688811d4a3670e6b43e1b751c87443f769","source":{"kind":"arxiv","id":"2506.18384","version":1},"attestation_state":"computed","paper":{"title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Kishen N Gowda, Laxman Dhulipala, Quinten De Man","submitted_at":"2025-06-23T08:16:46Z","abstract_excerpt":"Single-linkage clustering is a popular form of hierarchical agglomerative clustering (HAC) where the distance between two clusters is defined as the minimum distance between any pair of points across the two clusters. In single-linkage HAC, the output is typically the single-linkage dendrogram (SLD), which is the binary tree representing the hierarchy of clusters formed by iteratively contracting the two closest clusters. In the dynamic setting, prior work has only studied maintaining a minimum spanning forest over the data since single-linkage HAC reduces to computing the SLD on the minimum s"},"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":"2506.18384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-23T08:16:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0459822ace9e5a7afe3b173cf3e697f4fb29784a8fef34a517ccbd67e81bbebc","abstract_canon_sha256":"7da8501cfcfad05a36078c7e7b90ab4514291953f20b706d0c7b0f027a343c75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:49.409100Z","signature_b64":"WvB9z450963bjLjO0o9ocBPLgWsmIgUQRO6WiiWSEq1h0N9c6LAVsdWYiFwKZ0n05KzHjdVReMfvKOV+IVMFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb9a74120454954d0cb10c4bbc8d5a688811d4a3670e6b43e1b751c87443f769","last_reissued_at":"2026-07-05T11:25:49.408610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:49.408610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Kishen N Gowda, Laxman Dhulipala, Quinten De Man","submitted_at":"2025-06-23T08:16:46Z","abstract_excerpt":"Single-linkage clustering is a popular form of hierarchical agglomerative clustering (HAC) where the distance between two clusters is defined as the minimum distance between any pair of points across the two clusters. In single-linkage HAC, the output is typically the single-linkage dendrogram (SLD), which is the binary tree representing the hierarchy of clusters formed by iteratively contracting the two closest clusters. In the dynamic setting, prior work has only studied maintaining a minimum spanning forest over the data since single-linkage HAC reduces to computing the SLD on the minimum s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18384","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.18384/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.18384","created_at":"2026-07-05T11:25:49.408675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.18384v1","created_at":"2026-07-05T11:25:49.408675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18384","created_at":"2026-07-05T11:25:49.408675+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZONHIEQEKSKU","created_at":"2026-07-05T11:25:49.408675+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZONHIEQEKSKU2DFR","created_at":"2026-07-05T11:25:49.408675+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZONHIEQE","created_at":"2026-07-05T11:25:49.408675+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/ZONHIEQEKSKU2DFRBRF3ZDK2NC","json":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC.json","graph_json":"https://pith.science/api/pith-number/ZONHIEQEKSKU2DFRBRF3ZDK2NC/graph.json","events_json":"https://pith.science/api/pith-number/ZONHIEQEKSKU2DFRBRF3ZDK2NC/events.json","paper":"https://pith.science/paper/ZONHIEQE"},"agent_actions":{"view_html":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC","download_json":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC.json","view_paper":"https://pith.science/paper/ZONHIEQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.18384&json=true","fetch_graph":"https://pith.science/api/pith-number/ZONHIEQEKSKU2DFRBRF3ZDK2NC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZONHIEQEKSKU2DFRBRF3ZDK2NC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC/action/storage_attestation","attest_author":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC/action/author_attestation","sign_citation":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC/action/citation_signature","submit_replication":"https://pith.science/pith/ZONHIEQEKSKU2DFRBRF3ZDK2NC/action/replication_record"}},"created_at":"2026-07-05T11:25:49.408675+00:00","updated_at":"2026-07-05T11:25:49.408675+00:00"}