{"as_of":"2026-08-19T14:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:751f1b2eb2ff67922ade71cc5356b5c4a3ba4a7968219be365aacaecce9e7820","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-19T06:32:44.657259+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-16T20:51:15.664361Z","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-17T17:56:23.936921Z","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:c2b45d452b6884ea79ae78151d59e037aad2e1f8b82ac2151a3dfd549a9ae7e4","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-16T20:51:15.664361Z","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-16T20:52:34.080294Z","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:38650eabafde5f0bbec0d005963fdb5680967b85b177c1afae36d8fe86dd8cda","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:3d895d6a89b3c0402dd944fc52fa0dde868ff4f202e114cd62ab8a2a5dadbd51","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:85aa0196ec6777a03c43de62f60d9381bbaf16a924bb713d67c4a996c4599131","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:97cfd1f06825fa1fd33e712edd1d90d3f5eaeab47de83ec62e0a0f167e4e99b0","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:6b6953768fa8e6d6e242a585758abdb9a7ad7f5c8af773412a069449fb14abdd","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:3deaa1c30268036db7534cab691757b426cd542eb2d63a1f73383e17536823b4","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:9493c134222f911037f18cc4cbd9b5c489266af25ae065e241eeed96c4d2d158","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:4d9022cb7c13aa28115597a714f856b14ab3eb7435ada903b5bc2be086d8b628","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:4e12f62c1fc48197aed199a61718b66682676f46c32f94d4b60711727ca8ccab","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:8b393c78162fe3362f9f6909c41cd11a541c6e7f012459faf2a116fc646b33c5","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:76a6567d4b900367e6efb9ee47419c5249036ae8194bcc897692c66a076a04a8","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:a388333534c4229e47d0d278c9f83b1383cb7c5303928d4cffad4818b6e092ec","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:e00f6eab76af957ee6628ac3bc7def9735901470dbbe56407a74b27fa494a43d","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:b2416533099516cf1a03d228e6ad72b4ebde1a7c1babe213f974960290deb907","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:32056d9f7f418a03f78365e0d0ba51802ee477a0fb25227a64f0a6361df1f891","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:1545907a47d241339b385316885fbee4dc1b55152002ace68257d3f88b888ebb","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:1e3627d23537dc1f6becd0fa929ab7032667a9a2135c1f83809227989b2b0c46","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:c72254b750422167f6ef5f5d2f54f2b4d94d79a43f15765751e2d54c6641fdc6","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:8acab2e81ed55e65e89013a804af87fedbc79000348b02e60294b742a4295b9d","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:8353a5329994151f3daab2d57d9dafbabae4f78d049aa9a5dfbaf9a10075d672","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:c986a00213b1a251230f6128c76c72a8f240f50e0e35764f6f67bbf00443d33b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:8312ca1c7b8eb15d63d33c176327f536ebb2750218fa8a6ef19af6ef2eebb241","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:f3147bfacc22321372c103ec90b0372d5cc309abc66c16c6eef12c7aa046a9cf","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:0f47ed92fd97c3dc18d4972aa86cfe8a9b7fc2df4fb75c0866cdbffec7804381","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:b79d9355876292ae5249f6691a4d9b7f0828b0bd82bc4978ce4a0c221bde0788","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:6c5dc1fecbdb52caa0fab88d5b2cf7dcd733b977eb591948cbf97e09ccda3dbd","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:d9e2a02c3122554065e40d8b64cda6d350c88cc82798f306a6dbf26fb02ea61d","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:fa9725592704bb6ce1d442bfee6e0a839803426aab26370de51dbc1b13a5159f","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:74f934fdfb627111d253c60c96333dc58c50a40fea6e7b5ec384678d8790433f","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:c6f1b8018ea587b70cdfebc59b27dbe62de65e1b147c2fa99175762507029565","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:4a604e11cd1641130359380a129abfcc7a8b96bfbe20c7288185625526679cfc","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:9089c5af5ff19527353ecc3af8d16b12b15bc01628f755bc8a5d0dfa077dd3d4","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T13:52:26.750831Z","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-16T20:51:15.664361Z","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:c735d810a6cab7a5b8da953da0d43f64eabef19a9dd1f316d3aeca1b3f18b3c0","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:ad3998fe17e443e0787861b73b5dd9ed38de08781aafaba5655e0ea5d52cd871","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:c34058acc821952f156b5d6e3ebd6c2c7890d16f9b5665ec7ef3b1b78ef0a452","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:0c808501b19d32e3388be55c4be2ef2470e317ce2b7acbcfa94ec0062e68e1dc","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:49c4f0b3a2857a81ee8921828edbbdf8e61b4a176f6b484ddc0b94e0152e99b7","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:20a331b0f9a7ba2340246c38d467d80504ce67e556bc877938e94369fb6bfad0","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:853c3e4ccb7dc2577da0d1f076b1df23ccb091e88337eadc638ceb1d9f63ab8c","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:24de5beb3aece6e3c1b330a8ac693c9cd6acac5affee52b2335eb88e3d1f500f","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-16T20:51:15.664361Z","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:1157608144b4e77165c8cdec168bd26f8a3678704767f5d5676430ecf9cf5bba","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:64acff00c18294dda38f27ed1ed9846af1c3e5f5195e72cc8f8b424f9b6440e9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:3be3609a84e048ff48d22c8fe3685e3aa9d87953cdd40c3143801ea5667cde45","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:0cec1efe207c6487af7c1951f586eedc2ea514e897edf814eabc4bacce7e2fd3","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:fff67512a339edd206d1cec3ed92356c3e66fec5d543199669414c33a8802266","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:7451a05afcbd2db578b8c0708762a4cf0b231579797d70177f4ad239888ebd6e","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T12:46:31.236213Z","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-16T20:51:15.664361Z","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:eaef75cf21957bc0ce414219385264c6c822880a4b93b547d7e684ea52ce5173","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:f3ff41f2b1815dd7c966d78dbf9233913079e6a3768b5daf9a12dacea99ed7c6","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:65b8e530bad03bd3ab0175a23f8a8ca745d2d915ae41a8c6add323e440fc87ac","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:15d6cb8dc8ddf64e5e7bfafcc9d35ec0456b750d7d99a35ec4a7b3ae34cecdc2","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:0bac33580397ec842a9a5f1a99ee1441ffe9a615734f8f1a7b3d7783ec10e64b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:cf9569e9b6e3ee8364746fbeed136395c7c1627db2911dbdfbda279988b29309","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:af9a0a36a7adb7551bc40f07bf383dcca1aeea5b2eaae8874e5617a6aa0ebe07","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:604bbdd15f2c6c6f81b42c05822ce5bec069fabea0d457a95526cbe4b3eb0485","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:e67800722a2397cecd130c69ae37af9a388c762d3436712d395f6a79df70375b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:01644a3796a95e6f2ba68fef8223ff73a39579279ab0a5940023c4ba84656ec4","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:42bd73c92dcbf776bcf4b29a20982619bbbeab6f363812f4ed42dfa7f5c4fd07","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:5d902e67fc41259403893cf09031ce69bc0180194617b69e567d4f0092197933","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:239b3496bf0a579684b1876e9d58f8e03bf31070e49a3633e3d87f3defbdf01f","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:32cfeb1e6def2791f9e7ac8bef9a4da17939e0425b6953b3f53781d3cca1f214","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:d34e17817174b17415058df0176bf5c3c7845d67715e76b7759f5cc6ca3b65b9","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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:951decac35610ae6910cc956df0a02a2af88d833fe2e39f9bd05a64bd23bff7b","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T20:51:15.664361Z","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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 2 inbound Pith citation observations for arXiv:2411.15479."}