{"id":"a51a1257-3b48-44bf-ab86-5581d98dd0b2","arxiv_id":"2605.23670","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.","lead":"The paper introduces twirled perfect tensor networks that satisfy computational covariance and bound complexity according to the Python's Lunch Conjecture while obeying a lattice Ryu-Takayanagi formula. A smart generalist might read it to see how new tensor network constructions can bridge random and perfect models for holographic black hole studies.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"Reader's weakest assumption correctly isolates the non-generic fine structure required by PLC; the paper directly constructs a class realizing that structure and verifies the listed properties, so the verdict remains UNVERDICTED pending external checks rather than internal flaws.","tokens_in":1806,"tokens_out":249,"duration_ms":24270,"concrete_test":"Verify that the explicit twirling map in §3.2 applied to a perfect tensor on a small lattice (e.g., 2×2) reproduces the claimed covariance under arbitrary low-complexity decompositions; recompute the resulting network complexity and check agreement with the PLC exponent.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims are that twirled perfect tensors satisfy computational covariance (unlike generic random tensor networks), yield PLC-bounded complexity, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions. The manuscript supplies explicit constructions, definitions of the twirling operation, and derivations establishing these properties, together with the acknowledged residual postselection limitation. No internal inconsistency, hidden assumption in the covariance definition, or gap in the RT derivation is apparent from the provided arguments.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces 'twirled perfect tensors' as a novel class of tensor networks motivated by the Python's Lunch Conjecture (PLC) for local tensor network models of black hole interiors. It argues that random tensor networks generically lack 'computational covariance,' resulting in exponential complexity not controlled by the PLC exponent, and proposes twirled perfect tensors that satisfy this covariance property with complexity bounded by the PLC value. The construction is shown to obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions while combining features of perfect tensor networks and random tensor networks, with an acknowledged residual limitation from local postselection.","tokens_in":1924,"tokens_out":364,"duration_ms":33445,"significance":"If the central claims hold, the work supplies an explicit, covariant tensor network class that aligns more closely with PLC assumptions than generic random networks while preserving holographic properties such as the lattice RT formula. The explicit constructions, definitions of the twirling operation, and derivations establishing covariance and RT obedience constitute clear strengths, providing a flexible framework applicable beyond quantum gravity.","major_comments":[],"minor_comments":[{"comment":"The abstract states that explicit demonstrations were performed in random tensor network models, but the main text should include a brief summary of the model dimensions, bond dimensions, and number of samples used to support the claim that exponential complexity is not controlled by the PLC exponent.","section":"Abstract and §4"},{"comment":"The definition of the twirling operation and computational covariance would benefit from an explicit equation reference (e.g., the precise averaging procedure over unitaries) to make the independence from the PLC exponent fully transparent.","section":"§3"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive assessment of our manuscript, including the recognition of the explicit constructions, definitions of the twirling operation, and derivations for computational covariance and the lattice RT formula. We appreciate the recommendation for minor revision and will incorporate any editorial suggestions in the revised version. No major comments were raised in the report.","responses":[],"tokens_in":1300,"tokens_out":84,"duration_ms":13488,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that the authors introduce twirled perfect tensors to enforce computational covariance, which lets the network complexity respect the Python's Lunch bound instead of the generic exponential one seen in random tensor networks. They also keep the lattice Ryu-Takayanagi formula holding for any boundary subregion.\n\nThey do the useful work of spelling out why random networks fail the PLC in explicit cases, tracing it to the missing covariance property, and then defining the twirling operation on perfect tensors to restore it. The construction combines the exact features from perfect tensors with the averaging aspects from random ones, and they are straightforward about the leftover local postselection limitation that still sits between the model and actual gravity.\n\nThe soft spots are limited. The postselection issue is acknowledged but not removed, so the modeling of gravity remains incomplete on that point. The derivations for covariance and the RT formula rest on the explicit definitions and arguments given, which look internally consistent, though any reader would still want to check the technical steps for edge cases in how the twirling interacts with the network structure.\n\nThis is aimed at people already working on tensor network models of holography and black hole complexity. A reader in that area gets a concrete new construction and a clear comparison to prior random and perfect cases. It has enough new content and direct engagement with the PLC motivation to deserve a serious referee.","headline":"Twirled perfect tensors fix computational covariance so random networks' PLC violation goes away while keeping lattice RT for arbitrary regions.","tokens_in":2421,"tokens_out":345,"would_cite":true,"duration_ms":10356,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Tensor networks from twirled perfect tensors satisfy computational covariance and bound complexity by the Python's Lunch Conjecture.","keywords":["tensor networks","Python's Lunch Conjecture","computational covariance","Ryu-Takayanagi formula","holography","black hole complexity","perfect tensors"],"falsifier":"An explicit calculation in which the complexity of a twirled perfect tensor network exceeds the PLC exponent for some configuration would disprove the bounded-complexity claim.","tokens_in":2722,"feed_emoji":"🕸","tokens_out":588,"duration_ms":45028,"temperature":0.7,"pith_summary":"The paper argues that random tensor networks fail to capture black hole interior physics because they lack computational covariance, a property implicitly assumed by the Python's Lunch Conjecture. The authors introduce twirled perfect tensor networks that restore this covariance while retaining holographic features from both perfect and random tensor networks. These networks keep complexity controlled by the PLC exponent rather than a higher generic bound. They also satisfy a lattice Ryu-Takayanagi formula for arbitrary boundary subregions. This supplies a new class of models motivated by holography but applicable more broadly.","feed_headline":"Twirled perfect tensors bound complexity to Python's Lunch value","feed_subtitle":"New networks achieve covariance missing from random models and follow the lattice Ryu-Takayanagi formula for any subregion.","key_machinery":"Twirled perfect tensors, constructed to ensure computational covariance under arbitrary low-complexity decompositions of space while preserving holographic properties.","core_discovery":"The central claim is that tensor networks built from twirled perfect tensors satisfy the computational covariance property, have complexity bounded by the PLC value, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions, unlike random tensor networks which fail to capture the fine structure assumed by the PLC.","pith_inferences":["Holographic models may need non-generic fine structure beyond randomness to reproduce conjectured gravitational complexity bounds.","The framework could be tested in condensed-matter systems that require similar covariance under local operations.","Explicit constructions might clarify how gravity evades the postselection limitation present in these networks."],"forward_implications":["Complexity stays bounded by the PLC exponent rather than the generic upper bound.","A lattice Ryu-Takayanagi formula holds for arbitrary boundary subregions.","Desirable holographic features from perfect tensor networks and random tensor networks are combined in one construction.","A discrete limitation from local postselection remains, which appears absent in gravity."],"fun_headline_variants":["Twirled perfect tensors achieve computational covariance","PLC bounds complexity for twirled perfect tensors","Twirled tensors obey lattice RT for any subregion","Covariant networks from twirled perfect tensors"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The Python's Lunch Conjecture assumes tensor networks modeling gravity possess a fine structure that enables computational covariance, which generic random networks lack.","fun_headline_variants_meta":{"raw":{"variants":["Twirled perfect tensors achieve computational covariance","PLC bounds complexity for twirled perfect tensors","Twirled tensors obey lattice RT for any subregion","Covariant networks from twirled perfect tensors"]},"model":"grok-4.3","cost_usd":0.004845,"raw_usage":{"total_tokens":2398,"prompt_tokens":705,"num_sources_used":0,"completion_tokens":54,"cost_in_usd_ticks":48449500,"prompt_tokens_details":{"text_tokens":705,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1639,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":705,"tokens_out":54,"duration_ms":20666,"temperature":1.0,"reasoning_tokens":1639,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-30T15:33:12.944214+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit calculation in which the complexity of a twirled perfect tensor network exceeds the PLC exponent for some configuration would disprove the bounded-complexity claim.","supporting_citations":[],"review_version":2}