{"as_of":"2026-08-23T08:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c2d5e14a7d337615f63d756d642810115b086d7957b03f1169379358f4393c0","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:58:57.189254Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1909.00569/citation-record","integrity":"/paper/1909.00569/integrity","json":"/paper/1909.00569/citation-record.json","paper":"/paper/1909.00569"},"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-14T05:58:57.821263Z","title":"Anjos and Jean B","venue":null,"work_id":"41c620b5-ad9c-4f23-9656-df51e8bdd2db","year":2011},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:56.994570Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:35fadebe4a244dfc0678660ad5bc7630436e5af22932f2f2634c8c006a63f5e1","observation_id":"7a8326da-2473-4137-8ce2-145d83561eab","resolution":{"observed_at":"2026-08-14T05:58:57.824677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:56.998572Z","title":"A course in convexity , volume 54 of Graduate Studies in Mathematics","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:56.998572Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:200f35b190a812ebabc4a06c6eeee083fd58ae9f1aa607dbf5fc2a478388ccdf","observation_id":"3bbd6877-231f-4de5-82dc-d394411602bb","resolution":{"observed_at":"2026-08-14T05:58:56.998572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:58:57.804176Z","title":"The tracial moment problem and trace-optimization of polynomials","venue":null,"work_id":"46f40fac-91b2-4e5d-8c6c-412892e905db","year":2013},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.002094Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:18fc3f95694dc75ce066f63f897247b36f7d4910970fadf5b6e9719efcc52162","observation_id":"910a92dc-4798-49d3-b506-b919993a79a0","resolution":{"observed_at":"2026-08-14T05:58:57.808099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.794759Z","title":"Linear Matrix Inequalities in System and Control Theory , volume 15 of Studies in Applied Mathematics","venue":null,"work_id":"c8209ef1-c621-42b2-afd6-79736d9c7c36","year":1994},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.005691Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:c7623c2635ddd76a2e284731a868c6268b77070c606e01e12f253c562992fbb5","observation_id":"264f41a7-6ee5-42eb-8bef-18b192194d08","resolution":{"observed_at":"2026-08-14T05:58:57.798685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.786368Z","title":"Optimization of polynomials in non-commuting variables","venue":null,"work_id":"02b6dd6d-a75b-4758-985c-39ae4b6b0ede","year":2016},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.008918Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:6d5eb9a3d776cf9be5923fc4f196fa235c12b26eb6425b80affd4abdef931164","observation_id":"12b66af5-45d7-464e-9237-582bc2e23156","resolution":{"observed_at":"2026-08-14T05:58:57.789498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.777577Z","title":"Blackadar","venue":null,"work_id":"fc748191-f6b0-48dc-a17d-d370da87ba5c","year":1978},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.012092Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:35ef2c65aeb70e3df01a857abd0ddba4c20fc62d4f253f3dc05de4dba2d9fda3","observation_id":"18335f34-fc6f-4146-9ed1-9cc9d5a14693","resolution":{"observed_at":"2026-08-14T05:58:57.780822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.769824Z","title":"Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics","venue":null,"work_id":"973c4dc8-a177-4be1-ac52-fbdcaceb8b8b","year":1975},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.015582Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:a16ec82eb17ae94fa36220830b0b0ca25bf4906050e1b86151ac9120f375e6ee","observation_id":"e2fad07f-e88e-4953-9c37-ef6f3226b52f","resolution":{"observed_at":"2026-08-14T05:58:57.772705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.761700Z","title":"An introduction to central simple algebras and their applications to wireless communication , volume 191 of Mathematical Surveys and Monographs","venue":null,"work_id":"254c2d3b-fedf-4fcd-b0cb-78e53858aecd","year":2013},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.018452Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:e26eb68142fb7ce0da49ac95c73317f4f946103e8c1eeb74b9a33345129a79fa","observation_id":"bd47dc50-3c51-4fc6-9cf6-b1993ccc3f4c","resolution":{"observed_at":"2026-08-14T05:58:57.764790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.752049Z","title":null,"venue":null,"work_id":"45dae579-a206-4f84-b815-bee6ec3cb337","year":1993},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.021941Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:485c5623ac35b89b677a474d4c2ef4ec30b32eb987ef6779d6cf72bda1dcb8e4","observation_id":"d01f1004-49ca-40fc-a35b-ab9a4c422293","resolution":{"observed_at":"2026-08-14T05:58:57.755512Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.741687Z","title":"Introduction to noncommutative algebra","venue":null,"work_id":"f0cc3ff9-afde-4d57-8ec8-ad8028186b3a","year":2014},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.024997Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:52875335dc3df2a3572f7f60d43163de4df8ed559eabedb631ab2a72d3d29d65","observation_id":"feb754da-c46a-46c1-8448-0d0b7e404ec2","resolution":{"observed_at":"2026-08-14T05:58:57.745161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.733168Z","title":"Conn, Nicholas I","venue":null,"work_id":"935ad6ef-797f-4f6c-bd6c-7b09cd10dd82","year":1988},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.028631Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:d5b78a7061da157b5eb8465d57f145e46fd6a109445a3e393cf48a23e2443200","observation_id":"db2c301f-fa2c-418d-8003-4b6af3d7d81e","resolution":{"observed_at":"2026-08-14T05:58:57.735860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.724582Z","title":"N CSOS tools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials","venue":null,"work_id":"e3cbe417-196f-4f0d-ab06-74b16b0da2a6","year":2011},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.031924Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4319abf004a8bafe4154af1a892eeb5c50251fc77a679a1d708576defb189dfa","observation_id":"75c057ca-7a6e-47b9-8088-e5198a69ca96","resolution":{"observed_at":"2026-08-14T05:58:57.727465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.716391Z","title":"Constrained polynomial optimization problems with noncommuting variables","venue":null,"work_id":"55d1e899-11f3-407d-8b80-dc3ad62f70bc","year":2012},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.034423Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:8dbd58a5f3a1a26273379515967b4612394688d3d06ab6fe9bfbc4826d96da46","observation_id":"1c0c97e3-92e6-4a21-987a-6c59d884a719","resolution":{"observed_at":"2026-08-14T05:58:57.719128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03657","last_updated":"2020-10-28T09:19:39Z","snapshot_observed_at":"2026-08-19T14:27:12.882014Z","submitted_at":"2020-02-10T11:09:37Z","title":"Semialgebraic Optimization for Lipschitz Constants of ReLU Networks","version":4},"cited_work":{"arxiv_id":"2002.03657","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03657","snapshot_observed_at":"2026-08-14T05:58:57.273472Z","title":"Semialgebraic Optimization for Lipschitz Constants of ReLU Networks","venue":"math.OC","work_id":"32ea61b9-dd4e-417c-84f6-7c3f89ced5aa","year":2020},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.036981Z"},"links":{"cited_paper":"/paper/2002.03657","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4ab621fa0ccd1cefcc3d48f06f2bae7609a019ca95974af46d735743fef4b11f","observation_id":"94336fb9-e52e-4820-a246-2d1c849f8082","resolution":{"observed_at":"2026-08-14T05:58:57.276881Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.708660Z","title":"Exploiting sparsity in semidefinite programming via matrix completion","venue":null,"work_id":"ef924b35-c11d-44c5-af40-5e00d12a2fc0","year":2000},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.040020Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:9a59fdbfee4897c83b5fcfb30d6909b575e28ef46d4712bf394d648ac2d0762f","observation_id":"239114ed-ef1f-4678-bee0-527b89fbb5e2","resolution":{"observed_at":"2026-08-14T05:58:57.712083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.700315Z","title":"Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization","venue":null,"work_id":"3e745089-b9a0-4f83-b900-b5def2246a5a","year":2018},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.042584Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:b5d05b21d42a55fa87d5bcfa843005cf5c9d8e04c4993038c60291050d868a44","observation_id":"45d85f20-d8d8-4a1a-8313-d0708f03211b","resolution":{"observed_at":"2026-08-14T05:58:57.703297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.691970Z","title":"Lower bounds on matrix factorization ranks via noncommutative polynomial optimization","venue":null,"work_id":"bd9942ac-5e85-4dc3-aa47-3a296687aff2","year":2019},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.045569Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:ec0a122ceba7d207e05f6fab438977eb09d7c718d8e89580d7b338209348bfca","observation_id":"6b03d9c7-f73b-4a58-956b-3d80b742ddbc","resolution":{"observed_at":"2026-08-14T05:58:57.695043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.683808Z","title":"A note on the representation of positive polynomials with structured sparsity","venue":null,"work_id":"88aea733-1126-4fcd-80d1-a0caf8068336","year":2007},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.048443Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:0d7164906f4ed53f849273270939259d6f1aeec54003b2a807445c9706ccf601","observation_id":"072aaff5-1951-4557-b03c-ee9362f25d37","resolution":{"observed_at":"2026-08-14T05:58:57.686838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.674744Z","title":"William Helton","venue":null,"work_id":"fee23bdc-d2fb-4b7b-ad95-c046062d55c0","year":2002},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.052070Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:e79c200dc8a3981c011825853db9565beeef1f5d83a1ab4adf679df04d18179f","observation_id":"f3ad6e1d-aa63-405e-9df5-78b7d6ba8f03","resolution":{"observed_at":"2026-08-14T05:58:57.677560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.665522Z","title":"William Helton, Igor Klep, and Scott McCullough","venue":null,"work_id":"defc7dcd-49c0-4dd1-9039-94f03d158916","year":2012},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.054828Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:221b24e884174ebbca51e35afe6a8193b992b5bf769ee7a952c57018de195cf5","observation_id":"c7a0d673-00ac-4eb7-89ac-501aa89f2257","resolution":{"observed_at":"2026-08-14T05:58:57.667988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.657828Z","title":"Glopti P oly 3: moments, optimization and semidefinite programming","venue":null,"work_id":"2c525871-da0f-4717-b1c8-101e3e7b8767","year":2009},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.056922Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:a1dcea5e68f0d8aaca6de07d2f3b667c26e250e9445f715e0a2dffa6e5c96725","observation_id":"f6b656ff-4b9d-4bc9-930a-b747870f843c","resolution":{"observed_at":"2026-08-14T05:58:57.661110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.648451Z","title":"Approximate volume and integration for basic semialgebraic sets","venue":null,"work_id":"d225f70d-54c5-46c5-ba7f-8e0a5c8e661b","year":2009},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.058743Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:d1bec9ab42b0e45424e1fef1b2792c3864bbb9c25c07beddb83453b950901867","observation_id":"bcb45692-a52b-4ebe-9ac1-b9afbeb6cebb","resolution":{"observed_at":"2026-08-14T05:58:57.651532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.639883Z","title":"William Helton and Scott A","venue":null,"work_id":"5d029c3f-45c0-4bc3-af11-97c3b833efee","year":2004},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.060516Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4b01b60e10545af986113f5305222c0a69ea2c14761ab6769f61f859b2e519f7","observation_id":"ffc3a96b-ee0b-43f5-8830-df4bb2422461","resolution":{"observed_at":"2026-08-14T05:58:57.643061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.630931Z","title":"Ordered linear spaces","venue":null,"work_id":"77e8ddb5-a14f-4592-a644-b1d7e7591fb1","year":1970},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.062407Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:a1f7d41a6665912c857823c3c64c7ed316859ea9f1a58e28a1bd0b209485341e","observation_id":"404776a1-41a1-4e0c-b434-cb058634db44","resolution":{"observed_at":"2026-08-14T05:58:57.634403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.621126Z","title":"Application of polynomial optimization to electricity transmission networks","venue":null,"work_id":"aa5a01fc-633d-4698-84b8-2b57179e819d","year":2016},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.065810Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:49ba082b4d9a882ff372ba6152ef4d250ba3dc7ccfa9970b1c90229b437690eb","observation_id":"41fceda2-7071-4ede-8f09-6cfa45364515","resolution":{"observed_at":"2026-08-14T05:58:57.624226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.612212Z","title":"Anneaux pr\\' e ordonn\\' e s","venue":null,"work_id":"18bc0372-ecd4-45aa-b743-849eb973e170","year":1964},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.067843Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:2dd9f5fb5084591e142de3090b32c0d16edeeaadb82a1aea4823ce04768fa41f","observation_id":"c1ff9768-4274-4090-9a4f-a23761552612","resolution":{"observed_at":"2026-08-14T05:58:57.615387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.603799Z","title":"Sums of H ermitian squares and the BMV conjecture","venue":null,"work_id":"7cfac5a7-4152-4229-a9d2-db3cdc9021f1","year":2008},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.070729Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:400f81fb204200de8ca3847a86a8894e48b83dde690194c4b806b6531fa250f4","observation_id":"6e68922f-2e5b-47a2-92e2-5b9e22b4f599","resolution":{"observed_at":"2026-08-14T05:58:57.606306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.595410Z","title":"A first course in noncommutative rings , volume 131","venue":null,"work_id":"f35a8e10-0159-48d4-87d8-21d97a8534ab","year":2013},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.074392Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:234765949b7294b39c483142d6b4d4da1ed719ee2e0c75479a7f3ed805e02bdf","observation_id":"1f8abbd2-cccf-49fa-ac17-83aa7dfedbe7","resolution":{"observed_at":"2026-08-14T05:58:57.598836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.584343Z","title":"Global optimization with polynomials and the problem of moments","venue":null,"work_id":"94e9f3ab-2969-4a15-a556-343ce8a302a1","year":2000},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.077615Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:e699b6d4ba3a175b55dd6c6c1584f339c8c19298632f82672c1501ab0740b988","observation_id":"b188db02-e866-4483-8d63-1cedc96cc48d","resolution":{"observed_at":"2026-08-14T05:58:57.587589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.575141Z","title":"Convergent SDP -relaxations in polynomial optimization with sparsity","venue":null,"work_id":"5d218314-111d-4f73-9ae2-8f2269e2a68b","year":2006},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.080569Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:102a83fc27538b902e83efc06a08fadd0fb6ce086c2d0359ae5aea05588deb9c","observation_id":"a0774bfa-87a6-4334-8d24-823ae213e6ff","resolution":{"observed_at":"2026-08-14T05:58:57.578712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.565831Z","title":"Matrix completion problems","venue":null,"work_id":"8da76908-dc87-4ad9-95cf-6f81e0a57c8a","year":1967},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.082913Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:f9c7396e1cb389dc95e2bfc3162394b9367f2f785bdf296d2e7b87eee3bf4981","observation_id":"669555b2-89a9-40cf-8cab-f709652024d8","resolution":{"observed_at":"2026-08-14T05:58:57.568864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.085995Z","title":"Sums of squares, moment matrices and optimization over polynomials","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.085995Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4e33999d6a8b2abe630bb1e1dc5aa9bd75aa5ee6c750286dfa816c8560c4e565","observation_id":"01755f40-c89a-449b-afd0-df5985d8ecd9","resolution":{"observed_at":"2026-08-14T05:58:57.085995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:58:57.549971Z","title":null,"venue":null,"work_id":"d8b158df-32ea-46d3-92e6-84a12c329d52","year":1958},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.089445Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:fbdb96461b2afe1600230a4ac2d57e17a31c1e2500f20bd88da269bc1ed32f02","observation_id":"dc3f7ef4-dde9-4998-81f2-733066d3cbb5","resolution":{"observed_at":"2026-08-14T05:58:57.553274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.541072Z","title":"Semidefinite programming and integer programming","venue":null,"work_id":"1ea3e2b3-1fa0-4b25-8eec-1eb98aefba9b","year":2005},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.092062Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:5f2ff371bf68df1186f11bd12da68195b63796d6fd6af66078a9d2fc4853fee6","observation_id":"0e899f6a-3382-4077-8bbf-a916396e2b9e","resolution":{"observed_at":"2026-08-14T05:58:57.543663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.534051Z","title":"Lieb and Robert Seiringer","venue":null,"work_id":"23961098-b036-473e-9686-08259555d761","year":2004},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.095324Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:f232574d75ed74bd266a58d4d046f9d8b0b85629c961b80a0a67f6ac705470a4","observation_id":"6de79c38-dbc2-4e36-9139-4ce782a6b665","resolution":{"observed_at":"2026-08-14T05:58:57.536417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.524310Z","title":"A bounded degree SOS hierarchy for polynomial optimization","venue":null,"work_id":"0b9bd6bb-70ce-43dd-9c89-acc3be21cd64","year":2017},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.098089Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:922a1d60ba00038911fe69e08527305ef5772b2cc08088e6563f4d05b66abc3c","observation_id":"2b9b4ea9-8b8a-4f1e-b91b-f26374412781","resolution":{"observed_at":"2026-08-14T05:58:57.527784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.512937Z","title":"Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming","venue":null,"work_id":"53fd5315-1ad7-4369-985d-7607ae001345","year":2018},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.101554Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:f0f8abf8f0a8e01e7065ad5908b9c2ae260e023578d1df2680e5510967c782bf","observation_id":"37abd350-b421-4737-9423-9ab6bc47c86d","resolution":{"observed_at":"2026-08-14T05:58:57.516276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.502227Z","title":"Factorization of operator-valued polynomials in several non-commuting variables","venue":null,"work_id":"eaaa4ce4-51cb-4d87-955f-e6421f02f35b","year":2001},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.104101Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4bda867a3de3952e64dbd0da8924cf01d750fa97081cebf0fe3f4af9ea99b4e5","observation_id":"d862ba6d-4e0f-4d4a-a04e-2e7414da9ba1","resolution":{"observed_at":"2026-08-14T05:58:57.505855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.491847Z","title":"Certified roundoff error bounds using semidefinite programming","venue":null,"work_id":"6a6dc6d8-7900-496e-a8b9-800ff43a961c","year":2017},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.106619Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:677f619a19c2b3d927acd906f5bcfdc386d0a076f2e9193d90df43d51ec74e05","observation_id":"0e5c9bde-12df-47ce-b758-c796c953ca49","resolution":{"observed_at":"2026-08-14T05:58:57.495491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.482729Z","title":"A numerical algorithm for block-diagonal decomposition of matrix * -algebras with application to semidefinite programming","venue":null,"work_id":"6a8c312e-56ea-4831-ba66-341e8c306ef8","year":2010},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.109351Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:3f02443f5c200c3028cf8add0d57d03b004833373c37cef1c2d460b8be115ab5","observation_id":"21a0ed57-0729-4dae-8460-3172ae6dfaf0","resolution":{"observed_at":"2026-08-14T05:58:57.485895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05101","last_updated":"2020-02-13T14:48:02Z","snapshot_observed_at":"2026-07-06T08:56:50.671205Z","submitted_at":"2020-02-12T17:20:14Z","title":"A sparse version of Reznick's Positivstellensatz","version":2},"cited_work":{"arxiv_id":"2002.05101","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.05101","snapshot_observed_at":"2026-08-14T05:58:57.260105Z","title":"A sparse version of Reznick's Positivstellensatz","venue":"math.AG","work_id":"eb95ebb9-dce1-46c2-b27a-56cb1d5e7871","year":2020},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.111856Z"},"links":{"cited_paper":"/paper/2002.05101","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:ea12f35fb7c6b2276bac80b86b1e1dc1e46d67262481a8bb29c1ac105bd3734c","observation_id":"05c2013c-87ae-46dd-be59-cc5422b23243","resolution":{"observed_at":"2026-08-14T05:58:57.265021Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.473710Z","title":"http://www.mosek.com/","venue":null,"work_id":"db2612dc-4409-4aa0-951d-f9f9532b2dd7","year":null},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.115318Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:de8b26d316c1d394ba88ad3c3b050991bb28f7899718dfb89148787ff593f084","observation_id":"a60534ce-7ee3-425f-b859-60e9272dab42","resolution":{"observed_at":"2026-08-14T05:58:57.476710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.465735Z","title":"Noncommutative sums of squares","venue":null,"work_id":"7c2604ec-d2c5-4694-aa0a-2d088823b54c","year":2005},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.118598Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:491cb660c52a76276e9e01ac9cb029ef544872da042bc3ae270495bc1eec50f3","observation_id":"6a5ad9a9-5766-4cc2-a52a-cee2c7246502","resolution":{"observed_at":"2026-08-14T05:58:57.468757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.456467Z","title":null,"venue":null,"work_id":"3f3ac3fa-5082-4a2f-a1b2-ba6960c74f12","year":1984},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.121270Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:f15988d980581eb6cc3d604674584d893732a8990053fa911fb7d88b755e9e64","observation_id":"2e365db1-e63b-4f06-b6e7-d8298497bfdf","resolution":{"observed_at":"2026-08-14T05:58:57.459395Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.447513Z","title":"Exploiting sparsity in semidefinite programming via matrix completion","venue":null,"work_id":"2b71d98e-c445-49ee-b9f3-cccb18839300","year":2003},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.123535Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:9d038858af36d894b976fca63706602610ff963217d5c05d4f87c53bf889e44b","observation_id":"2d4281b1-3b43-495c-8cd2-2a2dbe42d5f4","resolution":{"observed_at":"2026-08-14T05:58:57.450854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.126506Z","title":"The A -truncated K -moment problem","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.126506Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:fb84c472f5fd746a40ae74ad858299d05d8c07e77095c3be691e49f1bb817a23","observation_id":"02155f16-ad2f-43fe-b6aa-4b19fe5825c0","resolution":{"observed_at":"2026-08-14T05:58:57.126506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:58:57.433834Z","title":"A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations","venue":null,"work_id":"7557e3e6-214b-4460-90ea-a18af6c4d08d","year":2008},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.128816Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:ba653e6092c08f1478561defba1b671715fe520b59646c59645b7dca3a2276b8","observation_id":"a76c9c20-bbc9-4dfc-85d4-c2c00b1c0679","resolution":{"observed_at":"2026-08-14T05:58:57.437407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.423973Z","title":"Hyperbolic polynomials and generalized C lifford algebras","venue":null,"work_id":"4fa1723f-5464-43f6-8d76-18903f03c6d5","year":2014},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.131099Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4bcf3a43605b8e1a2ef2aba4cc3af37fc48da639fb22469a6fcffd52a0b04b32","observation_id":"e0947594-7d52-44b6-a968-27a4e3b5d0d2","resolution":{"observed_at":"2026-08-14T05:58:57.427014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.415515Z","title":"Convergent relaxations of polynomial optimization problems with noncommuting variables","venue":null,"work_id":"bcbb5071-7fb7-43b4-8a00-0edb6a46703b","year":2010},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.132982Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:66d4a31dd8f0e82a4cfbd750270adb8d52d84c5e6f53a2dbf5d4e0af58afed95","observation_id":"0c16c32f-226f-47e3-be11-f2b470a42aa5","resolution":{"observed_at":"2026-08-14T05:58:57.418644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.408751Z","title":"Positive polynomials on compact semi-algebraic sets","venue":null,"work_id":"8c9f8d06-c103-4949-8021-f9a70b5760b5","year":1993},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.135281Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:927e6c9d5f1ae339bbf6a2ba50114c1d9c261fd4a321dac94a8f4c968b42b241","observation_id":"a85fd626-79ce-4acc-acac-04fa4d770551","resolution":{"observed_at":"2026-08-14T05:58:57.411127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.401534Z","title":"P\\' a l and Tam\\' a s V\\' e rtesi","venue":null,"work_id":"587c4cbf-0e93-418b-a0a9-ce4c5acb22dd","year":2009},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.138013Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:cd488a17f8b36a6ec7787e1f14988f1c88c95aab609a68db0e907e4346febcd2","observation_id":"fdc7a8d0-7db4-4ff8-a2a6-d5ad167a13db","resolution":{"observed_at":"2026-08-14T05:58:57.403940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.393269Z","title":"Extremal PSD forms with few terms","venue":null,"work_id":"bce60617-1f06-4f72-a57e-7a38ebf1669c","year":1978},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.141016Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:a5c9263cfc8ffa60f1f7836ca157e7c27c76e2dcfbdd84564c2d5f7f71dc4bfc","observation_id":"9716a52a-165d-41b6-b639-929a6d311932","resolution":{"observed_at":"2026-08-14T05:58:57.396431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.383602Z","title":"Exploiting symmetries in SDP -relaxations for polynomial optimization","venue":null,"work_id":"0d4680b4-bdca-4d71-942b-6db01868c871","year":2013},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.143638Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:238f75ca08002544e2edda053c2b19416eadb34da4a1e3a72637a5ead78ded03","observation_id":"2ba335fb-9ab4-45ee-a867-55027b2296f8","resolution":{"observed_at":"2026-08-14T05:58:57.387564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.375739Z","title":"Skelton, Tetsuya Iwasaki, and Karolos M","venue":null,"work_id":"669f481f-112d-47d2-92e6-b4ff20e47c5f","year":1998},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.146215Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:7e1895e83234254c0fdb877d115d891d4523c17a1686229b486313468d1cc591","observation_id":"53cd61d2-205f-4d03-b17b-d1d4bfefac9f","resolution":{"observed_at":"2026-08-14T05:58:57.378939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.366338Z","title":null,"venue":null,"work_id":"b0e3d8da-3e33-4f41-b77b-b096bc81632d","year":2013},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.149171Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:ad79912d6f11568ea1d444720143db9c388e94dd11e0565d59a12a179e5ca290","observation_id":"f7da88a9-5a1d-45b3-847b-a22553f38317","resolution":{"observed_at":"2026-08-14T05:58:57.369927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.356584Z","title":null,"venue":null,"work_id":"f8f87df8-9e3b-4a4a-a3cc-367f24a7939f","year":1999},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.151586Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:82ab20ac1091085acdf36fd75628fba9c9c7dae58b5ef4edc69bf4762d9836b7","observation_id":"b6cd7dff-2ebd-41b5-8f14-830a16b7e322","resolution":{"observed_at":"2026-08-14T05:58:57.361131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.349794Z","title":"Theory of operator algebras","venue":null,"work_id":"4227c48b-7c13-452c-bd6d-9a54d7bbb2a7","year":2003},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.153991Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:92e805c9f98b5ebeda17af1819025e485512a53297b8cb42d4ce7ca9922d3767","observation_id":"db4af9a4-8185-4bb5-b4e4-d5f6425f5c3d","resolution":{"observed_at":"2026-08-14T05:58:57.352002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.341720Z","title":"u t\\\" u nc\\","venue":null,"work_id":"1e013853-36cd-4e5e-a639-cc782795ce18","year":2003},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.156764Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:f70c992b0b5f6de45aecc0254b55f8b67410280628d01190d39047011e2a5226","observation_id":"3ece4c44-83a7-4423-8255-9ac1ea80a837","resolution":{"observed_at":"2026-08-14T05:58:57.345235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.02976","last_updated":"2020-07-27T12:34:43Z","snapshot_observed_at":"2026-08-14T17:19:17.344752Z","submitted_at":"2019-02-08T08:40:57Z","title":"Exploiting Sparsity for Semi-Algebraic Set Volume Computation","version":2},"cited_work":{"arxiv_id":"1902.02976","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.02976","snapshot_observed_at":"2026-08-14T05:58:57.248689Z","title":"Exploiting Sparsity for Semi-Algebraic Set Volume Computation","venue":"math.OC","work_id":"b839c7d6-c1b1-4427-8ab4-d63b310e5a5b","year":2019},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.159262Z"},"links":{"cited_paper":"/paper/1902.02976","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:b037bbf0d453739660db542fc86e2e00e050de5d6cc3c49ac6c5a5fe67239e35","observation_id":"dd23551a-37db-4642-a66d-aae12234ebfe","resolution":{"observed_at":"2026-08-14T05:58:57.252617Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.334140Z","title":"Dykema, and Alexandru Nica","venue":null,"work_id":"445f8511-88f9-429e-ae67-7da51f626370","year":1992},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.162602Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:ded0bcf41b85349dac6134fba4019b0e6a5c416515e812d89123b30952175e9c","observation_id":"927911cf-5f74-45a1-b654-e69ebe80b87d","resolution":{"observed_at":"2026-08-14T05:58:57.336907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.326652Z","title":"Symmetries of some reduced free product C^ -algebras","venue":null,"work_id":"28865552-5144-400a-9219-9ed34050a2c1","year":1983},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.165608Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:82aef58f9694f616f40f98896cc94eccb29b132ee116fabd7c06f873093e4d92","observation_id":"e265b0d9-d934-4161-8ade-6cb77e219833","resolution":{"observed_at":"2026-08-14T05:58:57.329496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.316849Z","title":"Algorithm 950: N cpol2sdpa-sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables","venue":null,"work_id":"8a525915-4620-440e-a3e0-e19d85381a72","year":2015},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.170014Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:5a141cc09bead53c7f8cbf6958ee25d827b66cb5d9c1979ac2574d672c5de541","observation_id":"31e8fe84-6c86-4ee5-bce9-ae3247fc2f7b","resolution":{"observed_at":"2026-08-14T05:58:57.320809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.307874Z","title":"Algorithm 883: sparse POP ---a sparse semidefinite programming relaxation of polynomial optimization problems","venue":null,"work_id":"2581624b-4ce4-4b23-a026-335d8f8cde6d","year":2009},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.173711Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:c1ce7b93c4e527e1027ea6d595cfd19eb4e4e40995dcf68817a007efb20f756a","observation_id":"18ec9286-7fe4-4093-b5a6-a8289b728994","resolution":{"observed_at":"2026-08-14T05:58:57.311311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.298658Z","title":"Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity","venue":null,"work_id":"05a0292a-f593-4931-b6c2-edf860077559","year":2006},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.176677Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:338118edffebb5904f0fe7511691e068b5df6a8240aef4ae9375008d9096f182","observation_id":"b8a97461-df87-4c6c-aabd-c778e66c7ad0","resolution":{"observed_at":"2026-08-14T05:58:57.302697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.291575Z","title":"Sparse- BSOS : a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity","venue":null,"work_id":"ced44412-5fd6-4bf8-9418-aefec6a325ea","year":2018},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.179802Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:b19f1d167b2bdf5cb5c0e682a1a5c64f35494b176122c425b7e75768f2f83816","observation_id":"1ba916e8-13e1-46fc-ad95-54f572182096","resolution":{"observed_at":"2026-08-14T05:58:57.294488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08899","last_updated":"2020-05-13T07:57:33Z","snapshot_observed_at":"2026-07-06T08:45:33.880733Z","submitted_at":"2019-12-18T21:29:18Z","title":"TSSOS: A Moment-SOS hierarchy that exploits term sparsity","version":2},"cited_work":{"arxiv_id":"1912.08899","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.08899","snapshot_observed_at":"2026-08-14T05:58:57.236894Z","title":"TSSOS: A Moment-SOS hierarchy that exploits term sparsity","venue":"math.OC","work_id":"6dd59210-25f0-45ae-9f41-aac72cce87ec","year":2019},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.181797Z"},"links":{"cited_paper":"/paper/1912.08899","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:28f2ee83524debd4bd4d2718170d221d421bccde63fc7a5844c833d3206dc2ea","observation_id":"1485340f-8eeb-4526-8f85-977d23a588f4","resolution":{"observed_at":"2026-08-14T05:58:57.240667Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03210","last_updated":"2020-03-04T19:31:56Z","snapshot_observed_at":"2026-08-06T06:30:06.348500Z","submitted_at":"2020-03-04T19:31:56Z","title":"Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension","version":1},"cited_work":{"arxiv_id":"2003.03210","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.03210","snapshot_observed_at":"2026-08-14T05:58:57.225642Z","title":"Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension","venue":"math.OC","work_id":"9772d755-8876-4edd-a6b1-00bcc98f5e71","year":2020},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.184105Z"},"links":{"cited_paper":"/paper/2003.03210","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:dcf5c03ad0afd752a003c09e169e812947ccdd4008ea237a2c664acfa38a3af5","observation_id":"7df30b9b-e49b-4493-bfac-954c6dea4be1","resolution":{"observed_at":"2026-08-14T05:58:57.229411Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.02828","last_updated":"2021-06-08T21:12:01Z","snapshot_observed_at":"2026-08-13T16:23:54.001213Z","submitted_at":"2020-05-06T13:55:03Z","title":"CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization","version":2},"cited_work":{"arxiv_id":"2005.02828","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.02828","snapshot_observed_at":"2026-08-14T05:58:57.212285Z","title":"CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization","venue":"math.OC","work_id":"548d8576-7c45-4093-b001-a81f458ea2fb","year":2020},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.186373Z"},"links":{"cited_paper":"/paper/2005.02828","citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:3d7e871ce03839b522808ebe94662ba05b65c4539043553b8283d96556889cba","observation_id":"417d72c3-01dc-4b5c-9d8f-2afbadf31497","resolution":{"observed_at":"2026-08-14T05:58:57.217344Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T05:58:57.283628Z","title":"Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0)","venue":null,"work_id":"157f5d0c-a876-4f11-8405-94c7c254b590","year":2003},"citing_paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization","version":3},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-14T05:58:57.189254Z"},"links":{"citing_paper":"/paper/1909.00569"},"observation_digest":"sha256:4c51cf0e79a15fe4dbc1528801f308de63bd0e1fd5260054875cbed99bf16121","observation_id":"bf2501db-bc45-4db3-a634-5cf046750b96","resolution":{"observed_at":"2026-08-14T05:58:57.286650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.00569","last_updated":"2020-08-17T11:14:03Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:46:07.766954Z","submitted_at":"2019-09-02T07:07:37Z","title":"Sparse Noncommutative Polynomial Optimization"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":6,"verified_fuzzy":55},"total_outbound_references":69},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:1909.00569."}