Paper Citation Record · LEDGER

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2608.00333 v1

Coverage vector

measured 57 of 57 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T00:48:38.488425Z

measured 57 of 57 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

57 of 57 outbound references displayed

verified exact0
verified fuzzy0
unresolved57
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8613cddb-7f4b-46d8-a2ea-a04f10700dac · outbound

This paper cites The Quantum PCP conjecture.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT The Quantum PCP conjecture

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:31.628418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d8dccee-35cb-4ce6-9bfc-5d7b460ae95c · outbound

This paper cites Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:31.755841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20952929-1e92-40ac-8fc9-b3a52e0ee983 · outbound

This paper cites Proof verification and the hardness of approximation problems.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Proof verification and the hardness of approximation problems

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:31.954981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e652eaee-260d-48a9-9374-e126c307bb62 · outbound

This paper cites Probabilistic checking of proofs: a new characterization of NP.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Probabilistic checking of proofs: a new characterization of NP

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.104470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec9564ab-ee6d-467f-a204-88914c1418e0 · outbound

This paper cites New NP-hardness results for 3-Coloring and 2-to-1 Label Cover.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT New NP-hardness results for 3-Coloring and 2-to-1 Label Cover

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.298876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0c2f9d1-0ed3-4c32-877f-ebaf57cbc16a · outbound

This paper cites Alan Taylor, Spherical rearrangements, subharmonic functions, and -functions in n -space, Duke Mathematical Journal (1976).

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Alan Taylor, Spherical rearrangements, subharmonic functions, and -functions in n -space, Duke Mathematical Journal (1976)

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.433722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abc76674-2d31-42bd-8308-ce645c612865 · outbound

This paper cites Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.512123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac7ca151-3fa0-49ac-bdd8-a6a2e3a9d778 · outbound

This paper cites Free Bits, PCPs, and Nonapproximability---Towards Tight Results.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Free Bits, PCPs, and Nonapproximability---Towards Tight Results

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.634105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b6eabfb-6001-4ff1-852c-ff08bad73928 · outbound

This paper cites Derandomised tensor product gap amplification for quantum Hamiltonians.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Derandomised tensor product gap amplification for quantum Hamiltonians

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.758700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fdee68e1-70f3-4d65-a973-596ce48ac02b · outbound

This paper cites An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:32.870677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0ae9cf6-69a9-4138-b4d1-54ddb24a79fc · outbound

This paper cites Geometric bounds on the Ornstein-Uhlenbeck velocity process.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Geometric bounds on the Ornstein-Uhlenbeck velocity process

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.012252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2265bb70-30a7-4344-90c4-a0618727a428 · outbound

This paper cites Tight approximability of MAX 2-SAT and relatives, under UGC.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Tight approximability of MAX 2-SAT and relatives, under UGC

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.135584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2479195d-cf60-4ecd-a79e-e8ffbe593d54 · outbound

This paper cites Grothendieck inequalities for semidefinite programs with rank constraint.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Grothendieck inequalities for semidefinite programs with rank constraint

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.270124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab1a73db-fd29-4fe9-aef8-bef9764a208f · outbound

This paper cites Comparison theorems for exit times.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Comparison theorems for exit times

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.371136Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bacbe87a-506d-4a3a-a7e7-917f46a8ff3b · outbound

This paper cites Approximation Algorithms for Quantum Max-$d$-Cut.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Approximation Algorithms for Quantum Max-$d$-Cut

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.528792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 589ad8bc-bb2d-4175-8b22-25a796750088 · outbound

This paper cites A generalization of the Lindeberg principle.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT A generalization of the Lindeberg principle

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.653819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33af832e-b5ec-4db3-b0be-dd71b149fce9 · outbound

This paper cites On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT On Weighted vs Unweighted Versions of Combinatorial Optimization Problems

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.815171Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a989ae0e-8435-4807-8b4f-b08573b8dfd7 · outbound

