On the completeness of contraction map proof method for holographic entropy inequalities

Joydeep Naskar; Keiichiro Furuya; Ning Bao

REVIEW 3 major objections 4 minor 1 cited by

On the completeness of contraction map proof method for holographic entropy inequalities

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that every valid holographic entropy inequality has a contraction map, making the standard proof method complete for this class.

desk verdict A plausible and clearly written attack on the completeness question, but the central contradiction argument rests on a graph construction that is not yet shown to be a holographic geometry. read the letter →

arxiv 2506.18086 v3 pith:OR2VEOOC submitted 2025-06-22 hep-th math-phmath.MPquant-ph

Ning Bao , Keiichiro Furuya , Joydeep Naskar This is my paper · ORCID

classification hep-thmath-phmath.MPquant-ph

keywords holographicentropyinequalitiescontractionmapconeRyu-TakayanagiformulapartialcubesRT-regiongraphgeometry-graphdualityentanglement

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper answers, in the affirmative, the open question of whether the contraction map proof method is complete for linear holographic entropy inequalities with rational coefficients. Its central theorem states that a candidate inequality with positive integer coefficients is a valid holographic entropy inequality if and only if there exists a contraction map between two bitstring hypercubes that respects boundary homology conditions. The proof works by showing that any non-contraction map leaves a proper cubical subgraph in its preimage, and that replacing the missing edges by virtual edges of infinite weight produces a graph whose discrete entropies violate the inequality. Since by the geometry-graph duality such a graph corresponds to a holographic geometry obeying the RT formula, an inequality without a contraction map cannot be valid. If correct, the result upgrades the contraction map method from a proof technique to a complete characterization of this class of inequalities.

What carries the argument

The load-bearing object is the contraction map $f:\{0,1\}^M \to \{0,1\}^N$, defined by the condition that Hamming distance never increases, together with its graph-theoretic realization as a graph map between hypercubes. The proof centers on the nontrivial preimage $P(\Phi_f(H^M))$: for a contraction map this preimage is the full $M$-dimensional hypercube, while for a non-contraction map it is a proper cubical subgraph with missing edges. The missing edges, called virtual edges, are assigned infinite weight in the RT-region graph, a graph whose vertices are bulk regions and whose weighted edges record crossings of RT surfaces. These virtual edges make the discrete entropy of the LHS divergent while the RHS stays finite, which is the mechanism that produces a violating holographic geometry.

What would settle it

Take the set of all candidate linear inequalities with positive integer coefficients and a fixed party number, and for each one without a boundary-compatible contraction map search for a positive edge-weight assignment on a connected bitstring subset that satisfies the inequality; the theorem predicts the search always finds a violation, so a single no-contraction-map inequality that survives all such assignments would refute it. Equivalently, exhibiting a smooth holographic geometry whose continuous RT entropies cannot be matched by any discrete RT-region graph would break the geometry-graph duality on which the contradiction argument rests.

Watch

Extended reading notes

Core claim

The paper's central claim is that validity of a linear holographic entropy inequality and existence of a contraction map are equivalent. Given an inequality $\sum_i \alpha_i S_{P_i} \ge \sum_j \beta_j S_{Q_j}$ with positive integer coefficients $\alpha_i,\beta_j$, set $M=\sum_i\alpha_i$ and $N=\sum_j\beta_j$; the paper claims there is a contraction map $f:\{0,1\}^M \to \{0,1\}^N$, mapping the occurrence bitstrings of the LHS subregions to those of the RHS, if and only if every holographic geometry satisfying the RT formula obeys the inequality. The converse is established by contradiction: assuming a valid inequality has no contraction map, every candidate map is non-contractive, which forces the preimage of the image graph to be a proper subgraph of the hypercube. In that subgraph, the edges that a non-contractive map collapses are treated as virtual edges with infinite weight; the resulting RT-region graph gives a holographic geometry for which the LHS discrete entropy is infinite while the RHS is finite, violating the inequality. Hence the supposed valid inequality fails, so no valid inequality can lack a contraction map.

