{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6DVOEB7AJIZZJ7XS4A6WOSDJDB","short_pith_number":"pith:6DVOEB7A","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"},"canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","source":{"kind":"arxiv","id":"2404.14730","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14730","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14730v2","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14730","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"6DVOEB7AJIZZ","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"6DVOEB7AJIZZJ7XS","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"6DVOEB7A","created_at":"2026-07-05T10:09:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6DVOEB7AJIZZJ7XS4A6WOSDJDB","target":"record","payload":{"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"},"canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","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"},"source_kind":"arxiv","source_id":"2404.14730","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq7N68PyyHNS+ejLMmLWXIhV3YwpiIP7KHq0cqwUZ7AyZ2cVGaef3uHhCHhVphQOCZkVLgjVHcL3wYVIjdx/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:36:05.552066Z"},"content_sha256":"aef929cb06f13dcf4d1c5e28b52c2fef3364114b6a5bffaf6120a5dc7f959600","schema_version":"1.0","event_id":"sha256:aef929cb06f13dcf4d1c5e28b52c2fef3364114b6a5bffaf6120a5dc7f959600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6DVOEB7AJIZZJ7XS4A6WOSDJDB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hlz337DRjLJpBWCZ8/3hb5Kq0esPyyCyp7vKNhNXvbPD77FPxaJ+RpwGenNkOKA8RaDkdY9cYNqX251lt9R8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:36:05.552658Z"},"content_sha256":"af9e2c26688753c528c24a1dfc1e0fd97c4dc96c0d4d4c67b890f46b8cf6431c","schema_version":"1.0","event_id":"sha256:af9e2c26688753c528c24a1dfc1e0fd97c4dc96c0d4d4c67b890f46b8cf6431c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/bundle.json","state_url":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T19:36:05Z","links":{"resolver":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB","bundle":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/bundle.json","state":"https://pith.science/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DVOEB7AJIZZJ7XS4A6WOSDJDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6DVOEB7AJIZZJ7XS4A6WOSDJDB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f465f2e8e3e6ca6cea0b0326c19149507c0b231c1991497b74b55024ec8d8fbf","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-23T04:14:29Z","title_canon_sha256":"d277f826f1f6fc48456e0167ef8994b7086ee35b9438f8250b96c89415495962"},"schema_version":"1.0","source":{"id":"2404.14730","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14730","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14730v2","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14730","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"6DVOEB7AJIZZ","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"6DVOEB7AJIZZJ7XS","created_at":"2026-07-05T10:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"6DVOEB7A","created_at":"2026-07-05T10:09:43Z"}],"graph_snapshots":[{"event_id":"sha256:af9e2c26688753c528c24a1dfc1e0fd97c4dc96c0d4d4c67b890f46b8cf6431c","target":"graph","created_at":"2026-07-05T10:09:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.14730/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"D Ellis Hershkowitz, Jakub {\\L}\\k{a}cki, Kishen N Gowda, Laxman Dhulipala, MohammadHossein Bateni, Rajesh Jayaram","cross_cats":["cs.CC","cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-23T04:14:29Z","title":"It's Hard to HAC with Average Linkage!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14730","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aef929cb06f13dcf4d1c5e28b52c2fef3364114b6a5bffaf6120a5dc7f959600","target":"record","created_at":"2026-07-05T10:09:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f465f2e8e3e6ca6cea0b0326c19149507c0b231c1991497b74b55024ec8d8fbf","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-23T04:14:29Z","title_canon_sha256":"d277f826f1f6fc48456e0167ef8994b7086ee35b9438f8250b96c89415495962"},"schema_version":"1.0","source":{"id":"2404.14730","kind":"arxiv","version":2}},"canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0eae207e04a3394fef2e03d674869186ee810bb52dc0a02f59b7b5a42daf938","first_computed_at":"2026-07-05T10:09:43.517153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:43.517153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tYBgJV5LYxjhVCQGpzKAMoDk05Q+6l3HtzwcNS0yEa3Ddr2TLc+bUfdcjh/x3s0w/7jBQEnV/FOp3BO8LEmUAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:43.517582Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.14730","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aef929cb06f13dcf4d1c5e28b52c2fef3364114b6a5bffaf6120a5dc7f959600","sha256:af9e2c26688753c528c24a1dfc1e0fd97c4dc96c0d4d4c67b890f46b8cf6431c"],"state_sha256":"5ddf22e5afdbe19b115ff97e4a38c3a0104adbd584f2877127591c3e74013cc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/3sU2obj80PUcN0SM4wDxmtg/GJfEeMNlwfSzsVpIvz8Sxm+n9neJPnZq8udsFTAkTBdS1LhxmZpCTRCGmVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:36:05.557303Z","bundle_sha256":"0622ef5ee87574242a77506575b158c08da4e41a1ef4d765e096aaac6b648103"}}