{"as_of":"2026-08-18T14:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8d5edfa8694e32d91132066d68f70f5c76165575b40bbfde51e9c166876febe","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T15:28:19.746128Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2607.08841/citation-record","integrity":"/paper/2607.08841/integrity","json":"/paper/2607.08841/citation-record.json","paper":"/paper/2607.08841"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"The tracial moment problem and trace-optimization of polynomials","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:1f27eb73742b218f31f2fcaa8a1c0af312361613dadc156f247a54a768bf9a37","observation_id":"48541e2c-e038-46b1-b535-347e0d6dcaf1","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Bell nonlocality","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:c49586eeedc2ecdaa80b94f43a35d90f0648f24df24c1acf3f5cf50f577fe917","observation_id":"3e81452c-43f2-48f6-a2f4-7d2c092d0e15","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Device-independent lower bounds on the conditional von N eumann entropy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:ed621bc6042928a0ef289705e4e3c3ed502c2c740f317b615f803ce8391fb25a","observation_id":"40a12a5c-4f8c-49a2-913a-a29584ac6c60","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Sum-of-squares decompositions for a family of C lauser- H orne- S himony- H olt-like inequalities and their application to self-testing","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:b38ad3fb302b90bb165c41de739d447281fd8e1ff261b6427b95f3322ecb22eb","observation_id":"b142a4e1-d9ed-4d5f-9b02-c23ff1a20d6e","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Gr\\\"obner- S hirshov bases for C oxeter groups","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:85aa08717b0bd374eb4936dfc838cd89bf6bb627017afc1e82945bb5facf3cd1","observation_id":"aca42795-a8fa-474e-8c07-12f724aef058","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Applications probabilistes , volume 85 of Lecture Notes on Mathematics","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:2f21515eadf2cafac10c4e924c9a6a25f30bd1934733a67a834373dd3c7c550c","observation_id":"376588fc-b00f-4746-ab54-378336756002","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Toric heaps, cyclic reducibility, and conjugacy in C oxeter groups","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:0f2db1814eb1948f05be58735185e7116c73793c36bf27384e537e203753f01e","observation_id":"94a854f3-8bf1-487a-81f4-f8a4c2d18313","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"The quantum moment problem and bounds on entangled multi-prover games","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:c1bd170ccba5b85e9cb3f4595bb70e3e704f20a79d5e0992c2462ac4f5047773","observation_id":"b40b7b93-717b-4d00-a53e-edffcea6a894","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Partial commutation and traces","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:5c296bffd8641e3a47d88d3c943978e4eb74f253d44c2c99ce02bea9a5352bd2","observation_id":"ae66d1bf-f8ea-4dc5-a273-02d19f2bbad6","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Toric partial orders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:47538ab4921e059c26c1b4a3c5c844b56c28134ece143b8f9c70c9483423054b","observation_id":"244d5eb8-c200-4083-9b24-8daffb56a726","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"The book of traces","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:1099e4d41d5c66d9115525b434c519d9962263b5f9f8d0e43816b00b772f624f","observation_id":"06a2b4bb-ac29-4ccd-811b-e1a37af7888e","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"On some equations in free partially commutative monoids","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:1d2f0279b95b2bb08ed1959ef1b9b53a05626629b950586995e9df90500cd017","observation_id":"2668ffd1-18a4-40e3-b171-eeb19df400b0","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:8ec21d650ced9a04fb4b496772a11b443dc9ca0ee521fdfb76dd9003c3c167e3","observation_id":"d0a1a339-2324-4805-8e49-d77910bcfc38","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Connes' embedding problem and T sirelson's problem","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:4550fc95391ed3e59cd3cd1d2c7bdca173e4e6eef03889a06ce035a16b1845ca","observation_id":"8822655c-d08d-46ee-b74d-f8e5da61e1d6","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"MIP ^*= RE","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:9345461b77d0ed33e64fe3ebff98bdc9323af74a6be9770d27595b294c78a423","observation_id":"ea2d7a9f-9e4a-4e7b-93c8-ae33773b7a55","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Simple word problems in universal algebras","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:cc8d62516cfdc547642de4395002e27d5e327f06801d40adb94bddaf9e2bdf16","observation_id":"ea33daac-72ad-42c7-9980-fa9e3e42e0cc","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Optimization over trace polynomials","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:eddd2bf58ab855b2a02d19577a6806e744e836a9dd4845a11a1285170f78a24c","observation_id":"b8081865-f41a-42d7-9e28-2aec91bacd7a","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"State polynomials: positivity, optimization and nonlinear B ell inequalities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:ebdf21dbc6ec67c72f8ddef7de4f92a3620765c56cdb6f74b69a0de507eab9cb","observation_id":"09ca8dce-359e-464b-979e-1aa03f3fd03a","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Constrained trace-optimization of polynomials in freely noncommuting variables","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:d953628293e5efc8bebe99269c3d00349c7b3e5551d9e70320f2da074d15c6ad","observation_id":"d659352e-251a-4d90-9d61-5accafc05f28","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Global optimization with polynomials and the problem of moments","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:8ac1cb65f319ca17660f1cca6909ee3611d209bb2ea9e52e3476b3a90960c9ba","observation_id":"343d31f5-f765-489d-b78c-d8539522b227","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Sums of squares, moment matrices and optimization over polynomials","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:4f87bfe07464e69556977780988f1a00eda3bbf728b439fb4250476b0cb7cd24","observation_id":"463c01fd-ce2b-4633-ab5e-d6fcb04f9ee5","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Algebraic Combinatorics on Words , volume 90 of Encyclopedia of Mathematics and its Applications","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:254df6369e6a31ba276abe00d7bd919340774f94ecb87b62b27c4660e6d01b36","observation_id":"7fe49818-eb5b-470a-8e22-c7c253c8b090","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Certifying long-range quantum correlations through routed B ell tests","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:8fa84636c86d884cd8a47e7c0c1f2bec9c0f857b38828ee90496ea9fa2d3ee44","observation_id":"ea665176-07a6-4361-ba41-478d9d12acd1","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Efficient solution of some problems in free partially commutative monoids","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:837a49dda142a8fc78ea95807070a35d9b2d5db26a7569fb677340a421e48d2c","observation_id":"cc2e1992-e474-49c0-a889-5b2c53eb872a","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Concurrent program schemes and their interpretations","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:2df4fc9306073ed874ac7714d67de7d4055158e45b47eed1c25c12d2f6be6b0d","observation_id":"a10e8cc1-3564-4aa8-a980-7ada43a01d57","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"PCPOP.jl , 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:ea8b727960ec4b4a40d2743253f78e54a0c5f069712bb6e3fcc0331532924556","observation_id":"7e29dbde-d6ec-4bdc-adc3-74c8ded9e503","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"PCPOP .jl: A julia package for partially commutative polynomial optimization, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:99df7cb59e1e446a0df2b46df34cf7a33c9b591c3816c6e5f567e56f5f366c93","observation_id":"079496ce-befc-445a-85ae-169531642694","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"An introduction to commutative and noncommutative G r \\\"o bner bases","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:8bca3400a6c6a0d9234fedf70349ef79fd45bd0439473a9c4dcf602063bcee6f","observation_id":"4ed1009f-c5e5-44da-9347-d697926f4813","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Bounding the set of quantum correlations","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:679c4f707e72d12af1c99751fa7b96c95b6ed75470fed558cb14ee36afac584c","observation_id":"3f07af89-671c-4e9c-9ddc-16abc554243c","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:c4f6bfd4b7f84d2e720a49c2675e4d5232ad04d272eca9d666e00f1c29666233","observation_id":"17234e92-d606-4df3-bd9b-a01a3f8b3ad2","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Bounding the set of finite dimensional quantum correlations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:2743072ae7562fb4f4839e88c3b14e3bdb62b47976c5e890da8db61d649ad98c","observation_id":"cf6974c6-c522-4d2f-a21b-c974ae53ca6b","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Semidefinite programming relaxations for semialgebraic problems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:43155000771d6b8b5778dc703b0f9241b7926b13d7b9e1fc9346b72854e58313","observation_id":"0b78cfdb-181f-4b05-b52f-79dbb4677124","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Exploiting algebraic structure in sum of squares programs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:ea76b25ebb0e78a834a48a7688e45cd08f6a678ace2c3c1be91529415c156a73","observation_id":"f907adde-c3f0-4b92-a8db-0fcb99d434db","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Convergent relaxations of polynomial optimization problems with noncommuting variables","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:9044848f97346be0b954ebbd8dccd7db7f23c94e22f23356dc1b646c4bce8eea","observation_id":"9c522d4e-ec2e-44cf-96ed-9bf53b369cce","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"On reorienting graphs by pushing down maximal vertices","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:9d7266ddfc3726bb5200aa4186ee83e57ed7787d6e134fb08a825bee42e56e63","observation_id":"f1b953d8-b0d3-43c6-a03d-930cab7e2dea","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Prepare-and-measure scenarios with photon-number constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:7bb60d7233d77ba237a36f4c5e0d7d29d46601329a1312b017d3e9e2fc54ffc2","observation_id":"561f7b0e-c69e-4f1a-9715-6319b048f994","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Symdpoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:f98d5856cf2604efe263db8201ce91e5c2bf5c0155d08fc4d7fa3ab3e99f8bc7","observation_id":"cfb14398-c684-41da-a16c-c851361e615a","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Handbook of Formal Languages: Beyonds words , volume 3","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:f16b3c9b97cd2fccc6950b428708dd1729caa341369144438be01e78c08cf72e","observation_id":"1c277ff4-4287-401c-a6df-8b231b28c09f","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Semidefinite programming relaxations for quantum correlations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:4552611508de229ecb2b674dc2cfaf6adf2885eb3c0e42faeaa8db010de2968b","observation_id":"6ac1bcf1-e92b-465c-8d63-4c70ec1692f3","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Informationally restricted correlations: a general framework for classical and quantum systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:fde7644e8b64710f385f1369de22615ddf822765ca626a755862a08922a9a8d3","observation_id":"3185de72-f76f-4905-a126-1e432b133d7f","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Colloque de combinatoire \\'e num \\'e rative","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:f7e9ee7f2872d128e0800c2e5f3f84105ad48ca01dd244abdbed76c1c2c09d22","observation_id":"55083cb6-6972-4a8a-b95e-810b0cfadca1","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Algorithm 950: Ncpol2sdpa—sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:294558d427a4a019393b8ab79a77ceca6ccedf0c1b8c2eaf404488ca3fa036e9","observation_id":"a08dbb21-04cd-4df5-a597-585dd820f63a","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Exploiting term sparsity in noncommutative polynomial optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:c3535257c9342d1fe3a2d29a55030c3e2d0c96ffad0a9707bfd31e1212bb5941","observation_id":"ac33e0ea-3d16-44cb-a977-c419be47e314","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"QuantumNPA.jl , 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:5719cd5bd8796b81c03fe8dde8b680e918c33f62d55a629120f26f52625b4a7b","observation_id":"c4619b6a-29dc-4305-9311-f3e38f1d31be","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T15:28:19.746128Z","title":"Certifying ground-state properties of many-body systems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-14T15:28:19.746128Z"},"links":{"citing_paper":"/paper/2607.08841"},"observation_digest":"sha256:be759b19735eb8b146fa3cea1e7c6abb8c0d7a7b4ad9bde536e6053e86a049bb","observation_id":"9e1e737f-ff30-4ba6-8780-d9f10d609e79","resolution":{"observed_at":"2026-07-14T15:28:19.746128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.08841","last_updated":"2026-07-13T01:42:14Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T15:43:13.689348Z","submitted_at":"2026-07-09T18:01:42Z","title":"Partially-Commutative Polynomial Optimization"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":45},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2607.08841."}