{"as_of":"2026-08-18T01:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e81c9f2342c7465c253587825009364a7484ef7d230a7716fcfec7442df43db1","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:55:05.340175Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"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/2509.22879/citation-record","integrity":"/paper/2509.22879/integrity","json":"/paper/2509.22879/citation-record.json","paper":"/paper/2509.22879"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:54:57.301801Z","title":"A new look at the statistical model identification","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.301801Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:81334f085da481e3b3385df0c1984c21afa961c4daad25ddf81c5096ca268a53","observation_id":"4c69d5c5-d37e-49f0-a960-ece20f258422","resolution":{"observed_at":"2026-08-04T14:54:57.301801Z","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":"10.1093/imrn/rnx126","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algebraic identifiability of gaussian mixtures","venue":"International Mathematics Research Notices","work_id":"7c5768ac-8e76-49cf-85dc-f82b57705f16","year":2018},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.389148Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:870b61bc7181e6c6ffb11a35df75594e5a96d1a464c65a44e06d48134969e7e1","observation_id":"d1f601fb-230b-4bb9-bcbe-e7d4274295cb","resolution":{"observed_at":"2026-08-04T14:58:58.027540Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:54:57.495254Z","title":"The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.495254Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:c541f5da05ba29cf041ca69988da4fd3430104cf4b114a2f2e4f7eb9e2e0d1e6","observation_id":"6cbafbf4-9a45-458a-9bdc-635d69f89ada","resolution":{"observed_at":"2026-08-04T14:54:57.495254Z","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-04T14:54:57.565876Z","title":"Antoniak","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.565876Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:4a0775a35df52fd5354a5b86564b6b3c7ca0b957e674a8f06bc65c3f8f7bede0","observation_id":"0e27c705-15e0-4cc0-8312-6586d0324a08","resolution":{"observed_at":"2026-08-04T14:54:57.565876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04288","last_updated":"2023-06-07T23:35:37Z","snapshot_observed_at":"2026-08-17T10:57:50.443300Z","submitted_at":"2023-03-07T23:24:27Z","title":"Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04288","snapshot_observed_at":"2026-08-04T14:54:57.626987Z","title":"Polynomial time and private learning of unbounded gaussian mixture models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.626987Z"},"links":{"cited_paper":"/paper/2303.04288","citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:34fbb83ac8fa8122ba6ae3d3d7aed55732b29fcf7d3695747f20be4c7ab4a1e9","observation_id":"9c40ed75-b228-4d7c-a032-5fab3acafdd2","resolution":{"observed_at":"2026-08-04T14:54:57.626987Z","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-04T14:54:57.693246Z","title":"k-means++: the advantages of careful seeding","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.693246Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:f0302789884b841b69127e68fe57a7a8f3ffbdc837c387d02a66a1c16f9df863","observation_id":"430245ee-ee65-47a3-ae8f-c07760ca1af9","resolution":{"observed_at":"2026-08-04T14:54:57.693246Z","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":"10.18653/v1/p17-1151","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multimodal word distributions","venue":null,"work_id":"9c83480c-ae47-4c77-a09c-c1e5a77ada74","year":2017},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.757132Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:2cfa823316bb26aceca9795cb95ae1b013efb82d90d8c6205ee4af4c79e273ad","observation_id":"181fdda6-d95d-49aa-aa15-a4b593d614d3","resolution":{"observed_at":"2026-08-04T14:58:57.654749Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:54:57.827587Z","title":"Kane, Pravesh K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.827587Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:e09eca328a7721a6d3c3de4ae55e0af249a7db913a9b96eeb433ed32eece7114","observation_id":"c526aa20-6d0d-4958-9878-26411f523da3","resolution":{"observed_at":"2026-08-04T14:54:57.827587Z","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-04T14:54:57.931791Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:57.931791Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:3395433b266a7eecb698093cd74af4a75f2642947c917bb67a065b91d90e2a58","observation_id":"1f203345-e076-402c-b6ad-528b781de285","resolution":{"observed_at":"2026-08-04T14:54:57.931791Z","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-04T14:54:58.004016Z","title":"Aggregating continuous word embeddings for information retrieval","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.004016Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:95e70cea447dcf739d57a8e4fe74b638ad02bfad0439831b5a2031514d4b56d2","observation_id":"7385038a-98d7-40fa-9b3c-f484118558d3","resolution":{"observed_at":"2026-08-04T14:54:58.004016Z","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-04T14:54:58.100752Z","title":"Curto and Lawrence A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.100752Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:241a61146fba9c8c89b4fe4f499ca8017867628e4e70ed210389173c529bab97","observation_id":"c5408f2f-cd49-4540-8b84-7907e0d8f772","resolution":{"observed_at":"2026-08-04T14:54:58.100752Z","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-04T14:54:58.181839Z","title":"Learning mixtures of gaussians","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.181839Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:a566797a4f14f69489e95001726ff6cca638cf1f865cea06f6f94c61aeb39107","observation_id":"6eeff7da-53c6-4cff-9401-90aa3847e1ff","resolution":{"observed_at":"2026-08-04T14:54:58.181839Z","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-04T14:54:58.259747Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.259747Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:ba9fd53416b05ef3684f14168b1183463fdd8326e9191e78ee2ad86e7fc53576","observation_id":"4a06544e-cf8c-44d1-98aa-63f638a3e7bd","resolution":{"observed_at":"2026-08-04T14:54:58.259747Z","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-04T14:54:58.363467Z","title":"Likelihood ratio tests and singularities","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.363467Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:a6c7a4fc4db7706e11a3c4bcb33565923c06db922dea150069f8a2465c4f9721","observation_id":"9631ecb3-39cd-471b-8979-a72334e11ba5","resolution":{"observed_at":"2026-08-04T14:54:58.363467Z","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-04T14:54:58.533169Z","title":"Model-based clustering, discriminant analysis, and density estimation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.533169Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:1a5abc121f07ce2f9aa6c07329e594a6289bf82098660e1e95709657068a6e2e","observation_id":"0cbe0148-b8d1-4023-a9a7-46300de33c5c","resolution":{"observed_at":"2026-08-04T14:54:58.533169Z","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-04T14:54:58.672567Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.672567Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:ce5eb964fa2db7a9bc9bc03e077c851343a44e5100e3166a040b321c4614b4bf","observation_id":"0265bf08-a78e-44cc-9da4-60294e0e2e88","resolution":{"observed_at":"2026-08-04T14:54:58.672567Z","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-04T14:54:58.808585Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.808585Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:fb6798193e265b71055bdb0651736aaa729d624a69c705feba92e736531abd01","observation_id":"74044482-d532-44e3-ad3e-b81d383943d7","resolution":{"observed_at":"2026-08-04T14:54:58.808585Z","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-04T14:54:58.981243Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:58.981243Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:6f133cfde1a062b0fd3f0104eb7fdbc9a13e52de3be102ef3e6f2cdea7e7fc82","observation_id":"acf3d8a1-8bdb-43dc-83ce-f410b7ad6055","resolution":{"observed_at":"2026-08-04T14:54:58.981243Z","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-04T14:54:59.090024Z","title":"Large sample properties of generalized method of moments estimators","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.090024Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:4408822411e93afabd13bbfcf0e66cf6c7b0a3375b6bae257c9e8799ba903f37","observation_id":"3cbd6a04-f561-4bfc-9358-48c3867420f5","resolution":{"observed_at":"2026-08-04T14:54:59.090024Z","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":"10.1214/17-aos1647","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Strong identifiability and optimal minimax rates for finite mixture estimation","venue":"The Annals of Statistics","work_id":"2dda914e-cd10-42c3-8462-21d2be2fb16e","year":2018},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.164179Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:55eb25241ca8c803d07d3dadda5b7f73af9915744046fe7cd15811e29502ff5d","observation_id":"6bcdc023-3280-4639-8537-aa891812903f","resolution":{"observed_at":"2026-08-04T14:58:56.944758Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/10997703_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Detecting Global Optimality and Extracting Solutions in GloptiPoly, pp.\\ 293--310","venue":"Lecture notes in control and information sciences","work_id":"7f3e886a-3811-4c9e-87a1-58be91445dd1","year":2005},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.275633Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:28fed316a12cc61bc67d467d1948ebe3f318af38392f651e30378760e49b1e99","observation_id":"9b22f579-f355-4dde-a852-b5e4be2b7468","resolution":{"observed_at":"2026-08-04T14:58:56.674741Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:54:59.422527Z","title":"Matrix manifold optimization for gaussian mixtures","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.422527Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:5904d91308b58696c54cc9520270776ad5c923abd7e809503f3061b2fe1f07b2","observation_id":"162026f5-95a9-4487-8299-b661fcfbf2e0","resolution":{"observed_at":"2026-08-04T14:54:59.422527Z","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":"10.1023/a:1003183708705","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:58:56.235174Z","title":"Bootstrapping log likelihood and eic, an extension of aic","venue":null,"work_id":"458593c2-ca1c-4f2b-ac61-876f7e52839c","year":1997},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.579358Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:1bf48c52e79a3d5014ba60c40a4f2f365cca9fd44e26e14de725651b55275013","observation_id":"d6dda9a0-80af-4399-96de-767edf0d4488","resolution":{"observed_at":"2026-08-04T14:58:56.394740Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.jspi.2006.07.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finite mixtures of multivariate poisson distributions with application","venue":"Journal of Statistical Planning and Inference","work_id":"1718b148-2e71-489d-9077-ee6fabf8ae3f","year":1942},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.752066Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:6ca4b2d4ac2394789e34c63b324c56ba0bcc613eda7208378ba175f0f46ebb3e","observation_id":"40c2488b-a8d7-4750-bb9a-32dd0d5b016a","resolution":{"observed_at":"2026-08-04T14:58:56.035765Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/s0167-9473(02)00177-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Choosing initial values for the em algorithm for finite mixtures","venue":"Computational Statistics & Data Analysis","work_id":"b6ee4aca-96d1-49c6-94a5-7f05e0b26236","year":2003},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T14:54:59.951601Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:ce2f73bfdfcf9853cbc81d96be9eb81ba638c853d764aeb7cb047ef7c49cf8b1","observation_id":"5b4baf7a-4968-48bc-a441-876463853548","resolution":{"observed_at":"2026-08-04T14:58:55.664738Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:00.157414Z","title":"Rousseeuw","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:00.157414Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:04935f768298c2f18192dc6814e8e5f3f9566d3af9239f90ded23ac7211feae6","observation_id":"2f3589b9-14d0-4b0e-8718-7e7f573194c0","resolution":{"observed_at":"2026-08-04T14:55:00.157414Z","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":"10.1016/j.jsc.2022.04.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tensor decomposition for learning gaussian mixtures from moments","venue":"Journal of Symbolic Computation","work_id":"2c12148d-f002-43b9-b570-d271c4655492","year":2022},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:00.314228Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:b5f79dc8f53a725f1b85cf0ea992943ac856ec082ab75298d7cfa80af3b463b4","observation_id":"eadfb0c0-b560-4854-9be6-031a99b68838","resolution":{"observed_at":"2026-08-04T14:58:55.324747Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:00.500921Z","title":"Kiefer and J","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:00.500921Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:2d6a9d49101da6df402b8f37eacef5aae248574e588536f8729455ca53d687b5","observation_id":"58a84588-7e3b-4fe1-a9fb-395f89764f8c","resolution":{"observed_at":"2026-08-04T14:55:00.500921Z","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":"10.1137/17m1152061","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minimizer extraction in polynomial optimization is robust","venue":"SIAM Journal on Optimization","work_id":"8cab9f90-af29-4ac1-a8d6-eb8cd7db39b4","year":2018},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:00.705939Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:c5211850581535c8d7f5cddfe7415300dd327d735c0935351bffc8120a1afa75","observation_id":"542fa59f-a123-47d6-a6fd-b19f12fad200","resolution":{"observed_at":"2026-08-04T14:58:54.999365Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:00.884048Z","title":"Kothari, Prasad Raghavendra Manohar, and B","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:00.884048Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:eedafddebd5887d2929f4a318f6838f3328f121c9774b08a083cecdc6041f8a3","observation_id":"fd2fb999-ed21-4759-b9c2-3a27ec716025","resolution":{"observed_at":"2026-08-04T14:55:00.884048Z","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":"10.5802/crmath.657","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lasserre","venue":"Comptes Rendus Mathématique","work_id":"b980d00f-acc9-4d55-8e88-6b6556702cc6","year":2024},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.069992Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:b845670396be52f795281256a2ed6b091aec2321ec0a83edbd7c5e2a398eb9a4","observation_id":"5a023049-aec2-46e3-a08c-e3d9dcc43703","resolution":{"observed_at":"2026-08-04T14:58:54.755057Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:01.236287Z","title":"Moments, Positive Polynomials and Their Applications","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.236287Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:51311eaae7cfc09398a2034cbf9d72d609f19bd03c0d8ebc604450aff0481c5d","observation_id":"c2609760-c137-4c81-8d5a-43658e8e20de","resolution":{"observed_at":"2026-08-04T14:55:01.236287Z","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-08-04T14:55:01.402886Z","title":"An Introduction to Polynomial and Semi-Algebraic Optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.402886Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:4f7467aa36d8f710aa9260a404b270745475e481031ae789c83ac1e25a5a0a54","observation_id":"ccebc418-4fda-4f99-9c03-f4f61c73b2ed","resolution":{"observed_at":"2026-08-04T14:55:01.402886Z","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-04T14:55:01.497874Z","title":"A hierarchy of convex relaxations for the total variation distance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.497874Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:27476f13ea5c9db945fb2f49f89ff57c45155e86cf3523305de856eeebe63810","observation_id":"a4f38037-ef11-487f-977b-d1be619b48e9","resolution":{"observed_at":"2026-08-04T14:55:01.497874Z","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-04T14:55:01.677147Z","title":"Estimating gaussian mixtures using sparse polynomial moment systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.677147Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:b6ebb2078785db9cf09b53eada4ca54c30ca9d30c47e9930d570a0a8098e5c70","observation_id":"4c482b70-8bab-45fc-94df-b364f4288770","resolution":{"observed_at":"2026-08-04T14:55:01.677147Z","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-04T14:55:01.831828Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.831828Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:23b8094e57ce3d369f77692c180fd6acaf6e0ef6cb324cb818147407dc357584","observation_id":"73927d0d-cf3d-44be-8876-50c3d16219f9","resolution":{"observed_at":"2026-08-04T14:55:01.831828Z","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-04T14:55:01.941343Z","title":"Clustering mixtures with almost optimal separation in polynomial time","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:01.941343Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:6f433edd5b3b59422d5b1cadfe93c063d6a13fe4f481e0e734f47526e98ff054","observation_id":"1b800445-b371-4b9c-a278-db8cdccab0bb","resolution":{"observed_at":"2026-08-04T14:55:01.941343Z","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":"10.1016/j.spl.2004.12.015","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Likelihood ratio tests of the number of components in a normal mixture with unequal variances","venue":"Statistics & Probability Letters","work_id":"b65889d8-b5eb-463c-a869-a8135c72a4b9","year":2005},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.060287Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:61bf34e575a16f9c1123c7bf7a41a5b828a4b558d6c4f4ee5340b4f5d835cba5","observation_id":"286f14f5-2e24-4dc0-8fec-6de4574345af","resolution":{"observed_at":"2026-08-04T14:58:54.354744Z","resolver_source":"doi","status":"verified_exact"},"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":"2103.00915","last_updated":"2021-03-01T11:09:40Z","snapshot_observed_at":"2026-08-16T18:42:14.642964Z","submitted_at":"2021-03-01T11:09:40Z","title":"TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.00915","snapshot_observed_at":"2026-08-04T14:55:02.270473Z","title":"TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.270473Z"},"links":{"cited_paper":"/paper/2103.00915","citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:c97f89447efa0a6b61f7de98ea5c2faebad5397084dd480228c2c551a15af102","observation_id":"8678cff2-824a-4b26-ad07-9199b63e0384","resolution":{"observed_at":"2026-08-04T14:55:02.270473Z","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-04T14:55:02.442348Z","title":"McLachlan and David Peel","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.442348Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:078daf51748cedff3d7284608709b41420aacdc9d3c3c8936fd906235e536cf7","observation_id":"b06f43a2-874a-49c3-a649-56769a03fea4","resolution":{"observed_at":"2026-08-04T14:55:02.442348Z","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-04T14:55:02.621295Z","title":"McLachlan and Suren Rathnayake","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.621295Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:f1de795dba2cc43f1b3eed58619c71176310d4bf83fdf857eb59e80b7439a387","observation_id":"5dcd6f30-bbd8-412a-ab45-e4f3cdb8ef61","resolution":{"observed_at":"2026-08-04T14:55:02.621295Z","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-04T14:55:02.792250Z","title":"Moitra and G","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.792250Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:f157593e82f48c4f5af1b388cd8628b1895c75c8cc6aa5f80fad8f84de8cec54","observation_id":"6cf58415-6eac-4645-b2e9-19925aac164c","resolution":{"observed_at":"2026-08-04T14:55:02.792250Z","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-04T14:55:02.980231Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:02.980231Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:a2a2f97f2da107b798d1c200a38779214f8edf5bb5fd2b5f5e63754afcca9e36","observation_id":"9fae15b1-95ef-4952-978d-fb2a9f99435e","resolution":{"observed_at":"2026-08-04T14:55:02.980231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06930","last_updated":"2022-03-21T21:42:54Z","snapshot_observed_at":"2026-08-16T17:21:23.655144Z","submitted_at":"2022-02-14T18:42:11Z","title":"Tensor Moments of Gaussian Mixture Models: Theory and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06930","snapshot_observed_at":"2026-08-04T14:55:03.177327Z","title":"Pereira, Joe Kileel, and Tamara G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.177327Z"},"links":{"cited_paper":"/paper/2202.06930","citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:1a148b4409ad933889375a1a93730e6fc31e71972a4e7a07d2947e89c09baa07","observation_id":"f43605f1-bf22-4ad9-a0af-13e1fa0d48a2","resolution":{"observed_at":"2026-08-04T14:55:03.177327Z","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":"10.1016/j.patcog.2005.10.028","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A study of gaussian mixture models of color and texture features for image classification and segmentation","venue":"Pattern Recognition","work_id":"796d7ed6-c630-4d81-b3e3-9331786a8052","year":2006},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.363639Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:78d3c4821bcfe4e458c51dd318d0be3cdc543c018f3d25d5cf1b20ed183874d7","observation_id":"9808fe80-8510-41ea-ad0b-4440e1f67eb8","resolution":{"observed_at":"2026-08-04T14:58:53.924748Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:03.553043Z","title":"Positive polynomials on compact semi-algebraic sets","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.553043Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:4ee3a7b1f8a0ac3c3f49940e1937a94090f447634a8d92d86c4dae7788cbef34","observation_id":"95aebcdb-d90b-4a91-92f5-0fb5f229509c","resolution":{"observed_at":"2026-08-04T14:55:03.553043Z","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-04T14:55:03.664756Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.664756Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:241dd6d5f4ba070f1a9017864efff37004f5fe5b44aabe73c64b1127d487aa7d","observation_id":"7d296319-1c7a-4a6d-94de-fbeef5f8df42","resolution":{"observed_at":"2026-08-04T14:55:03.664756Z","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-04T14:55:03.789327Z","title":"Reynolds, Thomas F","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.789327Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:d0fd07fb8fd3fb1d21afc1571ab4d83ed3db0837a4a3e26506578549b6061cad","observation_id":"57e7bf27-6017-4f14-b85f-5973839d1158","resolution":{"observed_at":"2026-08-04T14:55:03.789327Z","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-04T14:55:03.908022Z","title":"Lasserre","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:03.908022Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:2ff1d0124a7ea6b31276a83163b874ce40654af9eaeabb3277af891cf2248c28","observation_id":"5c89567b-2963-4b4e-ad8c-1d0cfb2a540b","resolution":{"observed_at":"2026-08-04T14:55:03.908022Z","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-04T14:55:04.030775Z","title":"Estimating the dimension of a model","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.030775Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:ca83662b8a95077f54adca050afcad0ea8e6703fc1bb962ec085b3ef67d1198f","observation_id":"a0aca2e6-7946-4491-bcfc-2cb12a480b80","resolution":{"observed_at":"2026-08-04T14:55:04.030775Z","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":"10.1023/a:1004181512763","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:58:53.463477Z","title":"A cautionary note on likelihood ratio tests in mixture models","venue":null,"work_id":"15502878-2769-4ebb-9036-2e7c436b0b30","year":2000},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.115648Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:2b168123ed0e845cc84a43fb560f66f70b5697bb74e309b09c2e63fef6997ad1","observation_id":"74c15b05-fc5f-4a80-a8bc-aceb91b8fd94","resolution":{"observed_at":"2026-08-04T14:58:53.561080Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1142/s0219498820502047","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Identifying the number of components in gaussian mixture models using numerical algebraic geometry","venue":"Journal of Algebra and Its Applications","work_id":"6d8e57b9-fa26-4905-8ae4-9063c0f5dce4","year":2020},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.190254Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:38d9661b63ebb9a99b295d495851d0e68e556426e76bd66da001f45911ad1652","observation_id":"11c05bda-f192-482c-978d-8b46a78bc2ec","resolution":{"observed_at":"2026-08-04T14:58:53.333923Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:04.298120Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.298120Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:ae43a5ebfac9b2070676e7428fd3635523ea962d6f35d90574e697cd983d41e9","observation_id":"b41b8445-7418-4a61-a76c-0ddb7ebae69e","resolution":{"observed_at":"2026-08-04T14:55:04.298120Z","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-04T14:55:04.377219Z","title":"Estimating the number of clusters in a data set via the gap statistic","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.377219Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:b00318ef9155b8accf046c426d2d52f7db62a5c9c3575af590201d27aef83b76","observation_id":"f65c0170-c2af-4046-a868-719ef6700da0","resolution":{"observed_at":"2026-08-04T14:55:04.377219Z","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-04T14:55:04.398554Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.398554Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:c85bd628485c218c958112a906c004478bdc82fc402921e63614791693b9b516","observation_id":"3722d92f-bd0d-406c-832e-cf8d2a3bb7d2","resolution":{"observed_at":"2026-08-04T14:55:04.398554Z","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-04T14:55:04.474454Z","title":"Optimal estimation of gaussian mixtures via denoised method of moments","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.474454Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:a4f90dde72c1369fe97fc5facb409231284a3b57294e81e63adf19b8d934c6c8","observation_id":"43acd970-0a25-4751-815d-9addd98c0621","resolution":{"observed_at":"2026-08-04T14:55:04.474454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01766","last_updated":"2023-01-04T18:59:35Z","snapshot_observed_at":"2026-08-16T16:04:23.697489Z","submitted_at":"2023-01-04T18:59:35Z","title":"Learning Gaussian Mixtures Using the Wasserstein-Fisher-Rao Gradient Flow","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01766","snapshot_observed_at":"2026-08-04T14:55:04.590884Z","title":"Learning gaussian mixtures using the wasserstein-fisher-rao gradient flow","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.590884Z"},"links":{"cited_paper":"/paper/2301.01766","citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:9586fe52ea2f1b86f7c4a2c75bae59cb7c18418070ae94a44d5b022c4a1fd3cc","observation_id":"9c97f82f-1818-48f6-afac-ad57fe024be3","resolution":{"observed_at":"2026-08-04T14:55:04.590884Z","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-04T14:55:04.713289Z","title":"Solving inverse problems with piecewise linear estimators: From gaussian mixture models to structured sparsity","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.713289Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:c376be2920daa342b7eb54a8d5b0d56a2d53b11359ac4277e38f5c942f6b8b1c","observation_id":"daa35138-0860-45a0-80c1-ed36686fbd7a","resolution":{"observed_at":"2026-08-04T14:55:04.713289Z","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":"10.1016/j.csda.2006.01.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A mixture of mixture models for a classification problem: The unity measure error","venue":"Computational Statistics & Data Analysis","work_id":"15c61af3-5086-47f6-b1c5-167e94ac2991","year":2007},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:04.870877Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:3186aed0a458f9c29952be7b5815482f6b6f013d8867e85bd5edb2178c33d635","observation_id":"c860ad57-8f00-4c86-b48b-f426d30d4153","resolution":{"observed_at":"2026-08-04T14:58:52.976097Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:55:05.008158Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:05.008158Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:3d39883f92b4d0e572136678eaf87b46f09bcae8f3592a6efbe0263876e694f7","observation_id":"79b08e27-6163-4991-9506-6eabce4cab13","resolution":{"observed_at":"2026-08-04T14:55:05.008158Z","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-04T14:55:05.174360Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:05.174360Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:dd7863f6190178bf6a117539bebf3a60b48361c9da854765c2c458f0a152fd22","observation_id":"bc1a9e79-cc6e-4921-983d-92cdc50e0f92","resolution":{"observed_at":"2026-08-04T14:55:05.174360Z","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-04T14:55:05.340175Z","title":"A X . V@ly`r?4","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-04T14:55:05.340175Z"},"links":{"citing_paper":"/paper/2509.22879"},"observation_digest":"sha256:5e296632580b4c362adfbbd59cf0b18d737f615a0a3d6ba7c3bd0b2a17ab9b0a","observation_id":"ec6217b3-3d65-49ae-82e6-8346b4f4d945","resolution":{"observed_at":"2026-08-04T14:55:05.340175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.22879","last_updated":"2026-06-23T02:52:48Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T22:08:19.190520Z","submitted_at":"2025-09-26T19:51:21Z","title":"Mixtures Closest to a Given Measure: A Semidefinite Programming Approach"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":15,"verified_fuzzy":0},"total_outbound_references":62},"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 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2509.22879."}