{"id":"e755e8f6-8dec-43e2-a5fc-c57466c160b7","arxiv_id":"2507.07199","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Graph contributions to correlators of conformally coupled scalars have an amplitube expansion whose surviving terms are exactly those with bipartite contracted graphs.","lead":"This paper derives a new way to write cosmological correlation functions as sums over amplitude-like building blocks called amplitubes, with many terms cancelling out. The result gives theorists a more compact combinatorial handle on correlators than the wavefunction coefficients provide.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The unproved identity in Eq. (34) is the central gap; it is true for connected graphs via a chromatic-polynomial evaluation, but the paper neither proves it nor states the loop-contraction conventions, so a proof or citation is needed before Eq. (35) is fully established.","rationale":"The paper's aim is to convert the known graph-by-graph correlator formula (21) into the amplitube expansion (35). The only genuinely unproved step is the coefficient identity connecting (34) and (35). I checked the identity: after setting S = \\bar I and A = I \\setminus J, the coefficient becomes sum_{A subseteq I} (-1)^{|A|} 2^{c(G[S cup A])}, which is exactly the chromatic polynomial of G/S evaluated at q=2. For connected G, G/S is connected, so P_{G/S}(2) = 2 if G/S is bipartite and 0 otherwise; hence C(I) = 2 chi_{G/\\bar I}. This confirms the central formula, provided the standard convention that loops in the contracted edge set are deleted and loops outside it remain is used. The paper's failure to supply this argument, or even a citation for it, is a real presentation gap: a reader cannot verify Eq. (35) from the text alone. The same weakness was identified by the reader's verdict. Since the identity is true and all worked examples agree, the appropriate verdict remains CONDITIONAL, pending an independent proof or an automated check.","tokens_in":6804,"tokens_out":16721,"duration_ms":196157,"concrete_test":"Write an independent verification script: for every connected graph up to 6 vertices, including parallel edges and using the loop-contraction convention described above, enumerate all I and J, evaluate C(I) = sum_{J subseteq I} (-1)^{|I|-|J|} 2^{kappa_{G\\J}}, and compare it with 2 chi_{G/\\bar I}; if any mismatch is found, Eq. (35) is false. In parallel, provide a one-page proof of C(I) = P_{G/\\bar I}(2) via Whitney's rank formula sum_{A subseteq E(H)} (-1)^{|A|} 2^{c_H(A)}, noting that H = G/\\bar I is connected when G is. Either the exhaustive check or the analytic derivation settles whether the gap is cosmetic or fatal.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Equation (35) rests entirely on the step from Eq. (34) to Eq. (35): for each edge subset I, the coefficient C(I) = sum_{J subseteq I} (-1)^{|I|-|J|} 2^{kappa_{G\\J}} is asserted to equal 2 chi_{G/\\bar I}. The paper says this is 'not hard to convince oneself' and calls it a well-known graph invariant, but no proof or citation is supplied. The identity is not quite trivial: it is the q=2 evaluation of the chromatic polynomial of the contracted graph, and its validity depends on the standard convention that loops created by contracting edges in \\bar I are deleted, while loops not in \\bar I survive. For connected G the identity is true, because G/\\bar I is connected and a connected bipartite graph has exactly two proper 2-colorings; for disconnected G the coefficient would instead be 2^{c(G/\\bar I)} chi_{G/\\bar I}. All worked examples are connected and consistent, but the proof gap is the single load-bearing step.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper derives an amplitube expansion for the correlation function of conformally coupled scalars, starting from a known expression for the correlator as a sum over wavefunction coefficients and the author's earlier amplitube expansion of the wavefunction. The main claim is the closed formula ⟨G⟩ = 2N∏_{e∈E_G}(2y_e) \\sum_{I⊂E_G} χ_{G/\\bar I} A_{G\\setminus I}, where χ_{G/\\bar I} is 1 if the contracted graph is bipartite and 0 otherwise. The paper demonstrates this formula on several tree-level and one-loop examples, showing many cancellations and the absence of relative minus signs. The derivation hinges on an unproved combinatorial identity in the passage from Eq. (34) to Eq. (35); the paper states it is 'not hard to convince oneself' and calls it a well-known graph invariant, but supplies neither a proof nor a citation.","tokens_in":7000,"tokens_out":3671,"duration_ms":42977,"significance":"If the main formula is correct, it provides a remarkably simple combinatorial characterization of cosmological correlators, making contact with the recent 'subtle simplicity' and dressing-rule results of Refs. [27–29] and uncovering a potential link to bipartite structures in amplitudes. The formula is parameter-free and the worked examples are internally consistent; the claimed cancellations, including the loop-level vanishing terms, are nontrivial and are exactly the kind of simplification that justifies publication. The significance is, however, conditional on closing the proof gap in the single load-bearing combinatorial step, because all examples shown are special cases of that step.","major_comments":[{"comment":"The step from Eq. (34) to Eq. (35) is the central load-bearing point of the paper, yet the identity C(I) = \\sum_{J⊂I} (-1)^{|I|-|J|} 2^{κ_{G\\setminus J}} = 2χ_{G/\\bar I} is asserted with the comment that it is 'not hard to convince oneself' and is called a well-known graph invariant. No proof or citation is provided. This identity is not completely trivial: for connected graphs it follows from the q=2 evaluation of the chromatic polynomial of G/\\bar I, but its validity depends on the convention for contracting edges that produce loops. The paper does not state this convention. I ask the author to supply a proof or an explicit reference for the identity and to spell out the loop-contraction convention.","section":"§IV, Eqs. (34)–(36)"},{"comment":"The formula with the prefactor 2N is stated without qualification, but the identity underlying it yields 2χ_{G/\\bar I} only when G is connected; for disconnected graphs the coefficient would be 2^{c(G/\\bar I)}χ_{G/\\bar I}, where c(G/\\bar I) is the number of connected components. All worked examples are connected graphs, so they do not probe this distinction. The paper should clarify whether the path sum is restricted to connected Feynman graphs or, if disconnected graphs are allowed, how the formula must be modified.","section":"§IV, Eq. (35) and the worked examples"}],"minor_comments":[{"comment":"In the five-point example, the variable x2 is defined twice: 'x2 = |k3|' and then 'x2 = |k3| + |k4|'; the second assignment should presumably be x3, since the formula is meant to give three distinct vertex variables.","section":"§II.A, Eq. (8)"},{"comment":"The exponent in the factor (-1)^{I\\setminus J} is written as a set difference rather than an integer; it should read (-1)^{|I|-|J|}.","section":"§IV, Eq. (34)"},{"comment":"There are several typographical errors in the text, for example 'At first site' should be 'At first sight' and 'probabliity distribution' should be 'probability distribution'; a careful proofreading pass is recommended.","section":"§I"},{"comment":"The statement 'this statement is valid for all tree-level graphs' is asserted without proof at that point; since the later general formula (35) implies it, it would be cleaner to defer or briefly justify this claim.","section":"§IV, after Eq. (28)"}],"recommendation":"major_revision","confidential_remarks":"The paper is concise and the central idea is appealing. The missing proof of the identity in Eq. (34)–(35) is the only substantive obstacle; once a correct proof with explicit conventions is added (or a valid reference is provided), the paper would be acceptable. I would also ask the editor to ensure that the author addresses the disconnected-graph qualification, since the current presentation risks overclaiming the generality of the result."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Hi,\n\nThis short paper extends the amplitube expansion of wavefunction coefficients to full correlators. The main result, Eq. (35), is a compact bipartite selection rule: for each graph G, only edge subsets I whose contracted graph G/\\bar I is bipartite survive, and all coefficients are positive. That is genuinely new and gives a combinatorial origin for the simplicity seen in recent work [27-29]. The examples (two-chain, three-chain, two-cycle, one-loop) check out and show the cancellations clearly. The writing is clear and the logic is easy to follow.\n\nThe soft spot is the step from Eq. (34) to Eq. (35). The coefficient sum over J is asserted to equal the number of proper 2-colorings of G/\\bar I, with a terse 'not hard to convince oneself'. This is load-bearing: all the loop-level cancellations depend on it. In fact the identity is a q=2 evaluation of the chromatic polynomial, and it works for connected graphs, but only under a specific convention: loops created by contracting \\bar I must be deleted, while loops not in \\bar I survive. The paper never states this. For disconnected contracted graphs the coefficient would come out as 2^{c(G/\\bar I)} times the bipartite indicator, so the formula as written needs G/\\bar I connected or an explicit convention. The author should provide a proof or at least a citation for the identity. This is an easy fix, but the paper as it stands has a real gap at the central argument.\n\nThe reliance on Eq. (14) from the author's own prior paper is not a problem by itself; that result is published. But it does mean the new contribution rests on two imported formulas, and the only new ingredient is the identity above. The minor typos (e.g., Eq. (8) repeats x2) are cosmetic.\n\nVerdict: I'd send it to a serious referee. The result is plausible, new, and potentially useful as an organizing principle for correlator computations. A referee should push for the missing proof or reference, and for a clear statement of graph-contraction conventions. If those are supplied, this is a nice paper for the cosmobootstrap audience.","headline":"The bipartite selection rule is new and plausible, but the unproved graph identity in the step from (34) to (35) is the main gap and needs either a proof or a stated convention.","tokens_in":7520,"tokens_out":3914,"would_cite":true,"duration_ms":37731,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"For conformally coupled scalars, the paper derives a sign-free amplitube expansion of cosmological correlators in which only bipartite contracted graphs contribute.","keywords":["cosmological correlators","wavefunction of the universe","amplitubes","conformally coupled scalars","bipartite graphs","Feynman graph expansion","cosmological polytopes"],"falsifier":"Take $G$ to be a triangle and $I$ to be all three edges, so the contracted graph $G/\\bar I$ is the triangle itself and is not bipartite; Eq. (35) demands that the coefficient of this amplitube vanish. The coefficient is the eight-term sum $\\sum_{J\\subset I}(-1)^{|I\\setminus J|}2^{\\kappa_{G\\setminus J}}$, which can be evaluated directly by hand; a nonzero result would refute the formula, while a vanishing result supports it.","tokens_in":6554,"feed_emoji":"🌌","tokens_out":14915,"duration_ms":155063,"temperature":0.7,"pith_summary":"Observables in early-universe cosmology are spatial correlation functions, obtained from the wavefunction of the universe by the Born rule. The paper aims to express the graph-by-graph contribution to these correlators directly in terms of amplitubes, the same amplitude-like building blocks recently used for wavefunction coefficients. Its central result is that the correlator expansion is sign-free and sparser than the wavefunction expansion: a term survives only when a certain contracted graph is bipartite. If correct, this gives a combinatorial reason for a subtle simplicity of cosmological correlators and a concrete target for geometric interpretations.","feed_headline":"Correlators simplify to sign-free sums over amplitubes","feed_subtitle":"A bipartite graph condition kills minus signs and many loop terms in cosmological correlators.","key_machinery":"The engine is the amplitube $A_G = \\sum_{\\tau\\in\\Gamma_G}\\prod_{t\\in\\tau} 1/H_t$, where the sum runs over tubings (maximal sets of pairwise compatible vertex-induced tubes) and $H_t$ is the energy sum associated with tube $t$. Starting from $\\Psi_G = \\sum_{I\\subset E_G}(-1)^{|I|} A_{G\\setminus I}$ and substituting into $\\langle G\\rangle = N\\prod_{e}(2y_e)\\sum_{I} 2^{\\kappa_{G\\setminus I}}\\Psi_{G\\setminus I}$, the derivation reduces to the combinatorial identity that $\\sum_{J\\subset I}(-1)^{|I\\setminus J|}2^{\\kappa_{G\\setminus J}}$ equals twice the number of proper two-colorings of $G/\\bar I$, namely $2\\chi$. This identity converts an alternating sum into a bipartiteness test and is the mechanism behind every cancellation and sign removal in the examples.","core_discovery":"On the paper's own terms: substituting the amplitube expansion of wavefunction coefficients into the known correlator formula produces, after a graph-theoretic simplification, the exact expression (35): the contribution of a Feynman graph $G$ is $2N\\prod_{e\\in E_G}(2y_e)$ times the sum over edge subsets $I$ of $\\chi_{G/\\bar I} A_{G\\setminus I}$, where $\\chi$ is 1 exactly when the graph obtained by contracting all edges outside $I$ is bipartite. Consequently every amplitube whose associated contracted graph fails bipartiteness drops out, and all surviving terms carry the same overall coefficient, so there are no relative minus signs. For tree graphs this means the correlator is the wavefunction expansion with all minus signs removed; at loop level, additional terms vanish entirely. The worked examples show these cancellations explicitly for the two-chain, three-chain, two-cycle, and a one-loop graph.","pith_inferences":["The unproved identity in Eq. (34) resembles a deletion-contraction recursion and is likely provable through the chromatic or Tutte polynomial; such a proof would place the main formula on fully rigorous footing.","Because the simplification is purely graph-theoretic, the same sign-free formula should hold for any theory whose wavefunction coefficients admit an amplitube expansion, not only the conformally coupled scalar toy model treated here.","The bipartiteness criterion implies that odd cycles surviving contraction are the only source of cancellations; testing a one-loop graph built on a pentagon would probe whether the simplifications persist beyond the examples shown.","A positive-geometric realization might come from summing amplitubes only over tubings selected by a bipartiteness condition; the correlator's polytope would then be a parity-selected piece of the wavefunction's polytope."],"forward_implications":["Correlator computations can be organized directly at the level of amplitubes, bypassing the sign-heavy wavefunction sum.","At tree level, the correlator is obtained from the wavefunction coefficient by deleting all minus signs, up to an overall normalization factor.","Loop-level contributions whose contracted graph is non-bipartite vanish in the correlator, so the expansion has fewer terms than the wavefunction expansion.","The bipartite criterion supplies a combinatorial origin for the subtle simplicity of cosmological correlators previously seen through dressing rules.","As the author notes speculatively, the appearance of bipartiteness invites a geometric interpretation and a possible connection to bipartite graphs in scattering amplitudes."],"supporting_citations":[{"why":"Supplies the wavefunction amplitube expansion $\\Psi_G = \\sum_{I}(-1)^{|I|}A_{G\\setminus I}$ that the correlator derivation starts from.","marker":"[25]"},{"why":"Defines amplitubes and tubings, the building blocks appearing in the final correlator formula.","marker":"[26]"},{"why":"Provides the known expression for the correlator graph contribution in terms of wavefunction coefficients that serves as the starting point.","marker":"[24]"},{"why":"Documents the subtle simplicity of cosmological correlators that the bipartite formula is said to explain combinatorially.","marker":"[27]"},{"why":"Gives dressing rules relating correlators to flat-space amplitudes, the phenomenon the paper's bipartite criterion underpins.","marker":"[28]"}],"fun_headline_variants":["Amplitubes cancel minus signs in correlators","Correlators drop loop terms via bipartite graphs","Bipartite rule makes correlators sign-free","Amplitube correlators shed loops and signs","Bipartite condition eliminates correlator minus signs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole simplification rests on an unproved combinatorial identity, Eq. (34), justified only by 'it is not hard to convince oneself', which equates an alternating sum over edge subsets of powers of two with twice a two-coloring count; if that identity fails for some graph, the sign-free formula and its cancellations collapse.","fun_headline_variants_meta":{"raw":{"variants":["Amplitubes cancel minus signs in correlators","Correlators drop loop terms via bipartite graphs","Bipartite rule makes correlators sign-free","Amplitube correlators shed loops and signs","Bipartite condition eliminates correlator minus signs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000491,"raw_usage":{"total_tokens":2350,"prompt_tokens":819,"completion_tokens":1531,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":435,"completion_tokens_details":{"reasoning_tokens":1459}},"tokens_in":435,"tokens_out":1531,"duration_ms":12582,"temperature":1.0,"reasoning_tokens":1459,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T18:47:12.195949+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $G$ to be a triangle and $I$ to be all three edges, so the contracted graph $G/\\bar I$ is the triangle itself and is not bipartite; Eq. (35) demands that the coefficient of this amplitube vanish. The coefficient is the eight-term sum $\\sum_{J\\subset I}(-1)^{|I\\setminus J|}2^{\\kappa_{G\\setminus J}}$, which can be evaluated directly by hand; a nonzero result would refute the formula, while a vanishing result supports it.","supporting_citations":[{"cited_title":"Scattering Forms and the Positive Geometry of Kinematics, Color and the Worldsheet","cited_arxiv_id":null,"evidence_quote":"Supplies the wavefunction amplitube expansion $\\Psi_G = \\sum_{I}(-1)^{|I|}A_{G\\setminus I}$ that the correlator derivation starts from."},{"cited_title":"Amplitubes: Graph Cosmohedra","cited_arxiv_id":null,"evidence_quote":"Defines amplitubes and tubings, the building blocks appearing in the final correlator formula."},{"cited_title":"Man- dal, Pierpaolo Mastrolia, and Francisco Vaz˜ ao","cited_arxiv_id":null,"evidence_quote":"Provides the known expression for the correlator graph contribution in terms of wavefunction coefficients that serves as the starting point."},{"cited_title":"Cosmohedra","cited_arxiv_id":null,"evidence_quote":"Documents the subtle simplicity of cosmological correlators that the bipartite formula is said to explain combinatorially."},{"cited_title":"Correlator Polytopes","cited_arxiv_id":null,"evidence_quote":"Gives dressing rules relating correlators to flat-space amplitudes, the phenomenon the paper's bipartite criterion underpins."}],"review_version":1}