{"as_of":"2026-08-21T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4faddf2b08152f89da69a30b832364b2e066314d57c9efa3e1a775425fcce307","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:48:38.488425Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.00333/citation-record","integrity":"/paper/2608.00333/integrity","json":"/paper/2608.00333/citation-record.json","paper":"/paper/2608.00333"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:48:31.628418Z","title":"The Quantum PCP conjecture","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:31.628418Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:4b9a5aa103b3876d276bc088d347f145aaaa708c876c255998edb9c9f6ce0b8a","observation_id":"8613cddb-7f4b-46d8-a2ea-a04f10700dac","resolution":{"observed_at":"2026-08-04T00:48:31.628418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15276","last_updated":"2025-04-21T17:59:02Z","snapshot_observed_at":"2026-08-16T11:26:54.535037Z","submitted_at":"2025-04-21T17:59:02Z","title":"Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15276","snapshot_observed_at":"2026-08-04T00:48:31.755841Z","title":"Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:31.755841Z"},"links":{"cited_paper":"/paper/2504.15276","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:4a7fe42328a66061ecb24da11f76fbb025786db845308b1e67a3611064ab1965","observation_id":"2d8dccee-35cb-4ce6-9bfc-5d7b460ae95c","resolution":{"observed_at":"2026-08-04T00:48:31.755841Z","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-04T00:48:31.954981Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:31.954981Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:230bfc9ad15489ce2c7c1bb940bbf5b5c270ca198f8007a2cbdae2beaae6912c","observation_id":"20952929-1e92-40ac-8fc9-b3a52e0ee983","resolution":{"observed_at":"2026-08-04T00:48:31.954981Z","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-04T00:48:32.104470Z","title":"Probabilistic checking of proofs: a new characterization of NP","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.104470Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:14fd2961f7fe55b2e3f6a3b5f8eed6ad0e0689f19c025d9a058a7f6f6495150b","observation_id":"e652eaee-260d-48a9-9374-e126c307bb62","resolution":{"observed_at":"2026-08-04T00:48:32.104470Z","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-04T00:48:32.298876Z","title":"New NP-hardness results for 3-Coloring and 2-to-1 Label Cover","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.298876Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:6314f6d4887ffaf3be796f0c1d1ca05d3222873a17ccb678158ff1ce75b5a282","observation_id":"ec9564ab-ee6d-467f-a204-88914c1418e0","resolution":{"observed_at":"2026-08-04T00:48:32.298876Z","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-04T00:48:32.433722Z","title":"Alan Taylor, Spherical rearrangements, subharmonic functions, and -functions in n -space, Duke Mathematical Journal (1976)","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.433722Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:da65e6394b422e44fc9647bae2e8fce93b2dbd963815dbf834473a9ee0d1cc4d","observation_id":"a0c2f9d1-0ed3-4c32-877f-ebaf57cbc16a","resolution":{"observed_at":"2026-08-04T00:48:32.433722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.14994","last_updated":"2026-05-14T15:56:29Z","snapshot_observed_at":"2026-08-14T03:24:39.773504Z","submitted_at":"2026-05-14T15:56:29Z","title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.14994","snapshot_observed_at":"2026-08-04T00:48:32.512123Z","title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.512123Z"},"links":{"cited_paper":"/paper/2605.14994","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:c97e9333d60f34b0938d2f7a3356b378b97917cb7ad30086120b54804cbb9bb6","observation_id":"abc76674-2d31-42bd-8308-ce645c612865","resolution":{"observed_at":"2026-08-04T00:48:32.512123Z","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-04T00:48:32.634105Z","title":"Free Bits, PCPs, and Nonapproximability---Towards Tight Results","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.634105Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:899ecca5e9cad57f2c191d4d3e73b1d0b4a9b38316f250fbb59fd7ad24c22395","observation_id":"ac7ca151-3fa0-49ac-bdd8-a6a2e3a9d778","resolution":{"observed_at":"2026-08-04T00:48:32.634105Z","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-04T00:48:32.758700Z","title":"Derandomised tensor product gap amplification for quantum Hamiltonians","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.758700Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:ad766a7b5ad60705009b0dcd314c8503aca2fe864f89a201f59bd182ad6a24c9","observation_id":"6b6eabfb-6001-4ff1-852c-ff08bad73928","resolution":{"observed_at":"2026-08-04T00:48:32.758700Z","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-04T00:48:32.870677Z","title":"An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:32.870677Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:77742c8fec1072e91e1fbe27988942798eaa431b6ea61e6405c370b1149238a0","observation_id":"fdee68e1-70f3-4d65-a973-596ce48ac02b","resolution":{"observed_at":"2026-08-04T00:48:32.870677Z","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-04T00:48:33.012252Z","title":"Geometric bounds on the Ornstein-Uhlenbeck velocity process","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.012252Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:d602788f200c6e1f4468e50db49cf8750dc3a0fe77f5c57947f2a14513a25bbc","observation_id":"d0ae9cf6-69a9-4138-b4d1-54ddb24a79fc","resolution":{"observed_at":"2026-08-04T00:48:33.012252Z","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-04T00:48:33.135584Z","title":"Tight approximability of MAX 2-SAT and relatives, under UGC","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.135584Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:deaa301e28a798cac0fd4f3e9ced396f890b1c1796c16ea010ab48e806ae05c4","observation_id":"2265bb70-30a7-4344-90c4-a0618727a428","resolution":{"observed_at":"2026-08-04T00:48:33.135584Z","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-04T00:48:33.270124Z","title":"Grothendieck inequalities for semidefinite programs with rank constraint","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.270124Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:1af244f56e8d29b361e3ff5f64745c10cb1edb71a2717e8afa713f66648fb5f9","observation_id":"2479195d-cf60-4ecd-a79e-e8ffbe593d54","resolution":{"observed_at":"2026-08-04T00:48:33.270124Z","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-04T00:48:33.371136Z","title":"Comparison theorems for exit times","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.371136Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:981183575d66d70d18f51e59a15eea6e6e681e92ef2b79c5913ff7276e8c35e5","observation_id":"ab1a73db-fd29-4fe9-aef8-bef9764a208f","resolution":{"observed_at":"2026-08-04T00:48:33.371136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10957","last_updated":"2024-02-21T04:29:01Z","snapshot_observed_at":"2026-08-21T05:42:47.675789Z","submitted_at":"2023-09-19T22:53:17Z","title":"Approximation Algorithms for Quantum Max-$d$-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10957","snapshot_observed_at":"2026-08-04T00:48:33.528792Z","title":"Approximation Algorithms for Quantum Max-d-Cut","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.528792Z"},"links":{"cited_paper":"/paper/2309.10957","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:dd8be5c6b45b8d00b3da0f6609ddb99376c814dfb15f468a2ead989cdecdde83","observation_id":"bacbe87a-506d-4a3a-a7e7-917f46a8ff3b","resolution":{"observed_at":"2026-08-04T00:48:33.528792Z","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-04T00:48:33.653819Z","title":"A generalization of the Lindeberg principle","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.653819Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:3fcdbb5f5c3b563f0588c0fec552b1b903675505b98fd713f970558f004339eb","observation_id":"589ad8bc-bb2d-4175-8b22-25a796750088","resolution":{"observed_at":"2026-08-04T00:48:33.653819Z","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-04T00:48:33.815171Z","title":"On Weighted vs Unweighted Versions of Combinatorial Optimization Problems","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.815171Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:576a2f6eaab1f406b70e69e881bbf904397e40ae8ec6ac94163033a5de441643","observation_id":"33af832e-b5ec-4db3-b0be-dd71b149fce9","resolution":{"observed_at":"2026-08-04T00:48:33.815171Z","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-04T00:48:33.952142Z","title":"Complexity classification of local Hamiltonian problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:33.952142Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:9e9ef9eb4a17149f88932a6c9ceb37016845d41e014f8f21144bc482c758d272","observation_id":"a989ae0e-8435-4807-8b4f-b08573b8dfd7","resolution":{"observed_at":"2026-08-04T00:48:33.952142Z","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-04T00:48:34.119884Z","title":"Analytical approach to parallel repetition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.119884Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:ab2e622485eb482482402efa4b34e32fd2753f55824fcbcb726f916bfa333f83","observation_id":"4eac6b73-6c45-4351-8c07-6fea308866a8","resolution":{"observed_at":"2026-08-04T00:48:34.119884Z","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-04T00:48:34.252002Z","title":"A two-sided estimate for the gaussian noise stability deficit","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.252002Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:3450f53d259507223db33f0dbe1f48907c73ba299b983cc3e22395d95212827f","observation_id":"c8ed61ad-0310-4955-b2c3-ed1e9946a46c","resolution":{"observed_at":"2026-08-04T00:48:34.252002Z","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-04T00:48:34.319799Z","title":"A threshold of n for approximating set cover","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.319799Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:96f3b6bad2a7b3b4bfa9a750e642445b4bf29c861b79b6fa049886966c23da8a","observation_id":"6ff62aad-731e-4aa0-bd5f-a076d7ce6830","resolution":{"observed_at":"2026-08-04T00:48:34.319799Z","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-04T00:48:34.449174Z","title":"On the optimality of the random hyperplane rounding technique for MAX CUT","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.449174Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:d2a44b30f9496b9c90cba54e7279778050fe4103c0f5a0e0c36180c40c44aec6","observation_id":"ece93c51-b9eb-46fd-bc54-4eb1633a0ffc","resolution":{"observed_at":"2026-08-04T00:48:34.449174Z","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-04T00:48:34.598216Z","title":"Algorithmica (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.598216Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:4f54775d8a35d7cfb19ffa44b9bb374b0337c622846990d7ccf4bb077f968970","observation_id":"81ecc24c-2e26-4464-804d-98c1d13fef6b","resolution":{"observed_at":"2026-08-04T00:48:34.598216Z","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-04T00:48:34.682009Z","title":"Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.682009Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:5edbd1f15557857db9f0df8bf458ebe79753520a85ec91193b16261b0fe0930d","observation_id":"d5b45627-62a9-4bc7-9b06-656284562ce4","resolution":{"observed_at":"2026-08-04T00:48:34.682009Z","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-04T00:48:34.768321Z","title":"Goemans and David P","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.768321Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:edfa17007c41ac58649db5781ba3d5cf32696227745fd492c348edf0da09bb8f","observation_id":"dd1f9412-e5f7-4d14-8c97-8a29a882bae8","resolution":{"observed_at":"2026-08-04T00:48:34.768321Z","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-04T00:48:34.873599Z","title":"Improved inapproximability results for Maximum k -Colorable Subgraph","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.873599Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:40e9245afa91fd03e9dc6a1a8828977da45bcd968c1dc28ec7a97b917e6c53d7","observation_id":"f44970a3-0588-450b-877f-97f70a91ab5c","resolution":{"observed_at":"2026-08-04T00:48:34.873599Z","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-04T00:48:34.986794Z","title":"Some optimal inapproximability results","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:34.986794Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:8ae2b063a1b4b50081b26acd9bc17079a78c76a4138322ff7ff51140b2d5da37","observation_id":"cd29d1f4-d559-4990-9524-4a37e7a79428","resolution":{"observed_at":"2026-08-04T00:48:34.986794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11216","last_updated":"2022-09-22T17:55:49Z","snapshot_observed_at":"2026-08-18T17:02:11.528678Z","submitted_at":"2022-09-22T17:55:49Z","title":"Hyperstable Sets with Voting and Algorithmic Hardness Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11216","snapshot_observed_at":"2026-08-04T00:48:35.109595Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.109595Z"},"links":{"cited_paper":"/paper/2209.11216","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:f9a26268705cc9bc9994681f2ae45373ed3685be7a7db224fc67d5a0d3514cea","observation_id":"a0436550-f68f-44a3-89e4-70573bc61fab","resolution":{"observed_at":"2026-08-04T00:48:35.109595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03312","last_updated":"2023-08-09T16:52:53Z","snapshot_observed_at":"2026-08-17T13:11:21.417225Z","submitted_at":"2023-06-05T23:45:30Z","title":"Three Candidate Plurality is Stablest for Correlations at most 1/10","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03312","snapshot_observed_at":"2026-08-04T00:48:35.235917Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.235917Z"},"links":{"cited_paper":"/paper/2306.03312","citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:e5938bb439d33da2c15bb9bf1285a3a21cc43169ea860a0bd4a358ed7c14658b","observation_id":"b2ba17ff-500a-4611-a7e1-d62834175dbd","resolution":{"observed_at":"2026-08-04T00:48:35.235917Z","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-04T00:48:35.334934Z","title":"Sphere valued noise stability and quantum MAX-CUT hardness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.334934Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:ab1fc77ceb5884877795ab2ec7e48d51c31146a75d60aa44633131bb9485f088","observation_id":"84f8a1cd-0f56-405f-9745-22c4a1ee838d","resolution":{"observed_at":"2026-08-04T00:48:35.334934Z","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-04T00:48:35.414217Z","title":"Standard simplices and pluralities are not the most noise stable","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.414217Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:249ce4ceef5daf989aa73a3807e2b16e8280b69556d669d9452d62a8cb348c34","observation_id":"2ed1aeae-768b-4f62-a22d-313f36fe08dd","resolution":{"observed_at":"2026-08-04T00:48:35.414217Z","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-04T00:48:35.486456Z","title":"Three candidate plurality is stablest for small correlations, Forum of Mathematics, Sigma (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.486456Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:9cb646fd9339f678ef87530c6e1f26464cae92e7049446b5b3c011a7dbc8c800","observation_id":"08cb666f-8bea-4446-9bfd-475a26adcdf4","resolution":{"observed_at":"2026-08-04T00:48:35.486456Z","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-04T00:48:35.587218Z","title":"Zur Theorie des Ferromagnetismus","venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.587218Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:7c20eca69d94141931452d23906f13a96417fa3d0a7afd730f1531ef3af6fba1","observation_id":"f1f34b48-281c-49c8-8069-36dfd5e40d7c","resolution":{"observed_at":"2026-08-04T00:48:35.587218Z","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-04T00:48:35.648232Z","title":"Hochbaum, David B","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.648232Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:86885387d15b7729b32a6341f91e8c2da786811210baf94e63dfe37b91174205","observation_id":"bda23981-7b6d-4430-b660-c04380fa0ee8","resolution":{"observed_at":"2026-08-04T00:48:35.648232Z","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-04T00:48:35.780792Z","title":"Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.780792Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:960340b793c59c4b1c20f4cdbcad03c87ef91bdcbd1e0e9545d9ed8cfb5d8aaa","observation_id":"d8e499bd-0d32-420a-a8c9-4cca28e38c9a","resolution":{"observed_at":"2026-08-04T00:48:35.780792Z","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-04T00:48:35.883612Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.883612Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:fee114aaceb2640335d148bbffb3d3f6c1b38068e4944a6bbe759566afa72b7c","observation_id":"6dcef00e-32ea-46ae-b60b-1c2c5a2976ef","resolution":{"observed_at":"2026-08-04T00:48:35.883612Z","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-04T00:48:35.974624Z","title":"On the hardness of approximating MAX k -CUT and its dual","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:35.974624Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:9518a1268253133070f026824df11b2359e9e9d3f165310b7c7db2b3215f6e9c","observation_id":"254317c5-cba8-4a76-a280-6d0c201d50fa","resolution":{"observed_at":"2026-08-04T00:48:35.974624Z","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-04T00:48:36.079325Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.079325Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:e094d2e8d29e8af1d983d0c831e5e7c8b5ec6f683cca33c27d25496c1a08913e","observation_id":"9316fa2a-6cb7-4080-8225-c769d1962a49","resolution":{"observed_at":"2026-08-04T00:48:36.079325Z","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-04T00:48:36.178961Z","title":"On the power of unique 2-prover 1-round games","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.178961Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:206530f48a1fcc7436c3b944d6b946c868f7608549044276c615c889a0b517c1","observation_id":"8e150786-b6f0-4078-b907-1cf718edf18f","resolution":{"observed_at":"2026-08-04T00:48:36.178961Z","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-04T00:48:36.263835Z","title":"37 (1), pp","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.263835Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:9d16402b26d78c5f7663d7c4fe0833e8d212402afb52ff27660b87f4ed5798de","observation_id":"a385d673-02ce-4073-a491-6884829ec821","resolution":{"observed_at":"2026-08-04T00:48:36.263835Z","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-04T00:48:36.348794Z","title":"Vertex cover might be hard to approximate to within 2-","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.348794Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:ddb11925a0407e4ab2f4475ab6a42623f98e40509fc7824f9143b6edc6bcdeee","observation_id":"003203dc-36fc-4c32-9eef-9e5e59f99ad4","resolution":{"observed_at":"2026-08-04T00:48:36.348794Z","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-04T00:48:36.435422Z","title":"On the unique games conjecture","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.435422Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:3a8b8d47b5ef16801f2b5505f9207a652dc7addfacaff7f68b1a84f9ba17fb46","observation_id":"1fb98c48-6c7e-417c-8141-6ed8721a1e1c","resolution":{"observed_at":"2026-08-04T00:48:36.435422Z","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-04T00:48:36.527538Z","title":"Sharp kernel clustering algorithms and their associated Grothendieck inequalities","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.527538Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:c0be9ddbffc2f8a771793022122c0d26be7d4e063df82729e8d164f60262cb37","observation_id":"81fb6354-3205-4803-832d-c74de8be5fd9","resolution":{"observed_at":"2026-08-04T00:48:36.527538Z","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-04T00:48:36.632405Z","title":"Pseudorandom sets in Grassmann graph have near-perfect expansion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.632405Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:585ed2f8407bdd42a5ae944962ecdaff06837243ec461fefa35f8b6292da0a37","observation_id":"b25940c3-fec8-400f-b426-e98aea2cd955","resolution":{"observed_at":"2026-08-04T00:48:36.632405Z","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-04T00:48:36.738519Z","title":"Semigroup proofs of the isoperimetric inequality in Euclidean and Gauss space","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.738519Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:3611ce8cdf258e5beadf1ec53f0dc22f7eadab9477137f08f9e16d002a6240c9","observation_id":"cb5807a2-02cb-4882-bff8-4e706266d2b9","resolution":{"observed_at":"2026-08-04T00:48:36.738519Z","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-04T00:48:36.824212Z","title":"Robust optimality of Gaussian noise stability","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.824212Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:8744f4200d76eee696160c2cce8ce45d864f918b9d9497811f6b08515eee5094","observation_id":"7a356078-989e-4f17-9dd0-9f29f40421b9","resolution":{"observed_at":"2026-08-04T00:48:36.824212Z","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-04T00:48:36.903261Z","title":"Noise stability of functions with low influences: invariance and optimality","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:36.903261Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:98e950b6730943c0f99c06f37dfc03f9bd2d20f994b2e9009213a0ba1c1e18d3","observation_id":"c90e5150-1cdb-40b8-bad6-a3b37bdab508","resolution":{"observed_at":"2026-08-04T00:48:36.903261Z","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-04T00:48:37.021940Z","title":"Reinforced generation of combinatorial structures: Hardness of approximation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.021940Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:d2f0ab9294929c7968c5e57d480a6ba284cf800980222e9f771261c18c9b60f1","observation_id":"53a3fa51-e7a2-4d37-87f9-50f6b8aa6eda","resolution":{"observed_at":"2026-08-04T00:48:37.021940Z","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-04T00:48:37.164427Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.164427Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:1b5e82a1c6d1c84c1cc3f7194e10854c23e6476218e8b9cb64e3a0b19cdc044c","observation_id":"f40e7aa7-7039-4d51-897e-ed983ee28b0b","resolution":{"observed_at":"2026-08-04T00:48:37.164427Z","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-04T00:48:37.336713Z","title":"Optimization, approximation, and complexity classes","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.336713Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:d9634e06ee3fb0220e81766330fd591d93007f99c155c4cacda79cad55c81bce","observation_id":"7aa380ec-72dd-48b6-b42d-68f32ce6edb7","resolution":{"observed_at":"2026-08-04T00:48:37.336713Z","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-04T00:48:37.493108Z","title":"The complexity of antiferromagnetic interactions and 2D lattices","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.493108Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:d1fa2092a88610f279e2a33290693292102dba5394eadf5c4967ed91ed9cfe44","observation_id":"cb47b21a-f736-4669-b4f1-9e8b49c3749c","resolution":{"observed_at":"2026-08-04T00:48:37.493108Z","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-04T00:48:37.708705Z","title":"Quantum Max-Cut is NP hard to approximate","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.708705Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:0f809f475989f3c2fc2178ea9351a8651cd1f2c3f22f49790750a7b13ea5cbc0","observation_id":"f79e827c-c8fa-4cad-8016-945f562c7fdb","resolution":{"observed_at":"2026-08-04T00:48:37.708705Z","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-04T00:48:37.883445Z","title":"Optimal algorithms and inapproximability results for every CSP?","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:37.883445Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:39545fc3217b384aa8d760dc970bd1807816f5121e4dd5d20ff553460fc23b4f","observation_id":"9723803b-b512-420a-a378-5abc50fe4532","resolution":{"observed_at":"2026-08-04T00:48:37.883445Z","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-04T00:48:38.022666Z","title":"Towards Computing the Grothendieck Constant","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:38.022666Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:6abac9ea636646f2e82e6f6abdf00d0382b6a2791c98c5fae78c407902b2fe76","observation_id":"4d26186b-9eaf-490c-97e8-9f7eff3f70f8","resolution":{"observed_at":"2026-08-04T00:48:38.022666Z","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-04T00:48:38.225865Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:38.225865Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:a6b7dc923fa82c8a85094acea0d8b2b1c5f4ffa7b0a06c6939f694c566c53737","observation_id":"5f37c018-4260-4f63-a2c4-9c9beb377f0f","resolution":{"observed_at":"2026-08-04T00:48:38.225865Z","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-04T00:48:38.363722Z","title":"P-complete approximation problems","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:38.363722Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:37b09dc878e6839c5794aa4a0df2569f58dd0f1e4afcc55ef5195cc3edb4d517","observation_id":"2c599dc6-4c5b-4378-9843-0b6686e6a8e7","resolution":{"observed_at":"2026-08-04T00:48:38.363722Z","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-04T00:48:38.488425Z","title":"Sorkin, Madhu Sudan, and David P","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-04T00:48:38.488425Z"},"links":{"citing_paper":"/paper/2608.00333"},"observation_digest":"sha256:ecb6d42e75d6f24da5ba7fed5ae9f6c34745d5038f0f7e04dc7fc1c399d96747","observation_id":"6a673e4f-1342-487b-915a-f55fbd2d89d6","resolution":{"observed_at":"2026-08-04T00:48:38.488425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00333","last_updated":"2026-07-31T22:53:00Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-14T03:25:52.326465Z","submitted_at":"2026-07-31T22:53:00Z","title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":57},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2608.00333."}