{"as_of":"2026-08-20T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:392168d6708e19b51da171e810c225b2ccd592a6664736a8b6a909868a6f0c18","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:05:28.254903Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2608.06990/citation-record","integrity":"/paper/2608.06990/integrity","json":"/paper/2608.06990/citation-record.json","paper":"/paper/2608.06990"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:27.918600Z","title":"RNN-DBSCAN: A density-based clustering algorithm using reverse nearest neighbor density estimates.IEEE Transactions on Knowledge and Data Engineering, 30(6):1109–1121, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.918600Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:a764ea80f85e8a9895e9c42a9f52b4bdfde707951bfc865095f8e6e440c42155","observation_id":"ef8732aa-7187-46d0-b10b-2895fe3d6664","resolution":{"observed_at":"2026-08-10T17:05:27.918600Z","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-10T17:05:27.929092Z","title":"Sarasvady","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.929092Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:1dfd35b429813da0e645771071a89a47e210c9fe2b1e4db37e1a28967a2c51ba","observation_id":"f0f6774b-b907-4675-8021-444d4330df88","resolution":{"observed_at":"2026-08-10T17:05:27.929092Z","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":"6305.27631","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:29.670717Z","title":"CURE: An efficient clustering algorithm for large databases.ACM Sigmod record, 27(2):73–84, 1998","venue":null,"work_id":"cb1cb623-fe88-408a-bc62-9026ecfe3c59","year":1998},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.938410Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:0fdec95f3c30a3e3ea9e6f3288943f0c6912376882d456bf558fd9c7aaa5c758","observation_id":"76394aae-5ea9-4d78-9b98-75570437e612","resolution":{"observed_at":"2026-08-10T17:05:29.683745Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1999.75496","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:29.474735Z","title":"ROCK: A robust clustering algorithm for categorical attributes","venue":null,"work_id":"424869e7-ad58-45c9-ae84-071e28eb33aa","year":2000},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.945548Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:1e357cdad37ca0f43a4cab17805089532b6d95e842fd2806bcbb8ac000608cbb","observation_id":"f51e66c4-d02e-4ed6-8804-f0e9a5fa8ba7","resolution":{"observed_at":"2026-08-10T17:05:29.521177Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/2.781637","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:28.379469Z","title":"Chameleon: Hierarchical clustering using dynamic modeling","venue":null,"work_id":"a6c0a4cd-d342-459b-8b2b-1ce09e625e26","year":1999},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.953612Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:2b40400bb8ecae9832a8d0e34f57d3012a702c8c69b8da18b3801e68569bbd1f","observation_id":"45573722-329f-47a8-991a-ce4cfae73f64","resolution":{"observed_at":"2026-08-10T17:05:28.386202Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.74395","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:29.281339Z","title":"Reza Asharif, Yulwan Sung, and Seiji Ogawa","venue":null,"work_id":"dbdd572e-71f3-4e65-becc-738eaac30550","year":2015},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.966350Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:b4a6bdc370337089e1ad3ab57776a36d1fb61b89cdcc40e488269bac7d227dd8","observation_id":"6805d76d-9c05-44e4-9e18-3264cb05eea4","resolution":{"observed_at":"2026-08-10T17:05:29.311827Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.647535Z","title":"A new hierarchical clustering algorithm with intersection points","venue":null,"work_id":"7cc84366-604a-4649-96c6-5bb7f62b4342","year":null},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.984123Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:7cb8ec879176c20bb30ccaa52be8c02b4b966d3a54217f1bbec5c59e501c20c0","observation_id":"6414b471-269c-4476-8ae5-cfd1d86e1fd8","resolution":{"observed_at":"2026-08-10T17:05:30.655220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.567524Z","title":"An optimized CHAMELEON algorithm based on local features","venue":null,"work_id":"9b1d45f8-5474-45c5-8830-c4621d5bce48","year":2018},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.018264Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:50d0c6785ba071d0900c3419eac69b19a7136a850eb30305da5a6fac95835cc2","observation_id":"3e3f95ea-adc2-4429-9271-d25cdb8960ad","resolution":{"observed_at":"2026-08-10T17:05:30.582155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.523681Z","title":"Density-based spatial clustering of applications with noise","venue":null,"work_id":"db134870-8375-4b6c-bf2f-30f3b7ddc519","year":1996},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.025040Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:6cbce3e0b1341f619cd3ad33f293d4f8370a05d3218a0d7f45af95fe7ad257cd","observation_id":"91110895-1805-44a4-b547-6bb2915bf7f4","resolution":{"observed_at":"2026-08-10T17:05:30.537543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.489514Z","title":"Clustering by fast search and find of density peaks.science, 344(6191):1492–1496, 2014","venue":null,"work_id":"d0c9a71e-b2b8-4503-9c4d-80b3354f4da1","year":2014},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.039458Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:5378508adc68b750f8b60e73990a24366907b81942c7062c5fa0a087de45cfe5","observation_id":"ba29570e-5ee1-484f-8484-64f877c607f0","resolution":{"observed_at":"2026-08-10T17:05:30.499515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.461682Z","title":"Hybrid clustering algorithm based on improved density peak clustering","venue":null,"work_id":"27f49e0f-b637-48f4-bb95-e097547e71e3","year":2024},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.048666Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:da0a5864a379fbb20b155a4a66729146f43c5388536b4068dc26f80f6025d7f2","observation_id":"ca1fdd32-26cf-41e9-9786-cd398e52bffa","resolution":{"observed_at":"2026-08-10T17:05:30.471197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.432306Z","title":"Mean shift analysis and applications","venue":null,"work_id":"cdc6ed3b-47cd-4c82-8b22-fdf94102a5de","year":1999},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.053907Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:a0e2f665d3e937e86b677aa87aceb9f6ca00d8e3e065018fe29d23193f71983f","observation_id":"b4f41ab0-e36a-48b5-bcb5-cce5fdc523db","resolution":{"observed_at":"2026-08-10T17:05:30.442168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.406510Z","title":"Hierarchical density estimates for data clustering, visualization, and outlier detection.ACM Transactions on Knowledge Discovery from Data (TKDD), 10(1): 1–51, 2015","venue":null,"work_id":"f362608f-b757-41f0-8599-3afa9ac3d1e3","year":2015},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.058575Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:0ab53b483fe105dc01f20da133f2102529e787e4ba12635e3e4cda276c664e51","observation_id":"e3ee29b3-7dbf-4031-99f5-06d733baf8a1","resolution":{"observed_at":"2026-08-10T17:05:30.418178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.372208Z","title":"DenPEHC: Density peak based efficient hierarchical clustering.Information Sciences, 373:200–218, 2016","venue":null,"work_id":"9e8f660a-410b-4038-8826-88ce82f420b9","year":2016},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.071546Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:14660816bb10315ee5da5db6a8c8ba8c4ea1c6046e50788b6cf09fb3ec758694","observation_id":"1a97cb42-ea4f-4054-b1b6-307ee7c7ee38","resolution":{"observed_at":"2026-08-10T17:05:30.381679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.342731Z","title":"Efficient computation and visualization of multiple density-based clustering hierarchies.IEEE Transactions on Knowledge and Data Engineering, 33(8):3075–3089, 2019","venue":null,"work_id":"faaf1079-b895-42ef-8240-4f9f852e2841","year":2019},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.081401Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:467a1dce310d7d2a7e418a79cbc3de714b89bb26500434a4ad075b22fe55f494","observation_id":"eb0d8985-5438-4540-9eb5-02069494ddd6","resolution":{"observed_at":"2026-08-10T17:05:30.352251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.311778Z","title":"Hierarchical clustering that takes advantage of both density-peak and density-connectivity.Information Systems, 103:101871, 2022","venue":null,"work_id":"6f783e0d-10a0-4d00-8943-69d1326b290a","year":2022},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.089395Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:3e291d53ac06d5bfabb650135bb8b2dd95a853b6428d0dd4f90c1fa4944b5205","observation_id":"53627eee-6e4d-45b0-9794-a79adbc5c409","resolution":{"observed_at":"2026-08-10T17:05:30.317847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.277204Z","title":"Fast sparse representative tree splitting via local density for large-scale clustering.Scientific Reports, 15(1):29398, 2025","venue":null,"work_id":"022d2aba-badf-4909-9176-a8cb5ec1fc98","year":2025},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.100384Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:c2d839d73106f617e8e1f4ce0caac5a44207345efae7774146f5dc9ac0975926","observation_id":"093ba29d-f476-4f8d-bb7a-9952f461f8bf","resolution":{"observed_at":"2026-08-10T17:05:30.285246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.236168Z","title":"Graph clustering with local density-cut","venue":null,"work_id":"22341ca0-0b0a-4661-a297-9968a288e9bc","year":2018},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.106818Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:d9a353c89b42030e92b2790a12ac7c902c4f4ff167d056c8f293ca23a50a59f8","observation_id":"828a17b1-ddf9-4c75-a19e-6c907009cc27","resolution":{"observed_at":"2026-08-10T17:05:30.245356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.199079Z","title":"ADPSCAN: Structural graph clustering with adaptive density peak selection and noise re-clustering.Applied Sciences, 14(15):6660, 2024","venue":null,"work_id":"25effe5d-a715-4ea9-8160-6380945a4f92","year":2024},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.115263Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:34227adac7895564c0a389481b3f71972e7330475be8f37cb47903eb93e34d5f","observation_id":"4d9fddc0-187f-4835-81cd-512e80a98064","resolution":{"observed_at":"2026-08-10T17:05:30.207567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.172868Z","title":"DSets-DBSCAN: A parameter-free clustering algorithm.IEEE Transactions on Image Processing, 25(7):3182–3193, 2016","venue":null,"work_id":"8d30d0d9-09c3-48ae-87cd-92aaf258c8f5","year":2016},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.124886Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:3ba023fab2d5ce1403a5f6c27f78450ab85ff11a6bcb299d13e107aca6bc50a0","observation_id":"43261e95-7dfc-4c0d-93a0-713951b64247","resolution":{"observed_at":"2026-08-10T17:05:30.181643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.131637Z","title":"Multiview clustering: A scalable and parameter-free bipartite graph fusion method.IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(1):330–344, 2020","venue":null,"work_id":"c071e624-7042-441f-ad4f-cfcf7da8b5b9","year":2020},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.134839Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:2d583056d31ef83233189d64733702d4e60f20576fccd40990d4a71313fccae9","observation_id":"513c05fa-1bc0-4518-9bc4-98c0c07b283b","resolution":{"observed_at":"2026-08-10T17:05:30.141581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11904","last_updated":"2025-05-17T08:41:07Z","snapshot_observed_at":"2026-08-17T07:04:58.241706Z","submitted_at":"2025-05-17T08:41:07Z","title":"K*-Means: A Parameter-free Clustering Algorithm","version":1},"cited_work":{"arxiv_id":"2505.11904","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.11904","snapshot_observed_at":"2026-08-10T17:05:28.981947Z","title":"K*-Means: A Parameter-free Clustering Algorithm","venue":"cs.LG","work_id":"5a7215f2-c67a-4888-bcc2-48c5b966cc5b","year":2025},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.144060Z"},"links":{"cited_paper":"/paper/2505.11904","citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:6d2d8bf25bc8d67aeb31777c602a3e91562290ad3f668ecaec9bb0ec0a9d9cd8","observation_id":"c35733a5-1058-4ad3-a545-56a8e6093777","resolution":{"observed_at":"2026-08-10T17:05:29.010807Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:28.151517Z","title":"Ruspini, James C","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.151517Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:2dc3907558dd767341334019d5efa84c29d60897482fda55a5dd68d51e122949","observation_id":"18c6edbf-916e-441b-ae7c-8ac16ab95c2d","resolution":{"observed_at":"2026-08-10T17:05:28.151517Z","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-10T17:05:30.606007Z","title":"Research and application of improved CHAMELEON algorithm based on condensed hierarchical clustering method","venue":null,"work_id":"7a623d8d-c342-4e7c-9f9c-763a918977b7","year":2019},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.156572Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:d0976b8e64f32c5c546efcfa91fa383f9c606979e9a67d8bcb0976885f12d537","observation_id":"876138be-7d63-467a-9706-899f43e8e06c","resolution":{"observed_at":"2026-08-10T17:05:30.616561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.093294Z","title":"Chameleon 2: an improved graph-based clustering algorithm.ACM Transactions on Knowledge Discovery from Data (TKDD), 13(1):1–27, 2019","venue":null,"work_id":"bfd475b4-2d01-440f-9891-5d7017447480","year":2019},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.166611Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:9bd938447e108f1f72ccf5833a34d22836968facf0baf0b8ecd9f514e330ffd1","observation_id":"9d5e6576-e961-4ec9-8802-20da40cb4f5e","resolution":{"observed_at":"2026-08-10T17:05:30.107070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.045460Z","title":"Data partitioning in hierarchical clustering: A parameter-insensitive approach.International Information Institute (Tokyo)","venue":null,"work_id":"80ddf179-20cd-45df-b233-decdb7e0661d","year":2013},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.173017Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:795ffc014bb13729f533b645b0141bbe5fbea2684012506140cbce5813196b79","observation_id":"309028e8-8412-415a-a011-159dd8679d64","resolution":{"observed_at":"2026-08-10T17:05:30.054950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2501.02612","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:28.753252Z","title":"Chameleon2++: An efficient and scalable variant of chameleon clustering.arXiv preprint arXiv:2501.02612, 2025","venue":null,"work_id":"d6e7d126-8268-45c8-a459-4f76449a5d3d","year":2025},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.182049Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:5d604ee5bfa06a73bad1cb2058710676e966e2bb3f574715e8a93a34e370aef3","observation_id":"8703f13f-40b2-426a-a8a3-2b219d11629d","resolution":{"observed_at":"2026-08-10T17:05:28.780334Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:30.019871Z","title":"K-means properties on six clustering benchmark datasets, 2018","venue":null,"work_id":"34ea3984-15f3-4bdb-becd-a64b2406fe5f","year":2018},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.195932Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:3c0d74d158d9da0cfe3a944a5b70526e3b6a0254087697b2e01bcbed89a0bb27","observation_id":"dbb4609e-4734-4f5c-b2e4-d5192da7aaed","resolution":{"observed_at":"2026-08-10T17:05:30.027824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00521-020-04754-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"McDPC: multi-center density peak clustering","venue":"Neural Computing and Applications","work_id":"1bd58d11-61b3-43c2-85bf-fed46d9c6da3","year":2020},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.204541Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:6db296371f1e699a1ca65b773582e627e5cae8d5a6b95407293ac85f3d3d2ca7","observation_id":"5946ea5f-58e1-42cb-af3c-0c7e0b4b398a","resolution":{"observed_at":"2026-08-10T17:05:28.361639Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.31479","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:28.531063Z","title":"A novel mean-shift algorithm for data clustering.IEEE Access, 10: 14575–14585, 2022","venue":null,"work_id":"64eaeed8-9c99-45e1-b974-f8d1858ca7a6","year":2022},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.212181Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:d9ff330d7c615f764c2f804213bc244424e042e2cffcfe28e3eac32f71803c5a","observation_id":"eeee9da5-fed0-4258-bc05-baf034feff42","resolution":{"observed_at":"2026-08-10T17:05:28.548562Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:29.998180Z","title":null,"venue":null,"work_id":"417cc198-a85d-4d46-9826-6f33e1e07417","year":2009},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.218947Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:22fb95d758acb317cf4b1b0931625b06524ac1bcdc3de58cca6c4dc50d24274c","observation_id":"2369c4a2-6be2-4720-9428-4eb4d9fff2b6","resolution":{"observed_at":"2026-08-10T17:05:30.003296Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:29.981533Z","title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance.Journal of Machine Learning Research, 11:2837–2854, 2010","venue":null,"work_id":"597fdf21-d8ee-42c9-8f97-f5bb370780aa","year":2010},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.225271Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:b6551f66fee76512127e3f6b16d237f2b7970312bcf582d51e3d0e0d38c80761","observation_id":"6a33b85d-f6dc-4908-ac56-d920cea6d7ce","resolution":{"observed_at":"2026-08-10T17:05:29.986924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:29.955315Z","title":"Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation","venue":null,"work_id":"ebd1dbf9-c753-4a7c-883f-0e63efaaf972","year":2011},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.234760Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:cf6924b574a4e2cd62ff388f3d7883a225793bbff41255801f405d10b23184c6","observation_id":"95353a32-1c82-4f8c-a529-236043d3cbf2","resolution":{"observed_at":"2026-08-10T17:05:29.960422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:05:28.245466Z","title":"nearest neighbor","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.245466Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:ef92b196a745ab54db8d1058375645d8e666b16682cf07ed576ed265aab22bbc","observation_id":"5ff184ce-afbb-4ac8-9db5-865d6d164602","resolution":{"observed_at":"2026-08-10T17:05:28.245466Z","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-10T17:05:29.915133Z","title":"Cambridge University Press Cambridge, 2008","venue":null,"work_id":"175f4737-4396-4fe8-87a8-d0dd6570474c","year":2008},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:28.254903Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:18a1f9d99f43ec901cd3e717707b14c26b2fe69430b8641f940adf45f381798b","observation_id":"af6ab747-f53b-4e6d-b141-307e66b868b7","resolution":{"observed_at":"2026-08-10T17:05:29.921246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.85967","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:05:29.129036Z","title":null,"venue":null,"work_id":"7b082655-e0a1-4b5a-b871-7f573bff3e9c","year":2018},"citing_paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T17:05:27.998116Z"},"links":{"citing_paper":"/paper/2608.06990"},"observation_digest":"sha256:094618146952a069e8adaf57b0719f05154fc035f45e8b47bdbad72e6f17ebf1","observation_id":"b63be877-5f35-4f86-8e08-f98a42ddd2cc","resolution":{"observed_at":"2026-08-10T17:05:29.144156Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06990","last_updated":"2026-08-07T09:09:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T09:35:47.477168Z","submitted_at":"2026-08-07T09:09:13Z","title":"Density-aware Hierarchical Clustering Based on Element-Categorized Connection Subgraphs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":5,"verified_exact":4,"verified_fuzzy":22},"total_outbound_references":36},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2608.06990."}