Load-bearing premise

The proof assumes that every holographic geometry obeying the RT formula can be replaced, for entropy purposes, by a discrete graph whose edge-weight min-cuts reproduce the continuous RT entropies exactly; if a geometry admits no such graph realization, the constructed counterexample may not be a real holographic geometry.

Editorial extensions

If this is right

Every valid linear holographic entropy inequality with rational coefficients can in principle be proved by the contraction map method; no separate proof technology is needed for this class.
The algorithmic enumeration of holographic entropy inequalities via partial cubes and graph contractions is complete: it generates all valid linear inequalities, not just those already known.
A candidate inequality can be certified false by proving that no boundary-compatible contraction map exists, because the theorem excludes valid inequalities without such a map.
The existence question reduces to a finite combinatorial search for distance-nonincreasing maps between hypercubes with prescribed boundary values, independent of the detailed bulk geometry.
Since the theorem identifies valid inequalities exactly with contraction maps, the holographic entropy cone for any party number is determined by the set of such maps.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Beyond the paper: if the graph-realizability assumption holds, the same iff statement should transfer to any entropy functional defined by min-cuts on graphs, so tensor-network or quantum error-correcting models with graph entropies would inherit the completeness result.
The virtual-edge argument suggests a practical diagnostic for invalid candidate inequalities: check whether the forced map deletes an edge between single-bit neighbors; such an edge deletion is the signature of a violating bulk chambering.
A natural next step, not taken here, is to make the proof constructive and effective: given a valid inequality, extract an explicit contraction map; the examples indicate deterministic filling rules may already do this.
The theorem shifts attention from proving individual inequalities to classifying contraction maps, so the main bottleneck for higher-party cones becomes combinatorial enumeration rather than geometric construction.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The main theorem is new and the paper is honest about what it assumes, but the proof of the necessity direction has a hole at the central step. The iff statement (Theorem 4.1) is what people have been waiting for: sufficiency was known from earlier work, but the converse was open. Section 3's worked examples, especially the MMI deformation, are helpful, and the graph intuition (non-contraction leaves a proper subgraph of the hypercube and breaks adjacency) is clearly explained. Lemma 4.1 is straightforward.

The soft spot is Lemma 4.2/4.3, which bears the weight of the contradiction argument. The construction replaces null edges with virtual edges of infinite weight (Definition 4.3). But Definition 4.1 quantifies over holographic geometries obeying the RT formula, and a graph in which non-adjacent vertices are connected by an infinite-weight edge is not an RT-region graph of a smooth geometry, as the authors themselves acknowledge when they say smoothness breaks down. Invoking a finite but arbitrarily large weight does not fix it: the discrete entropy in (2.15) is a minimum over cuts, and a min-cut will route around a huge edge. That would be acceptable if the proof used the true S*_N, but (4.23) instead substitutes the non-minimized RHS sum from (2.39). Since S*_N is less than or equal to that sum, the negative sign in (4.23) is not established. The claimed violation is therefore unsupported at the exact step where the contradiction is supposed to bite.

To the paper's credit, Section 1 lists three disclaimers, including the graph-realizability assumption and the treatment of an adjacency condition as a physical requirement. These are real assumptions, not hidden ones, and the authors flag them plainly. But they are load-bearing: if graph realizability fails, the contrapositive does not go through.

Who this is for: people actively working on the holographic entropy cone and contraction-map methods. The paper is readable and the examples are instructive. It deserves a serious referee, not a desk reject, but the referee should be asked to focus on Lemma 4.2/4.3 and whether the virtual-edge construction can be replaced by a real RT-region graph with finite weights that genuinely violates the inequality. My own verdict is conditional: the result is plausible and new, but the proof is not yet complete.

Referee Report

3 major / 4 minor

