{"as_of":"2026-08-08T06:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f1955dc3af6b22afdebf4607ad795ddce9b3c213d2d550ab607df75cba5eb9f","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:32:21.460456Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.05495/citation-record","integrity":"/paper/2506.05495/integrity","json":"/paper/2506.05495/citation-record.json","paper":"/paper/2506.05495"},"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-07T10:32:22.012049Z","title":"Hierarchical clustering: A 0.585 revenue approximation","venue":null,"work_id":"7c973d8e-d782-4afd-898a-6285f667cfae","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.253618Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:68c8965e151e9efa59e9949f96b402f7a1acbd10422c995251c0b9e7e5c0c48f","observation_id":"020344df-0095-46d9-b10d-354eea1ab256","resolution":{"observed_at":"2026-08-07T10:32:22.015126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:22.004791Z","title":"Bartlett","venue":null,"work_id":"c6ee6282-049f-4320-ab0a-927e1ccfe76f","year":1999},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.256707Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:263cf95931c2f3be406c4d57c39104c26ef13f27ff01de6d97de794fcf3b4b23","observation_id":"de53438b-0c6f-4297-bb2e-9c870abb027b","resolution":{"observed_at":"2026-08-07T10:32:22.007675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.996309Z","title":"Online metric algorithms with untrusted predictions","venue":null,"work_id":"429f9feb-a7a7-49e0-bec0-8918b218653a","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.259494Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:21a698c886fca4887f004ab12ca267117ffacf5c18123529b415ec34a9adec6b","observation_id":"142b610a-2581-474f-8003-005235f13b96","resolution":{"observed_at":"2026-08-07T10:32:21.999133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.988884Z","title":"Chen, and Piotr Indyk","venue":null,"work_id":"fd01f97e-ea9d-447f-87da-dfa389ae2f48","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.262364Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:3b9c2625e1db4ab21d281bfb34a01a2256bc096589f8f8829e54e11c02e875c1","observation_id":"3fee56fc-3383-4c24-ab4a-b471fa1ac6f2","resolution":{"observed_at":"2026-08-07T10:32:21.991641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.981182Z","title":"Hierarchical clustering in graph streams: Single-pass algorithms and space lower bounds","venue":null,"work_id":"e16dc359-d6e2-497d-9860-ce3ced298d85","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.265635Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:fea05ea8912ae6c87c8c458ae2881a5a2d313c4ddb16ee68f823139416debe95","observation_id":"dcd85dc2-6e72-4384-acf1-c953f446c52a","resolution":{"observed_at":"2026-08-07T10:32:21.984266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.973949Z","title":"Online algorithms with multiple predictions","venue":null,"work_id":"af08bb8b-18f5-410b-8a18-9df01b7de13a","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.268099Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:31850f317f9cda50010de7c22b10f5e357b6d6eff451ab54a2a43790d8d580ba","observation_id":"e9147a7f-0dca-4acb-a2d4-0d2dfc3c42af","resolution":{"observed_at":"2026-08-07T10:32:21.976714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.966777Z","title":"0(sqrt (log n)) approximation to SPARSEST CUT in \\ o (n\\( ^ 2 \\)) time","venue":null,"work_id":"1f515a4e-31c1-4466-8c5b-81fdb991def8","year":2004},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.270703Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:8674998beffa842938401948ae13b8e46bfe2bceb5c0d638011491c00c2f7ed8","observation_id":"361f3b8f-08ef-4b06-a4df-13e0c8123651","resolution":{"observed_at":"2026-08-07T10:32:21.969480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.273128Z","title":"Parallel approximate maximum flows in near-linear work and polylogarithmic depth","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.273128Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:5504f3fa5bf0f9eb0c68c044d8a99487fe863054b068583b7db1b043de71fa65","observation_id":"a18179ff-5f3c-41d6-9e7a-a4975bd45499","resolution":{"observed_at":"2026-08-07T10:32:21.273128Z","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-07T10:32:21.955220Z","title":"Sublinear algorithms for hierarchical clustering","venue":null,"work_id":"fae5c1a1-fdd3-40eb-802f-7ede31747b6c","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.275650Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:9ab20935eabd2e2e5802e647dff9009c2580f1a1e8816e3f9bf1ba0108e2e4ce","observation_id":"b5d300e5-d2c9-4cce-93be-fc83f7da4cc5","resolution":{"observed_at":"2026-08-07T10:32:21.958600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.948419Z","title":"Online graph algorithms with predictions","venue":null,"work_id":"a14140d4-968d-4ffd-8339-4ad4dd385ded","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.278062Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:3512c62dfbf394872b2d5c509fcc9be5403bcfdd6d31bf8b1911fd0929c69d31","observation_id":"28d1af19-7d7d-41e1-8881-4abd215c8d23","resolution":{"observed_at":"2026-08-07T10:32:21.950938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.941467Z","title":"Aho, Yehoshua Sagiv, Thomas G","venue":null,"work_id":"3447ed4e-32c4-4b76-b9d5-28364386d846","year":1981},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.280491Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:27057e57f3dd34880061ca819b58eb11d1031291f128c609d5a08ca221fb756b","observation_id":"4df2d8c6-4b55-40c4-aadb-187921896df8","resolution":{"observed_at":"2026-08-07T10:32:21.943994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.934535Z","title":"On the compatibility of quartet trees","venue":null,"work_id":"d79e442b-23be-4055-a16b-665fe76d285d","year":2014},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.282996Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:e2d760541e493e9f8c0817fe396bc3688416ed619e9c99efa897c374f852ea08","observation_id":"6a3e6365-cb81-40cd-9b58-1bd205b2a435","resolution":{"observed_at":"2026-08-07T10:32:21.937188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.927800Z","title":"Jiang, Hoai-An Nguyen, Chen Wang, Yubo Zhang, and Samson Zhou","venue":null,"work_id":"aad26e12-ba73-4eb1-a44e-59219d0ae1f5","year":2025},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.285327Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:ab25c5a2d2eac7dc0f966e3e4932e0359fc831fd8288dd9d91b6ccec543ff3a7","observation_id":"78e49528-ccc2-4f79-b59e-51cea133b9a3","resolution":{"observed_at":"2026-08-07T10:32:21.930152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.920868Z","title":"Learning-augmented maximum independent set","venue":null,"work_id":"5af6f2cf-52db-4ff0-bbb2-2967edb4c269","year":2024},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.287852Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:0d7bb5946597152450d2347168bdc71af4b97fe70779d8dea10ba1af2cd2b4f4","observation_id":"c45d5515-16df-475f-8cd1-3ed38994910a","resolution":{"observed_at":"2026-08-07T10:32:21.923560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.914040Z","title":"The primal-dual method for learning augmented algorithms","venue":null,"work_id":"5bacee39-e6ff-41d5-b063-9800649283a2","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.290207Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:6cd2eb79f93aa0f6b4505fd364cab81d3cf4a96c84701517eaed3793c971d3c5","observation_id":"07bd050c-e110-48b7-b13b-8dd47238f41c","resolution":{"observed_at":"2026-08-07T10:32:21.916606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.906931Z","title":"Advice querying under budget constraint for online algorithms","venue":null,"work_id":"88a473c7-c8da-41d0-b528-301033b0ea6c","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.293243Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:d851242d6257b936d8c511a037bc2ddd04240bc409b02142cc480ae1d9845fd2","observation_id":"755e7def-fd33-47b4-ab1a-bd1653dbc28b","resolution":{"observed_at":"2026-08-07T10:32:21.909778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.898645Z","title":"Approximate hierarchical clustering via sparsest cut and spreading metrics","venue":null,"work_id":"dd69cfa9-a02e-406d-8115-6864b27391f2","year":2017},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.295643Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:7c834f6630512180d43cea7f200df36d9aff69ae0c478038fabb29a7e2af1994","observation_id":"e5f15cec-9beb-4301-83e9-a3e462a3f0e9","resolution":{"observed_at":"2026-08-07T10:32:21.901732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.891005Z","title":"Approximate hierarchical clustering via sparsest cut and spreading metrics","venue":null,"work_id":"d2499604-89c6-4d5a-97c4-08c6cc08c747","year":2017},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.298545Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:5b178a02935435c91f9420fe92666e8f53e9931f2f10f1b471530f0fd4b3f15c","observation_id":"d45c3a3a-62f0-4a92-a04f-0ba425149954","resolution":{"observed_at":"2026-08-07T10:32:21.893883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.883736Z","title":"Hierarchical clustering better than average-linkage","venue":null,"work_id":"6b2d1c64-5228-40bc-b092-122aaeef5623","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.301916Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:767d540011869af3b0533f8b0bb2c7a71863eca2267c77935785d9af68c6e293","observation_id":"9f6a8a98-84bc-47cf-b39a-604411841875","resolution":{"observed_at":"2026-08-07T10:32:21.886534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.876453Z","title":"Hierarchical clustering for euclidean data","venue":null,"work_id":"7ba7a2ae-7c76-4927-a786-c95798a01edc","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.305015Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:81f862d3062326d125124192a42aab36642f38148f4526d61e34a8206ff0db93","observation_id":"68a98dbf-89ff-44cf-98e5-f66626098e98","resolution":{"observed_at":"2026-08-07T10:32:21.879105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.869045Z","title":"Learning-augmented approximation algorithms for maximum cut and related problems","venue":null,"work_id":"9889b800-7276-4931-9aa1-a1ea1ad114ba","year":2024},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.307323Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:67b65e0959673b2d7feb7705c04310784042e8185064d016e63b7deda6304efb","observation_id":"80fb9571-4f6a-4840-8e81-32f13a27482d","resolution":{"observed_at":"2026-08-07T10:32:21.871957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.861512Z","title":"Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P","venue":null,"work_id":"4a6fda50-c6eb-43c0-9a9e-00ca6e1d3889","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.310540Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:5ddc5f4f6da0c9083bc69778af95e673760b2f2ce1985d96064f9d33cc19d2c9","observation_id":"3d061d9a-dd65-41e0-9f3a-ccf5a25dabd1","resolution":{"observed_at":"2026-08-07T10:32:21.864417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.01459","last_updated":"2020-10-04T01:16:07Z","snapshot_observed_at":"2026-07-06T10:01:12.123445Z","submitted_at":"2020-10-04T01:16:07Z","title":"Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering","version":1},"cited_work":{"arxiv_id":"2010.01459","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.01459","snapshot_observed_at":"2026-08-07T10:32:21.493801Z","title":"Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering","venue":"cs.DS","work_id":"c359ab52-b817-416a-a3d6-dbc9e24e22d8","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.313973Z"},"links":{"cited_paper":"/paper/2010.01459","citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:e1d7c8af0ed5828bbbf4ba7507db048e4426ab6646b003cb113cfc3b63d989d9","observation_id":"a669ef27-991d-4e38-aecd-976755fe8454","resolution":{"observed_at":"2026-08-07T10:32:21.497717Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.316880Z","title":"Chen, Piotr Indyk, and Tal Wagner","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.316880Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:74dd2009251c1dbdeccf7cb515c65ea3dcd02307de9ed9e9fd02f15620872619","observation_id":"ead16ccd-995e-4659-8a58-0f531ec17e5e","resolution":{"observed_at":"2026-08-07T10:32:21.316880Z","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-07T10:32:21.850588Z","title":"Hierarchical clustering: Objective functions and algorithms","venue":null,"work_id":"40bf6145-4b56-4d89-a3f7-f7c873006916","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.319634Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:b6791358221874135310bcfe63074e7ef8bcb0b1d584416fc015723e7b2bed0c","observation_id":"eed84081-7703-4887-9d64-a7fe9cdbd301","resolution":{"observed_at":"2026-08-07T10:32:21.853075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03332","last_updated":"2025-04-10T19:07:00Z","snapshot_observed_at":"2026-07-06T20:01:36.670000Z","submitted_at":"2024-12-04T14:03:27Z","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","version":2},"cited_work":{"arxiv_id":"2412.03332","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.03332","snapshot_observed_at":"2026-08-07T10:32:21.482036Z","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","venue":"cs.DS","work_id":"b665990b-4ff0-41ad-821d-556ba44ff4cf","year":2024},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.321989Z"},"links":{"cited_paper":"/paper/2412.03332","citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:2fe1bc54d6d89734e597721f62fd32ac1b56663360b4e56c603a3f49b2e3f0b6","observation_id":"c4de72cb-ea54-4a40-bde1-6d8fc9cb9d2b","resolution":{"observed_at":"2026-08-07T10:32:21.485874Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.843487Z","title":"Triplet reconstruction and all other phylogenetic csps are approximation resistant","venue":null,"work_id":"e3a1e928-14e2-47fb-9bda-8556a3022729","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.325148Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:1c2d686c683fa48b507631f045ea72704a50d228d40b7123312c3ae31019b3c7","observation_id":"25a28e73-ca52-43b0-927e-35bb5674a4ce","resolution":{"observed_at":"2026-08-07T10:32:21.846042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.836292Z","title":"Hierarchical clustering with structural constraints","venue":null,"work_id":"243950ea-3a02-4aae-a8dd-6eb5aa68b5c3","year":2018},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.327606Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:2ef5c5f7e7e70a43a878eebc581d26bd235f7465b88303d24915501b70c65a70","observation_id":"1d22c34a-5854-4c68-9e3b-368ca32d4ff3","resolution":{"observed_at":"2026-08-07T10:32:21.838833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.828972Z","title":"Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang","venue":null,"work_id":"ca71f55f-d495-4fca-ab96-36bed3c64ab2","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.329930Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:133e686728644dba9f242d659db3d66d12db58052abf19bc38db0db437482fef","observation_id":"2903afe3-07c3-43d9-ad19-e100a3ede3f8","resolution":{"observed_at":"2026-08-07T10:32:21.831437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.821695Z","title":"Bisect and conquer: Hierarchical clustering via max-uncut bisection","venue":null,"work_id":"bb0ee033-100b-4e6a-8a8e-703a5c2d3426","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.332228Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:846b6fc33d55814082839fbd0e04ebaf763c87a09fb7fc3dadae693739be347a","observation_id":"59fa90b5-d378-48a7-a230-5b12c0fd247f","resolution":{"observed_at":"2026-08-07T10:32:21.824256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.814311Z","title":"A cost function for similarity-based hierarchical clustering","venue":null,"work_id":"725ef0d1-1cfb-4291-a3ea-2c633ec0c06e","year":2016},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.334601Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:6df93f4b70228e3f19e2c031d53a43301227c34b7644ca29509040d34e9ff80f","observation_id":"e7bfc780-7242-4691-b803-1a6d1f86bb20","resolution":{"observed_at":"2026-08-07T10:32:21.816908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.807340Z","title":"On the price of differential privacy for hierarchical clustering","venue":null,"work_id":"a2adc880-d81e-4f58-9acb-dfa873f31c0a","year":2025},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.337057Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:dd72f12ea8ac477c5678c46b45d1e7f0df1167e32c8b7c8b69d8a68dcd28de08","observation_id":"17ffa1c1-6d8b-4df2-9122-e52a78145475","resolution":{"observed_at":"2026-08-07T10:32:21.809981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.800293Z","title":"Faster matchings via learned duals","venue":null,"work_id":"05a383b3-88e0-4e3e-9547-a7b494e63fb7","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.340246Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:a0cf911e234a646b562d487f24d1b8e24c2e740d72aec04ad4a7a5dfc2ab1c63","observation_id":"fe0dbb47-99ed-4538-a549-a66b5025e176","resolution":{"observed_at":"2026-08-07T10:32:21.802809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.792720Z","title":"Predictive flows for faster ford-fulkerson","venue":null,"work_id":"1f12267e-05ff-4353-87ae-dcdfc5de263b","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.342532Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:f585d042998e6b51b74449d5b720eba425fc665c592155f8bea067c300e82357","observation_id":"0dc34c72-f8e1-4445-b0c4-2655a7aead0f","resolution":{"observed_at":"2026-08-07T10:32:21.795197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.784964Z","title":"Learning-augmented streaming algorithms for approximating MAX-CUT","venue":null,"work_id":"7f833922-a15b-4ddc-afe9-efcf8f6f895f","year":2025},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.344952Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:fcfdd43c33f317602e7b01619999409f0be22d6c8588c36077fcff98178a3b78","observation_id":"668f112f-d344-4a7c-825d-4c73dd17343c","resolution":{"observed_at":"2026-08-07T10:32:21.787473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.777738Z","title":"Ergun, Zhili Feng, Sandeep Silwal, David P","venue":null,"work_id":"7d129693-1ad5-4feb-98e4-31b61ef1a80d","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.347420Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:8ea8b69213f037d4617025e571f341b868b15d8b31e2bc7fb8055c341a872339","observation_id":"a30fc460-e4b0-41c5-8b1c-b64e5f8eeaa6","resolution":{"observed_at":"2026-08-07T10:32:21.780250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.771303Z","title":"Adaptive hierarchical clustering using ordinal queries","venue":null,"work_id":"d919e102-d57e-4ce5-917e-db9a053f3941","year":2018},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.349928Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:794dd0f5e2956cc686e51e615bd020e1504b629adae903484869641c05b6a6ab","observation_id":"ec1f3d0e-285f-4066-9d98-9e72793f1224","resolution":{"observed_at":"2026-08-07T10:32:21.773708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.764445Z","title":"Nguyen, Jung Hoon Seo, Ryan S","venue":null,"work_id":"7f4fa9ae-4d78-49b4-a916-8d22b7bd75ce","year":2025},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.352708Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:a77889f65ab108f1d7e4a3985d4671ebbcf178bf54fea4cf5bddfa3c518308c4","observation_id":"3a007768-2e82-4020-a04d-564eca26ec48","resolution":{"observed_at":"2026-08-07T10:32:21.766949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.757728Z","title":"Efficient algorithms for divisive hierarchical clustering with the diameter criterion","venue":null,"work_id":"49aa9712-2ea2-4241-9933-0e36c6e74fe8","year":1991},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.355114Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:a6b16bad37b611a02e8e7f1fc80fa5c5a8bea340fcb2c29210843143e79339d3","observation_id":"f72f0d28-fe1a-490a-91a9-648a30ff47c4","resolution":{"observed_at":"2026-08-07T10:32:21.760277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.751009Z","title":"Learning-augmented algorithms for online linear and semidefinite programming","venue":null,"work_id":"678a9a80-7114-4cf4-8e4b-48a6d9f6bc74","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.358132Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:bfdfbe045ce792ef58cf410149a54ad70843aea43be9285618ed258278df686a","observation_id":"222f0915-f43b-4618-a697-c05ac94c05d5","resolution":{"observed_at":"2026-08-07T10:32:21.753617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.744315Z","title":"Online algorithms for rent-or-buy with expert advice","venue":null,"work_id":"b6828e61-fe2c-4d3b-87f2-4221dc0e86b2","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.360684Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:284d182250b39676e57ea3292dd9d20ec772da35703f42278f5b20e6f69da5c6","observation_id":"6cf9ba5c-6934-4947-89c7-c4979c737c58","resolution":{"observed_at":"2026-08-07T10:32:21.746851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.737363Z","title":"Augmenting online algorithms with varepsilon -accurate predictions","venue":null,"work_id":"16205ae5-814b-4f16-96cb-fdaec69955be","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.363362Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:474746a9ba17931fc2a6ab603784c4b5aee160c747eb8221f486a35ca21b0a98","observation_id":"bc175877-5130-4e96-a64f-caf69c94d41c","resolution":{"observed_at":"2026-08-07T10:32:21.740151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.730573Z","title":"On dasgupta's hierarchical clustering objective and its relation to other graph parameters","venue":null,"work_id":"1554cb8d-5b9a-4ab7-aad7-af73a888392c","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.365830Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:8a21ce658ed8b8d43c3bf763cc9c2f034341da50be985d8cc3264def52b4dac1","observation_id":"9545a4d9-9c18-48f4-b536-053bd7cb8bc5","resolution":{"observed_at":"2026-08-07T10:32:21.733147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.723776Z","title":"Learning-based frequency estimation algorithms","venue":null,"work_id":"9607c1db-dd0d-4e25-a3e2-3cebf7efd2d4","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.369419Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:57c5c814bf31533df42e67acaace1487ed57068536e7eeaf38173fafa12c0d62","observation_id":"f41d7347-b396-4ab4-ad40-813280068995","resolution":{"observed_at":"2026-08-07T10:32:21.726278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.717031Z","title":"Online knapsack with frequency predictions","venue":null,"work_id":"42972e9b-14be-47f9-98c1-e0bd7812d151","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.372344Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:4262f0a72dc8cac59a2ee37d4c7377a2bc9a0df4bc5d19b31aca246544fa9217","observation_id":"a96c6cd2-0f54-4d35-80f9-c76f3ba9a7dc","resolution":{"observed_at":"2026-08-07T10:32:21.719637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.709928Z","title":"Dimensionality reduction for wasserstein barycenter","venue":null,"work_id":"4e1e4422-2676-40ea-ad87-789eb5b0dbab","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.374858Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:b91cc28f5fcf004db7ee27ffc1f2c7be463682d35053b5672ce93be043637c93","observation_id":"a81c6fdc-ea1b-486f-b586-c2ae95fb4a50","resolution":{"observed_at":"2026-08-07T10:32:21.712616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.703102Z","title":"Learning-based low-rank approximations","venue":null,"work_id":"7225a6ae-e299-4065-b544-6ccba0877ef5","year":2019},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.377124Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:74a2f8867627120166f8239012f570904766fd242336fb4601feec883e61e8f2","observation_id":"633a31b1-b6bf-483b-96bd-91bdb516d457","resolution":{"observed_at":"2026-08-07T10:32:21.705669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.696262Z","title":"Kearney, and Ming Li","venue":null,"work_id":"510a8185-d4dc-464f-8be9-d028328e94ec","year":1942},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.380394Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:acf213626604a457dbd9408a8f2cd652c33f9cf06cadced882f68d7618fa4816","observation_id":"e6b34c2b-d488-485f-a987-e73adbf312c1","resolution":{"observed_at":"2026-08-07T10:32:21.698905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.689695Z","title":"Woodruff","venue":null,"work_id":"43347de8-68d8-4021-a122-06934cc2da53","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.383607Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:6341f6f17d6df28fc32520184e388d5e106c81c9baa845a20f67d811f34422c6","observation_id":"7783dc26-50a9-421b-a93c-b50304f42f21","resolution":{"observed_at":"2026-08-07T10:32:21.692139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.682799Z","title":null,"venue":null,"work_id":"52246a73-a3ae-48fc-beb6-d51e774ec6c1","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.385904Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:be2ccf9fb6e496c12b7b230958916c5133c53094ef3b499c9778d6e45b7c394b","observation_id":"98284866-275b-4c43-b63d-d1c525c5e825","resolution":{"observed_at":"2026-08-07T10:32:21.685393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.675212Z","title":"Chi, Jeffrey Dean, and Neoklis Polyzotis","venue":null,"work_id":"e143f18e-af9d-47ff-882c-82c3e0fcb856","year":2018},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.388122Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:384006aba7bf0e1dc058b2f77eb891850616bfa79844aab5e4a4efa3c3bb680b","observation_id":"b69eeffb-6418-43b9-9130-2e433205510e","resolution":{"observed_at":"2026-08-07T10:32:21.677778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.668345Z","title":"Learning predictions for algorithms with predictions","venue":null,"work_id":"aa504692-b6f6-4f07-bef9-3e0bd8518010","year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.390985Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:594c2e339b94a4864b148cbace526c91d399a3c58f716b51fc23ab664de1eb22","observation_id":"2d4690d3-758b-42bf-b638-17f45abd3eac","resolution":{"observed_at":"2026-08-07T10:32:21.670969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.661521Z","title":"Training gaussian mixture models at scale via coresets","venue":null,"work_id":"2b4a60bc-5120-41d2-a059-2683f0b25049","year":2017},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.394207Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:60b2bf255f8701e50247827acc781cd0b16ebd2d29808723c603370302d81aff","observation_id":"fb17165f-7e3f-4ab3-9b55-8553726b3fac","resolution":{"observed_at":"2026-08-07T10:32:21.664099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.654388Z","title":"Woodruff","venue":null,"work_id":"d944da62-c77b-4460-97c3-95c375ab60a8","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.396605Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:1cc34afe0ae62880d0abd0411f9bd21706fd28eca1074b3a383046f25a04854c","observation_id":"246ec3fb-9e80-4efd-b396-529e4e57e9f0","resolution":{"observed_at":"2026-08-07T10:32:21.656970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.647417Z","title":"Online scheduling via learned weights","venue":null,"work_id":"95f9ff86-93e3-4c40-bd1a-ab2cf439871d","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.399747Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:c617916466584a8b1b348b2c085cd36bbe385522baed8201f7e7d9bdfde6f529","observation_id":"e96a664d-fbb7-4bcf-b3b5-45e0c3d3d424","resolution":{"observed_at":"2026-08-07T10:32:21.650010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.402023Z","title":"Woodruff","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.402023Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:757cd92bfd4bead02f9e4f6f940f742f1ca463d99e74165a6cd525e87b136a73","observation_id":"056a0d2a-8ec1-4c8e-b12b-14d43b39ec23","resolution":{"observed_at":"2026-08-07T10:32:21.402023Z","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-07T10:32:21.636973Z","title":"Mining of massive data sets","venue":null,"work_id":"ff3094da-b2ac-40b7-9b80-e92fa6c16bb2","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.404382Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:e9be1cacebe0da028bdb183745ed91e582b05eb0e7f58c9c8471f35b7dde5fe1","observation_id":"75080d13-337e-4846-954f-8976d5f13a0f","resolution":{"observed_at":"2026-08-07T10:32:21.639556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.406816Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.406816Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:5d872bd3911dd163aafd398cde9f730a8a127a1c5708c613d2e1ce0d0121d8ec","observation_id":"f3f51f22-bbd1-4003-8a83-add66c6f54aa","resolution":{"observed_at":"2026-08-07T10:32:21.406816Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:32:21.409390Z","title":"A model for learned bloom filters and optimizing by sandwiching","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.409390Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:7c80ca877a8e30d4b7c9a127819962461d025838959f7def986397cd15744dd2","observation_id":"fe43e0e8-8772-4b7e-b199-04730049c17a","resolution":{"observed_at":"2026-08-07T10:32:21.409390Z","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-07T10:32:21.622394Z","title":"Hierarchical clustering: O(1)-approximation for well-clustered graphs","venue":null,"work_id":"4b9f4f49-c222-48fd-b495-fa1159da6848","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.412057Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:cd71d0327d7a492b73ec5868c8957121fd5f335b4394e89bc667d2b2fe374eca","observation_id":"3eb6af6d-f7e6-4878-863e-43452ccf6035","resolution":{"observed_at":"2026-08-07T10:32:21.625087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.414877Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.414877Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:d14070fc0c9262faf3b9c307a0a9375e108008616a6d73fdb9d9ab0ccc73b495","observation_id":"df3391a0-2a7c-405c-b1d4-e1935f0bd54e","resolution":{"observed_at":"2026-08-07T10:32:21.414877Z","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-07T10:32:21.611623Z","title":null,"venue":null,"work_id":"e6f30838-c238-42db-aeb4-08f5b3f6f1bc","year":2017},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.417363Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:cbf57e361009710eebc4fc9c63cf758ba6a0ba97efb3c2391f49b4f86e16860a","observation_id":"4d86f8b7-a8a9-4fd1-a66c-967eda1a011e","resolution":{"observed_at":"2026-08-07T10:32:21.613944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.605227Z","title":null,"venue":null,"work_id":"0b84648d-dab6-4ecc-b357-f86c4ea62597","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.420853Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:4e7ab38fcf5b317c5b2c1200c0bc25e456836c27ff51b985d8bd26450bd5465e","observation_id":"b09c3827-97a1-4a24-928f-3a61332d7752","resolution":{"observed_at":"2026-08-07T10:32:21.607477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.598471Z","title":"Improving online algorithms via ML predictions","venue":null,"work_id":"1a3beec0-ef14-4fc5-b3a9-eb26bf90393d","year":2018},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.423398Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:f3668cec901c859e07637f3251c821d9844f3bb3b6f846480219a5e15d19d367","observation_id":"e0eff90a-a1f4-40a0-8df8-5d9baa935280","resolution":{"observed_at":"2026-08-07T10:32:21.601203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.591405Z","title":"Hierarchical clustering via spreading metrics http://papers.nips.cc/paper/6325-hierarchical-clustering-via-spreading-metrics.pdf","venue":null,"work_id":"c2a19d45-1768-4fc4-8943-314dd3366bf5","year":2016},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.426192Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:e3eb2c34f72d3a109b01a396071104be34684394a0aa4721db8f6649b2caac1e","observation_id":"6aeb228b-dadb-4d45-9126-72e3e0b35bb5","resolution":{"observed_at":"2026-08-07T10:32:21.594088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.584246Z","title":"Hierarchical clustering via spreading metrics","venue":null,"work_id":"e8588dc6-02d5-45cc-93d1-528fd2d2941d","year":2017},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.429935Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:4ee676b112038395c8dbc5e6e3fec7237c856e25c0d7c07cd3dfde84a5ff8e87","observation_id":"e1883f40-b73d-4820-a95a-306ecdc9fec1","resolution":{"observed_at":"2026-08-07T10:32:21.586873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.577128Z","title":"Procopiuc, and Claudio Gentile","venue":null,"work_id":"9235d1fd-8f96-4d6d-9df2-e7d0836f0693","year":2021},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.432526Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:520abd361a2d7bd67cc1c2246df6fd40d2efd1719edcc57a2ca8d6f5d7f7f1f6","observation_id":"8b393f3c-4d6a-4a1e-9542-ce951e640829","resolution":{"observed_at":"2026-08-07T10:32:21.579710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.569581Z","title":"A comparison of document clustering techniques","venue":null,"work_id":"f2b0751e-6896-488d-bd53-550134836530","year":2000},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.436359Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:cfa94647d3de818b4bd0a95abe2c8765b96c164a5a6c19702eeb873ca69753fb","observation_id":"ac316dd4-bfc2-4e51-b1e3-a841391d1fda","resolution":{"observed_at":"2026-08-07T10:32:21.572235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.562655Z","title":"Improved learning-augmented algorithms for the multi-option ski rental problem via best-possible competitive analysis","venue":null,"work_id":"5b176d61-8223-4726-a98a-460f5a802862","year":2023},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.439942Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:8f3be0f602c6a3d5eaee5b8d4c354686931d0539bdcf902bd32e39e00e09125a","observation_id":"7f0b3562-6081-4299-a430-7cb6d29e3a35","resolution":{"observed_at":"2026-08-07T10:32:21.565215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.555908Z","title":"Breast cancer classification and prognosis based on gene expression profiles from a population-based study","venue":null,"work_id":"efdb38d5-631b-413e-a403-0705f0658f45","year":2003},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.442373Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:04938c249cb5573d5ce688da6f5ce6b3a88e0cd34082dcee64dadb55f04eac13","observation_id":"7a2fbf5f-5f73-4bce-87b0-0cf9485d13f8","resolution":{"observed_at":"2026-08-07T10:32:21.558484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.549729Z","title":"Numerical taxonomy","venue":null,"work_id":"40bc2731-7438-4d4c-9f20-8cb903766819","year":1973},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.444999Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:30fec416cd14113acbf55f2a6170323462ee773d4d414f4f2006f98e5d9411dd","observation_id":"7f636c62-a312-4e3e-87c7-d2e21e225348","resolution":{"observed_at":"2026-08-07T10:32:21.551967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.542987Z","title":"A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs","venue":null,"work_id":"4dbeaade-8781-4775-8d8d-94fb1a4b75f6","year":2011},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.447706Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:b8bb9a75afe19057398138c78ce8b32e0f0c10595571a09233522fa6fd33bef2","observation_id":"c765a1a3-45b8-4a8a-bbb3-ba01c0b41df1","resolution":{"observed_at":"2026-08-07T10:32:21.545582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.535883Z","title":"Goodfellow, and Rob Fergus","venue":null,"work_id":"51f651fc-0ba0-4364-ad7d-65a92cf0b62d","year":2014},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.450185Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:137d9e239a7e2a3742b5c9fb22d2e90189fe66ff0707cb0a2298596915e581b0","observation_id":"acc00f63-0d4a-426a-b993-fe8932d661d6","resolution":{"observed_at":"2026-08-07T10:32:21.538429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.527580Z","title":"Who belongs in the family? Psychometrika , 18(4):267--276, 1953","venue":null,"work_id":"e9b8ea00-5e1d-44af-b5b9-b43fbd24b793","year":1953},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.452850Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:5d78d40b4a5aba10235c7ca16e1d6dbd438310b582c256b3dca92e1091534adf","observation_id":"d0446833-b976-4e45-a31c-9d27416d845a","resolution":{"observed_at":"2026-08-07T10:32:21.530903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.518474Z","title":"Hierarchical grouping to optimize an objective function","venue":null,"work_id":"ee7621fe-e176-4bdf-b231-3bf2a6905dc8","year":1963},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.455397Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:33bb3013174470173d658f4ac55e71a9c8b100220da76759f7a8732e9b3f76a0","observation_id":"21193937-aace-46b8-a214-702317b4f029","resolution":{"observed_at":"2026-08-07T10:32:21.521659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.510796Z","title":"Online algorithms for multi-shop ski rental with machine learned advice","venue":null,"work_id":"9a2fc983-0c8b-468d-b32e-eb3e3afb729f","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.457963Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:e5950d5f0cabc2d12be656a50435240164c312fe53fe4b2ad7e29ea14c8f10bf","observation_id":"28a3eb45-96cf-4db6-ad09-0e02dd83f310","resolution":{"observed_at":"2026-08-07T10:32:21.513425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:32:21.503085Z","title":"Optimal robustness-consistency trade-offs for learning-augmented online algorithms","venue":null,"work_id":"2d82c23a-7f76-46ba-90e9-b98ca81a9bf2","year":2020},"citing_paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:21.460456Z"},"links":{"citing_paper":"/paper/2506.05495"},"observation_digest":"sha256:12a34a31f21e5a2ac889d6425b811c2fb15644ba5a21cabc597f649073f7abdd","observation_id":"01d04786-fbe8-42b8-b7de-94a2570e953a","resolution":{"observed_at":"2026-08-07T10:32:21.505912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05495","last_updated":"2025-06-05T18:22:40Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T13:50:19.796577Z","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":66},"total_outbound_references":77},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2506.05495."}