This paper cites Complexity classification of local Hamiltonian problems.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Complexity classification of local Hamiltonian problems

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:33.952142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4eac6b73-6c45-4351-8c07-6fea308866a8 · outbound

This paper cites Analytical approach to parallel repetition.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Analytical approach to parallel repetition

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.119884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8ed61ad-0310-4955-b2c3-ed1e9946a46c · outbound

This paper cites A two-sided estimate for the gaussian noise stability deficit.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT A two-sided estimate for the gaussian noise stability deficit

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.252002Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ff62aad-731e-4aa0-bd5f-a076d7ce6830 · outbound

This paper cites A threshold of n for approximating set cover.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT A threshold of n for approximating set cover

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.319799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ece93c51-b9eb-46fd-bc54-4eb1633a0ffc · outbound

This paper cites On the optimality of the random hyperplane rounding technique for MAX CUT.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT On the optimality of the random hyperplane rounding technique for MAX CUT

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.449174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81ecc24c-2e26-4464-804d-98c1d13fef6b · outbound

This paper cites Algorithmica (1997).

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Algorithmica (1997)

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.598216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d5b45627-62a9-4bc7-9b06-656284562ce4 · outbound

This paper cites Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.682009Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd1f9412-e5f7-4d14-8c97-8a29a882bae8 · outbound

This paper cites Goemans and David P.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Goemans and David P

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.768321Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f44970a3-0588-450b-877f-97f70a91ab5c · outbound

This paper cites Improved inapproximability results for Maximum k -Colorable Subgraph.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Improved inapproximability results for Maximum k -Colorable Subgraph

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.873599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd29d1f4-d559-4990-9524-4a37e7a79428 · outbound

This paper cites Some optimal inapproximability results.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Some optimal inapproximability results

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:34.986794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0436550-f68f-44a3-89e4-70573bc61fab · outbound

This paper cites Hyperstable Sets with Voting and Algorithmic Hardness Applications.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Hyperstable Sets with Voting and Algorithmic Hardness Applications

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.109595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2ba17ff-500a-4611-a7e1-d62834175dbd · outbound

This paper cites Three Candidate Plurality is Stablest for Correlations at most 1/10.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Three Candidate Plurality is Stablest for Correlations at most 1/10

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.235917Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84f8a1cd-0f56-405f-9745-22c4a1ee838d · outbound

This paper cites Sphere valued noise stability and quantum MAX-CUT hardness.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Sphere valued noise stability and quantum MAX-CUT hardness

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.334934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ed1aeae-768b-4f62-a22d-313f36fe08dd · outbound

This paper cites Standard simplices and pluralities are not the most noise stable.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Standard simplices and pluralities are not the most noise stable

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.414217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08cb666f-8bea-4446-9bfd-475a26adcdf4 · outbound

This paper cites Three candidate plurality is stablest for small correlations, Forum of Mathematics, Sigma (2021).

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Three candidate plurality is stablest for small correlations, Forum of Mathematics, Sigma (2021)

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.486456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1f34b48-281c-49c8-8069-36dfd5e40d7c · outbound

This paper cites Zur Theorie des Ferromagnetismus.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Zur Theorie des Ferromagnetismus

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.587218Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bda23981-7b6d-4430-b660-c04380fa0ee8 · outbound

This paper cites Hochbaum, David B.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Hochbaum, David B

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.648232Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8e499bd-0d32-420a-a8c9-4cca28e38c9a · outbound

This paper cites Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.780792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6dcef00e-32ea-46ae-b60b-1c2c5a2976ef · outbound

This paper cites an unresolved cited work.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.883612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 254317c5-cba8-4a76-a280-6d0c201d50fa · outbound

This paper cites On the hardness of approximating MAX k -CUT and its dual.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT On the hardness of approximating MAX k -CUT and its dual

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:35.974624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9316fa2a-6cb7-4080-8225-c769d1962a49 · outbound

