{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XTA7MMT76NOWLBZZD5O4SJMM4X","short_pith_number":"pith:XTA7MMT7","schema_version":"1.0","canonical_sha256":"bcc1f6327ff35d6587391f5dc9258ce5e871f6b42aa0e844b9123dcb1992ef9e","source":{"kind":"arxiv","id":"2501.07745","version":1},"attestation_state":"computed","paper":{"title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Nikos Parotsidis, Shangdi Yu","submitted_at":"2025-01-13T23:18:03Z","abstract_excerpt":"We consider the problem of maintaining a hierarchical agglomerative clustering (HAC) in the dynamic setting, when the input is subject to point insertions and deletions. We introduce DynHAC - the first dynamic HAC algorithm for the popular average-linkage version of the problem which can maintain a 1+\\epsilon approximate solution. Our approach leverages recent structural results on (1+\\epsilon)-approximate HAC to carefully identify the part of the clustering dendrogram that needs to be updated in order to produce a solution that is consistent with what a full recomputation from scratch would h"},"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":"2501.07745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-01-13T23:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"dc5b24b42554b2a3538f2a3aea0c3d433eea1bd323f88cde206bc56b28b18dd9","abstract_canon_sha256":"0537f19b1576db8e0ef9fe0ae5015657bfa006f8296a1463fb5865e9bc742763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:49.368043Z","signature_b64":"Lmi3xZr3vSPToGp5KqOUW7Sp7kIzmmmbEt57YLbNVZf3clWhvitys2SR7OvTGAlU9CQh+noPhwazdnHtWjbmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc1f6327ff35d6587391f5dc9258ce5e871f6b42aa0e844b9123dcb1992ef9e","last_reissued_at":"2026-07-05T10:00:49.367637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:49.367637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Nikos Parotsidis, Shangdi Yu","submitted_at":"2025-01-13T23:18:03Z","abstract_excerpt":"We consider the problem of maintaining a hierarchical agglomerative clustering (HAC) in the dynamic setting, when the input is subject to point insertions and deletions. We introduce DynHAC - the first dynamic HAC algorithm for the popular average-linkage version of the problem which can maintain a 1+\\epsilon approximate solution. Our approach leverages recent structural results on (1+\\epsilon)-approximate HAC to carefully identify the part of the clustering dendrogram that needs to be updated in order to produce a solution that is consistent with what a full recomputation from scratch would h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07745","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/2501.07745/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":"2501.07745","created_at":"2026-07-05T10:00:49.367700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07745v1","created_at":"2026-07-05T10:00:49.367700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07745","created_at":"2026-07-05T10:00:49.367700+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTA7MMT76NOW","created_at":"2026-07-05T10:00:49.367700+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTA7MMT76NOWLBZZ","created_at":"2026-07-05T10:00:49.367700+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTA7MMT7","created_at":"2026-07-05T10:00:49.367700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20047","citing_title":"Parallel Hierarchical Agglomerative Clustering in Low Dimensions","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X","json":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X.json","graph_json":"https://pith.science/api/pith-number/XTA7MMT76NOWLBZZD5O4SJMM4X/graph.json","events_json":"https://pith.science/api/pith-number/XTA7MMT76NOWLBZZD5O4SJMM4X/events.json","paper":"https://pith.science/paper/XTA7MMT7"},"agent_actions":{"view_html":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X","download_json":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X.json","view_paper":"https://pith.science/paper/XTA7MMT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07745&json=true","fetch_graph":"https://pith.science/api/pith-number/XTA7MMT76NOWLBZZD5O4SJMM4X/graph.json","fetch_events":"https://pith.science/api/pith-number/XTA7MMT76NOWLBZZD5O4SJMM4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X/action/storage_attestation","attest_author":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X/action/author_attestation","sign_citation":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X/action/citation_signature","submit_replication":"https://pith.science/pith/XTA7MMT76NOWLBZZD5O4SJMM4X/action/replication_record"}},"created_at":"2026-07-05T10:00:49.367700+00:00","updated_at":"2026-07-05T10:00:49.367700+00:00"}