{"as_of":"2026-08-11T11:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94ceada46874d3371e61d4df23190623f0db9e23c493526bf8419d9fe97ed534","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:12:39.200727Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.20047/citation-record","integrity":"/paper/2507.20047/integrity","json":"/paper/2507.20047/citation-record.json","paper":"/paper/2507.20047"},"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-06T14:12:39.838642Z","title":"Subquadratic high-dimensional hierarchical clustering","venue":null,"work_id":"fbc198b3-0ed4-4cca-86c4-20d9420689fa","year":2019},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:36.821376Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:5d0b0dd015b0ac804e36982c9a211dfe603aa0ee8bd310277d18ebf6e8354aa5","observation_id":"b67b0f59-327c-4f10-bc6a-8e01934605c6","resolution":{"observed_at":"2026-08-06T14:12:39.843183Z","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-06T14:12:39.823952Z","title":"Efficient centroid-linkage clustering","venue":null,"work_id":"56fc356f-3a9b-4880-8f6b-6a65d340ea0a","year":2024},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:36.853416Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:f980a0083b3956b9d0fa9d118c3288ea4904fdf09dbf08a7ee0b91f24d88f92f","observation_id":"7ed46717-7258-423a-b6ff-a5c59b9dfcff","resolution":{"observed_at":"2026-08-06T14:12:39.828778Z","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-06T14:12:39.808934Z","title":"It's hard to hac with average linkage! In International Colloquium on Automata, Languages and Programming (ICALP) , 2024","venue":null,"work_id":"0b2a39e3-4b99-4fc2-8839-766d4324207a","year":2024},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:36.930869Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:bcf04bb1e76d52202fa878a154efca8bcaf00e48e31856ce0a2a79cb46baf7b4","observation_id":"f3388ba0-6126-453b-981c-9df911f23d3e","resolution":{"observed_at":"2026-08-06T14:12:39.814061Z","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-06T14:12:39.793450Z","title":"Introduction to Parallel Algorithms (DRAFT) , 2024","venue":null,"work_id":"dfc46dc6-ecd7-4897-aea0-d38bdc506369","year":2024},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.001492Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:859d0c007603b8298fd864e60fb45ddae5619a753db6047927a9707b487aa57e","observation_id":"097fcefe-66c2-44c4-8bfd-1e4ea2c3603b","resolution":{"observed_at":"2026-08-06T14:12:39.799128Z","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-06T14:12:39.777641Z","title":"Cover trees for nearest neighbor","venue":null,"work_id":"d6dc07d2-9110-4252-a2c7-c6923b20440d","year":2006},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.077777Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:6f4920a751eb2fdf7d98ea4742055a97e3313e51ed2ba45403558073b764de0f","observation_id":"7adf259f-4189-4927-a847-ec36e57521a8","resolution":{"observed_at":"2026-08-06T14:12:39.783064Z","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-06T14:12:39.762584Z","title":"The complexity of the comparator circuit value problem","venue":null,"work_id":"95ac1af8-dc7f-471a-9c40-27a33676c6ef","year":2014},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.175496Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:f736eeac4665ce6a4b283f4049a8ebbe9cc08bf0bf44b30d4b2842508c1e6aab","observation_id":"1799635d-f62a-462e-8b38-775d7629d40c","resolution":{"observed_at":"2026-08-06T14:12:39.767771Z","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-06T14:12:39.748494Z","title":"Twister tries: Approximate hierarchical agglomerative clustering for average distance in linear time","venue":null,"work_id":"f610213e-ce1e-4afa-a3de-460ab6ad39fe","year":2015},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.228911Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:dcca2e3cf1a81ee9c5fac1944f35a02149b43894a28f444c5d85560c2484f079","observation_id":"9b96c325-1719-47f9-b779-19928bc81c3b","resolution":{"observed_at":"2026-08-06T14:12:39.753114Z","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-06T14:12:39.733753Z","title":"Optimal parallel algorithms for dendrogram computation and single-linkage clustering","venue":null,"work_id":"5a9c92a0-8e20-402c-b9ac-6d796dd3ab9b","year":2024},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.306745Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:5fe619df3b256e048e6d7a03280c4987179845d430417e8f20b5a39e259f9c63","observation_id":"0ffcccb9-366f-49ce-8268-1b53008b2ea0","resolution":{"observed_at":"2026-08-06T14:12:39.738851Z","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-06T14:12:39.719092Z","title":"Hierarchical agglomerative graph clustering in nearly-linear time","venue":null,"work_id":"cd51c607-3642-4117-8799-f71c7a2db63c","year":2021},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.365397Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:36cd692f5675725d6e62eb8d8acaf2e066aa00469449d307a48efba945fab40a","observation_id":"5d117c95-ccbe-4f42-9b30-f2568ff1de18","resolution":{"observed_at":"2026-08-06T14:12:39.724486Z","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-06T14:12:39.703452Z","title":"Hierarchical agglomerative graph clustering in poly-logarithmic depth","venue":null,"work_id":"9616423e-f5b4-4f63-ad4a-b520eda98914","year":2022},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.477049Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:024f8aaad9f118f68abc9561ee382940a01811a0ce3f1f9c057fd9c6718c4943","observation_id":"e36b9724-db05-47fe-b39f-5574a76c8cfd","resolution":{"observed_at":"2026-08-06T14:12:39.708850Z","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":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-06T14:12:37.593542Z","title":"The faiss library","venue":null,"work_id":null,"year":2024},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.593542Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:84a7fd9520843a004d6224e9d3fee5cea5a942f3add88d83ffa54a5f54f73c03","observation_id":"bf0e1fce-4a62-49fe-b1b2-c9e160f06db3","resolution":{"observed_at":"2026-08-06T14:12:37.593542Z","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-06T14:12:39.688159Z","title":"Terahac: Hierarchical agglomerative clustering of trillion-edge graphs","venue":null,"work_id":"312702d2-ba36-49ec-8ff4-c1bdcea9bafe","year":2023},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.696677Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:c01a0c753dd14767f40034298c40c84fd93f1f85d1a0a19afa087b7464626239","observation_id":"f5a9a21f-98b0-4ca8-8d68-d93c00f19198","resolution":{"observed_at":"2026-08-06T14:12:39.693238Z","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":"2305.04359","last_updated":"2024-02-08T17:00:13Z","snapshot_observed_at":"2026-08-09T16:15:36.406735Z","submitted_at":"2023-05-07T19:28:23Z","title":"ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04359","snapshot_observed_at":"2026-08-06T14:12:37.808299Z","title":"Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, and Yihan Sun","venue":null,"work_id":null,"year":2023},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.808299Z"},"links":{"cited_paper":"/paper/2305.04359","citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:a8013f9c52411abe031e334f4765925194a72fd1cc3f709e7e4fb2974967b377","observation_id":"f3971baf-ac83-453f-b77f-70d339e4cf4b","resolution":{"observed_at":"2026-08-06T14:12:37.808299Z","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-06T14:12:39.671940Z","title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree","venue":null,"work_id":"1def6437-ebf9-4408-a58b-c2866c97dee3","year":2023},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.903804Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:64b1bf70f32e162f753879b46bdff53444443f001c616459f41b7c82b7e680dd","observation_id":"d84fba27-5b3a-4d98-879b-feed841a0710","resolution":{"observed_at":"2026-08-06T14:12:39.677480Z","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-06T14:12:39.657068Z","title":"Clustering for private interest-based advertising","venue":null,"work_id":"c8810058-b460-49ee-ae48-e4d56da8c38b","year":2021},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:37.980943Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:b406131d674603120ae9d0aae16af67192d3d618a0acfed65b502859e9cd5359","observation_id":"fe5169a4-02b2-4383-9643-8b40197acd0d","resolution":{"observed_at":"2026-08-06T14:12:39.661963Z","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-06T14:12:39.641901Z","title":"Tight analysis of parallel randomized greedy mis","venue":null,"work_id":"45c4ae0c-3fca-4ff9-8ae4-8d07171a47d3","year":2019},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.051675Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:557dd7f08b91a5c4134eab706022b9f8a8b02dda5d796f826587ffc2391b05b6","observation_id":"3807f092-d207-45d9-974d-c9048ad18057","resolution":{"observed_at":"2026-08-06T14:12:39.646625Z","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-06T14:12:39.627444Z","title":"Parallel cover trees and their applications","venue":null,"work_id":"f9fe3010-8185-43fd-8728-3a4d7ed38eb7","year":2022},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.100895Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:6b600a60c517deeddddd527b8de0279d46b181f480e1009668024a4e46a39211","observation_id":"7246d57b-73b1-4bf2-b9e9-fb7948535af4","resolution":{"observed_at":"2026-08-06T14:12:39.632411Z","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-06T14:12:39.612868Z","title":null,"venue":null,"work_id":"c94eb523-76e0-476b-bda5-c4ba65120d8d","year":1967},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.170772Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:883a0244d676504a8c808dea433e5969aba05eaca69a14c565ec79748faadbfc","observation_id":"f57116fb-c118-4f5e-95df-7dda1a2b8d75","resolution":{"observed_at":"2026-08-06T14:12:39.617614Z","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-06T14:12:39.597894Z","title":"Analysis of ward's method","venue":null,"work_id":"34ab859c-9fe3-4588-9e7e-17e1b82abae8","year":2019},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.267256Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:6f6a04e0227395fd5dfc0f9e2d0e4424a4a07fa912dc51ca22ed0f67d9b32713","observation_id":"84587bce-55b6-401d-887d-a75b84f2eb79","resolution":{"observed_at":"2026-08-06T14:12:39.603079Z","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-06T14:12:39.582523Z","title":"Clustering.jl","venue":null,"work_id":"2e284357-fb8c-469f-b75c-f4b004cc5eca","year":null},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.315367Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:2c41eeec8608a7fbf47e7630b7b5f75a8cfc4452521050790565d2ba6e6f9b30","observation_id":"db01629a-9847-498d-9be4-bd6130b69b0c","resolution":{"observed_at":"2026-08-06T14:12:39.587747Z","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-06T14:12:39.566388Z","title":"Hierarchical clustering","venue":null,"work_id":"ae11108c-6ff5-43fb-b48a-05d4f7caa0f2","year":null},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.397792Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:a1a4d6d2dfe14d28e22f5fca56b310677862bfc30be2ef7920ae61d93187293c","observation_id":"1185c031-5934-450c-b4d1-4281bff528c1","resolution":{"observed_at":"2026-08-06T14:12:39.571403Z","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-06T14:12:39.550366Z","title":"A framework for parallelizing hierarchical clustering methods","venue":null,"work_id":"b8091e34-c0bb-49eb-931b-616a8c2be888","year":2019},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.501467Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:c76f3beca0fc6b8ef02bd5a8f48f91ec0f03edac3350fbd63620054dae6cf54d","observation_id":"7d5a4602-cad9-4c89-a186-847976edf184","resolution":{"observed_at":"2026-08-06T14:12:39.555995Z","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-06T14:12:39.535220Z","title":"A general theory of classificatory sorting strategies: 1","venue":null,"work_id":"32864a22-a0df-432e-aefa-945632ec777e","year":1967},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.565735Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:c7ce49dfc530984bf13c04f7029c2b2b7e6aa8a2f936279180bef7805ff6a126","observation_id":"84750ca7-8280-4217-b1fb-46efa0873442","resolution":{"observed_at":"2026-08-06T14:12:39.539907Z","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-06T14:12:39.518388Z","title":"Agglomerative hierarchical cluster tree - matlab linkage","venue":null,"work_id":"bb8fd734-ae95-4bc1-af94-424b00c573a2","year":2024},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.690338Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:8857bfb603767e9816302c9026c7abd606b22600459be5efae534cb01135eaba","observation_id":"c0228cc6-434b-4fd7-9050-287bd095b2b8","resolution":{"observed_at":"2026-08-06T14:12:39.523923Z","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-06T14:12:39.500923Z","title":"Algorithms for hierarchical clustering: an overview","venue":null,"work_id":"d01368df-3275-45df-ad88-426aaa7d11d7","year":2012},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.749260Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:ece77456ef5da9150b5ed40b2c7cfdbfcc07592bc80fb9cbece91549a140480f","observation_id":"e5d2d0bd-db47-4b21-8367-0fd96362b4e1","resolution":{"observed_at":"2026-08-06T14:12:39.506766Z","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-06T14:12:39.484656Z","title":"Algorithms for hierarchical clustering: an overview, ii","venue":null,"work_id":"76fc7cb9-ce78-4117-b542-29675b590fc4","year":2017},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.832720Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:2a142744e1221d35752fe54486b9edb64359b23bc00fdd214b1415f4519537c8","observation_id":"66f98fbf-e0be-4fef-bb75-0b9fce736ff8","resolution":{"observed_at":"2026-08-06T14:12:39.490696Z","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-06T14:12:39.468009Z","title":"The complexity of circuit value and network stability","venue":null,"work_id":"1f9b8ad8-b5a4-4fb7-8b73-13057ec9e462","year":1992},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:38.966175Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:8c4dbb0e48157f4579dac94417b1c01c67ab73188db3fee40a38727d41c24253","observation_id":"bd07af3e-be55-41ed-a745-969d2d96789a","resolution":{"observed_at":"2026-08-06T14:12:39.473865Z","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-06T14:12:39.451941Z","title":"fastcluster: Fast hierarchical, agglomerative clustering routines for r and python","venue":null,"work_id":"07f24155-6f09-48f5-884e-d3b9d17e8ec0","year":2013},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.004336Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:c0e8edfd3a7f423fd65945c42e2e1fe28e5655a8fe3475c168173098e047f5c9","observation_id":"6ea9d626-1bfa-47e3-b596-54d4a4bf80be","resolution":{"observed_at":"2026-08-06T14:12:39.457001Z","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-06T14:12:39.435719Z","title":null,"venue":null,"work_id":"85e16ea3-6146-470c-8439-afed91c41dfe","year":2017},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.107944Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:d9634eec832d78c754949eeb91746c0d9be59717a199ad6057540393545ea2bb","observation_id":"c2237676-3f9f-4756-9b35-aa13661cc512","resolution":{"observed_at":"2026-08-06T14:12:39.440637Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:12:39.160730Z","title":"Scikit-learn: Machine learning in python","venue":null,"work_id":null,"year":2011},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.160730Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:e54d4d20ddb6ffa974f1d4652314b3f7d6ffe0efeee5ba882cfd01bb22ad6fbb","observation_id":"ab358831-d0cf-40ec-8463-81df57983690","resolution":{"observed_at":"2026-08-06T14:12:39.160730Z","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-06T14:12:39.409579Z","title":"hclust function - rdocumentation","venue":null,"work_id":"facc09b7-fc30-4798-8d28-688d2e2a38a5","year":null},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.165310Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:95b4e0ddc64cf760bdb64b455a365d93c44905092f2a3e5afe9ba2ed6104a201","observation_id":"d433fda8-832d-436a-acbe-417da1b89d35","resolution":{"observed_at":"2026-08-06T14:12:39.415364Z","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-06T14:12:39.391507Z","title":"Parallel algorithm and complexity results for telephone link simulation","venue":null,"work_id":"2b47071f-a008-4a9b-a234-cca3089ba469","year":1991},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.169986Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:e979594e5a2d11ed9917a97ff50d96fc124985f2bb813ac6f42f75dd1c6d5cff","observation_id":"8374ca81-97f5-4c47-9e7c-361f97ec8bc2","resolution":{"observed_at":"2026-08-06T14:12:39.398202Z","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-06T14:12:39.373570Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"ddbcf183-65fa-426b-ac26-f12f3cfbeedb","year":2019},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.173976Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:8641cfd6d033936ce1bd1605f930a020bfd936a24d29e1168ed6aebe22739bb9","observation_id":"bd8a0f83-0883-43e3-8709-3f1985b7a827","resolution":{"observed_at":"2026-08-06T14:12:39.379436Z","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-06T14:12:39.357693Z","title":"A new approach to stable matching problems","venue":null,"work_id":"0300a4f8-1850-4e03-a77f-189353721773","year":1994},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.178151Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:70af96ab704ca1cb96b568042ea4dad1002cf00efc505cfbe5a4c0c5b191c10d","observation_id":"0edd9991-bed1-4081-8fff-9589224a42c0","resolution":{"observed_at":"2026-08-06T14:12:39.362843Z","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-06T14:12:39.341806Z","title":"How small is a unit ball? Mathematics Magazine , 62(2):101--107, 1989","venue":null,"work_id":"2e73d565-7353-4821-9204-00c734930d24","year":1989},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.182107Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:dcfe3cf10a45581d09383359a10e626ce1b0cd01e220d0afb1db6baa528c368e","observation_id":"b0700936-92bd-4c20-99e2-0c5d4cb5aa85","resolution":{"observed_at":"2026-08-06T14:12:39.346920Z","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-06T14:12:39.325929Z","title":"Alglib, a simple symbol-manipulation package","venue":null,"work_id":"d51ecf33-7dca-475f-b4a8-c75bf41cb07e","year":1985},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.186181Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:094bf228a0673ceaf9701e91af8198a16994e5b0c0844cc8f32a2973f65c5700","observation_id":"2e078d8c-809b-4c5a-ba14-f91157844421","resolution":{"observed_at":"2026-08-06T14:12:39.331198Z","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-06T14:12:39.309586Z","title":"Scipy 1.0: fundamental algorithms for scientific computing in python","venue":null,"work_id":"6fead5ac-88bf-4796-817e-df419b32f6f4","year":2020},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.191876Z"},"links":{"citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:7b57df517a4e60dd935acbe676b52d3068ccf5cb18960fe5d62a82e139a37954","observation_id":"53edb0aa-a794-41d0-a1f1-bd61920a8b50","resolution":{"observed_at":"2026-08-06T14:12:39.314926Z","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":"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"}},{"citation":{"cited_paper":{"arxiv_id":"2411.10290","last_updated":"2024-11-15T15:47:32Z","snapshot_observed_at":"2026-07-06T19:51:01.075884Z","submitted_at":"2024-11-15T15:47:32Z","title":"The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering","version":1},"cited_work":{"arxiv_id":"2411.10290","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.10290","snapshot_observed_at":"2026-08-06T14:12:39.237153Z","title":"The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering","venue":"cs.DC","work_id":"b2bebe3e-d11e-42bf-adfb-e3b800fa9711","year":2024},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-06T14:12:39.200727Z"},"links":{"cited_paper":"/paper/2411.10290","citing_paper":"/paper/2507.20047"},"observation_digest":"sha256:171e4376568983a35fe99b622c07c9883cdbdacc57100d976a7724e51819693f","observation_id":"f0750a31-e132-4889-ba82-eb514e26e711","resolution":{"observed_at":"2026-08-06T14:12:39.243777Z","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"}}],"paper":{"arxiv_id":"2507.20047","last_updated":"2025-07-26T19:52:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T14:12:20.146593Z","submitted_at":"2025-07-26T19:52:50Z","title":"Parallel Hierarchical Agglomerative Clustering in Low Dimensions"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":32},"total_outbound_references":39},"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 11 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2507.20047."}