This paper cites an unresolved cited work.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.079325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e150786-b6f0-4078-b907-1cf718edf18f · outbound

This paper cites On the power of unique 2-prover 1-round games.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT On the power of unique 2-prover 1-round games

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.178961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a385d673-02ce-4073-a491-6884829ec821 · outbound

This paper cites 37 (1), pp.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT 37 (1), pp

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.263835Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 003203dc-36fc-4c32-9eef-9e5e59f99ad4 · outbound

This paper cites Vertex cover might be hard to approximate to within 2-.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Vertex cover might be hard to approximate to within 2-

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.348794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1fb98c48-6c7e-417c-8141-6ed8721a1e1c · outbound

This paper cites On the unique games conjecture.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT On the unique games conjecture

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.435422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81fb6354-3205-4803-832d-c74de8be5fd9 · outbound

This paper cites Sharp kernel clustering algorithms and their associated Grothendieck inequalities.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Sharp kernel clustering algorithms and their associated Grothendieck inequalities

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.527538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b25940c3-fec8-400f-b426-e98aea2cd955 · outbound

This paper cites Pseudorandom sets in Grassmann graph have near-perfect expansion.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Pseudorandom sets in Grassmann graph have near-perfect expansion

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.632405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb5807a2-02cb-4882-bff8-4e706266d2b9 · outbound

This paper cites Semigroup proofs of the isoperimetric inequality in Euclidean and Gauss space.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Semigroup proofs of the isoperimetric inequality in Euclidean and Gauss space

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.738519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a356078-989e-4f17-9dd0-9f29f40421b9 · outbound

This paper cites Robust optimality of Gaussian noise stability.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Robust optimality of Gaussian noise stability

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.824212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c90e5150-1cdb-40b8-bad6-a3b37bdab508 · outbound

This paper cites Noise stability of functions with low influences: invariance and optimality.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Noise stability of functions with low influences: invariance and optimality

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:36.903261Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53a3fa51-e7a2-4d37-87f9-50f6b8aa6eda · outbound

This paper cites Reinforced generation of combinatorial structures: Hardness of approximation.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Reinforced generation of combinatorial structures: Hardness of approximation

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.021940Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f40e7aa7-7039-4d51-897e-ed983ee28b0b · outbound

This paper cites an unresolved cited work.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Unresolved cited work

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.164427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7aa380ec-72dd-48b6-b42d-68f32ce6edb7 · outbound

This paper cites Optimization, approximation, and complexity classes.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Optimization, approximation, and complexity classes

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.336713Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb47b21a-f736-4669-b4f1-9e8b49c3749c · outbound

This paper cites The complexity of antiferromagnetic interactions and 2D lattices.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT The complexity of antiferromagnetic interactions and 2D lattices

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.493108Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f79e827c-c8fa-4cad-8016-945f562c7fdb · outbound

This paper cites Quantum Max-Cut is NP hard to approximate.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Quantum Max-Cut is NP hard to approximate

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.708705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9723803b-b512-420a-a378-5abc50fe4532 · outbound

This paper cites Optimal algorithms and inapproximability results for every CSP?.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Optimal algorithms and inapproximability results for every CSP?

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:37.883445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d26186b-9eaf-490c-97e8-9f7eff3f70f8 · outbound

This paper cites Towards Computing the Grothendieck Constant.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Towards Computing the Grothendieck Constant

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:38.022666Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f37c018-4260-4f63-a2c4-9c9beb377f0f · outbound

This paper cites an unresolved cited work.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Unresolved cited work

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:38.225865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c599dc6-4c5b-4378-9843-0b6686e6a8e7 · outbound

This paper cites P-complete approximation problems.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT P-complete approximation problems

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:38.363722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a673e4f-1342-487b-915a-f55fbd2d89d6 · outbound

This paper cites Sorkin, Madhu Sudan, and David P.

Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT Sorkin, Madhu Sudan, and David P

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-04T00:48:38.488425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.