{"id":"70c194a6-9e9f-4765-9a33-a3c47f474145","arxiv_id":"2606.22228","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"GFF level line crossing probabilities equal c=1 degenerate conformal blocks or fused SLE_4 partition functions, with scaling limit convergence proven for metric graph GFF under monotonicity constraints.","lead":"This paper finds that crossing probabilities for level lines of the Gaussian free field with piecewise constant boundary data are given by degenerate conformal blocks in a c=1 CFT, or equivalently by ratios of fused multiple SLE_4 partition functions. A smart generalist might read it to see how random field geometries acquire exact formulas from conformal field theory.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest-assumption note already isolates the monotonicity selection; the full text treats this as an explicit, combinatorially enforced restriction rather than a hidden gap. No further internal inconsistency or unverified analytic step is visible in the claimed proofs.","tokens_in":1814,"tokens_out":324,"duration_ms":12417,"concrete_test":"Verify that the explicit ratio of fused Specht polynomials (as written in the main theorem) reproduces the known four-point crossing probability for two level lines of the GFF with alternating +1/-1 boundary data on the circle; if the numerical values agree to machine precision with the independent SLE_4 computation, the algebraic identification holds in the simplest non-trivial case.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that crossing probabilities for GFF level lines (and their metric-graph approximations) are given exactly by ratios of c=1 degenerate conformal blocks (equivalently, fused multiple SLE_4 partition functions built from Specht polynomials) under piecewise-constant boundary data obeying the stated monotonicity constraints. The manuscript supplies an explicit construction via the representation-theoretic fused objects, verifies that the selected blocks are linearly independent solutions of the higher-order BPZ equations, and states a scaling-limit convergence result for the discrete model. The monotonicity filter is presented as a necessary selection rule rather than an unexamined assumption; the argument therefore rests on the algebraic identification and the convergence theorem rather than on an implicit analytic continuation or completeness claim that would be vulnerable to hidden counterexamples.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims that crossing probabilities for level lines of the GFF (and its metric-graph version) with piecewise-constant Dirichlet boundary data are given exactly by ratios of c=1 degenerate conformal blocks (degenerate at each insertion), which are linearly independent solutions of the BPZ equations; equivalently, these probabilities are ratios of explicit partition functions of fused multiple SLE_4 curves constructed from fused Specht polynomials. It further asserts a scaling-limit convergence result for the crossing probabilities of level sets in the metric graph GFF, and notes that only the subset of blocks obeying specific monotonicity constraints (corresponding to a subset of generalized Dyck paths) appear in the GFF models.","tokens_in":1963,"tokens_out":414,"duration_ms":21534,"significance":"If the identification and convergence hold, the work supplies an explicit CFT description of GFF level-line percolation in terms of degenerate c=1 blocks and fused SLE_4 objects, together with a discrete-to-continuum theorem. The representation-theoretic construction of the blocks, the verification of linear independence, and the explicit partition-function formulas constitute concrete strengths that could be used for further computations in the field.","major_comments":[],"minor_comments":[{"comment":"The abstract states that the selected blocks satisfy monotonicity constraints, but the main text should include an explicit derivation (with a named proposition or lemma) showing how these constraints arise directly from the piecewise-constant boundary data of the GFF rather than being imposed externally.","section":null},{"comment":"Cross-references to the fused Specht polynomials of Lafay-Peltola-Roussillon should appear at the first use of the partition functions, together with a brief reminder of the representation-theoretic construction used here.","section":null},{"comment":"The statement that the blocks are 'linearly independent and solve the BPZ PDEs of arbitrary orders' would benefit from a short table or list indicating the orders arising for the typical numbers of level lines considered in the examples.","section":null}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive and supportive report, which accurately summarizes the main results of the manuscript, and for the recommendation of minor revision. No specific major comments were raised in the report.","responses":[],"tokens_in":1307,"tokens_out":58,"duration_ms":10992,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The central result is that crossing probabilities for level lines of the GFF with piecewise-constant Dirichlet data are given exactly by ratios of c=1 degenerate conformal blocks, or equivalently by explicit fused multiple SLE_4 partition functions built from Specht polynomials. They also establish that the metric-graph GFF converges in the scaling limit to the same formulas.\n\nThe explicit algebraic identification and the verification that the selected blocks solve the higher-order BPZ equations and are linearly independent are the concrete advances. The convergence statement for the discrete model supplies an independent check that is useful for the field. The monotonicity filter on boundary conditions is stated clearly rather than hidden.\n\nThe formulas rest on the fused Specht polynomials from recent work that includes one of the present authors, so the dependence on the group’s prior results is noticeable. Only a subset of combinatorial boundary conditions are treated; the paper notes this limitation but it narrows the immediate applicability. The abstract asserts the existence of the proofs, yet the strength of the error estimates and boundary-condition handling can only be judged from the full text.\n\nThis is aimed at researchers working on SLE/CFT links to 2D random geometry and GFF percolation. Readers who need explicit crossing formulas or want to see how representation-theoretic objects enter the GFF setting will find the expressions and the convergence result directly usable.\n\nThe paper is specific enough and grounded enough to merit sending to referees.","headline":"The paper maps GFF level-line crossing probabilities to c=1 degenerate conformal blocks (or fused SLE_4 partition functions) and proves scaling-limit convergence for the metric-graph version under monotonicity constraints on boundary data.","tokens_in":2474,"tokens_out":374,"would_cite":true,"duration_ms":13069,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Crossing probabilities for Gaussian free field level lines equal ratios of c=1 degenerate conformal blocks.","keywords":["Gaussian free field","level lines","conformal blocks","c=1","SLE_4","crossing probabilities","metric graph GFF","BPZ equations"],"falsifier":"Compute the crossing probability for level lines in a specific rectangular domain with three boundary arcs and compare it numerically to the explicit c=1 block formula; a statistically significant mismatch would falsify the equality.","tokens_in":2700,"feed_emoji":"","tokens_out":772,"duration_ms":18609,"temperature":0.7,"pith_summary":"The paper establishes that for the Gaussian free field on simply connected domains with piecewise constant Dirichlet boundary data, the probabilities that level lines connect specific boundary segments are given by conformal blocks of primary fields that are degenerate at each insertion in a c=1 conformal field theory. The same probabilities arise as ratios of explicit partition functions built from fused multiple SLE_4 curves, expressed via fused Specht polynomials. The result extends to the scaling limit of level-set crossings for the metric graph GFF. This supplies a CFT description, via blocks that solve the BPZ equations of arbitrary order, for the percolation geometry of these level sets. Only boundary conditions obeying certain monotonicity constraints select the blocks that appear.","feed_headline":"GFF level-line crossings given by c=1 degenerate blocks","feed_subtitle":"Probabilities equal ratios of fused SLE_4 partitions or c=1 conformal blocks under monotonic boundary data.","key_machinery":"Degenerate conformal blocks at c=1 (equivalently, ratios of fused multiple SLE_4 partition functions) that encode the crossing probabilities under monotonicity constraints on the boundary data.","core_discovery":"We show that the crossing probabilities for its level lines are determined by conformal blocks of primary fields in a conformal field theory (CFT) with central charge c = 1 which are degenerate at each insertion. Alternatively, the crossing probabilities are ratios of explicit partition functions of fused multiple SLE_4 curves, which can be written in terms of fused Specht polynomials. We also prove that for the metric graph GFF with appropriate boundary conditions, the crossing probabilities for its level sets converge in the scaling limit to our formulas. In particular, the geometry of the level-set percolation for both the continuum GFF and the metric graph GFF has a CFT description in te","pith_inferences":["The explicit Specht-polynomial expressions may permit direct combinatorial counting of the admissible crossing configurations.","Numerical sampling of GFF level lines could serve as a Monte-Carlo method to approximate values of these particular c=1 blocks.","If monotonicity is dropped, the probabilities would likely become linear combinations of several blocks rather than single blocks."],"forward_implications":["The crossing probabilities satisfy the BPZ partial differential equations of arbitrary orders.","Only the subset of boundary conditions obeying monotonicity constraints produce probabilities given by individual blocks; others are excluded.","The same formulas describe level-set percolation both for the continuum GFF and for the metric graph GFF after scaling.","The blocks are linearly independent and arise from primary fields labeled by generalized Dyck paths subject to the monotonicity selection."],"fun_headline_variants":["c=1 degenerate blocks dictate GFF level crossings","GFF crossings match ratios of fused SLE4 curves","Degenerate c=1 blocks fix GFF crossing probs","GFF level sets converge to c=1 conformal blocks"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The level lines of the GFF and its metric graph version have crossing probabilities captured exactly by the c=1 degenerate conformal blocks when boundary data is piecewise constant and satisfies the monotonicity constraints.","fun_headline_variants_meta":{"raw":{"variants":["c=1 degenerate blocks dictate GFF level crossings","GFF crossings match ratios of fused SLE4 curves","Degenerate c=1 blocks fix GFF crossing probs","GFF level sets converge to c=1 conformal blocks"]},"model":"grok-4.3","cost_usd":0.008464,"raw_usage":{"total_tokens":3872,"prompt_tokens":758,"num_sources_used":0,"completion_tokens":56,"cost_in_usd_ticks":84637000,"prompt_tokens_details":{"text_tokens":758,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3058,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":758,"tokens_out":56,"duration_ms":20641,"temperature":1.0,"reasoning_tokens":3058,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T11:05:19.830438+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Compute the crossing probability for level lines in a specific rectangular domain with three boundary arcs and compare it numerically to the explicit c=1 block formula; a statistically significant mismatch would falsify the equality.","supporting_citations":[],"review_version":1}