Summary. The paper claims to settle the completeness of the contraction map method for holographic entropy inequalities (HEIs). Theorem 4.1 states that a linear entropy inequality with positive integer coefficients is a valid HEI if and only if a contraction map satisfying boundary homology conditions exists. The sufficiency direction is quoted from prior work (Theorem 2.2). The necessity direction is attempted by contradiction: assuming a valid HEI with no contraction map, the authors take a non-contraction map and construct a subgraph of the domain hypercube, introduce infinite-weight "virtual edges" (Definition 4.3), and claim that the resulting graph gives a holographic geometry violating the HEI (Lemmas 4.2 and 4.3).

Significance. If the theorem were correct, it would be a substantial advance: it would show that every valid linear holographic entropy inequality in the stated class admits a contraction-map proof, making the contraction map method both necessary and sufficient and completing the program initiated in [5, 15]. The paper is clearly organized, and it is honest about several disclaimers, including the reliance on an unproved graph-realizability assumption for smooth bulk geometries. However, the main theorem is stated unconditionally while the proof depends on this assumption and on a graph construction that is not shown to correspond to a holographic geometry obeying the RT formula. The central contradiction argument therefore does not currently establish the claimed completeness result.

major comments (3)

[§4.1, Definition 4.3 and Lemma 4.2/4.3] The object ̃G_X constructed in Lemma 4.2 is not shown to be an RT-region graph of a holographic geometry, so it is outside the quantification of Definition 4.1. Definition 4.1 defines a valid HEI over holographic geometries obeying the RT formula, and Theorem 2.1 provides a geometry-graph duality only for partial cubes satisfying the isometric condition. The graph ̃G_X violates the adjacency condition d_H^adj = d_G and is not a partial cube; moreover, Lemma 4.3 itself states that the discrete entropy S*_{L_u} on this graph is divergent and that "any geometry realized by ̃G_X cannot give the proper holographic entanglement entropy." Thus the conclusion of Lemma 4.3 that there exists at least one holographic geometry violating the HEI does not follow from the construction.
[§4.1, Eq. (4.23)] The discrete entropy S*_N in (2.15) is defined as a minimum over cuts, and the chain (2.40)–(2.42) explicitly uses the inequality S*_N ≥ ̄S*_N, where ̄S*_N is the non-minimized sum over edges with weights d_H(f(x),f(x')). In Eq. (4.23), the proof substitutes the non-minimized sum for S*_N and obtains S*_M − S*_N = −∞. Since the actual S*_N is no larger than the substituted expression, the sign of the minimized difference S*_M − S*_N is not established. Additionally, the first sum in (4.23) is asserted to be positive semidefinite, but this is not true for a non-contraction map: other pairs (x,x') may also violate the contraction condition and contribute negatively. This is a load-bearing gap in the proof of Lemma 4.2.
[§1 and Theorem 2.1] The proof relies on an unproved graph-realizability assumption: the authors state in the introduction that they expect every sensible holographic geometry to admit an RT-region graph with discrete entropies matching the continuous RT entropies, but they do not prove this. Theorem 2.1, which is the geometry-graph duality underpinning both directions of the proof, is imported without a proof, and its hypotheses exclude the non-isometric graphs constructed later. Because Theorem 4.1 is stated unconditionally for all holographic geometries, this missing assumption is load-bearing; at minimum the theorem should be stated as conditional on the graph-realizability conjecture, and the proof must show that the constructed violating object is an admissible geometry under Definition 4.1.

minor comments (4)

[Abstract and Theorem 4.1] The abstract advertises completeness for linear HEIs with rational coefficients, while Theorem 4.1 is stated for positive integer coefficients. The reduction from rational to integer coefficients should be stated explicitly.
[Definition 2.3] The isometry condition in (2.5) contains a typo: it compares d_G(w,w') with d_G(φ(v),φ(v')) for w,w' ∈ V_J and v,v' ∈ V_J; the right-hand side should be the Hamming distance in the hypercube H_J after applying the isometry φ: V → V_{H_J}. The current notation obscures the intended statement.
[§2.4, inequality (2.40)] The inequality S*_N ≥ ̄S*_N is stated to be provable geometrically from entanglement wedge nesting, but no proof or precise citation is given. Since this inequality is reused in the main proof, it should be proved or referenced to a specific statement in the literature.
[§3.3, around Eq. (3.9)] The maps ι_M, ι_N, and the graph ̃G are introduced informally with notation that is not fully consistent with Definitions 2.7, 2.8, and 2.10. Clarifying the domains and the role of the chosen connected subset X would improve readability.

