{"as_of":"2026-08-09T12:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:908169c222188e1b1d086746cbfacbc115ac7c02e28b00b2c0b4c85e3ac45944","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-09T06:31:02.800959+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-08T23:09:02.793774Z","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:d693edbc5eafcaf12935edd779357f62a368ee2f5552c9a62255e72c40253e0f","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-08T23:09:02.793774Z","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:821b7b2bf742981d6487300f302b8d7e81a005b093665e52975767f7c4f52280","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:762f4dcfeabca23ea7f30c9087304d555063c65752695a415c4f2a1a2da25fc6","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-08T23:09:02.793774Z","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:2b497d7fb700ad3918fca47475b432008f10d106da436c8369720179267bde79","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-07-06T14:59:57.727357Z","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-08T23:09:02.793774Z","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:3e7d1d3d78c51f7b3f5fee1c15aa5f9d435a76a124b7272cd0f53762d1b9d6da","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-08T23:09:02.793774Z","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:3fd9e982fecf08554591dc03cffff6cd01afd3e6f705ff82da9bcb47de8d7d17","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-08T23:09:02.793774Z","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:2b41e6f7b21d0339039752b4863236f04f58935e2dd673aeccf62ae8d5d382b0","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:673ddd80de72555a976aff32c126c74eb9ecddb3d1249043c0430f3d8829327c","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-08T23:09:02.793774Z","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:107ce3a182e8a8689e4212536c55926045d5f702f49fd50b51623247eac3264a","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-08T23:09:02.793774Z","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:16baf89f8577654119c4a9eade3bd111afd8318d1f298c973a0fa7d337ef8af2","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-08T23:09:02.793774Z","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:25d25a1351d41666dfe79f5c5c0d535a9646959f9b43b00d1c98b14eedf419be","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-08T23:09:02.793774Z","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:787754b784a90746d246e8f94e5e010f7b71dfdae8ed9df445b16486bfa7404c","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-08T23:09:02.793774Z","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:ee66d76fc9547f063e7874ba9bb5c088a19b5b10e8976562f09fcfd2249e8314","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-08T23:09:02.793774Z","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:f8105a3cbd89d350868b1778e4deb1af7ff01b3bbdfe7230b06b8e36d66d87d0","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-08T23:09:02.793774Z","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:7b02a31434012bd1e5dae04fec83902e94e57f404f3f5d01e2ad1c3bb5662d82","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-08T23:09:02.793774Z","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:5be422b11a7e22dda5920d6b338fbafbaa8915c2208d52acd5e943bc882a02de","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-08T23:09:02.793774Z","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:b6c717e4996cdea129bf5cf01a625da067d0d10fd9d0a12ae391015775ba12af","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-08T23:09:02.793774Z","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:075399c1d5aebe926a28d43c9b445ad7f7a904acd634d144adec57ca2c33453a","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-08T23:09:02.793774Z","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:6ebbf6f72ccc785c04087da975e4faf29728f763658379bb15fe8d1d7ea93c2b","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-08T23:09:02.793774Z","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:f5a7f5f20803f583852b61451825b6d7996006411d0bfb967bf9ec42a7de19fe","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:0b1716e06bb1deb8004997ee489e684d2ee9d97b4eb7ccb402aac6b2e76c7d33","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:81b1e4cc0787ef06f105b7ca7e9b40382508dc3c2b58d1fdfec883f5a6f562f8","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-08T23:09:02.793774Z","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:052c3b6e3955c89e1ce6713d5c2b4dd66f0f65220933c323fff63dcb0fc8bd40","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:d1475feb9aeb146b60063458019e80203bdec0c6117dc6b27fe09aef5cbe4507","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:5dbdfac36895782acb499f836b6b00b51fa337b3045691b0cd3bab8b44b070b9","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:f56d38d32575f96d9e49ec25d589b2451f44e6652416f4aa4981b3a87116e570","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-08T23:09:02.793774Z","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:8f973636d14afe41f6a50f0b24bdf9f8a92492d371e59ea0ec012f53fbc57f97","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:b953b6b1cc4e03418ccd96015f28685dfc12d5ac7130e3349eec98a904672f48","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-08T23:09:02.793774Z","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:06028b89564cfd2cba1479b9c37430e7284264c6ef1b861e02ffd08110250a2f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:6987d85442fdc249a7a7c30d61c83a5ef1f9da4a89ce6dd0959c1e3bcaa71ef7","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-08T23:09:02.793774Z","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:f8612291fc4cd35d97abf0f04792b00c93b6b1f72bc1d335907ea11b754749b6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:720a3a6e65dc5c1835b4a4d43eb9f2ba196344bd149df34c824a5e35bd8171fc","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-08T23:09:02.793774Z","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:3b2380c1adc86ad62c4bef3bc7e51af671a854153b2df627ae0e0e04cb319cc1","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-08T23:09:02.793774Z","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:86d1db05922ebcb19673f53dd50af569b47d737aff4e5a3adcff61e6a99f5c7d","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-08T23:09:02.793774Z","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:c6453298312a19873ba5e3d7b9bf3b250f5459e279f6c118222b24863911346a","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-08T23:09:02.793774Z","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:49cce6847a5c6f3017e35e01eacd2819e14dc5ddf464bf29687ebb98a04a04bc","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-08T23:09:02.793774Z","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:65fa5d80ccca795b61eadd30cf48066e8daff57c90d48e2b20b6488dcdc00987","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-08T23:09:02.793774Z","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:12f0896d3861a04b9d5e935fed6ad7ecdda829a5b7dddba09ea6b850a85be2b6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T10:45:35.740727Z","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-08T23:09:02.793774Z","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:716b5b2dc03c3bdbc15ca7117b499fe581f1810278da244522baeda355d1b8dc","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-08T23:09:02.793774Z","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:d777402242096e48a39f8f1c462ae75b51960f3057dd93bd2077bb53fc16fbfc","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-08T23:09:02.793774Z","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:42b295a031b6b534b547ba85601bedd148e99378dd9d46cfd2154aac8bdf0648","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-08T23:09:02.793774Z","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:cf47ae44146a0ddb418be674e08c276cfca575259db8f56595e687bbf4d8e8b3","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-08T23:09:02.793774Z","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:75894fe7be409018448b2dc763fd0c916b86dce68914634eb87e7cf4ee6afa15","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-08T16:22:04.644119Z","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-08T23:09:02.793774Z","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:9244916d0918ba6c67662494d8a0a3886f8d95820f0688aa0cf51f42022ed57f","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-08T23:09:02.793774Z","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:4f27c200ae2f1cba1d47b64eadebb8d74ef78b3ef02abb3bd095423f6f5ecc88","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:2c151a21988e47e03252f36c0177da5bd4fed06b1d168639359bc08f415da13c","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-08T23:09:02.793774Z","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:2e16fffe64ea9ab9bcdb4a55828ead15b3ab69ce29aa4a1e963e6ed1d5f1e37f","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-08T23:09:02.793774Z","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:57f946ac5210b6327e1d5fe6d2aa4307f09db9a67e6d789c1ef1b4678c06de6c","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-08T23:09:02.793774Z","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:b609d68c0d67934b4519ac0890c8376cddca7e78a971a6ae0cf65257b4b4f970","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-08T23:09:02.793774Z","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:9e544ef082f7cf9c93601636105187d0bd1e89b7490a84997ba3ef8306fa30e5","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-08T23:09:02.793774Z","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:b90a74c112867760e9464d0d1a0bdc9e9c06bf8eb71d81ba94561a1492efbd99","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:3eee8cf7b3a65c19b32914a4dc27516218156eaaa56e9ab4d815e7c4af2a0258","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:396079f326b304ecf810f323aea3dafd9d6071a3723999db3a8ee43ce404269b","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-08T23:09:02.793774Z","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:db8c0c13cd8051d359c34528e339df656559009705a082b715b81a9ced7bb78a","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-08T23:09:02.793774Z","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:bde5e11ddd0f75d6bed067b086d8914304e4127d329ea0db23ce3585c88820cf","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-08T23:09:02.793774Z","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:54719444496536e6e2a31fa72b31263dda2be2d1fbd2791a3e1a11d3f3c56b9d","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-02T17:01:47.127199Z","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-08T23:09:02.793774Z","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:4bad24865ef02956ae007218d45d205d476e1f3debb08ae902241a98c7db8559","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-08T23:09:02.793774Z","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:fe87f4ac97c4a461ae1125952a2513fde8ed8a3e38e311c470ca28f4fff54bd8","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-08T23:09:02.793774Z","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:9824d2a3e84ff9a5ef9f14f9ee913370a22467401e03794d01f4467033c337b1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T23:09:02.793774Z","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:421df5d1fe8352fb4c7d89b0aae2984a89b07be6d48c63c50b0d7ba04194cb6e","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-08T23:09:02.793774Z","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:0e6eba7daefc943397a938dbc417f7c29a2dd77c8f563a3c7fae6c8d2588628e","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-08T23:09:02.793774Z","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:f922fe6e871ca016c7eba52c21cac21a3eda821426775cfbe735492ef828f818","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-08T23:09:02.793774Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2509.22879."}