{"as_of":"2026-08-08T06:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:76b78a4aef51a0456a5ffa327403e90aa5e4bc0c26e62536a66d85428b6d26cd","coverage":[{"denominator":141,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:37:08.751998Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2508.21327/citation-record","integrity":"/paper/2508.21327/integrity","json":"/paper/2508.21327/citation-record.json","paper":"/paper/2508.21327"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.333054Z","title":"Towards strong nonapproximability results in the L ovasz- S chrijver hierarchy","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.333054Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:c459728e26992c52a812a9c6ebe64c627b6035efca48705259c802963eb3a821","observation_id":"f2151a97-a16e-4130-b028-45a4b549a553","resolution":{"observed_at":"2026-08-05T14:37:08.333054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.338061Z","title":"On non-approximability for quadratic programs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.338061Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:cca65753aaf0290a37291fa6354e223d19329f73f868e673c1b60e8bcda8fc59","observation_id":"64b937c1-8114-4693-ae35-7c3bd69d9082","resolution":{"observed_at":"2026-08-05T14:37:08.338061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.342474Z","title":"A fast and simple randomized parallel algorithm for the maximal independent set problem","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.342474Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6a926b31c60a92d232b3fcdd1cf2251cece8ce7f9288f62cc5ce212fb0986262","observation_id":"7d3acca7-5f19-435b-bc8e-9daf3f368b52","resolution":{"observed_at":"2026-08-05T14:37:08.342474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.346733Z","title":"Proving integrality gaps without knowing the linear program","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.346733Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:9ab46b74a660b78f7aed3d20f4d854c1a55dbf3e30e822cb3cc616600aab9cb9","observation_id":"e2b35fa8-b3c4-43e0-b16b-fafa575a23e9","resolution":{"observed_at":"2026-08-05T14:37:08.346733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.350870Z","title":"Proving integrality gaps without knowing the linear program","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.350870Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:52803964d673b4fad62d17db442534889176d8c5be4e60207d372b957f19ddec","observation_id":"2ffedcfe-5e81-4648-8b53-dde817320ff2","resolution":{"observed_at":"2026-08-05T14:37:08.350870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.355137Z","title":"Adversarially robust low dimensional representations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.355137Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6ad7b43f94cd16a6b2d419ad636d8a432902a73e8321589659c4a221089c4d73","observation_id":"ae21de97-d37c-4f20-b1b8-c97bfc32ac26","resolution":{"observed_at":"2026-08-05T14:37:08.355137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.359828Z","title":"On the usefulness of predicates","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.359828Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:57f7a3855fb3b56b9a7f062ae6074b0affcf5d8f862c0d30cd7b91612ac48a79","observation_id":"4b3fb0db-cf2b-470c-87d6-1ed371c7d308","resolution":{"observed_at":"2026-08-05T14:37:08.359828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.364311Z","title":"Topics in Banach space theory, volume 233 of Graduate Texts in Mathematics","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.364311Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:81b56b8363c116b15a6ab5ae018a98722c5a55a34adac09bc085e12c9591b5d3","observation_id":"e7eb07c8-4b8d-417e-9aca-299503eecdb5","resolution":{"observed_at":"2026-08-05T14:37:08.364311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.368306Z","title":"Topics in Banach space theory , volume 233","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.368306Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:c2da8a8a11470247cf5f78a22b1e6575babf9996bd9416917d5cdd27b22c056b","observation_id":"480e8f43-00f3-4dd1-b9b1-c6075b3594bb","resolution":{"observed_at":"2026-08-05T14:37:08.368306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.372401Z","title":"Quadratic forms on graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.372401Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6f1faadd1571804b629f2b1c69316a474f5a08bede23da7bdad3e2ca46b168f5","observation_id":"ce2a9e6c-f674-494a-ac56-765e48e8acbc","resolution":{"observed_at":"2026-08-05T14:37:08.372401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.377613Z","title":"Approximating the cut-norm via G rothendieck's inequality","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.377613Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:828d50c079bec2f173bad39bd41db2d00a7e5602189613df8b47401097baf0ff","observation_id":"647b83b0-d65a-4891-a24e-05aff1187277","resolution":{"observed_at":"2026-08-05T14:37:08.377613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.381701Z","title":"Woodruff","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.381701Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:a9ad7eb9855098ace5ac9c06f8a8bde494eb965063de38d2b4f26c61e30fa53c","observation_id":"a5bfc3be-32c7-4e75-8d06-833cb322bbd8","resolution":{"observed_at":"2026-08-05T14:37:08.381701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.385794Z","title":"Hypercontractivity, sum-of-squares proofs, and their applications","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.385794Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:f9eeaf4139450829b46c218350610116244a46eab8207fa8773f11df5033385f","observation_id":"d82348fc-d3e5-41f5-bb72-4a8549f2147e","resolution":{"observed_at":"2026-08-05T14:37:08.385794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.389784Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.389784Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:2788e68df594e6a8e4918e5508897d00be228ceee6510458404232ec8dfc4ba5","observation_id":"199127fb-c1f1-495b-8a9e-d61129f13996","resolution":{"observed_at":"2026-08-05T14:37:08.389784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.393926Z","title":"G rothendieck inequalities for semidefinite programs with rank constraint","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.393926Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:c7a643df34a4e2f2d32864969e08b4c8686c05da7d923aea52040e12f0448cf6","observation_id":"6e503168-514d-48c6-84b5-10c9777dacdb","resolution":{"observed_at":"2026-08-05T14:37:08.393926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.398585Z","title":"Weak decoupling, polynomial folds and approximate optimization over the sphere","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.398585Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:917488078579026d58551177311f1f539585d333fb03da08244ccd0010e8b898","observation_id":"14b5cc13-0f36-4fac-be74-f52760df59d9","resolution":{"observed_at":"2026-08-05T14:37:08.398585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.402864Z","title":"Deterministic and randomized polynomial-time approximation of radii","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.402864Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d4bdec1d97de02784765a5046709b17e07be388809139733058bbef3e02739e5","observation_id":"7a152d54-78b9-4b20-8809-aade892ea041","resolution":{"observed_at":"2026-08-05T14:37:08.402864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.00903","last_updated":"2017-06-17T12:59:47Z","snapshot_observed_at":"2026-07-06T04:54:57.841333Z","submitted_at":"2016-05-03T13:39:18Z","title":"Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.00903","snapshot_observed_at":"2026-08-05T14:37:08.406900Z","title":"Certifying random polynomials over the unit sphere via sum of squares hierarchy","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.406900Z"},"links":{"cited_paper":"/paper/1605.00903","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:236adac8eb14006de653d1964636213e82add611e288771d8efe2d4e0ebcf50c","observation_id":"7214f313-ac0c-427d-ae71-03d9710f3094","resolution":{"observed_at":"2026-08-05T14:37:08.406900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.411486Z","title":"SDP gaps from pairwise independence","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.411486Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:2e50c7eda33208047d370290bc9647335ff2126445411c873d65f29f5b31025b","observation_id":"f98e6118-bbd8-47d4-b3e1-c2f62312dd4c","resolution":{"observed_at":"2026-08-05T14:37:08.411486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.415619Z","title":"Quantum de finetti theorems under local measurements with applications","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.415619Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d3e9348a1050f293571109581bc1583c859fbc26c6449a564e93bbb95ead30f0","observation_id":"039d11f7-f67d-4499-8a9b-8c065b1672ef","resolution":{"observed_at":"2026-08-05T14:37:08.415619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1509.05065","last_updated":"2015-09-16T21:08:30Z","snapshot_observed_at":"2026-07-06T04:30:08.149201Z","submitted_at":"2015-09-16T21:08:30Z","title":"Estimating operator norms using covering nets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.05065","snapshot_observed_at":"2026-08-05T14:37:08.419816Z","title":"Estimating operator norms using covering nets","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.419816Z"},"links":{"cited_paper":"/paper/1509.05065","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:26715abe573fec040c05e3ad13617c51949f75b87c0861a21ea4dc6ec14cc3cc","observation_id":"ba1eb2fd-a554-4f0e-8c5f-f64986d96a42","resolution":{"observed_at":"2026-08-05T14:37:08.419816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.424529Z","title":"A nearly tight sum-of-squares lower bound for the planted clique problem","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.424529Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:847d817652d9f8b84a62ddb204b03eb15e5cc63a45d1cb3c35584070623b60c9","observation_id":"90ca19fa-5069-4416-a866-e14cb6645a9e","resolution":{"observed_at":"2026-08-05T14:37:08.424529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1101.2913","last_updated":"2011-01-14T21:30:47Z","snapshot_observed_at":"2026-07-06T02:22:03.632489Z","submitted_at":"2011-01-14T21:30:47Z","title":"Hypercontractivity and its applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1101.2913","snapshot_observed_at":"2026-08-05T14:37:08.429111Z","title":"Hypercontractivity and its applications","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.429111Z"},"links":{"cited_paper":"/paper/1101.2913","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d81c279ffab5b608d73a9d9107289ec114f84be9c869717500b48d01674aa5f8","observation_id":"0a0b0833-189d-49fb-9a56-cdf58274bb83","resolution":{"observed_at":"2026-08-05T14:37:08.429111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.433658Z","title":"Kelner, and David Steurer","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.433658Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:5576348d28fad6187ad8cb64bfa43fb12d7c8f9d500f90e44a3f22c055e148fb","observation_id":"6cb57b65-ae8a-4a3b-91ae-5dc1c4f3cc04","resolution":{"observed_at":"2026-08-05T14:37:08.433658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.437682Z","title":"Dictionary learning and tensor decomposition via the sum-of-squares method","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.437682Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:9adca11e308120ce3b9124a1cecc02689d6d426253ed1a9489ee7dbb09c70488","observation_id":"b481cdd0-567b-430f-8952-f745336fc5cf","resolution":{"observed_at":"2026-08-05T14:37:08.437682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.441842Z","title":"Kothari, and David Steurer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.441842Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:c3017be7320b2484208136a185f4f1ff41a02c8f0700403eccdc24483f13c8f5","observation_id":"4a1cc53f-ed80-4889-8d1b-35b7fd8eb302","resolution":{"observed_at":"2026-08-05T14:37:08.441842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.446252Z","title":"Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.446252Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:cfbf5b6126867b93b1d3715d5aa1d5b6cd0dc8e3333e7c03c3a836a13031113d","observation_id":"9b345509-ce5b-4e9b-91be-987d6a65723e","resolution":{"observed_at":"2026-08-05T14:37:08.446252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1501.06521","last_updated":"2016-02-18T16:37:39Z","snapshot_observed_at":"2026-08-04T16:50:30.021690Z","submitted_at":"2015-01-26T18:48:55Z","title":"Noisy Tensor Completion via the Sum-of-Squares Hierarchy","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1501.06521","snapshot_observed_at":"2026-08-05T14:37:08.450292Z","title":"Tensor prediction, rademacher complexity and random 3-xor","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.450292Z"},"links":{"cited_paper":"/paper/1501.06521","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:57953cb5a31e58e3c130d457fe4e0d7dc883b6cc68085be793117d1559f17dfb","observation_id":"aaff085e-d9a3-410f-9848-73567683ce61","resolution":{"observed_at":"2026-08-05T14:37:08.450292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.454547Z","title":"The G rothendieck constant is strictly smaller than K rivine's bound","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.454547Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:e0099b5ceedc2677c6434e59dc46649ae92cc3e755b44b4c36592244c38933bf","observation_id":"a6c4e39e-669f-43fe-8dcf-0695b0592ecb","resolution":{"observed_at":"2026-08-05T14:37:08.454547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.458523Z","title":"Briët , O","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.458523Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:e55f4ca3e705d040d196874a18c286799a823acb6ace939d75153b365c2ced67","observation_id":"d875875a-3e42-41b4-aa6b-25b992027269","resolution":{"observed_at":"2026-08-05T14:37:08.458523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.462714Z","title":"Additive error guarantees for weighted low rank approximation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.462714Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:e25379792672b430ea6b06c5bb22f3c25ba681f25351a3aa747f41d091a93c8b","observation_id":"4c7ba8d5-7e9c-4f2e-b014-40a4f74a3255","resolution":{"observed_at":"2026-08-05T14:37:08.462714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.467097Z","title":"Expansion in Proof Complexity","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.467097Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:de9638e86ad716960ac7efde268727b20f578bfd4a15fe209c98529c337bf369","observation_id":"0e44fb15-274f-42aa-8e4d-06fd937349b1","resolution":{"observed_at":"2026-08-05T14:37:08.467097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5236","last_updated":"2014-05-27T17:52:52Z","snapshot_observed_at":"2026-07-06T03:41:40.557510Z","submitted_at":"2014-04-21T16:24:13Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.5236","snapshot_observed_at":"2026-08-05T14:37:08.471227Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.471227Z"},"links":{"cited_paper":"/paper/1404.5236","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:3575e654f0447d56693721fa6cc59f5b40e8c21d522368816628add22b2270ff","observation_id":"eba85921-76d4-4da0-af48-9352326f0d70","resolution":{"observed_at":"2026-08-05T14:37:08.471227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.475702Z","title":"Invertibility of large submatrices with applications to the geometry of banach spaces and harmonic analysis","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.475702Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:4eff93ea8bc464e291190900b20b9b3eb175489c619bedf10d49cbd601f7a8a3","observation_id":"e307c384-1eea-42c3-a6a0-dd41453d76fa","resolution":{"observed_at":"2026-08-05T14:37:08.475702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.480164Z","title":"Random tensors and planted cliques","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.480164Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:411fae40f34c414e4ee0507dc1639774209c7469ad8213a3ddc44d0259e04944","observation_id":"fd07de95-cee0-4457-b99f-bd53c4c1f66d","resolution":{"observed_at":"2026-08-05T14:37:08.480164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.484418Z","title":"Approximating matrix p-norms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.484418Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:ff0f251656a2ad110770241b57990b33d830286b16cd0763c94b86a3876c17fa","observation_id":"cdda6c1e-a528-4e72-9670-77d9327ea000","resolution":{"observed_at":"2026-08-05T14:37:08.484418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.488624Z","title":"Approximating a finite metric by a small number of tree metrics","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.488624Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:1a3ad2c7a8a2196eadd47465ea12434f65850b261407906fde4974ff2443eba7","observation_id":"cd607ce7-6428-4d22-ba3a-4f30a1a3dbec","resolution":{"observed_at":"2026-08-05T14:37:08.488624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.492882Z","title":"The missing log in large deviations for triangle counts","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.492882Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d2f26fadad57a6a9b549d2d69b591caefffd810502a635d093b520c4584a8bc6","observation_id":"64e50671-36c1-4346-9be4-f5ebf912671d","resolution":{"observed_at":"2026-08-05T14:37:08.492882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.497257Z","title":"Lee, Prasad Raghavendra, and David Steurer","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.497257Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:64ff8bb16f4ac4f597daa753584af0ea21e5c61a3d12be05377800634df0bec4","observation_id":"df3a575e-e89a-414c-bc7d-fb388f41ebc4","resolution":{"observed_at":"2026-08-05T14:37:08.497257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.501361Z","title":"Local global tradeoffs in metric embeddings","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.501361Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:a1bb8c3c025d81365e92b9d1609bb2c348d3e684009f569043323f23614d2f67","observation_id":"e6ac96a6-680b-4aa3-ad7b-e8227c9a0d60","resolution":{"observed_at":"2026-08-05T14:37:08.501361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.507011Z","title":"Near-optimal algorithms for maximum constraint satisfaction problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.507011Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:732cc933c5ab9f58c62ee87753764647c39e0c2c63001983261a0278db566b6f","observation_id":"dc460176-785f-4212-8461-4be6faebbccf","resolution":{"observed_at":"2026-08-05T14:37:08.507011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.511443Z","title":"Integrality gaps for S herali- A dams relaxations","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.511443Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:262230417ac7073bb90e6d7f2185b31d0a611c4d2d807e0f35fc474ef84619a8","observation_id":"f1e15b56-2372-48de-af7d-a7537081ecba","resolution":{"observed_at":"2026-08-05T14:37:08.511443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.515727Z","title":"Factoring weakly compact operators","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.515727Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:de14345e3d0df98991212b2885b7e25ddf6e686fd6903a8a65382531d4c5fc2c","observation_id":"eef97ff9-519c-4fb2-8f3c-6e67ff453411","resolution":{"observed_at":"2026-08-05T14:37:08.515727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.519988Z","title":"Hopkins, Ankit Pensia, and Stefan Tiegel","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.519988Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:2c58ff47a9856f4faf69882c61b20bd655706ce2714dad92dc22afade055b2ff","observation_id":"a0a4c58d-33b0-4571-8ad0-bd9493bd227c","resolution":{"observed_at":"2026-08-05T14:37:08.519988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.524234Z","title":"The complexity of optimizing over a simplex, hypercube or sphere: a short survey","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.524234Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:c6d07366f0bb86aebf01b23fedf08e00e70a36a56e8d4e7b17c0a80638c037fb","observation_id":"15dbaec3-49b3-4856-8465-e85bccd829c4","resolution":{"observed_at":"2026-08-05T14:37:08.524234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.528508Z","title":"Upper tails for triangles","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.528508Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:af06caca239770e08d0c8abebaf6015e9856fc3c987526681b24bee0d28268dd","observation_id":"aa5c9146-b1c0-4550-b998-ee0716089738","resolution":{"observed_at":"2026-08-05T14:37:08.528508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.532968Z","title":"Tight upper tail bounds for cliques","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.532968Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:42e8b188f634a117ff1cb480610b30b5429ea9acfead9beee73cdfe50c45ecdc","observation_id":"cd74a8c2-cac1-4223-8814-6f6e40e4f05d","resolution":{"observed_at":"2026-08-05T14:37:08.532968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.537303Z","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.537303Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d8fff4bcf889ed1868c12701be720558245db3a54c114dd7ceab5b7a004b88e4","observation_id":"ec9526e7-fd2d-4312-9a37-f7aa8429cbae","resolution":{"observed_at":"2026-08-05T14:37:08.537303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.6867","last_updated":"2015-09-08T12:11:12Z","snapshot_observed_at":"2026-07-06T04:01:39.661870Z","submitted_at":"2014-11-25T13:44:21Z","title":"Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization","version":4},"cited_work":{"arxiv_id":"1411.6867","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.6867","snapshot_observed_at":"2026-08-05T14:37:09.071715Z","title":"Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization","venue":"math.OC","work_id":"225928b2-c859-4d21-81e4-b26a4b6be2da","year":2014},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.541605Z"},"links":{"cited_paper":"/paper/1411.6867","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:cd07ac3baabbef79cdd8f03d62ed1a05a9fe1d6f67483c54544ed9abf29b3283","observation_id":"ab676eac-6590-47e3-9675-6b992b3eeddf","resolution":{"observed_at":"2026-08-05T14:37:09.077277Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:08.545975Z","title":"An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.545975Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:414fd7b607b82cefff723267f26fc55275d20ff5ca0b9ecc3e942f1f953ccef9","observation_id":"3e760aec-13cd-41aa-8091-b3afd89afe10","resolution":{"observed_at":"2026-08-05T14:37:08.545975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.550509Z","title":"Decoupling: from dependence to independence","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.550509Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:db7efa884a5bc717a228b635d7742bc81061d2b11ab62c491c213b0789a790c8","observation_id":"3db426db-336a-424e-b65c-1b31452b086b","resolution":{"observed_at":"2026-08-05T14:37:08.550509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.554839Z","title":"Linear programming relaxations of maxcut","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.554839Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:22134e36b2c3baaa2b277267acecb5b0b4abe57efd2f9ff74f67b40fb39a7e27","observation_id":"48ac6d1d-e626-4c0a-a7e3-820489ce91e1","resolution":{"observed_at":"2026-08-05T14:37:08.554839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.559015Z","title":"Improved sum-of-squares lower bounds for hidden clique and hidden submatrix problems","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.559015Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:108e2c7ae118dd6a356e4dfbf9bbdb9bcc8a855d70562766b5449fc9bad94133","observation_id":"809ed4b8-73c8-4742-85d3-1404ea7a5df7","resolution":{"observed_at":"2026-08-05T14:37:08.559015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1210.5048","last_updated":"2013-06-22T13:20:59Z","snapshot_observed_at":"2026-07-06T02:57:57.703235Z","submitted_at":"2012-10-18T08:07:03Z","title":"Convergence of SDP hierarchies for polynomial optimization on the hypersphere","version":2},"cited_work":{"arxiv_id":"1210.5048","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.5048","snapshot_observed_at":"2026-08-05T14:37:09.048903Z","title":"Convergence of SDP hierarchies for polynomial optimization on the hypersphere","venue":"math.OC","work_id":"0fd575a5-5f98-474f-b770-0dbf5764ef19","year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.562947Z"},"links":{"cited_paper":"/paper/1210.5048","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:0cb066bca8766ff087f9f4e1c0199cea9cd1b2ae3f5a1f333446dd1de8ac3768","observation_id":"2330a12f-7aaf-4439-a2df-80eec0e4ef51","resolution":{"observed_at":"2026-08-05T14:37:09.053953Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:08.567050Z","title":"Relations between average case complexity and approximation complexity","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.567050Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:3b8a2da8ac74c258579655450acfdc33ded55b8598eeb6f8667783d9b909ec4c","observation_id":"46d760b9-03c4-4b9f-9b2b-0e3413aceb4e","resolution":{"observed_at":"2026-08-05T14:37:08.567050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.571026Z","title":"A new approach to the planted clique problem","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.571026Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:2eb8484dcbd5cc6b04792c6043d791063af3ff399199d864406d2c1395949fec","observation_id":"6cfad6e5-7355-42b2-8fc3-233844bb60ae","resolution":{"observed_at":"2026-08-05T14:37:08.571026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.574929Z","title":"The dimension of almost spherical sections of convex bodies","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.574929Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:20c83a1deb0e1545a743710193e3fa05ac6e360848ffb2cee7ddb2b5bec6c164","observation_id":"6f1c17e8-2d2f-4d72-a9ab-3918bca303b4","resolution":{"observed_at":"2026-08-05T14:37:08.574929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.578868Z","title":"Block diagonally dominant matrices and generalizations of the gerschgorin circle theorem","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.578868Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d706c16845812ea8ce9799b33c9d259310a6eed24fac9e9a2b94d9ea75c6ff99","observation_id":"ea784a2c-e79d-4c89-b4bc-a5d028d1b687","resolution":{"observed_at":"2026-08-05T14:37:08.578868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.584142Z","title":"Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.584142Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d10548c05f6e6ec7db31e219aa29b57d1efc12e15049f3df6d13edd3d025bfaa","observation_id":"90c21d91-eaf5-4de8-8cdb-003e425bc87a","resolution":{"observed_at":"2026-08-05T14:37:08.584142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.588475Z","title":"Estimating the matrix p q norm, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.588475Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:aa15eea65c0e212754a3710c600d1b5b6c47dc9552461992123bd7b45514a345","observation_id":"a0d4b0ed-9049-4984-9b23-1c0e3abe9776","resolution":{"observed_at":"2026-08-05T14:37:08.588475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.592632Z","title":"R \\'e sum \\'e de la th \\'e orie m \\'e trique des produits tensoriels topologiques","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.592632Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6e910506d4d09bedb34204ecb1e20913333fa3846b4b96da6027faff1ee7cd95","observation_id":"2013b5cc-7f16-46b3-8302-6778137c6fcf","resolution":{"observed_at":"2026-08-05T14:37:08.592632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.596469Z","title":"Bypassing UGC from some optimal geometric inapproximability results","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.596469Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:82ac33b627acd6319311b7aa426a75bb194e1322dbb38686a4b4307c77bddf19","observation_id":"bb32e1e5-31e4-48d1-b893-ad70c399e42c","resolution":{"observed_at":"2026-08-05T14:37:08.596469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.600424Z","title":"Goemans and David P","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.600424Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:4a56425ba288f3ce50770c6646d110a02e0d513fd83f45537ff89bc4a1e538d8","observation_id":"eee57747-45ed-43ac-970f-2b5df9ae0e59","resolution":{"observed_at":"2026-08-05T14:37:08.600424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.604517Z","title":"The best constants in the khintchine inequality","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.604517Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:8f25ccd9c96ee6ee2dc9a7db79b087c7352c0c478bc40bcccc057a97416908e6","observation_id":"6d5f8932-c1d0-48d8-a5f9-51aa61802c2b","resolution":{"observed_at":"2026-08-05T14:37:08.604517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.608571Z","title":"Clique is hard to approximate within n 1-&epsiv","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.608571Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:db28d4866269df1fac3b61dea01b6c0938d5ffa13d0b4f403d4c0f16e7c87713","observation_id":"08823d2a-f683-49ad-9d78-1c15bd1c8984","resolution":{"observed_at":"2026-08-05T14:37:08.608571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.612529Z","title":"Clique is hard to approximate within n^ 1-","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.612529Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:bc992ce9378948ab3611c341e792e0fddcdb0a7b5a7390ac71023c26fc2eb6ad","observation_id":"0b8539b0-0f7d-46ca-9b9e-719fc2ba9238","resolution":{"observed_at":"2026-08-05T14:37:08.612529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.617026Z","title":"Some optimal inapproximability results","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.617026Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:7633b49c2b03a9026da8d3e1f093b1aef5aeff5c0e58c82c30375e2c3e1fc9fe","observation_id":"8932f9a8-bc86-481c-aae6-9f792908858e","resolution":{"observed_at":"2026-08-05T14:37:08.617026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:37:08.620908Z","title":"Improved NP-Inapproximability for 2-Variable Linear Equations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.620908Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:f5d77207eeed73cc71f4bce813b139732501340c5f554ed288c5fe580f46b35c","observation_id":"62878f1b-eeeb-4e47-b98c-9adea5c4685c","resolution":{"observed_at":"2026-08-05T14:37:08.620908Z","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-05T14:37:11.561593Z","title":"The power of sum-of-squares for detecting hidden structures","venue":null,"work_id":"5458895c-b622-4d67-aba5-0bbd0f33c62d","year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.625029Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:f37bec37a66a5851f403d784410e4b3b2b04f4c57c910034e6dae9bbd4e08635","observation_id":"09ce1b6d-8641-48b0-b90a-71b9b5b89a80","resolution":{"observed_at":"2026-08-05T14:37:11.675588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:11.330609Z","title":"Approximation algorithms for homogeneous polynomial optimization with quadratic constraints","venue":null,"work_id":"87808800-a2e2-46c5-b1bc-74ff22a3cd5d","year":2010},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.629095Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:db77e0fdccbcc59d72d0b779a58277723c7a10882bc84e62f6bc287115935df1","observation_id":"c3ccf7b7-f49e-4eda-9c0b-6f7ff6b79c32","resolution":{"observed_at":"2026-08-05T14:37:11.438103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:11.114859Z","title":"Testing product states, quantum M erlin- A rthur games and tensor optimization","venue":null,"work_id":"c7a70eda-90f5-440e-a0c8-8228159c54f3","year":2013},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.633377Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:68d14513023637c5bfe7705144224c2148fc401728706dea5eb1685d2b80dfef","observation_id":"5a1dec0a-7c8f-4cae-ab2f-e0067a923d2f","resolution":{"observed_at":"2026-08-05T14:37:11.212640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.09306","last_updated":"2018-10-23T20:32:30Z","snapshot_observed_at":"2026-07-06T05:24:30.687281Z","submitted_at":"2016-12-29T21:01:01Z","title":"Limitations of semidefinite programs for separable states and entangled games","version":2},"cited_work":{"arxiv_id":"1612.09306","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.09306","snapshot_observed_at":"2026-08-05T14:37:09.027954Z","title":"Limitations of semidefinite programs for separable states and entangled games","venue":"quant-ph","work_id":"23901ddd-a3d1-47d6-ab6f-2702861d823b","year":2016},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.637404Z"},"links":{"cited_paper":"/paper/1612.09306","citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:d5fca86b518ec6d7adc31eeb9b0123bd1cfbc5beb28f058c45b90b4a83ba77cb","observation_id":"61722ad2-9bd6-4c9d-a39f-2181dc6e24a0","resolution":{"observed_at":"2026-08-05T14:37:09.032484Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.918748Z","title":"Tensor principal component analysis via sum-of-square proofs","venue":null,"work_id":"db8aca0c-5d8b-4585-bb45-abea3d71c098","year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.641715Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:ead8197b9219568c43e763f360950df88bfc3de7f959bfea2266fb587e44cb36","observation_id":"632bfb1c-8428-4c7d-bd49-c433d8ae7342","resolution":{"observed_at":"2026-08-05T14:37:10.995543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.701936Z","title":"On the advantage over a random assignment","venue":null,"work_id":"c7af1db2-69ca-4004-a9c2-fe61278732df","year":2004},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.645682Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:1e4406983cd2a2d3154f220348746f2dcd7ab0914177fb67de0f3aeb117265cf","observation_id":"82aed1d1-74ad-4673-9bcc-f3e1b0dde89a","resolution":{"observed_at":"2026-08-05T14:37:10.802616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.502750Z","title":"Stable distributions, pseudorandom generators, embeddings, and data stream computation","venue":null,"work_id":"f645d1f5-e4fb-4a6d-8d89-00e4cb2552f6","year":2006},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.650021Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:3110a3448720a4c8fa482651a061068b337f87fce3321ed36e429d938d5fe038","observation_id":"5b641452-bf95-4ee6-a730-55344433c2b9","resolution":{"observed_at":"2026-08-05T14:37:10.580396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.355510Z","title":"On the complexity of k-sat","venue":null,"work_id":"4294d957-6656-4682-af08-dd3a4e0b4a92","year":2001},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.654301Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:b777ac6fa478d2267711f705b4e811f010010ead5c48899f22616c77c785e379","observation_id":"7d7e077d-8e26-4808-a4d1-1a9e132be571","resolution":{"observed_at":"2026-08-05T14:37:10.444939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.166827Z","title":"Upper tails for subgraph counts in random graphs","venue":null,"work_id":"6cf0c13f-6ec1-431d-a99f-904263972f0b","year":2004},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.658241Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:0a8a5c6a437b1773491649bea0067becdb96deace9f0ce08114fb0ee729ef186","observation_id":"bfa52146-7c73-4bea-bc3f-9b02a4f62ec8","resolution":{"observed_at":"2026-08-05T14:37:10.232810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.118061Z","title":"Hardness results for coloring 3-colorable 3-uniform hypergraphs","venue":null,"work_id":"28e52c46-db9f-4040-994a-eaf0ae3f569f","year":2002},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.662257Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:3daad89180901dc4e92085f98772192369734a466792683aa5e0c0b09e9e4c98","observation_id":"7ba091fc-1bfa-4d3b-b8fb-3ed8e072e907","resolution":{"observed_at":"2026-08-05T14:37:10.139959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.082706Z","title":"On the power of unique 2-prover 1-round games","venue":null,"work_id":"161f0d40-29f1-43e2-98fe-bb6224e6e53a","year":2002},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.666254Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:55dd3ed4dedcfeb8f595df0b7ad628b75614ce3814309f2beeb6e9c9518f0fe2","observation_id":"dac993b0-1e27-4b96-9097-c71f9d5df33d","resolution":{"observed_at":"2026-08-05T14:37:10.095674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:10.032118Z","title":"On the power of unique 2-prover 1-round games","venue":null,"work_id":"f1677e47-88b4-46de-ab34-a3b336e555cd","year":2002},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.670084Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:bad87d068909d5c9f326ddf195623d23fb3696637ab693bb23296d7d886def5f","observation_id":"7dfa738b-7509-4442-886d-a92e7a8789bd","resolution":{"observed_at":"2026-08-05T14:37:10.050960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.991047Z","title":null,"venue":null,"work_id":"1b54dc36-8e8e-4b8c-a562-61a46e980238","year":2004},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.674234Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:442d41a4a21613b5649916b239690ec93d12d79376c8ee507b652414e155f89b","observation_id":"8de9ad9a-23b7-474e-a234-0082deaf7798","resolution":{"observed_at":"2026-08-05T14:37:10.005509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.968137Z","title":"Measured descent: A new embedding method for finite metrics","venue":null,"work_id":"72fe75d0-9bd0-4ce2-85c4-ffba9e735a2b","year":2005},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.678200Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6f1fd123651904d0de1e0f19ed71d1be6aad690932273a5d45d1f70f1d1026ba","observation_id":"1e77fd87-832d-4775-89b8-7fb1535cadc4","resolution":{"observed_at":"2026-08-05T14:37:09.976169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.953525Z","title":"Sum of squares lower bounds for refuting any CSP","venue":null,"work_id":"9cb36164-31db-4939-bd17-42621ec3be1f","year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.682451Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:7c1b73d4a40cf15f54cdbec4a4d20b2daba03a678dff4fb85f82ee86075acd83","observation_id":"98165419-e20f-4ee4-9811-62ba0dc8d322","resolution":{"observed_at":"2026-08-05T14:37:09.957865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.939332Z","title":"Kothari, Ryuhei Mori, Ryan O'Donnell, and David Witmer","venue":null,"work_id":"43b18ee4-956b-43bb-8c6b-81e11288b702","year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.686400Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:ec163a8c02633b69af7ed0f99e08124fc8c980392cab40c699abcd3d2daa3dae","observation_id":"0a5c4828-e0b1-450a-bdfe-418e98bdaf5e","resolution":{"observed_at":"2026-08-05T14:37:09.943816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.925040Z","title":"Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSP s","venue":null,"work_id":"2577d708-e1c1-46da-b33b-0e4967cdf772","year":2017},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.690653Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:6cd37496da4a04f05e15c6b19c5b8a00c228e960929ac9bcf7ecf6a35ef803b8","observation_id":"708286ca-8361-422d-be81-b8f6c90061d1","resolution":{"observed_at":"2026-08-05T14:37:09.929505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.910955Z","title":"Woodruff","venue":null,"work_id":"965dada1-4d10-4be1-9c80-f3b2b3f2b23a","year":2018},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.695630Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:e4dea36fe31cd0791224fb48fd86eae49de871ae4ee707d9dfffa81cccdaae23","observation_id":"c8be0600-febb-410a-89ef-7706aa31749c","resolution":{"observed_at":"2026-08-05T14:37:09.915018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.895564Z","title":"Linear equations modulo 2 and the l\\_1 diameter of convex bodies","venue":null,"work_id":"f18bd903-5efd-4b22-87a4-3b928704227a","year":2008},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.699987Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:0301c1992f9cf14e0cfc829126ad86aa8b088f8d97352716b6f08ed5691e5953","observation_id":"c37b9081-5fa1-4614-b046-8c8744a5c1a5","resolution":{"observed_at":"2026-08-05T14:37:09.900129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.881734Z","title":"Grothendieck-type inequalities in combinatorial optimization","venue":null,"work_id":"1b623968-f345-482c-a98d-ba33a417486a","year":2012},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.704118Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:7bf5c65445f44bd1894e49d26bf2b13890d9f203aa8fb65af6b67874751f1dd9","observation_id":"809d9b50-a4f9-451a-b080-7298a959d419","resolution":{"observed_at":"2026-08-05T14:37:09.886011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.868264Z","title":"The UGC hardness threshold of the L p G rothendieck problem","venue":null,"work_id":"8eca1f6b-6af2-436a-ac73-43cb5452a733","year":2010},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.708216Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:1f4af9fb99f74531a7db5ccb6735cfa13905fdeaa34061b9c6605704c686f28f","observation_id":"d5c7654f-36ad-4c91-8b7b-d22ee06612d1","resolution":{"observed_at":"2026-08-05T14:37:09.872418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.853797Z","title":"SDP gaps and UGC -hardness for Max-Cut-Gain","venue":null,"work_id":"0c5b80ed-1fc9-41fa-9d72-846b3f697606","year":2009},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.712386Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:b3419c3202deb0b359f616c45725b090422b0c66a023681c7358a0375993f545","observation_id":"11d86b67-cefa-4e7f-bcb4-29f7beb52132","resolution":{"observed_at":"2026-08-05T14:37:09.857806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.840194Z","title":"On the approximability of digraph ordering","venue":null,"work_id":"2fa9f859-735e-4202-82e5-8ee6c81fb625","year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.716621Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:4497745e7efcccfc7901cc442804856f15e1fdd3d12008e231c765088b5becf8","observation_id":"cb900073-b914-4389-bc22-99c9655d442d","resolution":{"observed_at":"2026-08-05T14:37:09.844554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.826297Z","title":"Sur la constante de G rothendieck","venue":null,"work_id":"c35db671-7e98-4395-a12e-dafa3f9dc89a","year":1977},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.720455Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:df107fc8fcfad10d8abf27434a1a158eba50e2571a78ae64f83685f44de38d8b","observation_id":"e52d1028-12ed-492d-9c66-b2ef31ce134d","resolution":{"observed_at":"2026-08-05T14:37:09.830425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.812364Z","title":"Sdp integrality gaps with local _1 -embeddability","venue":null,"work_id":"f5abc6ed-972e-4b8a-8dee-4c8144495fed","year":2009},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.724443Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:dc2bfce5400ba4ac2c8cac620cc3dd6b56c88d6602047bd4fd09e91a170bce95","observation_id":"47d28efe-7709-429d-b782-37fd45b69384","resolution":{"observed_at":"2026-08-05T14:37:09.816905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.796560Z","title":"Approximating CSP s using LP relaxation","venue":null,"work_id":"d9fe08da-a006-44e6-a387-c11fe10646fb","year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.728343Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:3d0e326d1f290ce55290f4a57416a39553447c6b1f5fac18e031ff766bea00b5","observation_id":"295924b8-2fec-42cb-8b2f-68f55a10114f","resolution":{"observed_at":"2026-08-05T14:37:09.801665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.781052Z","title":"The power of linear programming for general-valued CSP s","venue":null,"work_id":"dee6cdcb-97fa-44c2-93c6-fb6571ca03d2","year":2015},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.732201Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:70543772cb1b340e675d7a548bb1eef24cc152f61c4425cd0482651501bf3d49","observation_id":"dd07b0af-9c02-4792-b492-989277cf08ca","resolution":{"observed_at":"2026-08-05T14:37:09.785532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.766169Z","title":"A characterization of strong approximation resistance","venue":null,"work_id":"2dc82dfa-4c13-41d5-86d8-3ec83f622e59","year":2014},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.735967Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:9fa58d58704be13850c7f8483f761c481222cfd59d807abe3f85910921e7f67e","observation_id":"6516133c-b0fe-4fe7-9185-c4c25a57dc4a","resolution":{"observed_at":"2026-08-05T14:37:09.770895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.751891Z","title":"Divide and conquer martingales and the number of triangles in a random graph","venue":null,"work_id":"c85b1227-4c74-4870-915d-2f3e452f7b6d","year":2004},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.739808Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:41caefc7c8c1a89e7ca10140d0fac3ccf55c1ede53f1d7efb025abb0d2279b31","observation_id":"72386657-e1f2-44bc-a877-aa62d12e46fc","resolution":{"observed_at":"2026-08-05T14:37:09.756347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.737900Z","title":"Isomorphic characterizations of inner product spaces by orthogonal series with vector valued coefficients","venue":null,"work_id":"b4367b71-0026-4ab8-84bd-7a223731557d","year":1972},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.743584Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:687d0fd0c0bb8391e1dab33aafe83d30edc129787db0bb0f5775d256ab2fc9e2","observation_id":"ce254e55-e83c-4a75-80ff-7f1d620c77d6","resolution":{"observed_at":"2026-08-05T14:37:09.742126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:09.724022Z","title":"On operators factorizable through l_p space","venue":null,"work_id":"149c67f6-0de5-49be-8c15-807325555be9","year":1972},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.748020Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:a46d079bc89f278bce7e55a8d3a908184de699c0561372d0a752fb3f5118559f","observation_id":"a1f9ee55-a372-4e35-9616-36572f45e380","resolution":{"observed_at":"2026-08-05T14:37:09.728274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T14:37:08.751998Z","title":"Moments, positive polynomials and their applications , volume 1","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-05T14:37:08.751998Z"},"links":{"citing_paper":"/paper/2508.21327"},"observation_digest":"sha256:0bce9813d32599b548a8c6a86595f9bd612a3cfe0f7caad4fa71c35f4dae2b6c","observation_id":"b03e7d38-534c-4c1a-81a9-95326e91c289","resolution":{"observed_at":"2026-08-05T14:37:08.751998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.21327","last_updated":"2025-08-29T05:02:07Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T06:27:59.421119Z","submitted_at":"2025-08-29T05:02:07Z","title":"Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":68,"verified_exact":3,"verified_fuzzy":29},"total_outbound_references":141},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 141 outbound references and 0 inbound Pith citation observations for arXiv:2508.21327."}