Circularity Check

1 steps flagged · score 6.0 of 10

Necessity proof manufactures its violating geometry: infinite virtual-edge weights make the claimed counterexample by construction, and the RHS min-cut is replaced by a non-minimized sum.

self definitional [Section 4.1, Definition 4.3 and Lemma 4.2 (Eqs. (4.16), (4.22)-(4.25))]
"We set its edge weight |0_E| infinite, i.e., |0_E| := ∞. (4.16) ... Without loss of generality, we set it to be infinite. ... The first sum is positive semi-definite and finite. However, the second term is infinite. Hence, we have S*_M − S*_N = −∞ < 0."

The negative sign in (4.24) is inserted by Definition 4.3: a virtual edge is assigned infinite weight and then placed precisely in the term with negative coefficient −κ. This is not a consequence of the RT min-cut prescription, because S*_N in (2.15) is a minimum over cuts, while (4.23) substitutes for S*_N the non-minimized sum Σ d_H(f(x),f(x')) |(x,x')|; a minimizing cut can avoid the very large edge, so the sign of the minimized difference is not established. The proof also concedes in Lemma 4.3 that any geometry realized by \tilde G_X 'cannot give the proper holographic entanglement entropy,' so \tilde G_X is not a holographic geometry in the sense of Definition 4.1; using it as a counterexample redefines the class of geometries to include the violating object.

full rationale

The paper does not fit parameters or rename a known result. The sufficiency direction (Theorem 2.2) is imported from [5] and is independent. The graph-realizability assumption is stated as a disclaimer in the introduction, so it is an open assumption rather than a concealed circular input. The circular part is confined to the necessity proof: Theorem 4.2 is supposed to show that a valid HEI without a contraction map would have a holographic geometry violating it, but the only 'geometry' exhibited is \tilde G_X, a subgraph with virtual edges whose infinite weight is chosen by Definition 4.3. Equation (4.23) computes a difference in which the RHS is a non-minimized sum rather than the min-cut S*_N of (2.15), and the negative sign is supplied by placing infinite weight on the negative-coefficient term. The text itself says \tilde G_X cannot give proper holographic entropy, so it falls outside Definition 4.1, which quantifies over holographic geometries obeying the RT formula. Thus, for the necessity direction, the violation is equivalent by construction to the inserted virtual edge, not derived from the RT/min-cut data. This is a partial circularity (score 6) rather than a complete one, because the overall theorem also has a substantial independent sufficiency half and the earlier examples do independent work.

Assumptions & free parameters 0 free parameters · 5 assumptions · 1 invented entities

The central claim rests on the RT formula, an assumed geometry-graph duality, a physical adjacency condition, and the new virtual-edge construction. There are no fitted numerical parameters. The graph-realizability and adjacency assumptions are admitted by the authors to be expectations rather than proved facts, which is the main reason the theorem is not fully established as written.

assumptions (5)

domain assumption The RT formula holds at leading order in 1/G_N and defines entanglement entropies for holographic states.
Used throughout, including Eq. (1.1) and Definition 4.1, which defines a valid HEI as an inequality satisfied by every holographic geometry obeying the RT formula.
domain assumption Geometry-graph duality: every RT arrangement yields a partial cube whose discrete entropies equal the continuous RT entropies, and vice versa.
Theorem 2.1 and Section 2.1. The authors state in Section 1 that they expect every sensible holographic geometry to admit such a graph realization but know no proof or counterexample.
domain assumption Connected subsets of bitstrings with a path isometry induce valid RT-region graphs.
Definitions 2.7 and 2.8, used to convert bitstring maps into bulk geometries. This is load-bearing for turning a non-contraction map into a violating geometry.
ad hoc to paper The adjacency condition d_H(adj)=d_G is a physical requirement for a smooth bulk geometry.
Definition 2.12 and Section 1 third disclaimer. The paper takes this condition as a physical requirement and provides supporting evidence but no independent proof, and the condition is close to the contraction property being established.
ad hoc to paper Virtual edges with infinite weight represent obstructions to bulk smoothness without changing graph distances.
Definition 4.3. The infinite weight drives the inequality violation in Lemma 4.2, but the physical status of an infinite-entropy graph as an RT geometry is not independently established.

invented entities (1)

Virtual edge (0_E)
purpose: Replaces null edges in the preimage of a non-contraction map and carries infinite weight to force a violation of the candidate entropy inequality.
Defined in Definition 4.3. No independent falsifiable handle is given; its existence and geometric interpretation are introduced for the proof.

how reviews work

0 comments

Cite this review

Pith. "Pith review of On the completeness of contraction map proof method for holographic entropy inequalities." pith.science (2026). https://pith.science/paper/OR2VEOOC

@misc{pith2026250618086,
  author       = {Pith},
  title        = {Pith review of: On the completeness of contraction map proof method for holographic entropy inequalities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OR2VEOOC}},
  note         = {Machine review of arXiv:2506.18086}
}

