{"as_of":"2026-08-18T02:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d99e9201fb5ec4866aa3966e4868675bd04234c34fdbca1169dc0b125661eddd","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:52:47.280390Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.04200/citation-record","integrity":"/paper/2508.04200/integrity","json":"/paper/2508.04200/citation-record.json","paper":"/paper/2508.04200"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:52:38.768165Z","title":"Spectral clustering via ensemble deep autoencoder learning (sc-edae),","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:38.768165Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:09109d7c9eb6fc38b3b21dfd4a737d4276c84dbf9c9b7a0a665c19ac04188fda","observation_id":"7a2bc806-0c3e-4317-bd4e-561f1249b2f2","resolution":{"observed_at":"2026-08-06T00:52:38.768165Z","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-06T00:52:38.850856Z","title":"Spectral clustering joint deep embedding learning by autoencoder,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:38.850856Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:63ebdb9e1d8b2dd8624eb69a477b5ddccca017bf5473e560cb8d4ab29e526169","observation_id":"904ff4de-2956-4a28-81df-b9bf767f8a5f","resolution":{"observed_at":"2026-08-06T00:52:38.850856Z","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-06T00:52:39.011063Z","title":"Greedy layer-wise training of deep networks,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.011063Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:1a602ec1a34eeb80e872f83b35b0266537e94772e49f43fcbed024b50e67e94b","observation_id":"3ad01381-e7cd-417e-aa81-1520a6973f15","resolution":{"observed_at":"2026-08-06T00:52:39.011063Z","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-06T00:52:39.121750Z","title":"Deep learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.121750Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:e1f2198bbde187885c1a76f53ab1c0424c4c528449683030c83b07707a3b248e","observation_id":"63bef1ab-83e1-47bd-bfba-d9b505c66d85","resolution":{"observed_at":"2026-08-06T00:52:39.121750Z","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-06T00:52:39.293548Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.293548Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:f94c7484be20c1daf9e3197cd7e7fd556427ee56fb1eb33cfde8ddb24ad27271","observation_id":"33ef3420-771d-4300-bd23-5709851da0a1","resolution":{"observed_at":"2026-08-06T00:52:39.293548Z","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-06T00:52:39.404599Z","title":"A generalized solution of the orthogonal procrustes problem,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.404599Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:4c21d01ad6df7366709ec4e1e5e30dedc42c064d696f591f258a254442fbcf04","observation_id":"c12f1024-e03f-4d9b-ae09-99cd9f771a80","resolution":{"observed_at":"2026-08-06T00:52:39.404599Z","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-06T00:53:02.405285Z","title":"Deep embedded k-means clustering,","venue":null,"work_id":"4feee671-9452-49cb-ba2b-d89d48c41e54","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.499230Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:ad2e078be6aaa8225c8b49f7ec8276ccf31802aa04cdf74358344a4d8d6ad1c0","observation_id":"5c263ef5-875f-481f-8b8a-786df035021d","resolution":{"observed_at":"2026-08-06T00:53:02.448902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:02.306473Z","title":"Deep subspace clus- tering networks,","venue":null,"work_id":"a0814615-ebbc-4722-a61a-6d143ee61c0a","year":2017},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.595305Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:1ac150d466a591f02d20120598665f5c60e95300c86e106efb92e8207f3a6b6b","observation_id":"601328d8-c36c-479d-bb7f-2807c22200f6","resolution":{"observed_at":"2026-08-06T00:53:02.351647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:02.175491Z","title":"Deep multi-view subspace clustering with unified and discriminative learning,","venue":null,"work_id":"0cbbcc79-e1f7-4288-9b1e-f508ff721409","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.715973Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:a50f1e4c65d4848cffaa0eb742cdf98b9555763fdfe9e16c3faf78077958f405","observation_id":"757887e2-1564-4039-a8b1-a0530bb02117","resolution":{"observed_at":"2026-08-06T00:53:02.247599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:02.064247Z","title":"Projective multiple kernel subspace clustering,","venue":null,"work_id":"cc4818ec-21b9-403f-a034-f8c7e5a4b7b7","year":2022},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.840923Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:8c3c12c52eb7124d6c4c3467658b2ab591838b189d696dcee4b4722137755016","observation_id":"66da0bea-e2e2-4748-9b34-9d9e8734acd7","resolution":{"observed_at":"2026-08-06T00:53:02.119423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:01.910302Z","title":"Joint unsupervised learning of deep representations and image clusters,","venue":null,"work_id":"c9ef1410-908b-49c0-aa4c-e7cdf6f0b5c3","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.922461Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:57fada8bbaaebffd0fc7238932976a4e9e4eeff57ebc646b96e98c49c919b4e5","observation_id":"fb113a91-ca87-4910-9069-5a525044b614","resolution":{"observed_at":"2026-08-06T00:53:01.976382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:01.773140Z","title":"Acoustic scene clustering using joint optimization of deep embedding learning and clustering iteration,","venue":null,"work_id":"9f375293-1848-4a66-88b4-26fdbd85f1d4","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:39.997179Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b46a6b994f5ee9ae271c4fdf32d9839f9e5050cd9f8fc40c612710467f96fd90","observation_id":"d264e332-281c-4665-ace1-7ed0012c9554","resolution":{"observed_at":"2026-08-06T00:53:01.848682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:01.590197Z","title":"Network embedding via deep prediction model,","venue":null,"work_id":"d7a75bb9-2720-4294-acb6-5fb42b982868","year":2022},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.083507Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:0b763f3a0d33dd30e7ed928ab29fe02cd854e601d0904d3c5586a66a333de1c4","observation_id":"ea94e6ca-226e-4785-9ec3-e712c5fb19e8","resolution":{"observed_at":"2026-08-06T00:53:01.672980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:01.395266Z","title":"Deep spectral clustering via joint spectral embedding and kmeans,","venue":null,"work_id":"841e1f02-7561-4955-bc29-3d1923e4544b","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.168912Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:a62a65e0fa0bb292075ec968278a2a743115f70a44a882e6c2a49c0700ccecc8","observation_id":"6af4df0c-bf02-4922-8bfd-73551c157d2b","resolution":{"observed_at":"2026-08-06T00:53:01.473296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:01.108484Z","title":"Nearest neighbor matching for deep clustering,","venue":null,"work_id":"b4f2922e-6954-405f-96c4-f903429fd754","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.223875Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:595796abbb267c7094c67af73feeafa2907530481cab36624f73b2c4621b1656","observation_id":"8943964b-8276-4eaa-8b21-0bc5827d6668","resolution":{"observed_at":"2026-08-06T00:53:01.222740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:00.890985Z","title":"Deep comprehensive correlation mining for image clustering,","venue":null,"work_id":"1796e638-3f18-4f89-aebe-5e1866231d76","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.318940Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:fff4f34992d7812c12958e3ec8ac09d3cd219ac74349ffde6ede08f2313505b9","observation_id":"7c387ded-55fe-449d-974f-372622527799","resolution":{"observed_at":"2026-08-06T00:53:01.001892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:00.722995Z","title":"Scan: Learning to classify images without labels,","venue":null,"work_id":"5cd3425f-56a8-428b-8a66-5e24df76cffb","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.402486Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:2a4ff83045d6ee6d0dfb1efaf26f776480ad0cc401b9982fc5f2fcf1c6db4156","observation_id":"172db0cc-bdaf-4a9e-8421-f57a2c663251","resolution":{"observed_at":"2026-08-06T00:53:00.793139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:00.490426Z","title":"Invariant information clustering for unsupervised image classification and segmentation,","venue":null,"work_id":"5f06b5c1-e249-4675-bbae-6b36812d0c36","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.473127Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:5fbcb4fca9da1092e00d0f375d88a54300134bed44eac4753d25bc40e1a75a65","observation_id":"29280381-8d14-445e-8758-c318b5b2abbe","resolution":{"observed_at":"2026-08-06T00:53:00.602000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:53:00.162027Z","title":"Consistent multiple graph embedding for multi-view clustering,","venue":null,"work_id":"8eed14c1-380a-420a-b0d5-a4edb5a047c4","year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.534946Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7b592a3dfb72004babc4eeb4a0754435bba5c9f69ef4b406ad42a9a75c873dba","observation_id":"79b48b53-bbcc-4399-aeb5-db68c36a6cb2","resolution":{"observed_at":"2026-08-06T00:53:00.287335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:59.945261Z","title":"Learning deep generative clustering via mutual information maximization,","venue":null,"work_id":"b27e5f1e-5f20-48a6-9e86-cf2653a311f4","year":2022},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.618165Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c3a91b936fdad0d398388a46b7e0810812b3132cfea1f524370c48ac576b1f41","observation_id":"cc69e8e7-be69-4d80-ad62-9dc6807c4aa5","resolution":{"observed_at":"2026-08-06T00:53:00.071162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:59.790276Z","title":"A simple frame- work for contrastive learning of visual representations,","venue":null,"work_id":"dc5d0b63-1d1d-48aa-a5b7-53fb90fe94b4","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.657550Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7d78d336bfec256125cdeddeafb92f0510751d703b71ce50df4ad8a76de14426","observation_id":"25cba558-d98e-45ae-b8cc-70ad356c7e7b","resolution":{"observed_at":"2026-08-06T00:52:59.860569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:59.556288Z","title":"Momentum contrast for unsupervised visual representation learning,","venue":null,"work_id":"de6c9815-40a2-4139-9e14-74c560d0553a","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.750880Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c1a7d489ad1c88843f45ca41f68d9a6476be9b42853c50c63ba66aff9ebaade2","observation_id":"b9e42bb6-b4c1-411b-b6ee-d168bdb08c5e","resolution":{"observed_at":"2026-08-06T00:52:59.682558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:59.254866Z","title":"Contrastive clustering,","venue":null,"work_id":"1931b04e-faf7-4880-b7ce-b1187fb19447","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.808003Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:fcb3b0d421a9b4d77eafb79b1dd135e889ab95d412f85d52ad6f18a8302b8d85","observation_id":"75bbba81-231d-4f00-a8c2-12a3bbd982ed","resolution":{"observed_at":"2026-08-06T00:52:59.385432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:58.899166Z","title":"You never cluster alone,","venue":null,"work_id":"00c0329a-7051-4d01-9926-a060916b9373","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.882920Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:738ae57cf2dca92ec02db69f1a81faf0d36c51066a0357f8d9f90c32caaa8de4","observation_id":"3cb67b64-30e2-4f84-88be-447aa14a87c5","resolution":{"observed_at":"2026-08-06T00:52:59.069299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:58.660669Z","title":"Contrastive multi-view learning for 3d shape clustering,","venue":null,"work_id":"c848895b-55e5-4993-a8bb-f13229cec8d1","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:40.979213Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:f762e9efb6e1c6c987ec8bd5778dd4b46e71f9703ce92a495fabf02acf604080","observation_id":"3b02061c-82df-47d1-984c-5cab0a95aad0","resolution":{"observed_at":"2026-08-06T00:52:58.739185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:58.436111Z","title":"Self-weighted contrastive fusion for deep multi-view clustering,","venue":null,"work_id":"31bf3197-3163-4b24-9030-7d81e3bbc89b","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.033771Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:e7c6821a9fdb286abf5f0617bb9bca6c24bff48c67a9910a7405c197a14092f5","observation_id":"33ed6e89-cff0-43f5-a806-4f21bdfa5b1b","resolution":{"observed_at":"2026-08-06T00:52:58.545678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:58.146309Z","title":"Image clustering conditioned on text criteria,","venue":null,"work_id":"69e5121c-7b13-4b4d-b95f-6498ac124708","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.135771Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:2efae94e0a42a5736e47f7ab9939c478008ac228cb93d562e9c1536e6642e76a","observation_id":"373e1cc0-3c7c-421d-8b3d-489ffb01b9b7","resolution":{"observed_at":"2026-08-06T00:52:58.274603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:58.006504Z","title":"Clusterllm: Large language models as a guide for text clustering,","venue":null,"work_id":"b133ca62-e665-40a5-b9cb-8652ae765da4","year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.213831Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:669012af4235754466acbc9c2296e0a62bd1f3f4ddbb2803e7cb21c48e635f7d","observation_id":"e1e77173-5386-4c6a-ab69-d26bc9fa7034","resolution":{"observed_at":"2026-08-06T00:52:58.065009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:57.833845Z","title":"Large language models enable few-shot clustering,","venue":null,"work_id":"5c972919-f741-4523-b10d-481c82d35d91","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.308635Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:96aac1382b6252e119c2509600bd89f23d9d34446c5a8cf8bdb2e26d883dd6bf","observation_id":"fd7a8e9f-2c12-4335-b32d-f8969c8cc335","resolution":{"observed_at":"2026-08-06T00:52:57.920244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-06T00:52:41.370976Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.370976Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b0f13a38df8e56f11ab4e5fdff93938b99ee17858708e419e440e9a384b0375a","observation_id":"3d235466-2c2f-4768-9c93-6083a744f8d7","resolution":{"observed_at":"2026-08-06T00:52:41.370976Z","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-06T00:52:57.585589Z","title":"New spectral methods for ratio cut partitioning and clustering,","venue":null,"work_id":"6132f57c-ceaf-47cc-b20e-1f2f27c4d968","year":1992},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.418204Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:29ec93241cde0eec83ee686448e86d9efa2fdd3fb73df85e5408d7800fb34181","observation_id":"5d6049bb-a76a-4356-b12b-089c09edfd7c","resolution":{"observed_at":"2026-08-06T00:52:57.729338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:57.466014Z","title":"A tutorial on spectral clustering,","venue":null,"work_id":"441d3faa-4bd1-4f70-b852-13504c2400e1","year":2007},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.467599Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:193a47a0ca20449c6c59bfb6f991ec13630d5b4c9ec63bbd01f81d784cc38a52","observation_id":"2a8a7ed5-1386-45b2-86b6-b39192e2b01a","resolution":{"observed_at":"2026-08-06T00:52:57.530592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:57.333698Z","title":"Deep spectral clustering with constrained laplacian rank,","venue":null,"work_id":"319d3308-263b-470f-a53c-38a8b41f5c1f","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.550870Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7a4cd78f863c8c1defe3358e4339fc1842975d7d9848ab672f134276ed7abbfe","observation_id":"95e734d0-0455-4b13-ac10-96140be33354","resolution":{"observed_at":"2026-08-06T00:52:57.400425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:57.219072Z","title":"Spectral clustering with adaptive neighbors for deep learning,","venue":null,"work_id":"8ed2eef3-1483-491e-8a85-3ee70c0f94d7","year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.645862Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:0bc34dc6bd1769e93a3044ecb18cc01d3299a1d4bcfc250d30829408b5671191","observation_id":"8f5cfb76-dd0a-40f4-b679-93a749180689","resolution":{"observed_at":"2026-08-06T00:52:57.264515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.996240Z","title":"Dynamic affinity graph construction for spectral clustering using multiple fea- tures,","venue":null,"work_id":"6286a4f0-fa92-4182-a8a6-c7d8f8f69f06","year":2018},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.731890Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:d9a8b876acf6eb32e7d2832aa9f7c300331253e11527e1b686d81368ffd6c186","observation_id":"0817fd8b-7f85-42bf-a08f-ca2cbe0c0be2","resolution":{"observed_at":"2026-08-06T00:52:57.104202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.848177Z","title":"Affinity aggregation for spectral clustering,","venue":null,"work_id":"5ffd578b-9454-407c-87fe-fac21c04e1ab","year":2012},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.829821Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:e0f89110fb8d4e15b7fa4f930027a58dceb71cc526ca281581a17913eeff8924","observation_id":"3850d363-41ab-4963-a6b3-12d3a11b2abb","resolution":{"observed_at":"2026-08-06T00:52:56.902641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.715149Z","title":"Consensus affinity graph learning for multiple kernel clustering,","venue":null,"work_id":"329c7fe2-5fe8-4b2f-b592-98c7fdff0c25","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.907169Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7600fc6b8408c0ff00e69ffd565681f1d4f5b936b6efaa501c88085ce4ce0770","observation_id":"eed3211f-5613-4381-bd43-69e2b7aced27","resolution":{"observed_at":"2026-08-06T00:52:56.765963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.553241Z","title":"Learning a joint affinity graph for multiview subspace clustering,","venue":null,"work_id":"5ed62ef4-665a-4291-a703-c8dda20e95e6","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:41.984974Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:d6bc2b8b436bca0495d3a573a6975b0f122fbdcec5814ac2fd38cd1ca540fe2f","observation_id":"c24f7788-5cc6-4257-bf29-d0b7f1e8717c","resolution":{"observed_at":"2026-08-06T00:52:56.634952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.414517Z","title":"Self-tuning spectral clustering,","venue":null,"work_id":"9952354e-6390-437d-8f39-dfb4058bf9db","year":2004},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.057098Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c30df9f84a39b44cb8d312b09b111274cf2746d53721bfd84c56adc709da0ecf","observation_id":"ddca8edf-cc6c-480a-98f5-7affe9d2f421","resolution":{"observed_at":"2026-08-06T00:52:56.499431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:56.218322Z","title":"Constructing robust affinity graphs for spectral clustering,","venue":null,"work_id":"9dc32218-e791-4f0e-9806-90256d6e4242","year":2014},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.142592Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:9e2aecbe9fad54386e6e278aebe663c498c56e2374252d3b251d6d2248ffaa10","observation_id":"6674801f-34f9-4d66-89d2-14af8f0f3778","resolution":{"observed_at":"2026-08-06T00:52:56.329646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:55.950635Z","title":"Random forests,","venue":null,"work_id":"9f4b27f6-ecaa-49eb-8b40-7c84a1ae6ff3","year":2001},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.233023Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7e8836ee0630ebd3619a6a7e66c5cb3fbf03b7a116b3899fdc7875b354694dcf","observation_id":"dda70911-9f2e-42c2-9022-6f5471f1a3d4","resolution":{"observed_at":"2026-08-06T00:52:56.061993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:55.737878Z","title":"Spectral grouping using the nystrom method,","venue":null,"work_id":"d4101afe-1565-4dc4-90ba-b559279f5f95","year":2004},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.311950Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:26208322133ada4aa093ed040fa3b94ce203c23406895731b661e1ff3a285e9a","observation_id":"194d7862-99ac-4e7a-8ab9-50b75748ee1b","resolution":{"observed_at":"2026-08-06T00:52:55.856297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:55.485619Z","title":"Power iteration clustering,","venue":null,"work_id":"7b7fd662-0adf-4e8d-8acb-4acb2505d0d8","year":2010},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.397238Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:9a267309f82206a52d05b8ace518094512cae5089aa7b4f5b5ba54b67b6f3d09","observation_id":"aa64c698-7d5d-4c80-914d-f330f0b692c8","resolution":{"observed_at":"2026-08-06T00:52:55.635277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:55.307531Z","title":"Fuse: Full spectral clus- tering,","venue":null,"work_id":"42c37c34-5989-4cd0-ae0f-3039ce4e1cff","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.457614Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:3d37496917f6eefa465603885aa385eb619575b69f6ecddc440dece02147a34c","observation_id":"481f72c6-7111-4658-bf6e-4c5ab2cc126a","resolution":{"observed_at":"2026-08-06T00:52:55.371860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:55.090337Z","title":"Large scale spectral clustering via landmark- based sparse representation,","venue":null,"work_id":"e82fea5d-b37b-4bc1-a32c-855a16281e15","year":2014},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.556052Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:4c29b4118e043359f3463589e97abe8a5d7a23f7a150ea407ff75a5ddff77f56","observation_id":"83197971-03c5-4470-9111-b56c5b6b4b25","resolution":{"observed_at":"2026-08-06T00:52:55.193964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:54.820424Z","title":"Large graph cluster- ing with simultaneous spectral embedding and discretization,","venue":null,"work_id":"6336b2b5-9fbd-4701-827a-962436b4b71d","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.647822Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:1e2c5859b3de4c483f51a7f5828eb66c3bbcb15fa418a216d37d58d914b28b0a","observation_id":"51e888db-f1ad-4ef6-9392-f9b0289b5986","resolution":{"observed_at":"2026-08-06T00:52:54.962681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:54.620437Z","title":"Mini-batch spectral clustering,","venue":null,"work_id":"b4b6981a-2599-40e8-b1e1-17945da31f6f","year":2017},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.736716Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:70df36530886c736ccfd971e0606f7573e724ec0634e93bb52128c5392c0b90d","observation_id":"245afb2c-442f-470d-a512-4858f8cb1e05","resolution":{"observed_at":"2026-08-06T00:52:54.730984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:54.359003Z","title":"Multiclass spectral clustering,","venue":null,"work_id":"4fb4b3c2-d1f6-418f-8490-8e4eb06fde8f","year":2003},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.798184Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:9b726a86e9b38ec94408b732e692b1f0d5089c9c05be366fd191f571f7fcaee3","observation_id":"92d4a8c2-6089-462f-9113-180a55317601","resolution":{"observed_at":"2026-08-06T00:52:54.481520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:54.167816Z","title":"Spectral rotation versus k-means in spectral clustering,","venue":null,"work_id":"1c3d7177-8aed-428a-8d89-eb0292406bdd","year":2013},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:42.893874Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:55abdc728316802bf52562aaf232d365516df9e18ae28fd21a65d4e4292b679f","observation_id":"99d0341e-13d4-40ef-be4f-70078473a053","resolution":{"observed_at":"2026-08-06T00:52:54.241305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.983147Z","title":"Scalable normalized cut with improved spectral rotation","venue":null,"work_id":"5e339e02-ec7b-4d8f-8917-531569a6a397","year":2017},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.006433Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:1c70f4b64e7abad95ccaff12b9f74c0a7a941e844e2faefce996126617c76df6","observation_id":"b0bfb012-df1b-4198-ba28-d58ca479e531","resolution":{"observed_at":"2026-08-06T00:52:54.071960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.777285Z","title":"Simple, direct and efficient multi- way spectral clustering,","venue":null,"work_id":"ee7e0e0f-0c42-416a-9eca-80ba3f5e3da1","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.127296Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c7fc98f3128c2ae156fd5c8296760e90df45a94afe3f08a04f9d5286df553ab2","observation_id":"15940998-ef6a-4522-9045-f2be9630b21d","resolution":{"observed_at":"2026-08-06T00:52:53.864733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.621303Z","title":"Fast opti- mization of spectral embedding and improved spectral rotation,","venue":null,"work_id":"f2342b29-311a-48e0-ad74-89b72a5e18c6","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.259364Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:77f2d94561af733ec1f1e67d18af3fa6c8d3cda287be581ab193db9cc0a6b6de","observation_id":"dbbeb7e6-669e-4154-8ff7-06a46a424364","resolution":{"observed_at":"2026-08-06T00:52:53.698971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.416670Z","title":"A unified framework for discrete spectral clustering,","venue":null,"work_id":"0e9f859c-9b31-4751-ae68-debf2a66d44d","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.353528Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b4c31084411d650f00ff1331f8885a666ccbf6fab6716491e5f795c532f95eda","observation_id":"a3750d2d-0320-4b21-9857-b4d702677391","resolution":{"observed_at":"2026-08-06T00:52:53.470599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.289629Z","title":"Unified spectral clustering with optimal graph,","venue":null,"work_id":"2940cf83-037e-4bd3-80f1-0197ed63c324","year":2018},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.497600Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c02f39c7aa0618a9893a602e392ebfd627ba90d3e0f01727ebceb7b0efabce78","observation_id":"269a1ba1-0d14-4ad8-97c8-36225197bf6e","resolution":{"observed_at":"2026-08-06T00:52:53.348009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:53.163581Z","title":"Tensor low- rank graph embedding and learning for one-step incomplete multi-view clustering,","venue":null,"work_id":"6cb36d6b-e8c2-4ba9-bf34-01f2bbcd212e","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.594581Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:017c5f594dad8198b761c28fe05e5a37538fa4a5262c1c591a1ee250f18e728e","observation_id":"8fe370b0-2787-45c2-bc9f-c8aff5e12e11","resolution":{"observed_at":"2026-08-06T00:52:53.219508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.989740Z","title":"Improved normalized cut for multi-view clustering,","venue":null,"work_id":"050e940c-0365-4e62-9334-81ecc10f881f","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.686579Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b4c119e8f7dcd78b5e5a624186e9153fcad2236db65518424111a1289183f3ee","observation_id":"27477a20-3ec6-465c-a05e-f83da7b7d144","resolution":{"observed_at":"2026-08-06T00:52:53.070056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.826566Z","title":"Learning deep representations for graph clustering,","venue":null,"work_id":"876418e5-e6ff-44e2-870b-98d8e286b03c","year":2014},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.757488Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:524b9dc1ede276bf4bc9d6b471c286c8e723e533a045a3177bc865eb93e15af9","observation_id":"283d2216-3d24-4ed5-9fd0-86204a146cdf","resolution":{"observed_at":"2026-08-06T00:52:52.879354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.622079Z","title":"Optimal transport for domain adaptation,","venue":null,"work_id":"d1ca840d-73a8-4736-ba8d-c4fadcaf6a07","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.816313Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:bed5b159a232ab05d51580fb5b5a11cb5b860cb7b3530f561a5dc356075e104b","observation_id":"6a2e70d4-94e8-4964-8b78-d91af1585baa","resolution":{"observed_at":"2026-08-06T00:52:52.714137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.471500Z","title":"Self-labelling via simultane- ous clustering and representation learning,","venue":null,"work_id":"c766c8ce-0860-4306-a7a9-5e95ccc9a834","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:43.925568Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:91314c3185fa716ebd3e65e422fbc451acf171286c34827d9a4d003a546f1a45","observation_id":"ca6db2c3-2af6-4ce5-8122-e2597045db51","resolution":{"observed_at":"2026-08-06T00:52:52.565662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.226188Z","title":"Unsupervised learning of visual features by contrasting cluster assign- ments,","venue":null,"work_id":"90de3745-ea83-468d-806f-0b2e71af5dba","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.034144Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:42a6b333d0f81df0d0907987675753df735f14b43cc04d3d0049c29518fae88a","observation_id":"b5333e44-ac23-44ac-ad03-bee5e77e6521","resolution":{"observed_at":"2026-08-06T00:52:52.321787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:52.077573Z","title":"Ota: Optimal transport as- signment for object detection,","venue":null,"work_id":"74ef160e-20d7-45a1-87a2-e86166f66595","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.179169Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:6c4c60eb9513e13237cb00db7808db85418f4da7e208452761d9266d953df974","observation_id":"1daafaec-2102-4ce7-b718-35a7634971a3","resolution":{"observed_at":"2026-08-06T00:52:52.153810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:51.940023Z","title":"A random walks view of spectral segmentation,","venue":null,"work_id":"ce12bbf0-28d7-44d4-aa30-4390ebb328cb","year":2001},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.313470Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b3de061392f1f2e1503e8a844e5683879978ac8d61fb4a9e67c5f705160dbdc0","observation_id":"4f4e7b32-65e1-4ced-a502-f7e5dcc06029","resolution":{"observed_at":"2026-08-06T00:52:52.017458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:51.798095Z","title":"Learning transferable visual models from natural language supervision,","venue":null,"work_id":"b9601a15-5f55-4bd9-86a6-10e2ff47642a","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.453869Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:6453f023381bb92f962067fd906019000ced6319e47fbf5ded556802701fffac","observation_id":"0a2b7336-faa8-447f-8578-afcd060ffec0","resolution":{"observed_at":"2026-08-06T00:52:51.878057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:51.621761Z","title":"Pattern recognition with fuzzy objective function algorithms,","venue":null,"work_id":"a3d01bbb-482c-4c91-91b9-d87e16d5fca1","year":1981},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.582535Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:89f8f8595c60d9a800889b0e177d1631b25ea2bb863f41adb441069952840806","observation_id":"df191568-d39b-41a2-80c4-4a52d0aacec2","resolution":{"observed_at":"2026-08-06T00:52:51.702666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-08-14T04:51:04.817737Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-08-06T00:52:44.712747Z","title":"Estimating or propagating gradients through stochastic neurons for conditional computation,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.712747Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:8824abcbe45da2585afd42e95c1b142a671584b2cf949e2fdcbdb971f7091f14","observation_id":"fcbaf3cd-0171-4439-8a2b-00d17f30fe96","resolution":{"observed_at":"2026-08-06T00:52:44.712747Z","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-06T00:52:51.456159Z","title":"Exploring simple siamese representation learn- ing,","venue":null,"work_id":"a76d363e-3700-4d7f-ad87-df4317e736c4","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.856690Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:c3c07d0cbd6e2b3e0cbcbbf1fd7e5e2142018871030114fbfd968551810c55c7","observation_id":"7ef6cdd9-1f2d-4a01-9395-7b505efbe66c","resolution":{"observed_at":"2026-08-06T00:52:51.522626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:51.255283Z","title":"Learning multiple layers of features from tiny images,","venue":null,"work_id":"082a6534-7ef3-4510-91c0-81048106d90c","year":2012},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:44.977596Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:99a506408ae4c3049974cbcf516ea8808ce276b1fd7e38a7abeda69b5ef98035","observation_id":"a04b3363-fa8d-4bb0-9be7-9bb8ed114e86","resolution":{"observed_at":"2026-08-06T00:52:51.383428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:51.037040Z","title":"Tiny imagenet visual recognition challenge,","venue":null,"work_id":"0759421c-da7e-4a61-9bc9-883705d8013d","year":2015},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.086705Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:299e8977780b66d71db5a054fb3ebccb9036b8ace0ceaf7235237baa9010d595","observation_id":"a0534b3e-ec61-4f0c-a84f-7b7cbaaf6d6a","resolution":{"observed_at":"2026-08-06T00:52:51.112439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:50.834599Z","title":"Divclust: Controlling diversity in deep clustering,","venue":null,"work_id":"18cbf8d1-394a-4036-9c37-88ee6fb37623","year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.182816Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:07dbab451abbb39b5bc34751ecdd9b168db46e0eb4c805d811479f8aedb439e3","observation_id":"5ad2c536-83f7-47d2-9705-39f9932d3b0d","resolution":{"observed_at":"2026-08-06T00:52:50.934109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:50.667633Z","title":"Least squares quantization in pcm,","venue":null,"work_id":"b91058d9-9173-40cd-9909-f1ad3dea3e95","year":1982},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.347529Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:a592330ef321bd52498391bb9086c86514b3e5c15cd8d975c7dddfc70e32b3a4","observation_id":"f79d4ee7-8ceb-477c-9866-674de32d1d2b","resolution":{"observed_at":"2026-08-06T00:52:50.737742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:50.378441Z","title":"Agglomerative clustering using the concept of mutual nearest neighbourhood,","venue":null,"work_id":"4123c83a-227a-4fe9-94c7-b95df8c9356e","year":1978},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.466845Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:60e26e4c9f613c2826867e7d38abb8d46b1f4a70a4c3d7a77ca7f93df60f4324","observation_id":"3d23de7b-ad7a-40cb-957a-81509e137721","resolution":{"observed_at":"2026-08-06T00:52:50.498373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:50.253740Z","title":"Locality preserving nonnegative matrix factorization,","venue":null,"work_id":"0ae6f7d2-b429-4c29-97de-4ff84d45c998","year":2009},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.607547Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:5b6e4f787289a47314cd8a896671cb83c72cd53f0bfe886c639715d8d959d4b6","observation_id":"db980112-f90a-408f-ba27-1e036e807891","resolution":{"observed_at":"2026-08-06T00:52:50.315145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:49.985551Z","title":"Graph contrastive clustering,","venue":null,"work_id":"f95fe31e-c821-48dd-a9ea-e244df429a85","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.709553Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:9b4d31e3aa3780c8ba9ad189de4ca9ee9e4295ffa96b0c4dc29042eaaf9ce320","observation_id":"48dda9a7-2fe3-4389-8725-8ca75ba6a31f","resolution":{"observed_at":"2026-08-06T00:52:50.134467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:49.769770Z","title":"Wasserstein em- bedding learning for deep clustering: A generative approach,","venue":null,"work_id":"0f0cb77d-661f-4a93-9089-e48237fab6c7","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.816360Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:4feabb6049649aae1b4578b5c7e0a01a53d598879a3496c9ae7a8ae28d0e7fd9","observation_id":"d83fdc0e-1ecc-441a-afe9-3dd62aea5ad8","resolution":{"observed_at":"2026-08-06T00:52:49.839655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:49.466759Z","title":"Deep semantic clustering by partition confidence maximisation,","venue":null,"work_id":"c8bb26d0-24b5-4658-b6ef-c20c9053871f","year":2020},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:45.956837Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:da0eccdbe828907006f876e06a96a780ff0d064c481cd4c834282ef87288830f","observation_id":"4d8bb455-fb86-418a-863b-50a82abb54a9","resolution":{"observed_at":"2026-08-06T00:52:49.565558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:49.264176Z","title":"Hcsc: Hierarchical contrastive selective coding,","venue":null,"work_id":"036d16d5-f80a-471a-a73f-9a779d84e70d","year":2022},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.063312Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:51e4b074228280b4bae88056ee48e2cff0915e6ea3cc20cc6304e76b8cd4437f","observation_id":"592fca9a-c3af-4e45-ae06-974ac488dbb3","resolution":{"observed_at":"2026-08-06T00:52:49.366754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:49.087777Z","title":"Clustering-friendly representation learning via instance discrimination and feature decorrelation,","venue":null,"work_id":"973893d6-6e12-447e-abdf-df4d848d6f9b","year":2021},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.101548Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:17817c929365eb8c3bc749271994655bc1d5c440b309878d5e756ab8d7f58e5b","observation_id":"319447a7-f588-48d7-87f6-b9f962538491","resolution":{"observed_at":"2026-08-06T00:52:49.144823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:48.890590Z","title":"Deep- clue: Enhanced deep clustering via multi-layer ensembles in neural networks,","venue":null,"work_id":"ced2a95f-3ffc-4618-9a41-bc48fc8ce4d1","year":2023},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.229556Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:78749129163e00e0dcaabb546f987b4d868931ce321304cb1a961d7e744cb663","observation_id":"9eaa9bb7-ac5b-4c2f-b4c0-c94b42a87226","resolution":{"observed_at":"2026-08-06T00:52:48.997662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:48.676187Z","title":"Semantic spectral clustering with contrastive learning and neighbor mining,","venue":null,"work_id":"cde6550d-bd93-443d-8c17-4efda4daef2c","year":2024},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.335566Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:a322918318aef3d8c945c85d2c8079ec2517f00025b398c2cfcdb77a03c61c20","observation_id":"f4008195-88a1-4f6c-8615-9871af619fa3","resolution":{"observed_at":"2026-08-06T00:52:48.769629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:48.481514Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":"56873e20-62fd-4842-a0be-4685fca12b3f","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.339446Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:6139753c68ac5608d28593fc52a3611ab414084b7239cabe9536622b17bdb058","observation_id":"ad5992fe-5888-4054-9935-954e7f0e38f5","resolution":{"observed_at":"2026-08-06T00:52:48.588512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:48.242377Z","title":"Understanding the difficulty of training deep feedforward neural networks,","venue":null,"work_id":"ccb91201-cbaa-4cb9-a0a5-d09bff2548ab","year":2010},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.379677Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:8bbe9eea2aea20d7a759141f74e2d00ac49216519a7126935a2e0ccbcbf27a48","observation_id":"1b7e6c59-ce73-423a-b9f3-3b06ccbfc9aa","resolution":{"observed_at":"2026-08-06T00:52:48.343649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:48.048562Z","title":"Sgdr: Stochastic gradient descent with warm restarts,","venue":null,"work_id":"b17cab36-9467-4115-b3fd-b5d26b14c4a9","year":2016},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.572682Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:0c138a33640a8eafb72c3e73952afc7e0a6c712206fa155651fb6330ae4f3c18","observation_id":"c9e62943-b75c-4197-ae48-ce6a68ee14d8","resolution":{"observed_at":"2026-08-06T00:52:48.123501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:47.960235Z","title":"Pytorch: An imper- ative style, high-performance deep learning library,","venue":null,"work_id":"370133fe-1c86-446a-8b90-a505d8cfb2a0","year":2019},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.735014Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:b03344c028f1c0278e3585092ddc488e4e435221d17c40c1906b8ff4d8f67140","observation_id":"5e1c9cb6-b03d-4251-b6ea-27c9ca783002","resolution":{"observed_at":"2026-08-06T00:52:47.998605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:47.780872Z","title":"Information theoretic measures for clusterings comparison: is a correction for chance necessary?","venue":null,"work_id":"a5e90a7a-9d52-4d91-badd-0bc4919744dd","year":2009},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:46.892234Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:7033c3423fbf058bfd8adbda5dd0d494e08d7ae4761866ca62175a73bd12178f","observation_id":"5708ad7c-e9f4-4d03-9a18-d3cf1db0953e","resolution":{"observed_at":"2026-08-06T00:52:47.886767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:47.593961Z","title":"Comparing partitions,","venue":null,"work_id":"c583d782-3393-448e-a211-77f7c37d2744","year":1985},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:47.112264Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:d84fff23678e84e58fe9b3be8085f40b6799333c7270af77dec878c4f4843d02","observation_id":"9816a2ff-6f39-4bfa-b9cc-bd22838ca922","resolution":{"observed_at":"2026-08-06T00:52:47.695190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T00:52:47.421937Z","title":"Dis- placement interpolation using lagrangian mass transport,","venue":null,"work_id":"626f3373-3238-467f-83a7-04ecd20ed5fa","year":2011},"citing_paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport","version":1},"reference_index":103,"source":"pdf_text","source_observed_at":"2026-08-06T00:52:47.280390Z"},"links":{"citing_paper":"/paper/2508.04200"},"observation_digest":"sha256:24aee70825af0f113aa18b84f950327e09d71d00f137476d7b64f7c910a04fc5","observation_id":"c3aac692-cf55-4bc9-98d4-a5a671709170","resolution":{"observed_at":"2026-08-06T00:52:47.495878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.04200","last_updated":"2025-08-06T08:30:30Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-10T17:04:52.408701Z","submitted_at":"2025-08-06T08:30:30Z","title":"Bootstrap Deep Spectral Clustering with Optimal Transport"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":78},"total_outbound_references":86},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2508.04200."}