{"as_of":"2026-08-12T04:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28a5996684cefabf6490f7b3b35c43aad6c04c0cae66093c6c73e6ddcc380a85","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:46:26.452209Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:12:39.196340Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T14:12:39.261180Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"cited_work":{"arxiv_id":"2501.07745","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.07745","snapshot_observed_at":"2026-08-06T14:12:39.261180Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","venue":"cs.DS","work_id":"3252e8c1-59e7-49c6-8337-655e8aa32a2c","year":2025},"citing_paper":{"arxiv_id":"2507.20047","last_updated":"2025-07-26T19:52:50Z","snapshot_observed_at":"2026-08-06T14:12:20.146593Z","submitted_at":"2025-07-26T19:52:50Z","title":"Parallel Hierarchical Agglomerative Clustering in Low Dimensions","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.196340Z"},"links":{"cited_paper":"/paper/2501.07745","citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:eba906bfd0cc61e930b96da276a4644aacae3020d2520a40e7a37fc655099613","observation_id":"b6e99f58-8ff8-49c1-bfb1-0369c5866d4e","resolution":{"observed_at":"2026-08-06T14:12:39.266760Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.07745/citation-record","integrity":"/paper/2501.07745/integrity","json":"/paper/2501.07745/citation-record.json","paper":"/paper/2501.07745"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:27.009761Z","title":"Terahac: Hierarchical agglomerative clustering of trillion-edge graphs,","venue":null,"work_id":"025212c7-955d-4019-8d75-df4897b52e66","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.291412Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:3515c60a54e1d773d62774d38d77f13b68c552f543f63b6991432ff009f83863","observation_id":"f8097975-9835-41f1-b612-29e4a14613a4","resolution":{"observed_at":"2026-08-10T20:46:27.012746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:27.002583Z","title":null,"venue":null,"work_id":"e7f86e41-2b22-4b46-ad06-1716bdee1ed1","year":2008},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.294925Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:4176d966809a106446f82e60205d473f97a47c5768223d738a4db6ea50e18fd9","observation_id":"eb849fc0-6119-4f7a-aa96-5112afee3ceb","resolution":{"observed_at":"2026-08-10T20:46:27.005216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.995108Z","title":"A survey of clustering data mining techniques,","venue":null,"work_id":"c60e1973-9a67-4c46-adf4-4130c465b09b","year":2006},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.297790Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ff79894ab81b54ea3d7271264a9e849845c7fdfde627065e33bef2a2ca8c12ed","observation_id":"a7963732-33e5-434c-bf84-08b5d24a829a","resolution":{"observed_at":"2026-08-10T20:46:26.997874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.987980Z","title":null,"venue":null,"work_id":"3d90d64c-4567-4e5f-aab3-ea507253678d","year":2014},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.300842Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:2b261eb73904e5811f1e7e1e33447ac25be9b05e658b8ed3aeac92004de2fc6d","observation_id":"6d8adba0-91d0-4b38-9332-973b43936b56","resolution":{"observed_at":"2026-08-10T20:46:26.990543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.980429Z","title":"Efficient clustering and matching for object class recognition","venue":null,"work_id":"0a447a36-63f5-4de7-8171-eb2f666fe834","year":2006},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.303713Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:03e97b3ff743e04c4b0dfbb702b0dcb1b6627c1aef5f7f32058fe6ab2203fabb","observation_id":"484ddfc1-6103-42f7-a471-448be029625c","resolution":{"observed_at":"2026-08-10T20:46:26.983217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.973277Z","title":"Algorithms for hier- archical clustering: an overview,","venue":null,"work_id":"bac15762-fd5b-4f23-b2d8-1f9300139f4d","year":2012},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.306346Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:b5a3b4f4dd6462c5296c98eeb145cc2fa524bc01c7a530b3ac5151835b493a0b","observation_id":"37947adf-5bf0-4e11-b7c5-1194052477c1","resolution":{"observed_at":"2026-08-10T20:46:26.976058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.965792Z","title":"Algorithms for hierarchical clustering: an overview, II,","venue":null,"work_id":"a79586f5-5641-4c18-b7c2-a222ebcd6d25","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.309196Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:a18cf35acc82c4ecd60376d25ec378876db76ba9fe026e15a2a514688b9a3df0","observation_id":"29efce79-6598-4c4c-9a90-4597f8c41c0e","resolution":{"observed_at":"2026-08-10T20:46:26.968819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1109.2378","last_updated":"2011-09-12T05:49:11Z","snapshot_observed_at":"2026-08-03T18:17:29.793532Z","submitted_at":"2011-09-12T05:49:11Z","title":"Modern hierarchical, agglomerative clustering algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1109.2378","snapshot_observed_at":"2026-08-10T20:46:26.311690Z","title":"Modern hierarchical, agglomerative clus- tering algorithms,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.311690Z"},"links":{"cited_paper":"/paper/1109.2378","citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:0350cc659fc7162da7de9e20413536ead862cb72cbaa1cd83ddeaa82712c443c","observation_id":"d16965e7-097f-4cc9-b0b6-f74714f90ed4","resolution":{"observed_at":"2026-08-10T20:46:26.311690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.958570Z","title":"fastcluster: Fast hierarchical, agglomerative clustering routines for r and python,","venue":null,"work_id":"1b3c327d-9699-43b2-8af3-3683252d79b3","year":2013},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.314908Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:1f4ad175782033fcbe448e9353ce50391477eab41c6de8f66b3948db58840b40","observation_id":"32b78656-e1d3-4221-9a01-cfc54a1cb7d1","resolution":{"observed_at":"2026-08-10T20:46:26.961386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.951208Z","title":"Optimal implementations of upgma and other common clustering algorithms,","venue":null,"work_id":"bb0fc2b8-92c4-46d2-9478-ed4021e8a03e","year":2007},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.317538Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ed73eee2e3b6264de6143471ef3dfa8d69b0e05773c74210d61230082799cd22","observation_id":"37164321-b57c-4437-b76d-1747beccfc17","resolution":{"observed_at":"2026-08-10T20:46:26.954135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.943866Z","title":"Multiple upgma and neighbor-joining trees and the performance of some computer packages,","venue":null,"work_id":"9b6fcb78-0af6-4c8c-8527-2d46e264f4d4","year":1996},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.320070Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:0aaa6a4ebb2070ade99e3f0ffa70e0a61482d783d2237cfb7c999b054f8fa460","observation_id":"8ae2a766-132b-4940-a81d-d9e3b65fa507","resolution":{"observed_at":"2026-08-10T20:46:26.946728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.936452Z","title":"Evaluation of hierarchical clustering algorithms for document datasets,","venue":null,"work_id":"ef824c9d-6667-4165-b8c5-6548471990fa","year":2002},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.322846Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:1de16448aebd0f38b7588ef990ab40c458bc42e3df009e0afc641821da4353ba","observation_id":"5193dbed-a7be-4f4c-8831-6b85bb45c9f6","resolution":{"observed_at":"2026-08-10T20:46:26.939235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.929102Z","title":"MGUPGMA: a fast UPGMA algorithm with multiple graphics processing units using NCCL,","venue":null,"work_id":"e73ebb29-f1a3-40fb-ae31-d046d51604ed","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.325432Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:3f4456f5e66017ce7812ebd99a13c4cc52ec55ebdaf8a137166dcd05889de2c4","observation_id":"716cad43-28f1-43a7-abab-fcd2e703904f","resolution":{"observed_at":"2026-08-10T20:46:26.931984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.921526Z","title":"A hierarchical algorithm for extreme clustering,","venue":null,"work_id":"33455181-4636-4b1a-a86c-66cb41b1c0b0","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.328074Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ce42d96f00ffcba32a073d100c7903ff4b228dac7255b75d4d457f37d72cc3a4","observation_id":"d2c4e8b4-108d-49b4-8a42-567c03a979b0","resolution":{"observed_at":"2026-08-10T20:46:26.924625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.914252Z","title":"Bayesian hierarchical community discovery,","venue":null,"work_id":"493146a1-1a78-447d-94a9-c0c847b0d9b8","year":2013},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.330546Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:6089476f6e21144222ac4da32176c2605d3348c15fec4af8566bc3fcb82b7914","observation_id":"9ce921b0-f76a-4e9e-aaf8-d730ea388ca9","resolution":{"observed_at":"2026-08-10T20:46:26.917078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.907174Z","title":"Author disambiguation using error-driven machine learning with a ranking loss function,","venue":null,"work_id":"fdaf8c99-67d7-470b-ad35-bd812b543a53","year":2007},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.333033Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:dd09d5b1f9a6bbb1b380025d0eb6cdee557ac236987055fe2f08afa488e17ffb","observation_id":"d45899cf-0aa0-401a-a2a3-c662151806fa","resolution":{"observed_at":"2026-08-10T20:46:26.909929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.900057Z","title":"Hierarchical agglomerative graph clustering in poly-logarithmic depth,","venue":null,"work_id":"af9a37ad-861f-4223-9abf-c735492bfbc2","year":2022},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.335557Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:6a4a5970cf5fb7afaa40f4664e86eaa85c1ef7a8a26e4cabe4096553ec70ff0e","observation_id":"1c30e807-b98c-4937-9f36-6495b837b566","resolution":{"observed_at":"2026-08-10T20:46:26.902764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.892818Z","title":"Hierarchical agglomerative graph clustering in nearly-linear time,","venue":null,"work_id":"e0b86727-fd5c-4657-b441-979d144d5ec5","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.337983Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:f8fd92bbf6f638a53a0a3a4a99fe99af271dcd6f01ab5445d44e3cccaf9ab498","observation_id":"921a3c13-b13e-4a74-8131-41cda97ee002","resolution":{"observed_at":"2026-08-10T20:46:26.895605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.885613Z","title":"Scalable hierarchical agglomerative clustering,","venue":null,"work_id":"3b842f1c-1931-426c-bc44-be4dd141a8d7","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.340592Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:cbe2a801fc07c8358bf0637a47d9540caca5e430770ea727659ba0a1dbd222f0","observation_id":"1795b0be-b23f-4106-bd36-ec4b229b2db4","resolution":{"observed_at":"2026-08-10T20:46:26.888301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.878122Z","title":"Affinity clustering: Hierarchical clustering at scale,","venue":null,"work_id":"96a4c3c2-cafb-4d97-a251-ab9558210412","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.343303Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:45637d7fd5729b2878bb0fae94684d84e27b4c0b16227c083a6fa69cf79e75e7","observation_id":"3e59721f-698e-4774-8299-cc5fb2c2b9ef","resolution":{"observed_at":"2026-08-10T20:46:26.881029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.870667Z","title":"A framework for parallelizing hierarchical clustering methods,","venue":null,"work_id":"e0172164-208d-48f3-81d5-2554cb2c667f","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.345607Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:9eb3eb138cf905f5f111e8efa81e43db71fee39b298312f9a9fca1461ff273d2","observation_id":"b2dfb70a-e8e6-48ff-ad83-38ecdb23efcd","resolution":{"observed_at":"2026-08-10T20:46:26.873746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.863327Z","title":"Parallel batch-dynamic minimum spanning forest and the efficiency of dynamic agglomerative graph clustering,","venue":null,"work_id":"ed0d7d8c-1b37-4fe0-99a9-96352e4bd496","year":2022},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.348102Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:81287c3f7af669a37cbb575c34f0c13d50fcde23914279f4eea2519c65064648","observation_id":"cb81ad96-291c-4c13-b2a4-03b6ba86e5b2","resolution":{"observed_at":"2026-08-10T20:46:26.866248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.09667","last_updated":"2019-09-20T18:29:59Z","snapshot_observed_at":"2026-07-06T08:23:29.570661Z","submitted_at":"2019-09-20T18:29:59Z","title":"Online Hierarchical Clustering Approximations","version":1},"cited_work":{"arxiv_id":"1909.09667","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.09667","snapshot_observed_at":"2026-08-10T20:46:26.570727Z","title":"Online Hierarchical Clustering Approximations","venue":"cs.LG","work_id":"7e1e66fa-f02f-4893-b100-3f75c9c9d11b","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.350622Z"},"links":{"cited_paper":"/paper/1909.09667","citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:dc1a26d352c3e0162be677ef3d6a804c597764ba3484a75d30d90fe99d4a217d","observation_id":"9193f31e-e300-4c03-9bec-754818af871c","resolution":{"observed_at":"2026-08-10T20:46:26.573922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.855816Z","title":"Birch: an efficient data clustering method for very large databases,","venue":null,"work_id":"54ef9074-da1a-4a21-9948-155cf8b802f1","year":1996},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.353523Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:e3b62c1cead9f81882cef03f5e588cbf1b44f676d1d9fcb27b52359f9aa9f825","observation_id":"5a0cf0ac-4d4c-4f62-890b-5dea73a3fa6c","resolution":{"observed_at":"2026-08-10T20:46:26.858598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.848408Z","title":"Pbirch: a scalable parallel clustering algorithm for incremental data,","venue":null,"work_id":"ccc1eb69-180d-4fad-a517-e4a46381b3bb","year":2006},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.356025Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:e92f1dfcf71d9becd7ede227ab3075bba669b7c336f944f5c6423f28076f1d64","observation_id":"97b81e54-56ba-49cb-a0d3-4f0d852acf24","resolution":{"observed_at":"2026-08-10T20:46:26.851251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.840934Z","title":"Scalable hierarchical clustering with tree grafting,","venue":null,"work_id":"6c88c980-6551-4ac8-ac1b-caa63b738112","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.358729Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:f9c870f21c1b1c47efb8c4a51612ef88ea1517fd5c0077705b19e83b7662b91c","observation_id":"090a5a7d-e1b4-4fb2-b166-986e4da7d200","resolution":{"observed_at":"2026-08-10T20:46:26.843940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.833812Z","title":"Online level-wise hierarchical clustering,","venue":null,"work_id":"f9a4081f-f7fd-483c-b223-7f4a38b0dbef","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.360965Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:eacbecb42a0536c6f247996e7c1e1c73edda1c5d077c61612ce524bc05dd8c14","observation_id":"761e28a3-5b6c-4309-9807-06ce78e7c165","resolution":{"observed_at":"2026-08-10T20:46:26.836519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.825620Z","title":"Hierarchical clustering better than average-linkage,","venue":null,"work_id":"71099e12-f5a4-4ea1-a495-45ce15e313ec","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.363604Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:04e009d729899f831f078b5cd09d7dd7bd422fa5cc907f761f2ebf81159bbb61","observation_id":"80b4f553-f2f7-46a5-bfd5-898d6041e8ec","resolution":{"observed_at":"2026-08-10T20:46:26.828492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.817873Z","title":"Hierarchical clustering: Objective functions and algorithms,","venue":null,"work_id":"dafbbf0d-5acd-4a00-9a0a-3e4a342bae9a","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.366099Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:cd90141b2998c558c54330413944c249549f6bdbbbd08e01c0151239cda9748b","observation_id":"25f63df7-ffae-4ccb-b2c2-5628fd45aef5","resolution":{"observed_at":"2026-08-10T20:46:26.820733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.810232Z","title":"A cost function for similarity-based hierarchical clustering,","venue":null,"work_id":"306c9169-18e8-49a1-8005-0baa763f7011","year":2016},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.368675Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ae9270d816cb9ab12f9ec20321115b34cff7730f07d4f612c3ae0fdbb2958f40","observation_id":"31ed5bf6-c5e6-43eb-8208-fc229903d3e3","resolution":{"observed_at":"2026-08-10T20:46:26.813072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.802567Z","title":"Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search,","venue":null,"work_id":"260ec912-6ce8-48ea-8b68-38e52139bcd1","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.371017Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:8024a11f7ea2fa36375be61248323db4161968deb3284195da3479b7f7c19734","observation_id":"8303b2b8-0bd2-415c-82b8-a37958588c27","resolution":{"observed_at":"2026-08-10T20:46:26.805579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.794638Z","title":"Hierarchical clustering of data streams: Scalable algorithms and approximation guarantees,","venue":null,"work_id":"f57f87e2-69d3-4c76-b390-39815b6ad8dc","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.373451Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:716e29be4584037f70c426d9d1c7892a530d8ef6bcdb08e0aebb3a9a4b350a51","observation_id":"cc5ea207-a1ab-4605-89ba-6449d5998137","resolution":{"observed_at":"2026-08-10T20:46:26.797675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.786382Z","title":"Hierarchical clustering via sketches and hierarchical correlation clustering,","venue":null,"work_id":"027bd0b8-b2f1-47e3-9efb-0cfbd3ccacd4","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.375802Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:8889a234defc5eb5da1fcabc30f795509e5ce3690e95fbb64385f8418ec0e568","observation_id":"39014141-0abb-4e30-8c12-7326bf7ecfa2","resolution":{"observed_at":"2026-08-10T20:46:26.789466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.778323Z","title":"Terrapattern: A nearest neighbor search service,","venue":null,"work_id":"dd2f2309-e8db-4100-8810-7a4a1d23990a","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.378352Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:667c0226f232b39a621e0522112e266391b8f99dcadd535b487387f59ac6dbc9","observation_id":"81602787-c33d-49c9-bafc-913e45e0852e","resolution":{"observed_at":"2026-08-10T20:46:26.781259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.11653","last_updated":"2021-05-25T04:14:21Z","snapshot_observed_at":"2026-08-11T14:06:24.127588Z","submitted_at":"2021-05-25T04:14:21Z","title":"Scaling Hierarchical Agglomerative Clustering to Billion-sized Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.11653","snapshot_observed_at":"2026-08-10T20:46:26.380756Z","title":"Scaling hierarchical agglomerative clustering to billion-sized datasets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.380756Z"},"links":{"cited_paper":"/paper/2105.11653","citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:cfda0eb673284b4aad582a949a1936cb04e9463a0434682f98e4d408feae8166","observation_id":"6a040142-1847-439d-8803-775f25ea5dc2","resolution":{"observed_at":"2026-08-10T20:46:26.380756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.770762Z","title":"Affinity clustering: Hierarchical clustering at scale,","venue":null,"work_id":"378b37e2-256d-49e9-b495-74741aa915c4","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.383769Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:058235899c3037ba1642394c288b6c7772dad6558bbf823f0fa7f38f9987cc03","observation_id":"22391df2-9b49-4213-a5af-fcefc03e11fe","resolution":{"observed_at":"2026-08-10T20:46:26.773494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.762466Z","title":"Para- metric umap: learning embeddings with deep neu- ral networks for representation and semi-supervised learning,","venue":null,"work_id":"3c14e499-e904-4fd6-8e5f-a4de206e6194","year":2020},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.386355Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:2e32ebc67c81160e9f2a35892dcf8827235b7e6b5375ee7da1ae415355f08656","observation_id":"cb4c712d-d112-498a-b05f-92f11dda774b","resolution":{"observed_at":"2026-08-10T20:46:26.765734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.754067Z","title":"The amsterdam library of object images,","venue":null,"work_id":"e9dad376-e6ca-4482-b6a3-7d538fd67213","year":2005},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.388994Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:d19acc529d3603eab59e76fdb23439d79b8feaba8fcf603481ff689dd8ba1db3","observation_id":"b8740f04-6633-4bc1-978b-8028eb098b32","resolution":{"observed_at":"2026-08-10T20:46:26.757037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.391578Z","title":"Imagenet: A large-scale hierarchical image database,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.391578Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:494a39d7427bb54c3da6d5a205a2ae560b3a60095f886be5494ee2ca4a46ad03","observation_id":"5d7d9954-548b-4945-889a-15fb9477c9c8","resolution":{"observed_at":"2026-08-10T20:46:26.391578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.742200Z","title":"Rethinking the inception architecture for computer vision,","venue":null,"work_id":"450e98d5-b753-4b34-9b46-686f134c7878","year":2016},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.394120Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:b5c8b24e1c47cda38918353143ce337ecaefaac8daf7b3486461ca8461be7d39","observation_id":"9667d333-234b-406d-91d4-f1c7af59ba60","resolution":{"observed_at":"2026-08-10T20:46:26.745305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.734824Z","title":"Probabilistic case-based reasoning for open-world knowledge graph completion,","venue":null,"work_id":"222502a2-7948-45f2-88d4-f4ad4587400e","year":2020},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.396704Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:7fd3b2ee314938b55bc94ea327a3ad7ecfc6002b56ea49de07dbf3d41cd5e65c","observation_id":"7cd443e6-8ae1-4f04-ba4c-c32ad897208b","resolution":{"observed_at":"2026-08-10T20:46:26.737714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.727753Z","title":null,"venue":null,"work_id":"0fca318e-3dc8-4231-8700-312cb6602e44","year":2020},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.399024Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:b346f9485306467bb419299c58ba73b38e84ccdb938efada8e100c80b852a891","observation_id":"4d2e4c59-84ea-4b4d-8f72-64bcc1336eab","resolution":{"observed_at":"2026-08-10T20:46:26.730320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.720199Z","title":"GraphGrove,","venue":null,"work_id":"51ab19ba-c504-4141-9583-458eb3c5e3ff","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.401562Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:a1ffa97f050a1724135a64c4d9d21c060685c352fc9be96ff5f1f1c531f50b12","observation_id":"522853df-a6fd-441a-8968-0cd91a9f9dcc","resolution":{"observed_at":"2026-08-10T20:46:26.723129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.712488Z","title":"DiskANN: Fast accurate billion-point nearest neighbor search on a single node,","venue":null,"work_id":"1efb7b43-db78-4df0-9806-d0f221e45d04","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.404197Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:b93389c981bd9945962fdb2f3a718ac372cb97613bd0c8599a0bbbba3613d0a6","observation_id":"70b870be-d2ad-405c-9202-05b22318f4a8","resolution":{"observed_at":"2026-08-10T20:46:26.715715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.704923Z","title":"Scaling graph- based anns algorithms to billion-size datasets: A comparative analysis,","venue":null,"work_id":"943023fb-d587-4abc-8751-a9f44e5e9428","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.406837Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:b5578643fdf1f76219bad4eb56b7d0644bd92a9af43b40c94bf5b64d154d05f1","observation_id":"ae39066c-3755-4df4-9ebd-49a2972719b0","resolution":{"observed_at":"2026-08-10T20:46:26.708022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.697041Z","title":"Poly- logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity,","venue":null,"work_id":"5d1adae9-0b7b-4e9e-94e4-08799e6b8c1b","year":2001},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.409365Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ec1f9a603d53048bbd2172c993c00fb13abc6879a98c2c3e8110a2db87d6cb29","observation_id":"d0554b8b-e26f-4b00-83a2-a1d5c3315c7d","resolution":{"observed_at":"2026-08-10T20:46:26.700124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.690096Z","title":"Dy- namic graph connectivity in polylogarithmic worst case time,","venue":null,"work_id":"a16055e4-9f68-49e5-8df7-159b98401fce","year":2013},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.412992Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:3109fb9076c81053129c14bfa069a58c34a2a4f7f95de7dd0e6a2de8dc02307f","observation_id":"e73aa8fb-242e-40f6-982d-82c3ae849137","resolution":{"observed_at":"2026-08-10T20:46:26.692718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.682521Z","title":"Dynamic minimum spanning forest with subpoly- nomial worst-case update time,","venue":null,"work_id":"24b3531e-2586-4883-b199-fa3a4b0c1126","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.415593Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:e883d11811aa58be68f21a60be49a65ba0255dcb1f963b7a58d376a68f6bc7cb","observation_id":"18f0695f-55f3-4a8a-8ce8-27ea021501e6","resolution":{"observed_at":"2026-08-10T20:46:26.685401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.675524Z","title":"Approximate hierarchical clustering via sparsest cut and spreading metrics,","venue":null,"work_id":"2b59f239-c93c-4bd1-a3e0-10bf29fa7a8f","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.418156Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:02a4c395e016b4dd00d958a062b09775df694fe3df7e97ee466736a791312797","observation_id":"bc328b86-a4ce-43b1-b0cc-672545787e7e","resolution":{"observed_at":"2026-08-10T20:46:26.678212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.668161Z","title":"Hierarchical clustering: A 0.585 revenue approximation,","venue":null,"work_id":"4151b23b-26bc-4831-92d7-d866401c1670","year":2020},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.420684Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:451e7f814efe39ca070361ec9d157cbbc6be2a8f66c3e827bc9482ec221e058d","observation_id":"0f029923-7c89-4e3e-b34e-61128ce456df","resolution":{"observed_at":"2026-08-10T20:46:26.671032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.660396Z","title":"Objective-based hierarchical clustering of deep em- bedding vectors,","venue":null,"work_id":"cbc84c29-b215-4af1-a8c9-a03733c5f724","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.423262Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:0a04983270349ae563162fb3f64831e5dba9b2199b1fbce1f4481eb4634092fd","observation_id":"171b5f59-677a-4456-a1c2-bd49c414139b","resolution":{"observed_at":"2026-08-10T20:46:26.663303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.652071Z","title":"Efficient and stable fully dynamic facility location,","venue":null,"work_id":"8b3d5f83-5d48-4006-ae58-ef0f53e475e9","year":2022},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.425917Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:625a94734e7b36e14cb6ce20427e0e8d13b3bf178ed65918ca9493589bf6d7cd","observation_id":"eaa58b1f-8e8a-447b-8a95-15e5c7f57292","resolution":{"observed_at":"2026-08-10T20:46:26.655397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.643383Z","title":"Fully dynamic consistent facility location,","venue":null,"work_id":"ab5ac19b-7402-497a-9d42-1a9bda36b771","year":2019},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.428406Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:ff1309972d75f62cb8b0e67b58e0b207816cb00ea519b982fa78620b99f49875","observation_id":"4cdab3aa-0973-4b88-b393-68e019259fc3","resolution":{"observed_at":"2026-08-10T20:46:26.646244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.14891","last_updated":"2020-09-28T10:47:29Z","snapshot_observed_at":"2026-07-06T09:16:37.287949Z","submitted_at":"2020-04-30T15:45:21Z","title":"Fully-Dynamic Coresets","version":3},"cited_work":{"arxiv_id":"2004.14891","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.14891","snapshot_observed_at":"2026-08-10T20:46:26.553121Z","title":"Fully-Dynamic Coresets","venue":"cs.DS","work_id":"7b37eae0-b63a-43e3-9998-f81c9bda787a","year":2020},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.431032Z"},"links":{"cited_paper":"/paper/2004.14891","citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:3b342cf65ecb7908d04861ecc0bd1ca9e4d495b07e471f77f6708ef7cf50535c","observation_id":"6b56ebc4-01aa-4023-86c0-b4e7db884dd4","resolution":{"observed_at":"2026-08-10T20:46:26.556283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.635536Z","title":"Clustering high dimensional dynamic data streams,","venue":null,"work_id":"a6368613-6efb-4cde-af31-7acb3fb5a66d","year":2017},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.434016Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:0f75eabf72e2c98a595d36c40221d56e5ead9aa353ae5aa838186a6323cfc810","observation_id":"55a12502-32b1-4a03-a442-2658c2e62d5b","resolution":{"observed_at":"2026-08-10T20:46:26.638378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.627686Z","title":"Fully dynamic k-center clustering in low dimensional metrics,","venue":null,"work_id":"784d2a99-a6c2-4a9f-9b2c-64492db93a74","year":2021},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.436610Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:76bdea6a326dd84d2ee34571e90cb67a2bc5bf41a67cbe023d92621dc9a91f9f","observation_id":"81d6a84d-6396-4de4-8926-fc17f4e61c79","resolution":{"observed_at":"2026-08-10T20:46:26.630695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.619307Z","title":"Op- timal fully dynamic k-center clustering for adaptive and oblivious adversaries,","venue":null,"work_id":"2de816b3-1493-4537-9435-d7557d18a6c3","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.439268Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:940153282fb986c5c06582fcb1912ab00c4110335508ecf65f5e46049c578e1d","observation_id":"3284617c-1095-433f-b283-df3f22203e7a","resolution":{"observed_at":"2026-08-10T20:46:26.622416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.611199Z","title":"Fully dynamic consistent k-center clustering,","venue":null,"work_id":"6ffa236d-a9c6-4bd4-8605-7db38f1dc77d","year":2024},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.441847Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:af0c3fe3dc8385bc1b66e87be630fa350a412e794652f88f58ee3b5ddcc5180e","observation_id":"e7ddef4e-e1b0-4248-be7d-47a2c8505fb4","resolution":{"observed_at":"2026-08-10T20:46:26.614213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.603025Z","title":"Bico: Birch meets coresets for k-means clustering,","venue":null,"work_id":"85f87879-021a-4b95-b7e5-c9597e26be53","year":2013},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.444565Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:c1a6dad1a8ff2804ea56d4002f05a8eba68857dfe187b8c15d946bcd03b23ff6","observation_id":"01c2c58f-9dfd-4870-9ddd-b420b4fc7dfa","resolution":{"observed_at":"2026-08-10T20:46:26.606056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.594403Z","title":"Parallel batch-dynamic algorithms for k-core decom- position and related graph problems,","venue":null,"work_id":"4573178d-ccbd-40a1-9d33-cf93eb096f64","year":2022},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.447297Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:0acdec5589be4f0b1b87346886ad7cca25e04fa8ad06b507e062cb5957c6d53b","observation_id":"d6f69208-5050-438f-946c-128963259807","resolution":{"observed_at":"2026-08-10T20:46:26.597467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.586325Z","title":"Online and consistent correlation clustering,","venue":null,"work_id":"a4044fbb-39ed-4daa-a047-a9059f3f9738","year":2022},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.449768Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:977b093ed25ef9085c71bd885fdd331b59d3a2ee30677905b0314b2cd85d9a26","observation_id":"f18dfb0e-043a-43ce-9ed2-99c4ecd24f23","resolution":{"observed_at":"2026-08-10T20:46:26.589410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2648.99184","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:46:26.539443Z","title":"Single-pass streaming algorithms for correlation clustering,","venue":null,"work_id":"253daf16-7193-4145-b13c-c7cffabb576e","year":2023},"citing_paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T20:46:26.452209Z"},"links":{"citing_paper":"/paper/2501.07745"},"observation_digest":"sha256:2c41d965ae8150c05a4870cb47897f156fb7f3a23eaae92d32493e394d9e049e","observation_id":"5dbb706f-3307-4bd9-b98f-e1edfd867f96","resolution":{"observed_at":"2026-08-10T20:46:26.545414Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.07745","last_updated":"2025-01-13T23:18:03Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T20:34:14.383893Z","submitted_at":"2025-01-13T23:18:03Z","title":"DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":53},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:2501.07745."}