read the original abstract

The contraction map proof method is the commonly used method to prove holographic entropy inequalities. Existence of a contraction map corresponding to a holographic entropy inequality is a sufficient condition for its validity. But is it also necessary? In this note, we answer that question in affirmative for all linear holographic entropy inequalities with rational coefficients. We show that the pre-image of a non-contraction map is not a hypercube, but a proper cubical subgraph, and show that this manifests as alterations to the geodesic structure in the bulk, which leads to the violation of inequalities by holographic geometries obeying the RT formula.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Combinatorial aspects of holographic quantum secret sharing
hep-th 2026-07 conditional novelty 6.0 of 10

Bulk regions in AdS3/CFT2 get a holographic secret-sharing distance d and thresholds (r,s), with r = n - d + 1; pure states satisfy s = d - 1 while mixed states can satisfy s >= d.

Reference graph

Works this paper leans on

35 extracted references · 14 canonical work pages · cited by 1 Pith paper

[1]

Maldacena,The Large-N Limit of Superconformal Field Theories and Supergravity., International Journal of Theoretical Physics38(1999) 1113–1133, [hep-th/9711200]

J. Maldacena,The Large-N Limit of Superconformal Field Theories and Supergravity., International Journal of Theoretical Physics38(1999) 1113–1133, [hep-th/9711200]

arXiv 1999
[2]

Ryu and T

S. Ryu and T. Takayanagi,Holographic derivation of entanglement entropy from the anti–de sitter space/conformal field theory correspondence,Phys. Rev. Lett.96(May, 2006) 181602

work page 2006
[3]

Engelhardt and A

N. Engelhardt and A. C. Wall,Quantum Extremal Surfaces: Holographic Entanglement Entropy beyond the Classical Regime,JHEP01(2015) 073, [arXiv:1408.3203]. – 30 –

arXiv 2015
[4]

Akers and G

C. Akers and G. Penington,Quantum minimal surfaces from quantum error correction, SciPost Phys.12(2022), no. 5 157, [arXiv:2109.14618]

arXiv 2022
[5]

N. Bao, S. Nezami, H. Ooguri, B. Stoica, J. Sully, and M. Walter,The Holographic Entropy Cone,JHEP09(2015) 130, [arXiv:1505.07839]

arXiv 2015
[6]

T. He, V. E. Hubeny, and M. Rota,Inner bounding the quantum entropy cone with subadditivity and subsystem coarse grainings,Phys. Rev. A109(2024), no. 5 052407, [arXiv:2312.04074]

