{"as_of":"2026-08-13T00:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d02b313d7bd75ce8be1b9d93d600701bee03094412baabb23e4bad353c756b53","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:02:45.189500Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T22:47:51.317948Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-04T22:47:54.806558Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"cited_work":{"arxiv_id":"2502.03405","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.03405","snapshot_observed_at":"2026-08-04T22:47:54.806558Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","venue":"cs.LG","work_id":"986bee57-8e25-4bf2-8efe-f9cecc5eb752","year":2025},"citing_paper":{"arxiv_id":"2509.07184","last_updated":"2025-09-08T20:01:29Z","snapshot_observed_at":"2026-08-10T00:02:54.026262Z","submitted_at":"2025-09-08T20:01:29Z","title":"Dimensionally Reduced Open-World Clustering: DROWCULA","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T22:47:51.317948Z"},"links":{"cited_paper":"/paper/2502.03405","citing_paper":"/paper/2509.07184"},"observation_digest":"sha256:a88451c14a0aa3f3be67116eaacd0694b99264593b3aad067be403319761b86c","observation_id":"84fe10ac-d6fa-4205-832f-3c4003723240","resolution":{"observed_at":"2026-08-04T22:47:54.879099Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.03405/citation-record","integrity":"/paper/2502.03405/integrity","json":"/paper/2502.03405/citation-record.json","paper":"/paper/2502.03405"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:46.293271Z","title":"Alam and S","venue":null,"work_id":"e12b9f96-de0b-4258-be3a-939c217d0cd0","year":2005},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.471759Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:e1894d668b0d1341fe597c0fd60c8e12d1c8943b47fe791b4ec033b52ade52fe","observation_id":"57aefe52-877a-4437-b3ed-586329a0ca86","resolution":{"observed_at":"2026-08-09T05:02:46.298259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.277255Z","title":"Iterative bregman projections for regularized transportation problems, 2014","venue":null,"work_id":"de9c38ba-ee02-495e-8c46-39aaa71749ca","year":2014},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.520972Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:436c832db88638fb038fa887b87b0a4f707be548c7b58fda2c6200d980b2ed6f","observation_id":"6e505b99-86ff-4f31-ab92-d1367e5ee36b","resolution":{"observed_at":"2026-08-09T05:02:46.282419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.260529Z","title":"Chen and Jun S","venue":null,"work_id":"d05685b8-5fec-437a-a0da-83dc045e0dda","year":1997},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.589494Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:8c5e866ccfcba4a17ce6589f0ab950f2de2a6d41ae309950e6b4fce40fb4880f","observation_id":"5bfc8ca7-4154-469f-86e7-9c53861299b4","resolution":{"observed_at":"2026-08-09T05:02:46.266640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:44.677910Z","title":"A simple framework for contrastive learning of visual representations, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.677910Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:1e0c610e23edec513ccfaae40c95ffce744aa74aea8db1ab931c63be8f0ac36c","observation_id":"d7d8e74b-8616-4618-8a1c-3a63e2b8de70","resolution":{"observed_at":"2026-08-09T05:02:44.677910Z","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-09T05:02:46.234305Z","title":"solo-learn: A library of self-supervised methods for visual representation learning","venue":null,"work_id":"5e692fcd-224e-43d9-86a4-451fcb89546b","year":2022},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.738668Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:285a71f39224f461eb7d2b15580d3f11575f33de1e93a09c609d48cfca8782cc","observation_id":"6673d308-e282-43eb-8a89-38a4fbf6af75","resolution":{"observed_at":"2026-08-09T05:02:46.239666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.219625Z","title":"Dhillon, Yuqiang Guan, and Brian Kulis","venue":null,"work_id":"d2f55866-cb6d-4646-aabb-dc73be82c4d0","year":2004},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.797117Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:1858a6b8d9aa8a6097e325e2279f025443ea601e1a69fe5e70a01843d3025bc8","observation_id":"27c34d30-0ab4-4cd3-bdad-71e959872090","resolution":{"observed_at":"2026-08-09T05:02:46.224144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.202935Z","title":"Estepa, Ignacio Sarasua, Bhalaji Nagarajan, and Petia Radeva","venue":null,"work_id":"c5ff214c-fb26-4268-8c47-99398dc63c13","year":2023},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.828369Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:ee456d9a6f4b66ffdf45c5f6d0c5945f17669bc415b5ef1dd3f5408742cdd013","observation_id":"82d38c13-bf5c-4959-b575-2f42c8dc18b4","resolution":{"observed_at":"2026-08-09T05:02:46.208369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.187605Z","title":"Ezugwu, Abiodun M","venue":null,"work_id":"0cc52b82-581f-4331-b9f1-927f8a12032b","year":2022},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.875409Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:9ff66b7353a80b5ea67cdb41d31196a8355a23db2a6b90c3ba42e09bf2569220","observation_id":"09825bf2-94c7-4819-a23a-39328a9fa566","resolution":{"observed_at":"2026-08-09T05:02:46.191872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.169654Z","title":"Let go of your labels with unsupervised transfer, 2024","venue":null,"work_id":"5469bb51-86b4-465e-8943-433fcfa466ea","year":2024},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.919968Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:d59d9c86bea0d850d2a918dfb90a018f55581f4fb70586b6413a0feff14332a5","observation_id":"508a1ac2-6aa6-4b2c-959b-3aa6ca2c7621","resolution":{"observed_at":"2026-08-09T05:02:46.175443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.152442Z","title":null,"venue":null,"work_id":"a4e91426-f76e-4853-890a-c90ed6c5d228","year":2000},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.971384Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:03b41b8fbaeb5bc79a2ce95ea482ccf65d4a6c74f23ca3cee8dd867879b4114c","observation_id":"120bf13b-db7d-4819-8df7-66641bdc2424","resolution":{"observed_at":"2026-08-09T05:02:46.157609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.134732Z","title":"Hagen and Andrew B","venue":null,"work_id":"364ae18c-98b6-48e6-8ed1-233dc49d9cca","year":1991},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.976112Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:3ab6067083edec7a365133165cffb74e5ccb86eb6c13f6387ba7a4a9c8056f7e","observation_id":"26ae2359-3443-4085-bb4b-69ff8b0914a4","resolution":{"observed_at":"2026-08-09T05:02:46.141598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.117925Z","title":"Bulirsch J","venue":null,"work_id":"698d649b-35d3-4cc5-ad1f-6d20cfcdf880","year":2013},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.981399Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:4828aadff51662e8c6e36c793e9b5726505754debcf8af976fdb0cdb36ba85c1","observation_id":"0946d5a8-dbf4-490c-a5be-a051e2e86a90","resolution":{"observed_at":"2026-08-09T05:02:46.123974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.101648Z","title":"A decoder-free variational deep embedding for unsupervised clustering","venue":null,"work_id":"89694554-e38f-4fb7-9fb5-a16c8bf48e75","year":2021},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.986075Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:0488a08d6a9542d11d5565613ccdfdd33e5fd86ad0fd089f1b5bd31cc5b7bd72","observation_id":"f9dce997-8048-467a-95a4-82139bf7aab3","resolution":{"observed_at":"2026-08-09T05:02:46.107162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.084738Z","title":"Variational deep embedding: An unsupervised and generative approach to clustering, 2017","venue":null,"work_id":"1ec8d108-9408-4ddd-bd15-ffb2da74283b","year":2017},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.990450Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:7deb6adea76a749197c78544126bd6f5fdc680e09a7e97db2f8190a5a7d15c8a","observation_id":"9a2b3a98-8275-411d-88da-fe8384db713c","resolution":{"observed_at":"2026-08-09T05:02:46.090169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:44.995275Z","title":"Learning multiple layers of features from tiny images, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:44.995275Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:ef410501e01215a96787dee910f731a70a83e6236b5474f03e8b5041cb809f69","observation_id":"156589ff-a35a-49d7-99e0-41345f9e26fd","resolution":{"observed_at":"2026-08-09T05:02:44.995275Z","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-09T05:02:46.060009Z","title":"Hierarchical deep reinforcement learning: Integrating temporal abstraction and intrinsic motivation","venue":null,"work_id":"43a2d76e-7465-4106-88c6-d7aad99e1083","year":2016},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.000163Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:eaeeeec1d5c8c9a23bfd388c8443092c17b03ac1a023b5409d5c1fede0e5881e","observation_id":"a6124d8b-a2b8-406f-a5fc-5a48cfccaa19","resolution":{"observed_at":"2026-08-09T05:02:46.064757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:45.005432Z","title":"Lecun, L","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.005432Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:1507efac51766c07a262951678da068fe7142332103039d778f88535cf55bc75","observation_id":"0c6b7bb9-11ab-4064-9d09-b5403d438f61","resolution":{"observed_at":"2026-08-09T05:02:45.005432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09687","last_updated":"2020-09-21T08:54:40Z","snapshot_observed_at":"2026-08-02T07:10:02.529655Z","submitted_at":"2020-09-21T08:54:40Z","title":"Contrastive Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.09687","snapshot_observed_at":"2026-08-09T05:02:45.011107Z","title":"Contrastive clustering","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.011107Z"},"links":{"cited_paper":"/paper/2009.09687","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:a6f14eb6548046343996115d13b8e0979ea3d10ee781fa9476340dd8fd3c242b","observation_id":"eca909a1-ea4b-4ebb-af8f-7622427fbe10","resolution":{"observed_at":"2026-08-09T05:02:45.011107Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:45.662500Z","title":null,"venue":null,"work_id":"b8cb94a4-d9ae-4acb-847f-97e17cb50bd3","year":1957},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.017069Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:61a65eb13288a27ea83d46ca9cd6fb11cf78d450813a89f78050b21599ea9526","observation_id":"a0ff9741-9b91-4a80-a04d-76c6a0072bbf","resolution":{"observed_at":"2026-08-09T05:02:45.667344Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.043969Z","title":"Machado, Marc G","venue":null,"work_id":"baa0aa7e-e1c2-4896-b53a-bc0fde62365e","year":2017},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.022577Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:8a4b31ce1c1a6a9bee976cf37c9b09c4a1beded38cc1ff2bd1d6b129c3979259","observation_id":"bd1817cd-8805-479c-8b03-5e75d8e6c899","resolution":{"observed_at":"2026-08-09T05:02:46.049439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.11089","last_updated":"2018-02-23T21:55:05Z","snapshot_observed_at":"2026-08-10T10:12:47.390860Z","submitted_at":"2017-10-30T17:36:19Z","title":"Eigenoption Discovery through the Deep Successor Representation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.11089","snapshot_observed_at":"2026-08-09T05:02:45.027482Z","title":"Machado, Clemens Rosenbaum, Xiaoxiao Guo, Miao Liu, Gerald Tesauro, and Murray Campbell","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.027482Z"},"links":{"cited_paper":"/paper/1710.11089","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:729ff24730d95d21b01e7660cf8748ca694c9b76b4bc77c57d6dabfa18820fcd","observation_id":"852dff9b-dd99-4e86-9f72-f7f95bd03bfb","resolution":{"observed_at":"2026-08-09T05:02:45.027482Z","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-09T05:02:46.028213Z","title":"Exploiting sparsity to improve the accuracy of nyström-based large-scale spectral clustering","venue":null,"work_id":"df16a3ef-93a9-4c8d-bd41-32ad4934e89c","year":2017},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.032851Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:70f5528cc698befe29b957e9c9bbc29d32f93c31463e504ccfaac2334c5b7f84","observation_id":"9dbdebce-a06a-4770-9e36-1415c024b926","resolution":{"observed_at":"2026-08-09T05:02:46.033421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/2098689","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:45.490131Z","title":"Algorithms for the assignment and transportation problems","venue":null,"work_id":"e7883552-d8ed-4763-8c56-8f029168c0b7","year":1957},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.038005Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:589a8388efeffb3d37335fdc4c0e800d48d868b74305a945cfd77d47484861ae","observation_id":"c02f547d-7767-4905-b0e5-c7daafb231af","resolution":{"observed_at":"2026-08-09T05:02:45.500327Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:46.012160Z","title":"On spectral clustering: Analysis and an algorithm","venue":null,"work_id":"006e73ce-f551-4a23-90c2-fa68cc47dfd3","year":2001},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.043335Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:b47c6ff2eeb395b2b7ad82dbde041303484c83971b16b2d053ac02a18451bd2c","observation_id":"2d0289a4-e345-4be9-a2aa-312d32c08298","resolution":{"observed_at":"2026-08-09T05:02:46.017900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07193","last_updated":"2024-02-02T10:24:09Z","snapshot_observed_at":"2026-08-11T10:12:11.384939Z","submitted_at":"2023-04-14T15:12:19Z","title":"DINOv2: Learning Robust Visual Features without Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07193","snapshot_observed_at":"2026-08-09T05:02:45.048636Z","title":"Dinov2: Learning robust visual features without supervision, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.048636Z"},"links":{"cited_paper":"/paper/2304.07193","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:21a5a5c8b2772b36a77da488aa0d010b0d3b7904a92f25698dbb30de5b8bb61a","observation_id":"2ad691aa-112e-487b-98dc-4578ca812660","resolution":{"observed_at":"2026-08-09T05:02:45.048636Z","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-09T05:02:45.054132Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.054132Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:1a40ef95c669fa429df3dadaa351e3b3ea96e11214938d0989b2cb6a621c194e","observation_id":"f6bda4b5-5d5d-4c6e-b4c1-14780da2ff59","resolution":{"observed_at":"2026-08-09T05:02:45.054132Z","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-09T05:02:45.987320Z","title":null,"venue":null,"work_id":"e135fc15-794d-4a3a-b0d7-3cf336dfe6dc","year":2020},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.058996Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:8f484b9071d9e135ece3e88c058d0406f27a562e8c97980f36f5df79e93d451a","observation_id":"1b2c4e82-7839-4f7f-8302-a1292e47dc09","resolution":{"observed_at":"2026-08-09T05:02:45.992002Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00020","last_updated":"2021-02-26T19:04:58Z","snapshot_observed_at":"2026-07-06T10:45:03.059688Z","submitted_at":"2021-02-26T19:04:58Z","title":"Learning Transferable Visual Models From Natural Language Supervision","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.00020","snapshot_observed_at":"2026-08-09T05:02:45.065172Z","title":"Learning transferable visual models from natural language supervision, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.065172Z"},"links":{"cited_paper":"/paper/2103.00020","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:cf3d0d0220aad6bf6ff8aa5eb035ad3853dc46cc4dc2b025a02e0e1b6e32f9a4","observation_id":"67dcd75a-1b8c-45c8-8890-3177723abc36","resolution":{"observed_at":"2026-08-09T05:02:45.065172Z","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-09T05:02:45.971817Z","title":"Spectralnet: Spectral clustering using deep neural networks","venue":null,"work_id":"fcd2aecd-8ffc-473e-b764-48449aebbaab","year":2018},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.071007Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:a71b946d3d3e04898c623643e8e2fe3d9c94a9ac510bbfd9eef4c5c1f994a74f","observation_id":"8871022b-55cc-4c4a-857c-e8c888a088a4","resolution":{"observed_at":"2026-08-09T05:02:45.976941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-09T05:02:45.829892Z","title":"Fast and accurate k-means for large datasets","venue":null,"work_id":"1f7e0486-b60c-454b-acbf-c306f82dbfc9","year":2011},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.076921Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:c658a0e5b6a92c8b861dc6cc896b900c35c7992bd480f33f2d5de38ddc3f97cd","observation_id":"6ab9275e-a4c7-4283-91bd-6785022720b6","resolution":{"observed_at":"2026-08-09T05:02:45.871580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04412","last_updated":"2025-03-11T03:56:24Z","snapshot_observed_at":"2026-08-09T02:22:44.258052Z","submitted_at":"2024-02-06T21:18:34Z","title":"The VampPrior Mixture Model","version":3},"cited_work":{"arxiv_id":"2402.04412","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.04412","snapshot_observed_at":"2026-08-09T05:02:45.287102Z","title":"The VampPrior Mixture Model","venue":"cs.LG","work_id":"ed5e730d-78c4-48ab-959c-76ab6a9021fa","year":2024},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.082726Z"},"links":{"cited_paper":"/paper/2402.04412","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:8d819ec9a323042460a450819074f00c2d556eb53b7b5a35600eece3e742acca","observation_id":"0f35be2a-f377-4645-be9a-5462a0c10776","resolution":{"observed_at":"2026-08-09T05:02:45.293274Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0711.0189","last_updated":"2007-11-01T19:04:43Z","snapshot_observed_at":"2026-07-06T01:35:39.668511Z","submitted_at":"2007-11-01T19:04:43Z","title":"A Tutorial on Spectral Clustering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0711.0189","snapshot_observed_at":"2026-08-09T05:02:45.104481Z","title":"A tutorial on spectral clustering","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.104481Z"},"links":{"cited_paper":"/paper/0711.0189","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:c6155c31e42370ae2dd9f6da9bd5203f3e5b69e0520f7884cb1b61b03b717540","observation_id":"4b2f9328-5b2a-40fa-b301-7bcaff23a297","resolution":{"observed_at":"2026-08-09T05:02:45.104481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-07-06T05:56:41.814255Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-09T05:02:45.134194Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.134194Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:c25106b4caea7ae49b39490d70da5b66e6c9441156a1e21b6551ab728371cd61","observation_id":"3312ad3f-a1f9-4402-a398-1d8062455da1","resolution":{"observed_at":"2026-08-09T05:02:45.134194Z","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-09T05:02:45.704399Z","title":"Streaming spectral clustering","venue":null,"work_id":"803f4f52-3b25-4364-8d29-f013df6e36c7","year":2016},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.162040Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:beaf1e9068e9f699e2c09383a2b5ef4ac68e278311a6ac41f1db4b37892ea168","observation_id":"8d94c760-ec8b-4b74-855b-4b92dfe240e9","resolution":{"observed_at":"2026-08-09T05:02:45.757078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T05:02:45.189500Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T05:02:45.189500Z"},"links":{"citing_paper":"/paper/2502.03405"},"observation_digest":"sha256:b8f753d7364ed0ee9823fd6b178ebbc9cb9bb0c720a1e5daf006635eb18f5511","observation_id":"6659e160-7e02-459c-a5d9-8f61a5048d2a","resolution":{"observed_at":"2026-08-09T05:02:45.189500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.03405","last_updated":"2025-03-11T08:27:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T04:00:17.943642Z","submitted_at":"2025-02-05T17:47:53Z","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":19},"total_outbound_references":35},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2502.03405."}