{"id":"83e3c0aa-fe7e-4cba-8114-254f2fec1d35","arxiv_id":"2311.14344","paper_version":3,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.","lead":"The paper gives a tensor-network way to represent tours in the Traveling Salesman Problem and variants, using layers for candidate paths, Boltzmann weights, and counting filters for constraints. A smart generalist might read it to understand how tensor methods from quantum physics can be turned into a new encoding for hard routing and assignment problems.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption concerns numerical stability and tractability at finite parameters, which is relevant to practical use but not to the correctness of the zero-temperature formal claim. The paper does not assert an efficient algorithm, only a formulation whose exact limit behaves as stated. Hence the provisional UNVERDICTED verdict requires no adjustment.","tokens_in":1628,"tokens_out":308,"duration_ms":50083,"concrete_test":"Take the smallest non-trivial TSP instance (e.g., 4 cities with known optimum), construct the explicit tensor network from the paper's layer and filter definitions, compute the zero-temperature marginals by exact enumeration of the support, and apply the sequential marginal rule; check whether the output is a feasible optimal tour.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the tensor-network construction yields an explicit marginal formula whose zero-temperature exact-arithmetic limit recovers an optimal feasible tour via a sequential marginal rule. The formulation uses Boltzmann factors for costs and counting-filter tensors for constraints (e.g., visit-once, degree-2). No internal inconsistency appears in this mathematical statement: if the network is defined and contracted exactly, the limit of the marginals encodes the support of the minimum-cost feasible configurations, and a sequential rule can in principle select one such tour. The paper explicitly qualifies finite-τ behavior as heuristic and presents only small illustrative experiments, so the formal claim is not over-extended.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and variants. Candidate tours are represented via tensor-network layers, weighted by Boltzmann factors according to tour cost, and constrained by explicit counting-filter tensors (e.g., visit-once and degree-2 conditions). The central claim is that this construction yields an explicit tensor-network marginal formula whose zero-temperature, exact-arithmetic limit recovers an optimal feasible tour via a sequential marginal rule. The approach is adapted to several TSP generalizations and demonstrated on the Job Reassignment Problem; all experiments are small and illustrative, with finite-τ extraction explicitly qualified as heuristic.","tokens_in":1754,"tokens_out":417,"duration_ms":23739,"significance":"If the unshown derivation of the marginal formula and its limiting behavior can be supplied and verified, the work would supply a novel, constraint-explicit encoding of combinatorial optimization inside the tensor-network formalism. This could open routes to contraction-based solvers or quantum-inspired algorithms. The manuscript's honesty about the heuristic status of finite-τ extraction and its deliberate choice of illustrative rather than competitive experiments are positive features that keep the claims proportionate.","major_comments":[{"comment":"Abstract (and the corresponding construction section): the central claim that the zero-temperature, exact-arithmetic limit of the tensor-network marginal formula identifies an optimal feasible tour through a sequential marginal rule is stated without any derivation steps, explicit marginal expression, or proof that the resulting marginals remain supported only on feasible tours and select a minimum-cost one. This derivation is load-bearing for the paper's primary contribution.","section":"Abstract"}],"minor_comments":[{"comment":"The manuscript repeatedly notes that finite-τ behavior is heuristic and depends on numerical contrast and near-degeneracies, but does not supply a quantitative characterization (e.g., condition-number bounds or failure-mode examples) that would help readers assess when the heuristic is reliable.","section":null}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful reading, balanced summary, and recognition that a verified marginal formula would constitute a novel contribution. We agree that the central claim requires explicit derivation and supporting proofs, which were omitted from the original manuscript.","responses":[{"response":"We fully agree that the derivation, explicit marginal expression, and supporting proofs are missing and constitute a load-bearing gap. In the revised manuscript we will insert a dedicated subsection (placed after the tensor-network construction) that (i) writes the explicit marginal formula obtained by contracting all but one index of the weighted, filtered network, (ii) proves by induction on the filter tensors that every marginal is supported exclusively on feasible partial tours, and (iii) shows that, in the joint limit of exact arithmetic and τ→0, the Boltzmann weights concentrate on minimum-cost configurations, so that the sequential marginal rule recovers an optimal feasible tour. The added material will also clarify the precise sense in which finite-τ extraction remains heuristic.","revision_made":"yes","referee_comment":"[Abstract] Abstract (and the corresponding construction section): the central claim that the zero-temperature, exact-arithmetic limit of the tensor-network marginal formula identifies an optimal feasible tour through a sequential marginal rule is stated without any derivation steps, explicit marginal expression, or proof that the resulting marginals remain supported only on feasible tours and select a minimum-cost one. This derivation is load-bearing for the paper's primary contribution."}],"tokens_in":1261,"tokens_out":316,"duration_ms":15656,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that this work encodes TSP tours as tensor-network layers, applies Boltzmann weights for the costs, and uses counting-filter tensors to enforce the visit-once and degree constraints. From that network it derives a marginal formula whose exact zero-temperature limit, in exact arithmetic, identifies a feasible optimum through a sequential rule. The authors flag that finite-temperature, finite-precision extraction is only a heuristic and that the tests are small and illustrative only. That combination of layers, filters, and marginal rule does not appear in the TSP literature they cite, so the encoding itself is new even though the underlying tensor-network machinery is not. They also adapt the same construction to several TSP variants and run it on a job-reassignment instance as an industrial example. The stress-test note finds no internal inconsistency in the central claim: if the network contracts exactly, the marginals do encode the support of the minimum-cost feasible configurations. The paper is therefore on solid ground as a formulation. The soft spots are exactly what the abstract states. No derivation steps are supplied in the material I saw, the practical extraction rule is acknowledged to be heuristic, and the experiments do not claim or demonstrate computational advantage over existing solvers. Numerical stability of the contractions for larger instances is not addressed. This is a paper for people already working on tensor networks for combinatorial optimization who want to see one more encoding. It is not aimed at readers looking for new algorithms or scaling results. The work shows clear thinking and states its limits plainly, so it deserves a serious referee rather than a desk reject.","headline":"The paper's new piece is an explicit tensor-network marginal formula for TSP whose zero-temperature limit recovers optimal tours via sequential marginals, using standard layers plus counting filters.","tokens_in":2250,"tokens_out":389,"would_cite":false,"duration_ms":14190,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"Tensor-network TSP solver with Boltzmann weighting and counting filters; no RS cost or forcing structure","alignment":"orthogonal","rationale":"The paper constructs a TN with imaginary-time evolution (Boltzmann e^{-τC}), Levi-Civita-style projectors for visit-once constraints, and zero-temperature marginal extraction. This is a standard combinatorial-optimization heuristic in the TN/QAOA family. RS derives J(x)=½(x+x^{-1})−1, φ-ladders, 8-tick periodicity and spacetime from a single distinction (reality_from_one_distinction, Cost/FunctionalEquation.washburn_uniqueness_aczel, Foundation/DimensionForcing). None of those objects or theorems appear; the paper neither uses nor contradicts them.","tokens_in":53243,"confidence":"high","tokens_out":172,"duration_ms":10862,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Tensor networks represent traveling salesman tours so their zero-temperature marginals select an optimal feasible path via sequential rules.","keywords":["tensor networks","traveling salesman problem","combinatorial optimization","marginal formula","Boltzmann weighting","counting filters","job reassignment problem","zero-temperature limit"],"falsifier":"For any small TSP instance whose optimum is known by exhaustive enumeration, the sequential marginal rule applied to the exact-arithmetic tensor-network marginals fails to recover that optimum.","tokens_in":2531,"feed_emoji":"","tokens_out":635,"duration_ms":14864,"temperature":0.7,"pith_summary":"The paper constructs a tensor-network representation of candidate tours for the traveling salesman problem and its variants. Tours are encoded in network layers, weighted by Boltzmann factors according to their costs, and constrained by explicit counting filters that enforce validity. This setup produces an explicit marginal formula whose zero-temperature, exact-arithmetic limit extracts an optimal tour by sequential application of the marginal rule. The same construction adapts directly to generalizations such as the job reassignment problem. At finite temperature or finite precision the extraction functions as a heuristic whose outcome depends on numerical contrast and near-degeneracies.","feed_headline":"Tensor-network marginals recover optimal TSP tours at zero temperature","feed_subtitle":"Sequential application of the network's marginal formula selects a feasible optimum when temperature and arithmetic precision reach exact-ar","key_machinery":"The tensor-network marginal formula obtained from layers weighted by Boltzmann factors and constrained by counting filters; it supplies the sequential marginal rule that recovers the optimum in the zero-temperature exact limit.","core_discovery":"Candidate tours are represented with tensor-network layers, weighted by Boltzmann factors, and constrained through explicit counting filters. The construction yields an explicit tensor-network marginal formula whose zero-temperature, exact-arithmetic limit identifies an optimal feasible tour through a sequential marginal rule.","pith_inferences":["If tensor-network contraction routines can be applied at scale, the same marginal formula might serve as a contraction-based solver for other routing or assignment problems.","The sequential marginal rule could be compared directly with belief-propagation or message-passing heuristics on the same constraint graphs.","Near-degeneracies that appear at finite temperature might be used to generate diverse near-optimal tours without additional sampling steps."],"forward_implications":["The same tensor-network layers and filters extend without change to several standard generalizations of the TSP.","The construction supplies a concrete tensor-network implementation for the job reassignment problem.","At any finite temperature the extraction procedure becomes a heuristic whose success depends on numerical contrast, calibration, and near-degeneracies.","The experiments remain deliberately small and serve only to illustrate the method against exact and heuristic references."],"fun_headline_variants":["Tensor marginals recover TSP optima at zero temperature","Zero temperature tensor marginals find optimal tours","Marginal formula identifies TSP optimum at zero temp","Tensor networks solve TSP via sequential marginal rules"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The counting filters and Boltzmann weighting together produce a tensor network whose marginals remain numerically stable and contractible enough to extract the optimum without the extraction rule itself becoming equivalent to exhaustive search.","fun_headline_variants_meta":{"raw":{"variants":["Tensor marginals recover TSP optima at zero temperature","Zero temperature tensor marginals find optimal tours","Marginal formula identifies TSP optimum at zero temp","Tensor networks solve TSP via sequential marginal rules"]},"model":"grok-4.3","cost_usd":0.007369,"raw_usage":{"total_tokens":3333,"prompt_tokens":556,"num_sources_used":0,"completion_tokens":55,"cost_in_usd_ticks":73687000,"prompt_tokens_details":{"text_tokens":556,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2722,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":556,"tokens_out":55,"duration_ms":18990,"temperature":1.0,"reasoning_tokens":2722,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-24T05:35:04.821631+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"For any small TSP instance whose optimum is known by exhaustive enumeration, the sequential marginal rule applied to the exact-arithmetic tensor-network marginals fails to recover that optimum.","supporting_citations":[],"review_version":1}