arXiv 2024
[9]

Fadel and S

M. Fadel and S. Hern´ andez-Cuenca,Symmetrized holographic entropy cone,Phys. Rev. D 105(2022), no. 8 086008, [arXiv:2112.03862]

arXiv 2022
[10]

N. Bao, N. Cheng, S. Hern´ andez-Cuenca, and V. P. Su,Topological Link Models of Multipartite Entanglement,Quantum6(June, 2022) 741

work page 2022

Show all 35 references

[11]

Czech and S

B. Czech and S. Shuai,Holographic Cone of Average Entropies,Commun. Phys.5(2022) 244, [arXiv:2112.00763]

2022 arXiv
[12]

T. He, S. Hern´ andez-Cuenca, and C. Keeler,Beyond the Holographic Entropy Cone via Cycle Flows,Commun. Math. Phys.405(2024), no. 11 252, [arXiv:2312.10137]

2024 arXiv
[13]

Bousso and S

R. Bousso and S. Kaya,Holographic entropy cone beyond AdS/CFT,Phys. Rev. D111 (2025), no. 8 086014, [arXiv:2502.03516]

2025 arXiv
[14]

Czech, S

B. Czech, S. Shuai, and Y. Wang,Entropy Inequalities Constrain Holographic Erasure Correction,arXiv:2502.12246

arXiv
[15]

N. Bao, K. Furuya, and J. Naskar,Towards a complete classification of holographic entropy inequalities,JHEP03(2025) 117, [arXiv:2409.17317]

2025 arXiv
[16]

Hern´ andez Cuenca,Holographic entropy cone for five regions,Phys

S. Hern´ andez Cuenca,Holographic entropy cone for five regions,Phys. Rev. D100(2019), no. 2 026004, [arXiv:1903.09148]

2019 arXiv
[17]

Hern´ andez-Cuenca, V

S. Hern´ andez-Cuenca, V. E. Hubeny, and H. F. Jia,Holographic entropy inequalities and multipartite entanglement,Journal of High Energy Physics2024(2024), no. 8 238

2024
[18]

Czech, S

B. Czech, S. Shuai, Y. Wang, and D. Zhang,Holographic entropy inequalities and the topology of entanglement wedge nesting,Phys. Rev. D109(May, 2024) L101903, [arXiv:2309.15145]

2024 arXiv
[19]

Czech, Y

B. Czech, Y. Liu, and B. Yu,Two infinite families of facets of the holographic entropy cone, SciPost Phys.17(2024) 084

2024
[20]

N. Bao, K. Furuya, and J. Naskar,A framework for generalizing toric inequalities for holographic entanglement entropy,JHEP10(2024) 251, [arXiv:2408.04741]

2024 arXiv
[21]

Bao and J

N. Bao and J. Naskar,Properties of the contraction map for holographic entanglement entropy inequalities,JHEP06(2024) 039, [arXiv:2403.13283]

2024 arXiv
[22]

N. Bao, K. Furuya, and J. Naskar,Holographic entanglement entropy inequalities from partial cubes,In progress
[23]

N. Bao, C. Cao, M. Walter, and Z. Wang,Holographic entropy inequalities and gapped phases of matter,JHEP09(2015) 203, [arXiv:1507.05650]. – 31 –

2015 arXiv
[24]

Naskar and S

J. Naskar and S. S. Samal,Topological entanglement entropy meets holographic entropy inequalities,arXiv:2412.05484

arXiv
[25]

Ovchinnikov,Graphs and Cubes

S. Ovchinnikov,Graphs and Cubes. Universitext. Springer New York, NY, 2011

2011
[26]

P. M. Winkler,Isometric embedding in products of complete graphs,Discrete Applied Mathematics7(1984), no. 2 221–225

1984
[27]

Ovchinnikov,Partial cubes: structures, characterizations, and constructions,Discrete Mathematics308(2008), no

S. Ovchinnikov,Partial cubes: structures, characterizations, and constructions,Discrete Mathematics308(2008), no. 23 5597–5621

