{"as_of":"2026-08-13T10:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30e496ee32e3ae293abb73f2afbe49c0a610989c7dc2e67ab72451c50d3120b2","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T11:51:53.429491Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2606.21873/citation-record","integrity":"/paper/2606.21873/integrity","json":"/paper/2606.21873/citation-record.json","paper":"/paper/2606.21873"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T11:51:53.429491Z","title":"An lp theory of pca and spectral clustering.The Annals of Statistics, 50(4):2359–2385, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:07ad81a89aed7ac9bd1fb39f12d46f006693245c476257b3c71e0e9a195e531c","observation_id":"b6c72cd9-8234-46a9-9592-02087e3682f2","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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":"2601.07074","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T08:19:44.461663Z","title":"Robust mean estimation under quantization.arXiv preprint arXiv:2601.07074, 2026","venue":null,"work_id":"a8e9dfa3-1d1b-4be2-8113-9cdb910ebfc8","year":2026},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:eff41b58bb70e4a736ea7e050bcbc8e1613e4ebe5ea08a26146c1554e4b4203b","observation_id":"d7723d2c-94a7-4530-8f71-fe7f9c3dddba","resolution":{"observed_at":"2026-07-04T08:19:44.463065Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-26T11:51:53.429491Z","title":"Courier Corporation, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:1e9f4fd80d28893c3e639b5423a87756712bb374f4697aa7d632e1125c1df34d","observation_id":"18ffe3f7-f4cc-4e44-9529-8b1e50cc392b","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Distributed adaptive gaussian mean estimation with unknown variance: Interactive protocol helps adaptation.The Annals of Statistics, 50(4):1992–2020, 2022","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:2e02e5b479ef57f4ef826c712e1b5c772968300d135b8c4674febed6ae8dd85c","observation_id":"badb986e-4bdd-4a05-90e1-ff20a42e9f9f","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"A parameter-free two-bit covariance estimator with improved operator norm error rate.Applied and Computational Harmonic Analysis, page 101774, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:a116f02cd594620aa4eb701dabfa3264262e080df8a79dfbe0649982e5cf3e3e","observation_id":"62c0cadc-5b93-41bb-a836-407a002e9e0c","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Ng, and Di Wang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:f4a6b7ce0926147dfe4220404d3da39fea20b454db9b652405aba924fc9594d5","observation_id":"b5c7b2a9-9193-4593-a01f-8f63a77bc8aa","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"One-bit phase retrieval: Optimal rates and efficient algo- rithms.IEEE Transactions on Information Theory, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:cf7bf3366e3fabaa7adfb63e8d41a6c2bb47cee2780edd00cd7661e1391eb365","observation_id":"c836fa47-829c-4a55-a30c-8b812938163e","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Cutoff for exact recovery of gaussian mixture models.IEEE Transactions on Information Theory, 67(6):4223–4238, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:3c69c838bf27dbb3579237f993f43f17604a9b14009dfa52f78bb6f1d519d2e1","observation_id":"57472b54-2204-44bf-b3b6-46b6ad683dd8","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Nonconvex optimization meets low-rank matrix factorization: An overview.IEEE Transactions on Signal Processing, 67(20):5239–5269, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:f109aaa16ee0561d41ecb8349be8df910d5bb5c64d65b547183cf98797d65197","observation_id":"c2c3f575-196f-40aa-8909-f5ef9b5728d7","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"1-bit matrix completion.Information and Inference: A Journal of the IMA, 3(3):189–223, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:a885b2a341b007dafd5f03199567595e479a8735bf5fa31a64df776e3b31c3a5","observation_id":"ae2a5a51-a479-4211-8d32-ed08fa53b4fb","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"An overview of low-rank matrix recovery from incomplete observations.IEEE Journal of Selected Topics in Signal Processing, 10(4):608– 622, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:570cac7aa4137f0ada3bf0ea0d438ea77733983bb852a55438115816d6c8377b","observation_id":"40d5bb29-48c2-4843-8b8d-b66016e16e02","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Covariance estimation under one-bit quantization.The Annals of Statistics, 50(6):3538–3562, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:f3dbcdc364ba7008afdd35591e1b46a7bea1380dfca5ecd20c5f61a59915b63e","observation_id":"cc7763ba-3ef0-466d-8f39-60eaee55da86","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Non-gaussian hyperplane tessellations and robust one-bit compressed sensing.Journal of the European Mathematical Society, 23(9):2913– 2947, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:3a1f043c590bb1e7cf7a67b2c96ce8e833949a02cc16dfeb98eaf52631d76a1f","observation_id":"7fd3e2ac-b303-4317-8046-4c3593cd3b87","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Phase retrieval by binary questions: Which complementary subspace is closer?Constructive Approximation, 56(1):1–33, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:6d8a50a16e1c0161cb2886496314661d28259755b90f85f67951046b2a86e6ab","observation_id":"d598e69e-499d-4f16-9a1e-1ff47d8defab","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Hidden integrality of sdp relaxations for sub-gaussian mix- ture models","venue":null,"work_id":null,"year":1931},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:f6b557b1a8cf2c45ea7551446ce6731b4429731030747d638fbf17d3360083c9","observation_id":"a8cace13-832c-4e8c-84f1-75054554337f","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Zhang, and Harrison H","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:1fae1d4b2b64d813f2bcda328f5d66ac41bfd88a0f95cec11ca409c412933a9a","observation_id":"7d04d052-dd2f-4f35-b3c5-15cef3d049f5","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Partial recovery bounds for clustering with the relaxedk-means.Mathematical Statistics and Learning, 1(3):317–374, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:870b402fd4bf7a64ded66b030515a574a66fb1c150d008878d36c4264a49a2eb","observation_id":"8b16233f-4f82-4dda-9fa1-b481c568cffc","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Dithered quantizers.IEEE Transactions on Information Theory, 39(3):805–812, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:9fe6d4000e4d5e392dd77ba02c03950d4f223cc82f434ba8676d193587cb3ddc","observation_id":"89c0d8e7-a90c-4840-8cf1-48493113b01c","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Robust 1- bit compressive sensing via binary stable embeddings of sparse vectors.IEEE Transactions on Information Theory, 59(4):2082–2102, 2013","venue":null,"work_id":null,"year":2082},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:f50893b79351d0cdaab367a058c81b5929b191f38ff180590f47b2762bc347f3","observation_id":"447f3639-6fcc-4160-8bad-97ef77400b3e","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Mean estimation from one-bit measurements.IEEE Transactions on Information Theory, 68(9):6276–6296, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:d6b3afa2d9c802de5f88ce191f44230f2215f1236948dc65745fce64e56d8e39","observation_id":"46c38361-c189-4761-bce7-c1e4403e4e4f","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Optimality of spectral clus- tering in the gaussian mixture model.The Annals of Statistics, 49(5):2506–2530, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:89779044259d3563f150fc6aba315ddd786c13c25f10fd49aa976613ea924bf8","observation_id":"ac6c64a2-9f66-4b3a-a150-7d47f9f47e78","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.02099","last_updated":"2016-12-07T02:35:54Z","snapshot_observed_at":"2026-08-07T23:31:37.473411Z","submitted_at":"2016-12-07T02:35:54Z","title":"Statistical and Computational Guarantees of Lloyd's Algorithm and its Variants","version":1},"cited_work":{"arxiv_id":"1612.02099","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.02099","snapshot_observed_at":"2026-07-04T08:19:44.459480Z","title":"Statistical and Computational Guarantees of Lloyd's Algorithm and its Variants","venue":"math.ST","work_id":"90af490b-6051-40ea-aaf5-adc3cfba8292","year":2016},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"cited_paper":"/paper/1612.02099","citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:2bde83fb20195d1b983eca974b81656c069fcb1b5fd2f26c12b170fefce2613b","observation_id":"42f012c2-d624-4b14-98d5-21dd1cfe51ea","resolution":{"observed_at":"2026-07-04T08:19:44.460602Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-26T11:51:53.429491Z","title":"Sharp optimal recovery in the two component gaussian mixture model","venue":null,"work_id":null,"year":2096},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:8a30ddbdb2b33e1addc69946c7191014dd2816f5b27d0daf6a389555fc5abac7","observation_id":"452ab367-7f74-4d5d-a61f-50fd935b0f7a","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise.Journal of Machine Learning Research, 13(1):1665–1697, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:64da59c9cdd94e10ae423ab08d52649d8701c30d82c1fe88c9b83b7b8ab0c3f4","observation_id":"6bf58ba1-cd2c-4f25-b4b5-e1cf92114b08","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Approximating k-means-type clustering via semidefinite pro- gramming.SIAM journal on optimization, 18(1):186–205, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:ee8c2aa896bce0caf1e95bc2829fd37b214688b66cf498574b80d49de967ab4b","observation_id":"d1d6756a-e4cd-47bc-b4cb-202bddcc4d4a","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach.IEEE Transactions on Information Theory, 59(1):482–494, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:8d184d9a1ae349d97042ed6308a25b88b1e6641e3676e29abe338def61b3bcdc","observation_id":"648dab1a-d099-4ed8-9c1e-1bd3d6a038e6","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Picture coding using pseudo-random noise.IRE Transactions on In- formation Theory, 8(2):145–154, 1962","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:56a40c121a0c52d98f577bb8199dfd8aea698d7a1e0c185858f1878ee131162b","observation_id":"bd504e3f-5d0f-472b-b5de-f440de56b2f1","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Sketching for distributed deep learning: A sharper analysis.Advances in Neural Infor- mation Processing Systems, 37:6417–6447, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:435b12d7d2e71522c907b68fd28d9ce3609de3e7cfb4f3c568dd641601c7188b","observation_id":"4723e313-feb8-47bf-aab7-62701bc39183","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"The generalized lasso for sub-gaussian measurements with dithered quantization.IEEE Transactions on Information Theory, 66(4):2487–2500, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:517d1e858b645dafa1de68ac7548c04767e6492f4e4af9d3f880ff339ba06a2a","observation_id":"c16cf432-4ef0-470f-b9d9-f13fd404f632","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Cambridge University Press, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:b3963a0c1d2f66265e6dc0e5ab2cd98585dc0ae8c30dc93a8b1a26b6a595f007","observation_id":"1a0d6f88-86e1-4232-b82d-1ab5bdecfb4d","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Randomly initialized em algorithm for two-component gaussian mixture achieves near optimality ino( √n) iterations.Mathematical Statistics & Learning, 4, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:6f217f5826fb60cea7874cd6bf0b0ff9d5503c88462d1a49f8972b66eebefc15","observation_id":"e225295e-e7a5-4353-888d-3fbf0e632ed6","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Quantized compressive sensing with rip matrices: The benefit of dithering.Information and Inference: A Journal of the IMA, 9(3):543–586, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:ccd5ea5076e6e416d88295de9eb9255b9853b7d259a2811bb52510e4c35d972f","observation_id":"c3d37120-0aab-4d41-815a-eaad206cb082","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:30c5a97e4a2764e3b070812b828bf93d1bed02cda32dca504622aea1fd685fe3","observation_id":"225b178d-23ce-4091-a7bd-d32c6c5e020b","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"We lete i = ˜Xi−Xi fori∈[n], then we have thatei is zero-mean andO(λ) sub-Gaussian (cf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:30af23f7d8f224acaeb942ae2d341a56b2989211c993c380148c258068b98f71","observation_id":"4561dea3-cbf9-48a7-8666-b46ab97ead2b","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":"Recall that δ1 d=Q 2λ(θ+ε1 +τ1)−θ, 22 we shall introduce a surrogate ofδ1 as ˜δ1 :=λsign(θ+ε1 +τ1)−E [ λsign(θ+ε1 +τ1) ] = (˜δ11,···,˜δ1p)T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:6e75aa8600cb89dcc91f740aa8e80a42a94ff05d7c05a64e87d58a0d1aff3094","observation_id":"9e93dd2b-7457-414c-ae55-5721f8995039","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","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-06-26T11:51:53.429491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:c2826ccf5fb5c9156b42f0c3de8c0d90f419cd4bd81c879f37488af86508c5c6","observation_id":"f7b71010-9f51-4df5-bdef-952f96b7c255","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","resolver_source":null,"status":"malformed_identifier"},"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-06-26T11:51:53.429491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T11:51:53.429491Z"},"links":{"citing_paper":"/paper/2606.21873"},"observation_digest":"sha256:9168766aed356f4cdd720a1ef49c13274cc8a0ba780fdb02e274bac3d3d0b357","observation_id":"61514723-e94d-40d4-89cb-0b9913a04464","resolution":{"observed_at":"2026-06-26T11:51:53.429491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.21873","last_updated":"2026-06-20T04:18:08Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T22:48:41.131969Z","submitted_at":"2026-06-20T04:18:08Z","title":"One-Bit Clustering for Two Component Sub-Gaussian Mixture Models"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":37},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2606.21873."}