{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VG6R77A65MA7CVUZ76YD4YLQN2","short_pith_number":"pith:VG6R77A6","schema_version":"1.0","canonical_sha256":"a9bd1ffc1eeb01f15699ffb03e61706eaaaf4a3cbdff2e44db6e6cd7f1dbdccb","source":{"kind":"arxiv","id":"2507.20047","version":1},"attestation_state":"computed","paper":{"title":"Parallel Hierarchical Agglomerative Clustering in Low Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.DS","authors_text":"D Ellis Hershkowitz, Jakub {\\L}\\k{a}cki, Kishen N Gowda, Laxman Dhulipala, MohammadHossein Bateni, Rajesh Jayaram, Willem Fletcher","submitted_at":"2025-07-26T19:52:50Z","abstract_excerpt":"Hierarchical Agglomerative Clustering (HAC) is an extensively studied and widely used method for hierarchical clustering in $\\mathbb{R}^k$ based on repeatedly merging the closest pair of clusters according to an input linkage function $d$. Highly parallel (i.e., NC) algorithms are known for $(1+\\epsilon)$-approximate HAC (where near-minimum rather than minimum pairs are merged) for certain linkage functions that monotonically increase as merges are performed. However, no such algorithms are known for many important but non-monotone linkage functions such as centroid and Ward's linkage.\n  In th"},"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":"2507.20047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-26T19:52:50Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"8d708305d079d5970648fcedabb5a1e5c15ae11623161935abdfef67b344f445","abstract_canon_sha256":"616f07a2aa8ae0401689c868ae297cb858419ecff8d6e69212a0339f313006c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:12.369499Z","signature_b64":"8W9QkCa9SzqTdMuu+4VQN4z/I0xDIDqh2ZoeNQ3GXtAYba55xpbZMsgNsYtKoDvBcnnhky93VC2RzTd28grEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9bd1ffc1eeb01f15699ffb03e61706eaaaf4a3cbdff2e44db6e6cd7f1dbdccb","last_reissued_at":"2026-07-05T11:44:12.369033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:12.369033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Hierarchical Agglomerative Clustering in Low Dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.DS","authors_text":"D Ellis Hershkowitz, Jakub {\\L}\\k{a}cki, Kishen N Gowda, Laxman Dhulipala, MohammadHossein Bateni, Rajesh Jayaram, Willem Fletcher","submitted_at":"2025-07-26T19:52:50Z","abstract_excerpt":"Hierarchical Agglomerative Clustering (HAC) is an extensively studied and widely used method for hierarchical clustering in $\\mathbb{R}^k$ based on repeatedly merging the closest pair of clusters according to an input linkage function $d$. Highly parallel (i.e., NC) algorithms are known for $(1+\\epsilon)$-approximate HAC (where near-minimum rather than minimum pairs are merged) for certain linkage functions that monotonically increase as merges are performed. However, no such algorithms are known for many important but non-monotone linkage functions such as centroid and Ward's linkage.\n  In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20047","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/2507.20047/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":"2507.20047","created_at":"2026-07-05T11:44:12.369091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20047v1","created_at":"2026-07-05T11:44:12.369091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20047","created_at":"2026-07-05T11:44:12.369091+00:00"},{"alias_kind":"pith_short_12","alias_value":"VG6R77A65MA7","created_at":"2026-07-05T11:44:12.369091+00:00"},{"alias_kind":"pith_short_16","alias_value":"VG6R77A65MA7CVUZ","created_at":"2026-07-05T11:44:12.369091+00:00"},{"alias_kind":"pith_short_8","alias_value":"VG6R77A6","created_at":"2026-07-05T11:44:12.369091+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/VG6R77A65MA7CVUZ76YD4YLQN2","json":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2.json","graph_json":"https://pith.science/api/pith-number/VG6R77A65MA7CVUZ76YD4YLQN2/graph.json","events_json":"https://pith.science/api/pith-number/VG6R77A65MA7CVUZ76YD4YLQN2/events.json","paper":"https://pith.science/paper/VG6R77A6"},"agent_actions":{"view_html":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2","download_json":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2.json","view_paper":"https://pith.science/paper/VG6R77A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20047&json=true","fetch_graph":"https://pith.science/api/pith-number/VG6R77A65MA7CVUZ76YD4YLQN2/graph.json","fetch_events":"https://pith.science/api/pith-number/VG6R77A65MA7CVUZ76YD4YLQN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2/action/storage_attestation","attest_author":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2/action/author_attestation","sign_citation":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2/action/citation_signature","submit_replication":"https://pith.science/pith/VG6R77A65MA7CVUZ76YD4YLQN2/action/replication_record"}},"created_at":"2026-07-05T11:44:12.369091+00:00","updated_at":"2026-07-05T11:44:12.369091+00:00"}