2008
[28]

D. ˇZ. Djokovi´ c,Distance-preserving subgraphs of hypercubes,Journal of Combinatorial Theory, Series B14(1973) 263–267

1973
[29]

J. L. Gross and J. Yellen,Graph theory and its applications, 2006

2006
[30]

Susskind,Er=epr, ghz, and the consistency of quantum measurements, 2014

L. Susskind,Er=epr, ghz, and the consistency of quantum measurements, 2014

2014
[31]

Bao and I

N. Bao and I. F. Halpern,Conditional and multipartite entanglements of purification and holography,Physical Review D99(2019), no. 4 046010

2019
[32]

Hosur, X.-L

P. Hosur, X.-L. Qi, D. A. Roberts, and B. Yoshida,Chaos in quantum channels,Journal of High Energy Physics2016(Feb., 2016)

2016
[33]

Avis and S

D. Avis and S. Hern´ andez-Cuenca,On the foundations and extremal structure of the holographic entropy cone,Discrete Applied Mathematics328(2023) 16–39

2023
[34]

T. He, M. Headrick, and V. E. Hubeny,Holographic Entropy Relations Repackaged,JHEP10 (2019) 118, [arXiv:1905.06985]

2019 arXiv
[35]

Hern´ andez-Cuenca, V

S. Hern´ andez-Cuenca, V. E. Hubeny, and M. Rota,The holographic entropy cone from marginal independence,JHEP09(2022) 190, [arXiv:2204.00075]

2022 arXiv
[36]

Avis and S

D. Avis and S. Hern´ andez-Cuenca,On the foundations and extremal structure of the holographic entropy cone,Discrete Appl. Math.328(2023) 16–39, [arXiv:2102.07535]

2023 arXiv
[37]

Czech and S

B. Czech and S. Shuai,Nesting is not Contracting,arXiv:2501.17222. – 32 –

arXiv

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

Maldacena,The Large-N Limit of Superconformal Field Theories and Supergravity., International Journal of Theoretical Physics38(1999) 1113–1133, [hep-th/9711200]

J. Maldacena,The Large-N Limit of Superconformal Field Theories and Supergravity., International Journal of Theoretical Physics38(1999) 1113–1133, [hep-th/9711200]

arXiv 1999

[2] [2]

Ryu and T

S. Ryu and T. Takayanagi,Holographic derivation of entanglement entropy from the anti–de sitter space/conformal field theory correspondence,Phys. Rev. Lett.96(May, 2006) 181602

work page 2006

[3] [3]

Engelhardt and A

N. Engelhardt and A. C. Wall,Quantum Extremal Surfaces: Holographic Entanglement Entropy beyond the Classical Regime,JHEP01(2015) 073, [arXiv:1408.3203]. – 30 –

arXiv 2015

[4] [4]

Akers and G

C. Akers and G. Penington,Quantum minimal surfaces from quantum error correction, SciPost Phys.12(2022), no. 5 157, [arXiv:2109.14618]

arXiv 2022

[5] [5]

N. Bao, S. Nezami, H. Ooguri, B. Stoica, J. Sully, and M. Walter,The Holographic Entropy Cone,JHEP09(2015) 130, [arXiv:1505.07839]

arXiv 2015

[6] [6]

T. He, V. E. Hubeny, and M. Rota,Inner bounding the quantum entropy cone with subadditivity and subsystem coarse grainings,Phys. Rev. A109(2024), no. 5 052407, [arXiv:2312.04074]

arXiv 2024

[7] [9]

Fadel and S

M. Fadel and S. Hern´ andez-Cuenca,Symmetrized holographic entropy cone,Phys. Rev. D 105(2022), no. 8 086008, [arXiv:2112.03862]

arXiv 2022

[8] [10]

N. Bao, N. Cheng, S. Hern´ andez-Cuenca, and V. P. Su,Topological Link Models of Multipartite Entanglement,Quantum6(June, 2022) 741

work page 2022