{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6DVOEB7AJIZZJ7XS4A6WOSDJDB","short_pith_number":"pith:6DVOEB7A","schema_version":"1.0","canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","source":{"kind":"arxiv","id":"2404.14730","version":2},"attestation_state":"computed","paper":{"title":"It's Hard to HAC with Average Linkage!","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","submitted_at":"2024-04-23T04:14:29Z","abstract_excerpt":"Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and applied method for hierarchical clustering. Recent applications to massive datasets have driven significant interest in near-linear-time and efficient parallel algorithms for average linkage HAC.\n  We provide hardness results that rule out such algorithms. On the sequential side, we establish a runtime lower bound of $n^{3/2-\\epsilon}$ on $n$ node graphs for sequential combinatorial algorithms under standard fine-grained complexity assumptions. This essentially matches the best-known running time for aver"},"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":"2404.14730","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-23T04:14:29Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"d277f826f1f6fc48456e0167ef8994b7086ee35b9438f8250b96c89415495962","abstract_canon_sha256":"f465f2e8e3e6ca6cea0b0326c19149507c0b231c1991497b74b55024ec8d8fbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:43.517582Z","signature_b64":"tYBgJV5LYxjhVCQGpzKAMoDk05Q+6l3HtzwcNS0yEa3Ddr2TLc+bUfdcjh/x3s0w/7jBQEnV/FOp3BO8LEmUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","last_reissued_at":"2026-07-05T10:09:43.517153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:43.517153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"It's Hard to HAC with Average Linkage!","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","submitted_at":"2024-04-23T04:14:29Z","abstract_excerpt":"Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and applied method for hierarchical clustering. Recent applications to massive datasets have driven significant interest in near-linear-time and efficient parallel algorithms for average linkage HAC.\n  We provide hardness results that rule out such algorithms. On the sequential side, we establish a runtime lower bound of $n^{3/2-\\epsilon}$ on $n$ node graphs for sequential combinatorial algorithms under standard fine-grained complexity assumptions. This essentially matches the best-known running time for aver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14730","kind":"arxiv","version":2},"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/2404.14730/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":"2404.14730","created_at":"2026-07-05T10:09:43.517210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14730v2","created_at":"2026-07-05T10:09:43.517210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14730","created_at":"2026-07-05T10:09:43.517210+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DVOEB7AJIZZ","created_at":"2026-07-05T10:09:43.517210+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DVOEB7AJIZZJ7XS","created_at":"2026-07-05T10:09:43.517210+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DVOEB7A","created_at":"2026-07-05T10:09:43.517210+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/6DVOEB7AJIZZJ7XS4A6WOSDJDB","json":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB.json","graph_json":"https://pith.science/api/pith-number/6DVOEB7AJIZZJ7XS4A6WOSDJDB/graph.json","events_json":"https://pith.science/api/pith-number/6DVOEB7AJIZZJ7XS4A6WOSDJDB/events.json","paper":"https://pith.science/paper/6DVOEB7A"},"agent_actions":{"view_html":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB","download_json":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB.json","view_paper":"https://pith.science/paper/6DVOEB7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14730&json=true","fetch_graph":"https://pith.science/api/pith-number/6DVOEB7AJIZZJ7XS4A6WOSDJDB/graph.json","fetch_events":"https://pith.science/api/pith-number/6DVOEB7AJIZZJ7XS4A6WOSDJDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/action/storage_attestation","attest_author":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/action/author_attestation","sign_citation":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/action/citation_signature","submit_replication":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/action/replication_record"}},"created_at":"2026-07-05T10:09:43.517210+00:00","updated_at":"2026-07-05T10:09:43.517210+00:00"}