{"as_of":"2026-08-16T11:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06778fdf26cec317e99ca744d04cce53460c0cd3e1cca17754eb0333454bba5e","coverage":[{"denominator":150,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:49:55.969014Z","state":"measured"},{"denominator":104,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":104,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T17:20:21.639912Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T17:24:57.234593Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"cited_work":{"arxiv_id":"2501.13597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13597","snapshot_observed_at":"2026-06-30T17:24:57.234593Z","title":"Berahmand, F","venue":null,"work_id":"8000f649-84c7-4006-8a3c-4d72fcd16b2f","year":2025},"citing_paper":{"arxiv_id":"2507.19247","last_updated":"2026-05-13T00:51:45Z","snapshot_observed_at":"2026-07-06T22:02:51.299919Z","submitted_at":"2025-07-25T13:14:03Z","title":"A Markov Categorical Framework for Language Modeling","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-19T02:34:24.622622Z"},"links":{"cited_paper":"/paper/2501.13597","citing_paper":"/paper/2507.19247"},"observation_digest":"sha256:b69586f2faee172d4884fddb9bb90fe965abdde62653b37206e8f84f3b31fe5b","observation_id":"2b211a4d-d3aa-48d3-bf28-8e84524a8a1c","resolution":{"observed_at":"2026-05-19T02:36:59.952118Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"cited_work":{"arxiv_id":"2501.13597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13597","snapshot_observed_at":"2026-06-30T17:24:57.234593Z","title":"Berahmand, F","venue":null,"work_id":"8000f649-84c7-4006-8a3c-4d72fcd16b2f","year":2025},"citing_paper":{"arxiv_id":"2605.22410","last_updated":"2026-06-27T05:25:38Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:36:24Z","title":"Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T07:34:54.929422Z"},"links":{"cited_paper":"/paper/2501.13597","citing_paper":"/paper/2605.22410"},"observation_digest":"sha256:e5c1261011a81ec236a6d93e19bd01dec8c3070b11024906ee3ffbb9ceae0837","observation_id":"c11b3a47-0b7f-4163-be18-100ae5e9e95e","resolution":{"observed_at":"2026-05-22T07:36:14.170644Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"cited_work":{"arxiv_id":"2501.13597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13597","snapshot_observed_at":"2026-06-30T17:24:57.234593Z","title":"Berahmand, F","venue":null,"work_id":"8000f649-84c7-4006-8a3c-4d72fcd16b2f","year":2025},"citing_paper":{"arxiv_id":"2605.22410","last_updated":"2026-06-27T05:25:38Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:36:24Z","title":"Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T17:20:21.639912Z"},"links":{"cited_paper":"/paper/2501.13597","citing_paper":"/paper/2605.22410"},"observation_digest":"sha256:c61d8d24e55bb3a57e24bbea6b1c22a47351f9ab131b0673ab953ccfdda1e2e9","observation_id":"54a313ee-dff2-4293-bc33-8c041144c991","resolution":{"observed_at":"2026-06-30T17:24:57.236059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"cited_work":{"arxiv_id":"2501.13597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13597","snapshot_observed_at":"2026-06-30T17:24:57.234593Z","title":"Berahmand, F","venue":null,"work_id":"8000f649-84c7-4006-8a3c-4d72fcd16b2f","year":2025},"citing_paper":{"arxiv_id":"2605.30134","last_updated":"2026-05-28T16:02:23Z","snapshot_observed_at":"2026-08-08T13:16:33.761780Z","submitted_at":"2026-05-28T16:02:23Z","title":"Accurate and Efficient MCMC for Latent Position Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T23:33:55.267906Z"},"links":{"cited_paper":"/paper/2501.13597","citing_paper":"/paper/2605.30134"},"observation_digest":"sha256:4ab9062d4827d8bdccc7b6e0899dd740cb9dfca82ceb007036794e2ea38c9523","observation_id":"11ff7d92-d459-401d-88b2-afb328d703e7","resolution":{"observed_at":"2026-06-28T23:42:49.779328Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13597/citation-record","integrity":"/paper/2501.13597/integrity","json":"/paper/2501.13597/citation-record.json","paper":"/paper/2501.13597"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:49:55.437803Z","title":"A comprehensive survey of fast graph clustering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.437803Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:b9e0d81edcb46a99c5567eb5a683281268ecb6aeaf51c6614d9258ab4aff9093","observation_id":"f1fdb824-0128-416d-b81c-5d29da44ff9c","resolution":{"observed_at":"2026-08-10T15:49:55.437803Z","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-10T15:49:55.443271Z","title":"An efficient spectral clustering algorithm based on granular-ball,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.443271Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:301c28999cc04b1d912d73851da14a188f4db8513a0c2b9079cca875535e5bd2","observation_id":"e7b482da-dd76-42ef-9fca-f04f319c37b0","resolution":{"observed_at":"2026-08-10T15:49:55.443271Z","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-10T15:49:55.447961Z","title":"A comprehensive review of clustering tech- niques in artificial intelligence for knowledge discovery: Taxonomy, challenges, applications and future prospects,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.447961Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:2173f28013b02bafd691dd98921a90ad9a6fc064ff72f2103cc9128e2d1128be","observation_id":"381fbb5a-3c09-48f4-a32e-7c0c9e2a6405","resolution":{"observed_at":"2026-08-10T15:49:55.447961Z","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-10T15:49:55.452840Z","title":"A review of convex clustering from multiple perspectives: models, optimizations, statistical properties, applications, and connections,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.452840Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e3a8b51201c22ac703a35e5a0fc12f95e161183be5af21f4b8904ddc3f5b4c71","observation_id":"6f8fb279-d99f-4e0b-8251-3b6bb9147120","resolution":{"observed_at":"2026-08-10T15:49:55.452840Z","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-10T15:49:55.457093Z","title":"Clustering of social media data and marketing decisions,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.457093Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:975102bc0a28ded40d454e732246ced9a81b367a6cb532bd9df97615e6e91934","observation_id":"578cbbab-8ef1-4ee4-b588-e0d7da456d89","resolution":{"observed_at":"2026-08-10T15:49:55.457093Z","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-10T15:49:55.461797Z","title":"Learning distilled graph for large-scale social network data clustering,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.461797Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1bd9e8ba1d13de58113b8ea527a11b3c8b3f5b6a85ad60e73925a3853ddc56fa","observation_id":"f8c18448-3fef-4530-b5b9-e911d6ba1e63","resolution":{"observed_at":"2026-08-10T15:49:55.461797Z","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-10T15:49:55.466788Z","title":"Image co-segmentation via locally biased discriminative clustering,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.466788Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:2f06892878cee7b9a453771569bafd28dd2ded7d909d1978e0ac96c9c97c1bf0","observation_id":"42414dd9-b7be-4f0e-8283-3e054471c711","resolution":{"observed_at":"2026-08-10T15:49:55.466788Z","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-10T15:49:55.470876Z","title":"Spectral clustering and its use in bioinformatics,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.470876Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:38c369983a94b4bc948b0e19feb40bcc4fe9f7b73f6584f9cbc3ffcf8ac485aa","observation_id":"9638486a-8de2-4c04-986c-a0a9c502ee42","resolution":{"observed_at":"2026-08-10T15:49:55.470876Z","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-10T15:49:55.475290Z","title":"Clustering-based anomaly detection in multivariate time series data,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.475290Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:46b8a52d3394b4f539dd020e37008b278031d17dcca8d522e5312e953ed2bea8","observation_id":"a423f8df-3ae9-4bc6-b627-3938339cc2ad","resolution":{"observed_at":"2026-08-10T15:49:55.475290Z","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-10T15:49:55.479673Z","title":"Document clustering using locality preserving indexing,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.479673Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ac8dfb4556f32e00aa6bc6f7da90c162d62113099e5776792a172cc7b003761c","observation_id":"32acefff-97db-4df7-85f0-c4fa05dbc1a8","resolution":{"observed_at":"2026-08-10T15:49:55.479673Z","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-10T15:49:55.484731Z","title":"From partition-based clustering to density-based clustering: Fast find clusters with diverse shapes and densities in spatial databases,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.484731Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:4c9c08cf052b85a0391fafa032c78af1333e30d796623b28915ac40164b3675b","observation_id":"42c0aa11-cc3c-4fce-b9ac-61b6d23e2dba","resolution":{"observed_at":"2026-08-10T15:49:55.484731Z","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-10T15:49:55.488948Z","title":"Synchronization- inspired partitioning and hierarchical clustering,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.488948Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:9b57b3f333740bd99eac34d3cddb587c81a633ca9f65b09ec167e054e6b9b245","observation_id":"176d39ce-d1bf-42a8-b3bb-55399efb6565","resolution":{"observed_at":"2026-08-10T15:49:55.488948Z","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-10T15:49:55.493714Z","title":"Density-based clustering by means of bridge point identification,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.493714Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:493ca1d9e999d1429b8732f86daf298897fbf2b65e959a4799eb87030afdce5a","observation_id":"86f61fb0-f225-45d2-8e28-2ab61b1adf2c","resolution":{"observed_at":"2026-08-10T15:49:55.493714Z","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-10T15:49:55.498102Z","title":"Probabilistic models for clustering,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.498102Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:d604eb29458f9b6c36fe054afddfb385872e2d69a895d99691d0538cbcf17d8b","observation_id":"9f4ed5e1-5730-4f54-97a9-1bb91505cdee","resolution":{"observed_at":"2026-08-10T15:49:55.498102Z","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-10T15:49:55.502227Z","title":"Algorithms for hierarchical clustering: an overview, ii,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.502227Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:0ba0b79ff4497bf903d87212c2af53f8da3c61d7d51d04cb88dbbccbba888e98","observation_id":"37d7dbf0-2ace-4797-92be-760d7ea3f09f","resolution":{"observed_at":"2026-08-10T15:49:55.502227Z","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-10T15:49:55.508277Z","title":"Hierarchical latent context representation for context-aware recommendations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.508277Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ad00ec2d6c0848dc3469789682da97bb34797f5caaf3563d8e4b048b511cb9fd","observation_id":"87b4c91c-94b7-40ad-8bee-b773609a36ce","resolution":{"observed_at":"2026-08-10T15:49:55.508277Z","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-10T15:49:55.513322Z","title":"dbscan: Fast density- based clustering with r,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.513322Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:9a359aeda6081a4d3bc77a0b5f3471b4c446a7aebb53fa83c1a020d93c737f2d","observation_id":"e6805dfe-f873-4fe9-b607-e2930342c2d6","resolution":{"observed_at":"2026-08-10T15:49:55.513322Z","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-10T15:49:55.517839Z","title":"Graph regularized nonnegative matrix factorization for community detection in attributed networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.517839Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ab077a02a30c023a36451097f273311aa3eda64badf5ce0c737f0862ed2fd57f","observation_id":"d4c97b7f-8a6f-49f2-9e73-020863dde4dc","resolution":{"observed_at":"2026-08-10T15:49:55.517839Z","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-10T15:49:55.523482Z","title":"A tutorial on spectral clustering,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.523482Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:61cc2af1530ee97ce6069e465c425c9e6f13669e133850d314d3d7fe5dd91e3c","observation_id":"e6dbfb59-7b0d-497c-b4f9-59a115c08e66","resolution":{"observed_at":"2026-08-10T15:49:55.523482Z","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-10T15:49:55.528794Z","title":"Multi-view spectral clustering with high-order optimal neighborhood laplacian matrix,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.528794Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:5f0c503c5ebc7f298d63c44275d90af8952d26a5075aeae559a93875e560b998","observation_id":"e8b73740-9357-4f41-be76-e2faeb4f41bb","resolution":{"observed_at":"2026-08-10T15:49:55.528794Z","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-10T15:49:55.534107Z","title":"A survey of kernel and spectral methods for clustering,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.534107Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:fdb78ba1953a5c3871df2c8ef54bd819b972ca124446dc29c11b568661f2294e","observation_id":"99546fe4-d09b-488b-996f-1ff626cc9b74","resolution":{"observed_at":"2026-08-10T15:49:55.534107Z","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-10T15:49:55.538999Z","title":"Deep clustering: A comprehensive survey,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.538999Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:4596953e4b721a076465643e760d7a31e599e648f1181151d8dee5e29ac27925","observation_id":"eef6e4a7-92bf-474c-a073-1c9e7dc3cf55","resolution":{"observed_at":"2026-08-10T15:49:55.538999Z","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-10T15:49:55.544313Z","title":"New spectral methods for ratio cut partitioning and clustering,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.544313Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:a62d0bef5ed9a5922baa1dea42b98b78a005ab05fd2eb20b8d36af36fc9924da","observation_id":"5fb62b48-56f4-4a1c-a925-1e32a71f24cf","resolution":{"observed_at":"2026-08-10T15:49:55.544313Z","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-10T15:49:55.549192Z","title":"Normalized cuts and image segmentation,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.549192Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:f844ab6f80db66c188c17f1a593a45380d831a531937e683f2e7f1ac1ddb83ff","observation_id":"d030622c-9db4-4fd6-b90f-742e405b8a71","resolution":{"observed_at":"2026-08-10T15:49:55.549192Z","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-10T15:49:55.554221Z","title":"Discrete nonnegative spectral clustering,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.554221Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:3d292dfaeaec53f46f9f9ef1c526679a5c980f3c4d937678dbda855dd93395d6","observation_id":"262da491-d883-4f51-adfe-6772f5dcf6c1","resolution":{"observed_at":"2026-08-10T15:49:55.554221Z","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-10T15:49:55.559020Z","title":"Effective clustering via structured graph learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.559020Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1ebc2dc1f3b2811a310dd67b736517b1e7e78725e61ce02432ccd21b16cd23f1","observation_id":"2df35d8c-8219-47ee-8d52-6cfc7be4df9e","resolution":{"observed_at":"2026-08-10T15:49:55.559020Z","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-10T15:49:55.564532Z","title":"Fast multi-view discrete clustering with anchor graphs,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.564532Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:f4420f4d154e4c0ebe96093369259ab100f8bf0c7fa2db99e2222758371adced","observation_id":"4fe29d1e-3880-4a24-adec-0b90a66edfa8","resolution":{"observed_at":"2026-08-10T15:49:55.564532Z","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-10T15:49:55.569123Z","title":"Efficient and robust multiview clustering with anchor graph regularization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.569123Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1daa641d8911d8a68683904c9f3bf2b91e16e1acc284b48a2bfb8f8e6ca1388e","observation_id":"60983350-aa9e-460f-9909-378cb4d1b364","resolution":{"observed_at":"2026-08-10T15:49:55.569123Z","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-10T15:49:55.574076Z","title":"Hypergraph spectral clustering for point cloud segmentation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.574076Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:b37b6bb0b5fa22c3642140f66c3d92d84f29d8c7e5df22e1bbb57b9f1bb830cb","observation_id":"8516c796-7c16-40fe-97c3-ca2496858a21","resolution":{"observed_at":"2026-08-10T15:49:55.574076Z","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-10T15:49:55.578683Z","title":"Hypergraph spectral clustering in the weighted stochastic block model,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.578683Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:60e692d1d6a4aefd9e401d947f512736883e5f991874f719d5e6ad9a73b759a8","observation_id":"b6094eda-bfb6-4889-94b4-79e60ef75a75","resolution":{"observed_at":"2026-08-10T15:49:55.578683Z","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-10T15:49:55.582616Z","title":"Image segmentation based on multiscale fast spectral clustering,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.582616Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:5c1496cd3fbf09ce7b72faab3f020a921127e012f0c1735fcfd2a5a0a6daf7d6","observation_id":"eb0e5c4f-692c-4b32-861d-b3e4174e4e60","resolution":{"observed_at":"2026-08-10T15:49:55.582616Z","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-10T15:49:55.586530Z","title":"Text document clustering using spectral clustering algorithm with particle swarm optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.586530Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:963ac61d10690f1f373c73d5f812146ccba53eb1924efdebf426662413f9749e","observation_id":"4916f312-4c39-4698-bde1-a05991719824","resolution":{"observed_at":"2026-08-10T15:49:55.586530Z","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-10T15:49:55.590827Z","title":"Ls-svm based spectral clustering and regression for predicting maintenance of industrial machines,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.590827Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:31f6c34f7000dfe5dfe942ba1cf4d40f9b23bcc70b4165b6a16a81d3abed3b54","observation_id":"ee669983-8210-40d4-8595-6279432ee448","resolution":{"observed_at":"2026-08-10T15:49:55.590827Z","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-10T15:49:55.595146Z","title":"Survey of spectral clustering based on graph theory,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.595146Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:cf25fb31c34553384f316d7e2018d2f0affde2b6cf76825e485cc58e04986dae","observation_id":"64287c4b-a972-4fcb-8ebd-5cde50be71be","resolution":{"observed_at":"2026-08-10T15:49:55.595146Z","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-10T15:49:55.600068Z","title":"Spectral clustering by joint spectral embedding and spectral rotation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.600068Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:d1d98f619294bb9a867081d99adb9450cccea34e8a3e0f3973a6299adf988c39","observation_id":"690f4df7-a6a3-42ef-ba57-1948722389a3","resolution":{"observed_at":"2026-08-10T15:49:55.600068Z","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-10T15:49:55.605731Z","title":"Spectral rotation versus k-means in spectral clustering,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.605731Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ae022644e31b1de360b477c6dead33797bea8af1bd8a9925419b5c7d6def25e9","observation_id":"071c3780-c908-4160-9925-7e8840799b80","resolution":{"observed_at":"2026-08-10T15:49:55.605731Z","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-10T15:49:55.610738Z","title":"Structured graph learning for scalable subspace clustering: From single view to multiview,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.610738Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:8c71f4701f60dd34028b9e58a991c663859c492d7f75b2c411a322e2e23d09b0","observation_id":"d9d69ad8-b4b5-42f6-80af-ff72f13ea729","resolution":{"observed_at":"2026-08-10T15:49:55.610738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03036","last_updated":"2022-02-15T03:52:02Z","snapshot_observed_at":"2026-08-13T20:04:14.965179Z","submitted_at":"2021-03-04T13:49:25Z","title":"A Survey on Graph Structure Learning: Progress and Opportunities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03036","snapshot_observed_at":"2026-08-10T15:49:55.616164Z","title":"Deep graph structure learning for robust representations: A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.616164Z"},"links":{"cited_paper":"/paper/2103.03036","citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:befb1f7962601e65c8d00e1cc220141a9c28faff906fcabe220c853ad9ea0530","observation_id":"1e5892be-e96a-4b00-acf3-0840a67286b7","resolution":{"observed_at":"2026-08-10T15:49:55.616164Z","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-10T15:49:55.623412Z","title":"A survey on laplacian eigenmaps based manifold learning methods,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.623412Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:d3a90c09179c2d2036ce0e57c5c0f4c006ae5f3fb2ec4630eb6a4996bd84b668","observation_id":"2fe8ed5f-7e5b-46a7-9de3-abe2a44fd5fe","resolution":{"observed_at":"2026-08-10T15:49:55.623412Z","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-10T15:49:55.629145Z","title":"Graph-based semi-supervised learning: A review,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.629145Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:457bbb0976e279d6f4ee65ec7c941534ac8aae714e681ccbe2f44dc218dbf980","observation_id":"7bc09b37-1921-47c4-82c0-f2f49eaacf3f","resolution":{"observed_at":"2026-08-10T15:49:55.629145Z","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-10T15:49:55.634181Z","title":"On spectral clustering: Analysis and an algorithm,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.634181Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:47b488f464d169941136254003b27ff4f9da23b6b8d2a84b2ebdf7ee5ad636ab","observation_id":"10630e38-7838-488a-bcb8-5203267ddc67","resolution":{"observed_at":"2026-08-10T15:49:55.634181Z","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-10T15:49:55.641427Z","title":"Clustering and projected clustering with adaptive neighbors,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.641427Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e57e62bdda836d2d3f7b3a378ed6e098a0a1463c116e3f73337cbc3190b7f5c7","observation_id":"b7e7fb39-6300-4a79-bfd8-640e673061ec","resolution":{"observed_at":"2026-08-10T15:49:55.641427Z","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-10T15:49:55.646414Z","title":"One-step spectral clustering via dynamically learning affinity matrix and subspace,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.646414Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:cf603d11cda86f7a91c88afd43df451cefb700c9bf5371f9e87e5b31d146c27f","observation_id":"e968f388-1532-4150-94c3-6058dbece94b","resolution":{"observed_at":"2026-08-10T15:49:55.646414Z","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-10T15:49:55.650682Z","title":"The constrained Laplacian rank algorithm for graph-based clustering,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.650682Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1bf37226025ac3c6398c28a9857dc6e3bab379584917f9e40d72a7ce72d28c2c","observation_id":"69e5ad97-f8e1-4622-bd25-b2bb8884e408","resolution":{"observed_at":"2026-08-10T15:49:55.650682Z","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-10T15:49:55.654918Z","title":"Sparse subspace clustering: Algorithm, theory, and applications,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.654918Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:a51a76ad6d40b0dfebda9d11d759a4cfccbc324fc8c8db359c6b7a3a0f767191","observation_id":"99681fe6-8073-412b-a11b-8fc6394214fe","resolution":{"observed_at":"2026-08-10T15:49:55.654918Z","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-10T15:49:55.659171Z","title":"Fast clustering with anchor guidance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.659171Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:fb21a5cacbae530b12cf517924395c23318d59d76f356c1f2ae0006d2ec9a44b","observation_id":"593d4b07-93cd-499e-ae26-705c146747d4","resolution":{"observed_at":"2026-08-10T15:49:55.659171Z","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-10T15:49:55.663155Z","title":"Unsupervised large graph embedding based on balanced and hierarchical K-means,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.663155Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ceff23234b8f79b273b7f035c7e92d6cd49bcac92ca74b0554eab1fcc2b4bf4a","observation_id":"e2b40a5f-6a48-4cdf-be69-d79b8fe35ae3","resolution":{"observed_at":"2026-08-10T15:49:55.663155Z","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-10T15:49:55.667404Z","title":"Efficient discrete clustering with anchor graph,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.667404Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:0673ddd02ac43c51a286aaa94e31ca1e81c34749c61b39953f55b88ebf0676a9","observation_id":"7929ffa9-5fb2-4373-913e-a04c269e55ba","resolution":{"observed_at":"2026-08-10T15:49:55.667404Z","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-10T15:49:55.671661Z","title":"Large scale spectral clustering via landmark- based sparse representation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.671661Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:9c1fdd3ab8b48685ecf8eae7b982ced548438a5579507ee0d02dae803bf02ef4","observation_id":"ad7f1271-bf91-417b-b816-cab596eb356f","resolution":{"observed_at":"2026-08-10T15:49:55.671661Z","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-10T15:49:55.675777Z","title":"Unsupervised optimized bipar- tite graph embedding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.675777Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:27a77e0ad692492a1f712603862e56ba3a2546df65dbd28cd4a2822e0116ceba","observation_id":"db3e8e8f-c968-4302-ac7f-3565d65f5862","resolution":{"observed_at":"2026-08-10T15:49:55.675777Z","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-10T15:49:55.680427Z","title":"Fast spectral clustering with self-adapted bipartite graph learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.680427Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:05bcf809821e9a7c7697795768cabb49ecd4cfd4f90b1d7df0f69aab87e617af","observation_id":"0012b6f7-f1a9-487d-876f-1c5e8fcb3404","resolution":{"observed_at":"2026-08-10T15:49:55.680427Z","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-10T15:49:55.685161Z","title":"Learning with hypergraphs: Clustering, classification, and embedding,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.685161Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:58dbd5e034404ab366dde436c5da62eb354570537e429d626ed8ed94ec649927","observation_id":"c2a06d07-0433-4be8-8d5f-836e6d52cb80","resolution":{"observed_at":"2026-08-10T15:49:55.685161Z","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-10T15:49:55.689310Z","title":"Hypergraph learning: Methods and practices,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.689310Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:3e189adcd76f54523eedb7d3d5add7b3a0f9fdc56581f694bee8142e49d9c812","observation_id":"db798edc-92c7-4a1a-8416-7050fb246d35","resolution":{"observed_at":"2026-08-10T15:49:55.689310Z","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-10T15:49:55.694342Z","title":"A survey on hypergraph representation learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.694342Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:31e594d6ffb6116b60d5f802e6ecc7514882f41a6466f7467685aeef6eeefa25","observation_id":"c08af8b4-08d5-42d2-83d8-7cfff8d9ae8a","resolution":{"observed_at":"2026-08-10T15:49:55.694342Z","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-10T15:49:55.698744Z","title":"Unsupervised spectral feature selection with dynamic hyper-graph learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.698744Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e580afeee31afcd291eeca9eec9a8fcccc575e65de9c9ee9aa69327f560f2151","observation_id":"fdf62de9-f25f-4eed-ba33-8d84af784ad9","resolution":{"observed_at":"2026-08-10T15:49:55.698744Z","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-10T15:49:55.703060Z","title":"Video object segmentation by hypergraph cut,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.703060Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:a92cb829dd60a483985f995094c6121a2f50bef73ef6547ae8533f90d7be46eb","observation_id":"ccbe7190-7795-4e72-bf03-ef6b2c428f45","resolution":{"observed_at":"2026-08-10T15:49:55.703060Z","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-10T15:49:55.708410Z","title":"3-D object retrieval and recognition with hypergraph analysis,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.708410Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ebc165af9777c79000fd96438998a5b3bad323d6724c41afd50be391dbbd858f","observation_id":"32bd3772-620f-4d57-a87e-af8e04065afd","resolution":{"observed_at":"2026-08-10T15:49:55.708410Z","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-10T15:49:55.713360Z","title":"Visual classification by ℓ1-hypergraph modeling,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.713360Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:dcd849625723bea5b0ccade993ea8c52fe1de8725fc870a86010d93b09ddc5ec","observation_id":"0dcd21f5-4c1d-4ca6-b521-e282be71af10","resolution":{"observed_at":"2026-08-10T15:49:55.713360Z","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-10T15:49:55.719434Z","title":"Robust ℓ2- hypergraph and its applications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.719434Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:8621c3abf5bdc7346fd668b9a5fc4caa4419e3e66a30ff271c3b0973f2b37228","observation_id":"cd96aa65-e59e-4422-9567-0681df9a0896","resolution":{"observed_at":"2026-08-10T15:49:55.719434Z","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-10T15:49:55.726481Z","title":"Elastic net hypergraph learning for image clustering and semi-supervised classification,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.726481Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:c7c523de9da72e0bd627c5015273fba3368532d42660c015f9cade88ae6763a8","observation_id":"e31c8836-d428-4981-a425-637339272bbd","resolution":{"observed_at":"2026-08-10T15:49:55.726481Z","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-10T15:49:55.732912Z","title":"Adaptive hypergraph learning for unsupervised feature selection,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.732912Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:31ca34a7821dc84002459cbdf01444809a666913c27663423a5b3b4d95675a28","observation_id":"ead01039-95f7-4661-be86-cb76b9a7b13f","resolution":{"observed_at":"2026-08-10T15:49:55.732912Z","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-10T15:49:55.738439Z","title":"Ghojogh, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.738439Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:27847336784741a9960a4cb8cce16c7aa6dbe22e59e2b89063f11f1a0ca9bfbf","observation_id":"f6f15f05-1544-4978-b017-d95a57080b91","resolution":{"observed_at":"2026-08-10T15:49:55.738439Z","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-10T15:49:55.745766Z","title":"Low-rank discrete multi- view spectral clustering,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.745766Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:0f9f6e13ebeccd4944d9515a5141bc563ee2a3698c2df38acb4ddf3a6789d10f","observation_id":"c1f2bb3d-ac28-41f2-af28-9e15c878ae23","resolution":{"observed_at":"2026-08-10T15:49:55.745766Z","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-10T15:49:55.753458Z","title":"Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.753458Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e647463050f44b5fd30e9addc57c538763048a09c6e620fd50ac3732dc264d04","observation_id":"89c39099-8827-4ed4-a34c-d9179c0816b6","resolution":{"observed_at":"2026-08-10T15:49:55.753458Z","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-10T15:49:55.758727Z","title":"SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.758727Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:8c8c450f5e21b12b0580854eeaf8ae16662831968d770c7d9d86d833aea6e0dc","observation_id":"86e5cf39-610c-4457-a037-8e1542a521e9","resolution":{"observed_at":"2026-08-10T15:49:55.758727Z","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-10T15:49:55.763853Z","title":"Dis- crete multi-graph clustering,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.763853Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:5ece5ce6f4f9cf25fec76c12d0786738bbd7b7960af4537861fbb25baea7d763","observation_id":"376613ab-d010-4ea6-95e6-ce3bc51418d2","resolution":{"observed_at":"2026-08-10T15:49:55.763853Z","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-10T15:49:55.769366Z","title":"Orthogonal and nonnegative graph reconstruction for large scale clustering,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.769366Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:9a9a1b3efd3445d9b751b7209fe330b348ffe4c98d3ab8134118ba34b3c6d8b5","observation_id":"d93fbc4e-a2ca-4ce3-af56-fa80e8e5616f","resolution":{"observed_at":"2026-08-10T15:49:55.769366Z","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-10T15:49:55.774438Z","title":"Knn-sc: novel spectral clustering algorithm using k-nearest neigh- bors,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.774438Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:70d17b3f389cd2e91447ea0d170ff9925c5cf7445d4c826d981adbc5e15134e7","observation_id":"0a1a284f-6005-43b5-88b4-a61e81670af5","resolution":{"observed_at":"2026-08-10T15:49:55.774438Z","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-10T15:49:55.779658Z","title":"Self-weighted clustering with adaptive neighbors,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.779658Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:37f9e52aad037898eab438d0eb87421476fb37c5aa3d302c792d8fb990ba77b9","observation_id":"22c1a107-6298-45c9-8db2-783412bed7f0","resolution":{"observed_at":"2026-08-10T15:49:55.779658Z","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-10T15:49:55.784398Z","title":"Entropy regularization for unsupervised clustering with adaptive neighbors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.784398Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ce14c7dde5405cb8cf30f72e05f4701627b68770dbee56287baa30938c98f092","observation_id":"6941c5a5-46db-4613-b130-a229ca21cb07","resolution":{"observed_at":"2026-08-10T15:49:55.784398Z","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-10T15:49:55.788786Z","title":"Spectral rotation for deep one-step clustering,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.788786Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:76bb0483b79fab2db622f2a4f76a5ff22035a9fc4a613efc9b65b006e476371c","observation_id":"46f9d118-7f01-46b7-a10d-1e739b04f0e0","resolution":{"observed_at":"2026-08-10T15:49:55.788786Z","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-10T15:49:57.926894Z","title":"Spectral clustering with adaptive neighbors for deep learning,","venue":null,"work_id":"dcd78120-fc34-43a6-9a49-83fd0634b6c4","year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.793696Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:a1142de045627741a1e44961baa48f76141f3e7363e9b11334e28e27f08acf60","observation_id":"19af9af8-329d-4417-a122-3bde10e31c9c","resolution":{"observed_at":"2026-08-10T15:49:57.932401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.906842Z","title":"Typicality- aware adaptive similarity matrix for unsupervised learning,","venue":null,"work_id":"8ea750a9-73c3-4058-ba2f-438dceca7ee6","year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.798467Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:c6a7231a366bb0b77101934a7a1d47ef4f0e8acef1fd35b87861e166b7145c75","observation_id":"841f0144-d3da-4ed3-85fb-c3105a548301","resolution":{"observed_at":"2026-08-10T15:49:57.912962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.889797Z","title":"Rank- constrained spectral clustering with flexible embedding,","venue":null,"work_id":"cd9522d1-9bd4-4213-82b5-8c55b9022f4c","year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.803330Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:56de0405b6b43c3362c390817d113f35e473b587b89d125a689d96c0620e7d79","observation_id":"5d20bc47-a736-4356-a8df-e69c192b8e27","resolution":{"observed_at":"2026-08-10T15:49:57.895606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.870936Z","title":"Spectral clustering in heteroge- neous information networks,","venue":null,"work_id":"977dc7c3-355a-4df1-9350-be66e4617e66","year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.808247Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:5bd4c0520871069fabfac186fc10225252d87264f576b32afb700d9417dd7840","observation_id":"22fbd259-ca0b-41e4-985f-bbc6081d72d7","resolution":{"observed_at":"2026-08-10T15:49:57.876919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.855316Z","title":"New approach for learning structured graph with laplacian rank constraint,","venue":null,"work_id":"ff2bd021-fd82-49cc-abd2-809e52c0b072","year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.813545Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:7f966cb9925f9f0ad96ea19f59a4d2bde64067b4f9bd2895332949eb31c1d00d","observation_id":"02c2a21a-2e4c-4019-ac62-f9cd985d2b79","resolution":{"observed_at":"2026-08-10T15:49:57.859924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.838390Z","title":"Spectral embedded adaptive neighbors clustering,","venue":null,"work_id":"4c9c41a1-97dc-45a3-a8a7-490ac00a6b45","year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.818852Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:6934cc83e11298f75cc6a12340b1a36407e9d3a002fbf7e867f86e39adf881a8","observation_id":"d920912a-1a70-4670-9264-263585a3ac24","resolution":{"observed_at":"2026-08-10T15:49:57.842864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.822943Z","title":"Robust recovery of subspace structures by low-rank representation,","venue":null,"work_id":"517e9fe9-a0c0-45af-8d70-5b1d8794a7ac","year":2012},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.824098Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:a6f1b101e94589ccbac201d12d69512dcafefe26399d47977b2acfb95d5a01e8","observation_id":"157d693a-c8ee-4b56-be0c-e9bd257e1ccc","resolution":{"observed_at":"2026-08-10T15:49:57.828044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.808740Z","title":"Robust and efficient subspace segmentation via least squares regres- sion,","venue":null,"work_id":"03325869-251f-488b-9f21-31bd1b2f4731","year":2012},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.835868Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e03a2eac957e21c13bba7537b9e7f671b7ff613eddb36d59a494df57fcde1d59","observation_id":"3c98d622-d07c-463b-b02a-800e7c2601a7","resolution":{"observed_at":"2026-08-10T15:49:57.813325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.793165Z","title":"Smooth representation clustering,","venue":null,"work_id":"90d363ca-ef4f-4be3-a437-74ddfdb1d4b6","year":2014},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.845003Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:71116d3797235ee28d910781af44e779c1ee01c6851daf213f1883471c261f3e","observation_id":"fb53dd15-f790-4897-a456-565c132eb677","resolution":{"observed_at":"2026-08-10T15:49:57.797673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.776976Z","title":"Enhancing low-rank subspace clustering by manifold regularization,","venue":null,"work_id":"fe9fd8d3-68c3-4e60-b2ae-5c5ec9c7ede1","year":2014},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.853402Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:de9a5b58d508be2612391cdfc8d7a3383ab8d243d3f08329045d46f1b16ee576","observation_id":"0e11fc59-4a2d-4657-84bd-5b314418eb9b","resolution":{"observed_at":"2026-08-10T15:49:57.781875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.761783Z","title":"Dual graph regularized latent low-rank representation for subspace clustering,","venue":null,"work_id":"c45c7490-559e-4e7c-ad2f-b77bb7dd65ab","year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.859538Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:5835895242731e1218c2ae202a84f9a61201176fefb309110c31032d770fd0fd","observation_id":"a12c77b8-2288-4ff0-ab24-ce8c6e5911b4","resolution":{"observed_at":"2026-08-10T15:49:57.766422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.744810Z","title":"Graph regularized compact low rank representation for subspace clustering,","venue":null,"work_id":"533afa4b-3f78-4516-9ebc-40eb09262709","year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.865395Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:d8c4856325f7e6386f17e880cd5b0ddac17a559c29faf336ee71b36d4ec33022","observation_id":"0d2c577a-a965-433f-9838-c65c293a9b93","resolution":{"observed_at":"2026-08-10T15:49:57.749613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.728916Z","title":"Deep subspace clus- tering networks,","venue":null,"work_id":"ac82a301-ec12-48d7-8930-51534fb20712","year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.870178Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1d551f92edbfdd7f26ac6ab04eb31402397db7db95ab7f33a3e6c2b0f415395a","observation_id":"fa363546-6670-4744-854a-8e67334d43ef","resolution":{"observed_at":"2026-08-10T15:49:57.733515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.713631Z","title":"Structured autoencoders for subspace clustering,","venue":null,"work_id":"c2fdc9c3-7b90-42ec-b35e-e1b488c3efda","year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.879843Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:d2bfd1189d34899722032094cc9623d4908329f0bbf1c157e102cb7e5f2a198f","observation_id":"7e18709e-116e-4f12-b694-00ff5bb94d51","resolution":{"observed_at":"2026-08-10T15:49:57.718145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.695904Z","title":"Low-rank representation with adaptive graph regularization,","venue":null,"work_id":"856aed51-6fbf-4d3b-ac67-edc5fabd23e4","year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.886995Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:76f0684e2a280cd7d0ed6b7dcbc5c46f2fbd451541228b1eb1eefce644d4b39e","observation_id":"c0d222fb-dbfc-429d-a4a5-ad7b996e2d85","resolution":{"observed_at":"2026-08-10T15:49:57.701558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.679270Z","title":"Low- rank sparse subspace for spectral clustering,","venue":null,"work_id":"b3901ad4-1eda-4a42-bce7-7441c66cd1fe","year":2018},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.892529Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:506bcd0dd9a66bb47d94ee6cb0a3dd42d2e3d5f4b0fb8db75243a3e090ec2ab5","observation_id":"d9638ee6-2fbc-4e8b-abb3-eab669097455","resolution":{"observed_at":"2026-08-10T15:49:57.684805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.663117Z","title":"One-step spectral clustering based on self-paced learning,","venue":null,"work_id":"0f69546a-f569-410e-ad76-d87724409e6f","year":2020},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.897747Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:9ec2e2b72a8610c012eca9ddbdbbae91d5639894d8e689a17ec040bcf40d97a2","observation_id":"a0378dc7-42e5-4732-b93a-8a9bd941193b","resolution":{"observed_at":"2026-08-10T15:49:57.668339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.643559Z","title":"Subspace clustering via joint ℓ1,2 and ℓ2,1 norms,","venue":null,"work_id":"8aed9274-4ea2-4c8e-a696-64e11de4d00a","year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.902721Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:246036f9599191da572c0ff395a63c035cdf8ea7fd81cac80a7e47e000df486f","observation_id":"d700828a-e5aa-4ab0-9c89-66627d1d2307","resolution":{"observed_at":"2026-08-10T15:49:57.649362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.622852Z","title":"Fast spectral clustering with efficient large graph construction,","venue":null,"work_id":"b6df95c1-5bac-440f-8a79-f67168615201","year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.910576Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1f73cdce49495906d3676b94ff34d7e06e1c664abbfe21d7736b676294a0cb77","observation_id":"a244ee83-2bff-4914-b6f2-d5c5c32ca1f2","resolution":{"observed_at":"2026-08-10T15:49:57.628760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.600485Z","title":"Fast spectral clustering with anchor graph for large hyperspectral images,","venue":null,"work_id":"95248c72-0836-433d-aaac-9cc218520101","year":2003},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.917715Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:087bd00c3ac564e69f43302498e3a5ad94dd3249bcf3667463920fa2e98c9452","observation_id":"78df2f8c-23c6-4469-9848-e58e1fb45758","resolution":{"observed_at":"2026-08-10T15:49:57.608881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.577815Z","title":"Scalable graph-based clustering with nonnegative relaxation for large hyperspectral image,","venue":null,"work_id":"1a88ca09-18b1-424e-9faf-d401d179c00d","year":2019},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.923520Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:1d80fdba5149c0f4f8640a7f07e09a8507d83782decdc6fbb9dc4bb80773b38c","observation_id":"e4e88c49-49dd-4d18-bd6d-6a238b4ac1b0","resolution":{"observed_at":"2026-08-10T15:49:57.585239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.551087Z","title":"Robust landmark graph-based clustering for high-dimensional data,","venue":null,"work_id":"7989797c-4310-4bfe-a410-0587dbd58ce8","year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.929168Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:ba254f8aeddd006b65e5edc679068afb859039ad814cbb2ffd0967680c69c765","observation_id":"96ebefee-fbb0-4fe7-9a71-65ff213831db","resolution":{"observed_at":"2026-08-10T15:49:57.557996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.527716Z","title":"FGC SS: Fast graph clustering method by joint spectral embedding and improved spectral rotation,","venue":null,"work_id":"d860f0b7-1b2c-487c-9a90-433eb0715dd6","year":2022},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.934739Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:87ec1a2657ebddffe2623fc798ca735378985401b5e17ff107f95e6ec432c931","observation_id":"38349cbb-3636-462f-8ac1-6eb8b40be284","resolution":{"observed_at":"2026-08-10T15:49:57.535539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.508929Z","title":"Reskm: a general framework to accelerate large-scale spectral clustering,","venue":null,"work_id":"cdab1fc2-6bfb-4764-865d-37cf2be9d56a","year":2023},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.940220Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:2b9c9f1837765349a35381d194e09a19cff9385c21e517017cf5c139596e7c84","observation_id":"0740c623-db5b-4942-a42b-5c2dbf377c08","resolution":{"observed_at":"2026-08-10T15:49:57.514818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.493039Z","title":"Fast opti- mization of spectral embedding and improved spectral rotation,","venue":null,"work_id":"b08f66ac-387f-4759-b2d2-3e0731a54589","year":2021},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.946924Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:e31b9843001628d6f72c35b29ce42401c8fb14aed60fcfc6bfd4522ce0371eb6","observation_id":"00a3910f-e01b-4f31-a874-d8d2a2f1f2e8","resolution":{"observed_at":"2026-08-10T15:49:57.498111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.476933Z","title":"Spectral clustering with linear embedding: A discrete clustering method for large-scale data,","venue":null,"work_id":"db7b171c-f234-43aa-9391-dbd6a9d922d6","year":2024},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.951677Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:daae4957246c11369c665d506c176094bb35709ac26e60da2e5bfe3493f53e7c","observation_id":"a9db6e5a-fe2a-4c9c-818b-128efc1a50ec","resolution":{"observed_at":"2026-08-10T15:49:57.481823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.459260Z","title":"On the effect of hyperedge weights on hypergraph learning,","venue":null,"work_id":"ab4788ba-e920-4ab8-96ba-8d0e6c152123","year":2017},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.956510Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:b80628bc5945a2161db3f4988033b82b4f8984dc1952f942f7fea01e7f4455ab","observation_id":"e8f5e0f5-dc37-4a0a-b65d-3fae2f937f89","resolution":{"observed_at":"2026-08-10T15:49:57.463807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.439737Z","title":"A provable generalized tensor spectral method for uniform hypergraph partitioning,","venue":null,"work_id":"78d42f60-2eea-472a-a586-ae61d5485570","year":2015},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.961994Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:677066cace7c5f13f1e6176d65a2431fea3ed9b5633a8298903ffae73ee71f33","observation_id":"efea39fd-46ec-4b20-9e11-7fe1989c292b","resolution":{"observed_at":"2026-08-10T15:49:57.445457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T15:49:57.415491Z","title":"Hypergraph learning with hyperedge ex- pansion,","venue":null,"work_id":"7e833336-529a-451e-b66f-cc0d357d84bd","year":2012},"citing_paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-10T15:49:55.969014Z"},"links":{"citing_paper":"/paper/2501.13597"},"observation_digest":"sha256:b2036182300a88dea2365192f61faba175ac88af772fc158b3e86ff9ae45d470","observation_id":"4773f51a-516a-42c3-9704-49b29e404a36","resolution":{"observed_at":"2026-08-10T15:49:57.420706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13597","last_updated":"2025-01-24T10:40:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T19:44:46.591078Z","submitted_at":"2025-01-23T12:06:32Z","title":"A Comprehensive Survey on Spectral Clustering with Graph Structure Learning"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":71,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":150},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 100 of 150 outbound references and 4 inbound Pith citation observations for arXiv:2501.13597."}