{"as_of":"2026-08-13T06:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e64e12e463a4be58da720bf47657f5e245a1389c81d603051f50aaec04765c6a","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:28:04.228320Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:34:21.141655Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T11:29:39.850153Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15479","snapshot_observed_at":"2026-08-09T15:34:21.141655Z","title":"Miller, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01410","last_updated":"2026-07-06T11:42:10Z","snapshot_observed_at":"2026-08-09T15:23:00.383354Z","submitted_at":"2025-02-03T14:42:16Z","title":"Finite convergence and minimizer extraction in moment relaxations with correlative sparsity","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T15:34:21.141655Z"},"links":{"cited_paper":"/paper/2411.15479","citing_paper":"/paper/2502.01410"},"observation_digest":"sha256:ab4c869847be7b9a32015883c523975a3871f56d3817589fc7d50ad8fc8d0601","observation_id":"e3acf1b3-6652-4166-9fa1-7633f4c5fafc","resolution":{"observed_at":"2026-08-09T15:34:21.141655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"cited_work":{"arxiv_id":"2411.15479","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.15479","snapshot_observed_at":"2026-08-05T11:29:39.850153Z","title":"Sparse Polynomial Matrix Optimization","venue":"math.OC","work_id":"4e3fc461-af40-4a05-8851-5755f29dd7c3","year":2024},"citing_paper":{"arxiv_id":"2509.02849","last_updated":"2025-09-02T21:32:40Z","snapshot_observed_at":"2026-08-11T01:19:52.294436Z","submitted_at":"2025-09-02T21:32:40Z","title":"Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:29:35.289594Z"},"links":{"cited_paper":"/paper/2411.15479","citing_paper":"/paper/2509.02849"},"observation_digest":"sha256:774defa2bbf5a490acfcaf97f7173e5c7fcdf651a7ce664518ea320efac542f8","observation_id":"a338a1d5-daf1-428a-9198-5a3fe2964b89","resolution":{"observed_at":"2026-08-05T11:29:39.964983Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.15479/citation-record","integrity":"/paper/2411.15479/integrity","json":"/paper/2411.15479/citation-record.json","paper":"/paper/2411.15479"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.102232Z","title":"AboutSections Polynomial Matrix Inequality and Semidefinite Representation,","venue":null,"work_id":"8ce8b436-d0fe-45e5-8e50-64070cc63ae1","year":2011},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:03.984793Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:7cb89cef4ac7b20550b70be523c3053baefbecee6c5fa7970cfdb6709e62f13a","observation_id":"871c98d9-d996-42b0-bb72-0c9d59cc1a3a","resolution":{"observed_at":"2026-08-12T14:28:05.106126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.090859Z","title":"Linear matrix inequality representation of sets,","venue":null,"work_id":"f3fb9817-4181-4c7e-9773-c934469b5220","year":2007},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:03.990424Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:207598170e390850dd2bddbfafd7da90f956b6d83e40509c3a629af3fb6ab65e","observation_id":"9d2a1f9c-eb13-4341-a4a3-1f2da0e57b8b","resolution":{"observed_at":"2026-08-12T14:28:05.094787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.079410Z","title":"Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions,","venue":null,"work_id":"d2013793-e392-401b-85db-1a7fe5b0d333","year":2011},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:03.994527Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:6dc1f3fddf74761516cfa2a1749a8d6cc722f8e9c368198b502c0b6b331c4f59","observation_id":"7bcd34dc-c43a-447f-b8ad-cb0269b6e9ab","resolution":{"observed_at":"2026-08-12T14:28:05.083398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.067882Z","title":"Global optimality in minimum compliance topology optimization of frames and shells by moment-sum-of-squares hierarchy,","venue":null,"work_id":"7f884f1a-6bb3-4660-914c-6baec167058e","year":1963},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:03.998357Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:7c280d5c2530f8ad288ac830d4189f4a60bb66b6344c34c440cae1d679b20cc0","observation_id":"59c271f9-728b-4b8a-8f88-ee46441a7475","resolution":{"observed_at":"2026-08-12T14:28:05.072180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.051606Z","title":"Frequency-domain identification of discrete-time systems using sum-of-rational optimization,","venue":null,"work_id":"8f5ed986-f108-4f83-bfb5-e8fb8e4c21b8","year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.002661Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:68b353fc757861371e3380d189619a618750abfe2840aa89de759e26268a2162","observation_id":"5e3c81f7-12c8-4435-a417-92edf464f163","resolution":{"observed_at":"2026-08-12T14:28:05.060302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.040186Z","title":"Analysis of input-affine dynamical systems using parameterized robust coun- terparts,","venue":null,"work_id":"b7456b20-ea5c-4051-8ac4-0a4698760423","year":2025},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.006813Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:d500b1bfbff3f7118c80d59586e9658b3ee7e9eb024ffc8662ef1b2926026164","observation_id":"3c1698ae-c3ca-45e8-8439-ccfd6ad5cc4d","resolution":{"observed_at":"2026-08-12T14:28:05.044198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.028798Z","title":"LMI techniques for optimization over polynomials in control: a survey,","venue":null,"work_id":"260ed38d-1b16-4082-90fb-22a600ae199d","year":2010},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.011205Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:e68527ef3afb08ef41e70cbcf1bbe32bedbb36c0a09a790fa3011d4baa0b8e2e","observation_id":"2cd443cb-69ab-4d76-a7db-3ae6eb354aaf","resolution":{"observed_at":"2026-08-12T14:28:05.032621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.016842Z","title":"Some NP-complete problems in quadratic and nonlinear programming,","venue":null,"work_id":"1a6a97df-6666-4138-bb87-756195684265","year":1985},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.014767Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:f72503590ab1e2ee9f373f06a34151843ca81d17ab54097f1e1864e79fa8482e","observation_id":"dbc46ba5-394e-44ee-9e11-5802141be77a","resolution":{"observed_at":"2026-08-12T14:28:05.020674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:05.005643Z","title":"dReal: An SMT solver for nonlinear theories over the reals,","venue":null,"work_id":"079e78fe-dd4d-4420-95b4-c659bc414790","year":2013},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.018426Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:b76e7d4307cd4b70c9bb061eef99a41d4468e8d8da8f0c3c2cfd01ae40b9e33e","observation_id":"04c5a80b-0979-45f5-8c6b-a928213463df","resolution":{"observed_at":"2026-08-12T14:28:05.009624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.993841Z","title":"Blekherman, P","venue":null,"work_id":"8de6c01e-e4db-4e4d-baea-a9a95061c6cc","year":2012},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.022255Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:df5b691ab150deecd76065f33aa506f268ee61e77bd1990538df5ebe224ec176","observation_id":"b85e0074-17f6-4d65-8c98-e9f81176f9b3","resolution":{"observed_at":"2026-08-12T14:28:04.998024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.982731Z","title":"There are Significantly More Nonnegative Polynomials than Sums of Squares,","venue":null,"work_id":"7eb0d082-20e5-45ac-90b3-36d2d42929b0","year":2006},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.025598Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:e2441299f463ebba86dbf6a03d9b3b2b7c6f9cd22f2fa64728718058ecfc1571","observation_id":"66133412-3ee4-45e0-81af-6cf0e8db3abc","resolution":{"observed_at":"2026-08-12T14:28:04.986582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.971266Z","title":"Positive Polynomials on Compact Semi-algebraic Sets,","venue":null,"work_id":"ce0153c2-08b3-4b2a-83d2-0762df5e7d0c","year":1993},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.029792Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:c86ba52101ba62c0766b8b50492aa01bd3a935f9705c103da726363c9df23735","observation_id":"14ee9632-9926-4c17-ba4c-ee89eeaad0dc","resolution":{"observed_at":"2026-08-12T14:28:04.975487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.960429Z","title":"On the Effective Putinar’s Positivstellensatz and Moment Approximation,","venue":null,"work_id":"d768a69f-51f6-4768-bc88-85b7e17ed884","year":2023},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.033723Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:3c3a23b182568340e7841ee0890bfdba527bb1a5e81ef6c53dac0e788e1ddddc","observation_id":"5e295d19-52b9-4cea-9155-95991113819c","resolution":{"observed_at":"2026-08-12T14:28:04.964292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.949416Z","title":"Sum of squares relaxations for robust polynomial semi-definite programs,","venue":null,"work_id":"0c7dde81-5f84-4eda-bcf7-6be7eecb547b","year":2005},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.037827Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:2c875c29444a4b435bcbf5eb5cbaeecb3ef7dc115157320bbab70ef1c138bfb2","observation_id":"4ec098f4-c89b-486f-ace4-e85f5ab38c5d","resolution":{"observed_at":"2026-08-12T14:28:04.953201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.937589Z","title":"Exploiting Sparsity in Complex Polynomial Optimization,","venue":null,"work_id":"1cb5f89b-4c78-4c18-bd1c-38f682cb569f","year":2022},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.041985Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:541992f2adcfd5a9fe41a4b81c6e9d33abd16226786c86c035c79e7bbe937307","observation_id":"adc80600-f5fc-4b71-b79f-bd5ea099d895","resolution":{"observed_at":"2026-08-12T14:28:04.941228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.927356Z","title":"“Positive","venue":null,"work_id":"765a3b77-88bb-40a4-8847-1e93d3df74f6","year":2002},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.046239Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:d7d16e70e5b9b0f756fb1566dd4a0b6c4cc6d519b45f8a76590aaf35f351a49f","observation_id":"acc8cbf0-dd89-4bb3-b764-5894e6deb873","resolution":{"observed_at":"2026-08-12T14:28:04.930885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.916979Z","title":"Constrained Polynomial Optimization Problems with Noncommuting Variables,","venue":null,"work_id":"3f3c5f11-e2e7-4e98-9a47-dce02d151b1b","year":2012},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.050259Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:99c4fbb26b03d155e589477cdb8b84ea9fa755c19e6e3f0efb6802299d2f3df9","observation_id":"a3bdc7a4-6af3-4fb4-b63c-d8a04199e1db","resolution":{"observed_at":"2026-08-12T14:28:04.920598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.906689Z","title":"Symmetry in Tur´ an sums of squares polynomials from flag algebras,","venue":null,"work_id":"93786d6a-be01-4ec3-946d-df03b4c57f09","year":2018},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.054389Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:5c20afe6d7831fd1eaf6679ec254e961301cb521e9b702863e709d301c838a67","observation_id":"ad0e0cd6-fc30-4b24-9748-310e1acb1dea","resolution":{"observed_at":"2026-08-12T14:28:04.910133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.896831Z","title":null,"venue":null,"work_id":"916cba52-7d62-40f0-a6b6-4e0e8b719586","year":2009},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.058645Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:a893a760306344076c7090a7732022cf7693c163aa2162af08070cfddcb63ad3","observation_id":"c22f58a9-1107-4ba1-9a3f-a8f3df885ded","resolution":{"observed_at":"2026-08-12T14:28:04.900215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.885731Z","title":"Harmonic hierarchies for polynomial optimization,","venue":null,"work_id":"d29352e5-44c6-47fc-b8f7-92dba63c9db1","year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.062486Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:0d2a980f70aade9234875a1327ca89b5dc109e27626d7759f4df1137c69fe6d4","observation_id":"e692a4fe-a380-4a3e-b6b8-3a70e2aa0fa9","resolution":{"observed_at":"2026-08-12T14:28:04.889794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.873801Z","title":"Magron and J","venue":null,"work_id":"28801739-f65e-4e31-bbd5-fa367ee8dcc9","year":2023},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.066537Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:3576a0fc604dfa0cd21bd661ff6dbeb1cbb0ef8c74029ec833c5ec3c559a5d71","observation_id":"195f0861-2614-4224-882c-ebed78ee4178","resolution":{"observed_at":"2026-08-12T14:28:04.877414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.862519Z","title":"Chordal and factor-width decompositions for scal- able semidefinite and polynomial optimization,","venue":null,"work_id":"92874310-8fd8-4d35-8a44-83ca6e67d7fd","year":2021},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.070399Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:958f474e405bdd39a8b1a84a8635a724dd5934d28c0db274134a9e0a2f22b5df","observation_id":"f3da2b5e-8caf-4c78-aa33-428c407c5aae","resolution":{"observed_at":"2026-08-12T14:28:04.866394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.851457Z","title":"Sums of Squares and Semidefinite Program Re- laxations for Polynomial Optimization Problems with Structured Sparsity,","venue":null,"work_id":"09854a10-82cc-40d1-85be-ba0aa360601c","year":2006},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.074968Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:50b5b071a0d54872cfafa85cf91c255c9f5f109128aeb6aeaa4b463a53b43e64","observation_id":"4cb52c80-248f-4daa-8b68-d60b4ed8358d","resolution":{"observed_at":"2026-08-12T14:28:04.855331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.840835Z","title":"TSSOS: A moment-SOS hierarchy that exploits term sparsity,","venue":null,"work_id":"801f1f26-b78f-41f8-9006-5df949bc78d5","year":2021},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.079089Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:d24f461a9e96efb669b5ad192933a41597292baeebf23794416e00fa124f3106","observation_id":"eaf6cdfa-3c0e-45ec-9426-17a6cdab0044","resolution":{"observed_at":"2026-08-12T14:28:04.844641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.830306Z","title":"Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension,","venue":null,"work_id":"d69c5742-fb56-4590-a7f0-99a43ccd79f0","year":2021},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.082543Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:c49e20c56837faf3f6eb2fa411b3ddd8b68565545dd31325557dd677cf49d2e7","observation_id":"331a765e-8d3d-4d85-a601-dfee045f2bcd","resolution":{"observed_at":"2026-08-12T14:28:04.833969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.819715Z","title":"Exploiting term sparsity in noncommutative polynomial optimization,","venue":null,"work_id":"f47f4bd7-b9ad-4513-9dea-af30bc224df4","year":2021},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.085818Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:ec7397d5440fcd981d15eaf9a69e0241c77420fb447f591404cc4050740aaf5d","observation_id":"46942a52-c115-48c1-a3a1-91801d621abe","resolution":{"observed_at":"2026-08-12T14:28:04.823407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.809059Z","title":"Extremal PSD forms with few terms,","venue":null,"work_id":"42bf2808-2289-4f44-b123-f7af415254c3","year":1978},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.089151Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:11371c687f9339ebf9b67f245f63da64b1d10a0c6a174f1b80f2a595bbf25f9f","observation_id":"eebd0d92-e215-443d-a47c-11680a211619","resolution":{"observed_at":"2026-08-12T14:28:04.812755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.797812Z","title":"Symmetry groups, semidefinite programs, and sums of squares,","venue":null,"work_id":"4fc92da7-aa70-452b-8531-1280615db1c0","year":2004},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.092925Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:df07a1d6611baaeb1a6aaf6da0cbafe471a383dbb3d4cc36eedde62b09d4844b","observation_id":"07638557-e36b-435e-a545-6422af05a357","resolution":{"observed_at":"2026-08-12T14:28:04.802074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.786451Z","title":"Pre-and post-processing sum-of-squares programs in practice,","venue":null,"work_id":"ed92bca2-6a00-4332-880a-608a8bb448f5","year":2009},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.096575Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:0f88832d67091a325c1ba498b9a71c26df5cd187ba87ed68792c2cb6681bda2b","observation_id":"e4ce363b-9b82-44c9-aa87-dfa86c735e65","resolution":{"observed_at":"2026-08-12T14:28:04.790527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.775780Z","title":"Exploiting algebraic structure in sum of squares programs,","venue":null,"work_id":"73cfddc8-753b-425d-b4e9-ff68bfe77063","year":2005},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.100841Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:86f377930656efaeaff74e0f23d3fa15add2af8ca6df3b0610459c4c388ffa4d","observation_id":"ed3f8723-da72-471a-8268-d259ad775bbd","resolution":{"observed_at":"2026-08-12T14:28:04.779657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.764392Z","title":"CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization,","venue":null,"work_id":"a8ce9b8f-d3a6-488a-9ae5-369e741dd42f","year":2022},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.105012Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:2da168824d97b49054babe2091b830d793c427d100ec209f4fa706a85d57d03d","observation_id":"f7522583-cba0-4f8b-b33d-75e90e332c59","resolution":{"observed_at":"2026-08-12T14:28:04.768305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.09419","last_updated":"2024-05-15T15:15:01Z","snapshot_observed_at":"2026-08-13T00:07:07.562484Z","submitted_at":"2024-05-15T15:15:01Z","title":"Exploiting Sign Symmetries in Minimizing Sums of Rational Functions","version":1},"cited_work":{"arxiv_id":"2405.09419","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.09419","snapshot_observed_at":"2026-08-12T14:28:04.461165Z","title":"Exploiting Sign Symmetries in Minimizing Sums of Rational Functions","venue":"math.OC","work_id":"4cee59aa-83f9-44e7-aff1-a5a42a703013","year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.109342Z"},"links":{"cited_paper":"/paper/2405.09419","citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:2974c3abbf49e194b67b37fff20f2897e3014dd9ba13d44ea7809395da531283","observation_id":"467efbb4-2e26-4f1f-bb02-d451a30edb27","resolution":{"observed_at":"2026-08-12T14:28:04.467807Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.752941Z","title":"Amoebas, nonnegative polynomials and sums of squares supported on circuits,","venue":null,"work_id":"c279da2a-4380-4811-a418-8cb9e56e25c8","year":2016},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.114039Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:6ddf5d374a54ac9e954e076c82728a36f4e2ed82f1603aade47515aacf4307d2","observation_id":"ad31d444-8489-47b2-9342-f3b930ac6722","resolution":{"observed_at":"2026-08-12T14:28:04.756960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.741651Z","title":"Relative entropy relaxations for signomial optimization,","venue":null,"work_id":"696ab60e-7669-4c8d-866e-107e771b40b8","year":2016},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.117935Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:93c8e874d9f8793ecdf44681669ac88623d5bd4a316f4e3be397d5cc6805819e","observation_id":"cc2661a9-b0ff-4c7e-8a00-c112cf317395","resolution":{"observed_at":"2026-08-12T14:28:04.745578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.729875Z","title":"A second order cone characterization for sums of nonnegative circuits,","venue":null,"work_id":"93d10cf7-07eb-45d4-a5d5-216a9cb8d9d4","year":2020},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.122079Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:37c4769685c19ec2e19d22f1cd5548ab84d8fdc4fec845f0e1917b485c44f28b","observation_id":"5eb0e78f-fcb5-4886-b319-5a179ada9de4","resolution":{"observed_at":"2026-08-12T14:28:04.733932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.718744Z","title":"Sonc optimization and exact nonnegativity certificates via second-order cone programming,","venue":null,"work_id":"ca9407a7-e865-4094-bf31-b6e0993ef26a","year":2023},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.126278Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:4141579df81ddd09806a96687120c40580928d02004b1369a414fec6ff795d0a","observation_id":"2f717ecc-6016-459a-ab85-6613fe12362a","resolution":{"observed_at":"2026-08-12T14:28:04.722800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.707363Z","title":"Kojima,Sums of squares relaxations of polynomial semidefinite programs","venue":null,"work_id":"e8ea688b-146e-4ec3-a530-44539a82baca","year":2003},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.130368Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:11c1117b7231c7ccb6fd87c4cbc1d109d02bb6ba8df75a7c7f6ae9413c0fdbe1","observation_id":"7bd03e60-ce43-42ea-a72c-0090e0bd8c48","resolution":{"observed_at":"2026-08-12T14:28:04.711688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.697026Z","title":"Convergent relaxations of polynomial matrix inequalities and static output feedback,","venue":null,"work_id":"93b6f39c-a125-45b6-aad6-8f2eea267d00","year":2006},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.134551Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:449caca4ab5a49d79c0106a092965b8f108494ab2cfa140da33c078268d02e83","observation_id":"f40e4ade-17b3-4840-a7e1-b0a341516980","resolution":{"observed_at":"2026-08-12T14:28:04.700639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.138674Z","title":"Convergence rates of S.O.S. hierarchies for polynomial semidefinite pro- grams,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.138674Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:58d0825648bbac4376252875a08fd85a8d1abee449c5dfa1cec2ad1f53573024","observation_id":"e3a70f93-1e1b-4ed6-aeef-a5d3a65411bf","resolution":{"observed_at":"2026-08-12T14:28:04.138674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.17241","last_updated":"2025-01-20T05:45:54Z","snapshot_observed_at":"2026-08-08T06:43:33.748842Z","submitted_at":"2024-03-25T22:42:26Z","title":"Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization","version":2},"cited_work":{"arxiv_id":"2403.17241","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.17241","snapshot_observed_at":"2026-08-12T14:28:04.374891Z","title":"Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization","venue":"math.OC","work_id":"44dc613c-2dbf-4886-b665-a682715120d8","year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.143097Z"},"links":{"cited_paper":"/paper/2403.17241","citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:8754cb6cc0a9a89e815c21a18584f2bb5a533d33132f7cd52915dda1a817132f","observation_id":"6b3d9e47-5d15-47d6-87f1-c2a02f2ef946","resolution":{"observed_at":"2026-08-12T14:28:04.380846Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.686913Z","title":"A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity,","venue":null,"work_id":"8aadfd24-ebe6-434d-b4c1-475bef96042e","year":2024},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.147381Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:038e2fa51468addc6c0d5cfe7d1179c4999d5a70ed9042b02e0f4d791cc15e3a","observation_id":"88d1cb1e-428d-4db5-876c-cfa8c825b082","resolution":{"observed_at":"2026-08-12T14:28:04.690493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.676213Z","title":"Sum-of-squares chordal decomposition of polynomial matrix inequalities,","venue":null,"work_id":"2e76ca23-ec49-4952-acba-5d6b9b3c3323","year":2023},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.152025Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:eb46d93aea0fe56eb96a4514326b702c3e722484f521961932b4c10faebb3c24","observation_id":"cbe64d42-a88a-4bd1-9db4-6ced5c527896","resolution":{"observed_at":"2026-08-12T14:28:04.680089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.664058Z","title":"A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones,","venue":null,"work_id":"793837ad-c8c6-4a34-8922-b3ee038af77d","year":2009},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.155879Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:06e1709cfba2e104b9845aea91e2058e8bee1511aa01fd9258ff5d3a93f275d6","observation_id":"2b9f4b6a-7ede-4022-9c07-103c6d15672c","resolution":{"observed_at":"2026-08-12T14:28:04.668462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.652444Z","title":"Sparse polynomial optimization with matrix constraints,","venue":null,"work_id":"31f9ca8d-228d-43c9-aeaa-386c7eb80a25","year":null},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.159718Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:30c3ede88fe7ee67795c2bfef569ec502588b643df13b6a1aefa22764b1b90f8","observation_id":"d1069753-996f-4fd0-84d0-4a9e598f712d","resolution":{"observed_at":"2026-08-12T14:28:04.656287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.640111Z","title":"Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion,","venue":null,"work_id":"edd8aaac-182f-4977-b01c-d9cc5bdcf222","year":2011},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.167320Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:1eee1321ce64d4734db35b4286d75381382b6348023d24ebafca16466f67030c","observation_id":"aec29841-eae7-45ed-b83f-8431d5f8352e","resolution":{"observed_at":"2026-08-12T14:28:04.644190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20915","last_updated":"2025-03-26T18:43:38Z","snapshot_observed_at":"2026-08-12T17:58:04.565216Z","submitted_at":"2025-03-26T18:43:38Z","title":"Term-sparse polynomial optimization for the design of frame structures","version":1},"cited_work":{"arxiv_id":"2503.20915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.20915","snapshot_observed_at":"2026-08-12T14:28:04.260486Z","title":"Term-sparse polynomial optimization for the design of frame structures","venue":"math.OC","work_id":"6506ee3f-b059-498a-abd7-1d0094ec5a56","year":2025},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.170991Z"},"links":{"cited_paper":"/paper/2503.20915","citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:5972e6ded1c04d626dde10dec5b66b8d744efb61b438e54e30030ff77cb0035e","observation_id":"f8320398-a256-432e-84ed-f5df12b2447d","resolution":{"observed_at":"2026-08-12T14:28:04.266616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.629148Z","title":"Matrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs,","venue":null,"work_id":"6441fbcf-cf3f-41a9-acd6-916553bd94f1","year":2006},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.174777Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:8c5a00882b2caacdd88364e2397e68006e14c6d616f70fbd8c5a3c99cb3569d9","observation_id":"760e8a6a-1c5a-4dcf-8ee9-5cdd66243031","resolution":{"observed_at":"2026-08-12T14:28:04.633136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.618662Z","title":"Closures of Quadratic Modules,","venue":null,"work_id":"661c6f56-cf8e-479d-a95a-688e260581d0","year":2011},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.179069Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:91780dfbf29e1ba6537efcaf0127a26180ef311db06e6f518db86642bdacef21","observation_id":"cb69fcc2-68c1-4c19-a8f6-d18513734d30","resolution":{"observed_at":"2026-08-12T14:28:04.622409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.606900Z","title":"On the complexity of Putinar’s Positivstellensatz,","venue":null,"work_id":"dd5d8ec9-ca13-4fed-98bc-1f5b4ba2ffa9","year":2007},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.183444Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:c1936b4b16cb1275b263fc7b79d95f2f564eead378ccab1cc7a6a361fd1b72dc","observation_id":"61783a0e-aead-446a-9320-a2000106d1f4","resolution":{"observed_at":"2026-08-12T14:28:04.611186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.596359Z","title":"Minimum-weight triangulation is NP-hard,","venue":null,"work_id":"1795c408-9810-4663-b265-52fbae08d909","year":2008},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.187311Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:47f2a6606ac3835edd7971171ca5c40df83a6846bed7dfd4e161a156463c68b6","observation_id":"ff935272-2df8-459d-ab8f-4b5b0a75b498","resolution":{"observed_at":"2026-08-12T14:28:04.600138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.585121Z","title":"Treewidth computations I. upper bounds,","venue":null,"work_id":"0bd67dc9-eac8-4b87-b0f8-e55298270c33","year":2010},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.191725Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:cb0b87c9ca6d5b7e78332b18611fa1703e0fdb4462b26ab8dd2f99016679244d","observation_id":"60b6b5ba-c775-4297-b666-9dd66ea85645","resolution":{"observed_at":"2026-08-12T14:28:04.588858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.572957Z","title":"Positive semidefinite matrices with a given sparsity pattern,","venue":null,"work_id":"d993c3c3-7b4b-4a53-b11e-46f3b1724f73","year":1988},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.195366Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:105d704f9fe4d29a017019a66aea7cc96afe94adf5840c2894c07f5f28133c6d","observation_id":"e8dce250-1724-4d0e-9a8c-9b2c3d04e32a","resolution":{"observed_at":"2026-08-12T14:28:04.577473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.560942Z","title":"Positive definite completions of partial hermitian matrices,","venue":null,"work_id":"5a28442e-b88f-4621-bc94-3e1a0d7135db","year":1984},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.199438Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:6a4265781838d4713868b9624c8219ef50d21f1a5aa3348164db9a3b9f11a809","observation_id":"038410cc-0785-4762-835c-1ed1491a1508","resolution":{"observed_at":"2026-08-12T14:28:04.565325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.548026Z","title":"L¨ ofberg,Block diagonalization of matrix-valued sum-of-squares programs","venue":null,"work_id":"1b84f23f-ce64-4d70-8901-9cfd23280bc9","year":2008},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.204100Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:9738740257bcc7b49a202efb4434d4c0847cc79035dbc722c76001ba757b1b12","observation_id":"148fb17c-69e8-4382-af7e-05a90cb26476","resolution":{"observed_at":"2026-08-12T14:28:04.552398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.536640Z","title":"On matrix-valued monge–kantorovich optimal mass transport,","venue":null,"work_id":"f12d78e3-58f3-4e2b-8b1d-a866f561e3b3","year":2014},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.208148Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:9afaedaecc1c371186ccd633f17fec6e4b2d532fdda1b591f771ed608832f603","observation_id":"4f40f948-5e43-48c4-bd47-8acdd74213c5","resolution":{"observed_at":"2026-08-12T14:28:04.540556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.524066Z","title":"Convergent SDP-relaxations in polynomial optimization with sparsity,","venue":null,"work_id":"65012b45-e3ef-44c1-962e-10ee072721de","year":2006},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.212167Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:2f21e052d6cde5bc7a9e69e256216d01b6c2dac63f1d21b090a950da70839c36","observation_id":"03ce3767-84ad-4d1d-995d-f2729e9a9078","resolution":{"observed_at":"2026-08-12T14:28:04.528810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.512103Z","title":"A note on the representation of positive polynomials with structured sparsity,","venue":null,"work_id":"99116e23-19a7-4e08-88f8-9742964e9f4b","year":2007},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.216195Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:673e5d8d515e2cd70a0636b3f6277c864ffaf9cedcdb618276fc2cd46f07ae90","observation_id":"f2ad6ac1-afd7-4041-9161-ab26b8b9c37b","resolution":{"observed_at":"2026-08-12T14:28:04.516189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.500646Z","title":"TSSOS: a Julia library to exploit sparsity for large-scale polynomial opti- mization,","venue":null,"work_id":"ced41ac1-9693-4176-a88a-a6cc9b59324a","year":2021},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.220156Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:832673c601b3e7d4ba9b4adcbb225b8e18ee5b9ee2579fb5eef535a5f4b7f837","observation_id":"44f70b3c-4da9-4dfd-8e6f-023c9de0321d","resolution":{"observed_at":"2026-08-12T14:28:04.504580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.487981Z","title":"The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm,","venue":null,"work_id":"04e12bc0-7e56-4dcc-bb0e-194b2e4b5811","year":2000},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.224525Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:01209fd8c7066e4310cac0dec8f12cf1a50bc27441b482714bbfe633aec321d5","observation_id":"370a7f9c-430c-4453-89df-fb757c2e0946","resolution":{"observed_at":"2026-08-12T14:28:04.492088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.476513Z","title":"Chordal sparsity in control and optimization of large-scale systems,","venue":null,"work_id":"7749d2b0-2f8a-4952-9741-9c3202c1f26d","year":2019},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.228320Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:1a81d3bd5f84e3f404fa8bf043d503244557572b2fe52373fcaa26a3d58e8a1d","observation_id":"30d9f4aa-a6eb-4b04-bc03-6f65518a6ebe","resolution":{"observed_at":"2026-08-12T14:28:04.480640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2411.18820","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:04.358388Z","title":"Available: https://arxiv.org/abs/2411.18820","venue":null,"work_id":"25635fb1-630b-4de2-a7c9-ce415e7161e4","year":null},"citing_paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:04.163485Z"},"links":{"citing_paper":"/paper/2411.15479"},"observation_digest":"sha256:15023fa3a7bbd4fc578e854df2562e087697e230abd4f1b71be860a791c0ba5a","observation_id":"8d83d38c-5173-4382-9fa7-95f035cdf1fc","resolution":{"observed_at":"2026-08-12T14:28:04.363953Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15479","last_updated":"2025-06-05T15:14:37Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T14:12:53.141742Z","submitted_at":"2024-11-23T07:23:17Z","title":"Sparse Polynomial Matrix Optimization"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":55},"total_outbound_references":61},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 2 inbound Pith citation observations for arXiv:2411.15479."}