{"id":"d823911c-758b-4a5f-ab7e-2646867d0f6a","arxiv_id":"2604.11327","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"For every m ≥ 2, the wheel graph W_{2m+1} is homologous to an explicit linear combination of 2^{m-2} graphs with only 3- and 4-valent vertices in the Kontsevich graph complex GC_d.","lead":"This paper proves that wheel graphs in the Kontsevich graph complex can be represented using only graphs with 3- and 4-valent vertices. This confirms Merkulov's low-valence conjecture for these specific classes by giving an explicit construction.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption correctly isolates the homology-class equality. After examining the explicit construction, that equality is precisely what the paper asserts to have verified by direct (combinatorial) computation rather than by an appeal to abstract properties. The proposed base-case check is therefore the minimal concrete verification that would confirm or refute the claim; no further structural gap appears.","tokens_in":1619,"tokens_out":291,"duration_ms":40706,"concrete_test":"For the base case m=2, expand the single proposed 3-/4-valent graph G and the wheel W_5 in the basis of the graph complex; apply the differential to the claimed preimage chain and verify that d(preimage) exactly equals W_5 - G (up to the usual sign conventions and automorphism factors).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper supplies an explicit combinatorial construction showing that each wheel W_{2m+1} differs from a linear combination of 2^{m-2} trivalent/quartic graphs by an element in the image of the differential. Because the construction is direct and the differential is a standard edge-contraction operator on the graph complex, the central claim reduces to a finite (if tedious) cancellation that the authors claim to have performed. No internal inconsistency or hidden non-constructive step is visible in the argument.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper proves that wheel classes in the Kontsevich graph complex GC_d admit representatives supported only on graphs with 3- and 4-valent vertices. Specifically, for every m ≥ 2 it constructs an explicit linear combination of 2^{m-2} such graphs to which the wheel W_{2m+1} is homologous, thereby verifying Merkulov's low-valence conjecture for these classes.","tokens_in":1696,"tokens_out":363,"duration_ms":34366,"significance":"If the explicit homology equivalence holds, the result supplies concrete low-valence representatives for the wheel classes, which are among the most studied generators of the homology of the graph complex. The direct combinatorial construction, relying on the standard edge-contraction differential and a finite cancellation, is a strength that could support further explicit computations in related operadic and deformation-quantization contexts.","major_comments":[],"minor_comments":[{"comment":"Abstract: the range of d for which GC_d is considered and the ground field (or characteristic) could be stated explicitly to make the scope of the result immediately clear.","section":"Abstract"},{"comment":"The explicit linear combination is asserted in the main theorem; including a fully expanded example for the smallest case m=2 (showing the two graphs and the boundary terms that cancel) would aid verification without lengthening the paper substantially.","section":"Main result / Theorem"},{"comment":"Notation for the graphs in the linear combination could be accompanied by a small diagram or table for low m to improve readability for readers less familiar with the wheel graphs.","section":"Section 3"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment of our manuscript and for recommending minor revision. The referee's summary correctly reflects the main theorem: for each m ≥ 2 the wheel W_{2m+1} is homologous to an explicit linear combination of 2^{m-2} graphs with only 3- and 4-valent vertices.","responses":[],"tokens_in":1102,"tokens_out":89,"duration_ms":29822,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's main contribution is a direct construction: for every m at least 2, the wheel W_{2m+1} is shown to be homologous to a specific linear combination of exactly 2^{m-2} graphs that have only 3-valent and 4-valent vertices. This verifies the low-valence conjecture for the wheel classes in the Kontsevich graph complex GC_d. The formula is combinatorial and explicit rather than existential, which is the step beyond prior statements of the conjecture. That explicitness is the useful part; it gives something one can actually plug into further calculations or homology computations instead of just knowing the class exists in some quotient. The argument uses the standard differential on the graph complex, so the proof reduces to checking that the proposed combination is a cycle and that its difference from the wheel lies in the image of the differential. The stress-test note indicates this is a finite cancellation for each fixed m, with no non-constructive steps or hidden parameters. If the author has carried out the cancellations correctly, the homology claim follows in the usual way. I see no load-bearing circularity or invented entities here. The construction appears case-by-case but patterned enough to cover all m. A possible limitation is that this organizes only the wheel classes; the rest of the complex still needs work, and it is not yet clear how much this speeds up full homology calculations. The paper is for people already working with graph complexes, deformation quantization, or explicit homological algebra in this area. Anyone trying to find bases or relations in GC_d could use the representatives. It is worth sending to referees. The explicit formula makes the central claim checkable, and confirming the conjecture for wheels is a solid incremental result even if the details require careful verification.","headline":"Andersson gives explicit low-valence representatives for the wheel classes, turning Merkulov's conjecture into a concrete combinatorial statement for each W_{2m+1}.","tokens_in":2185,"tokens_out":433,"would_cite":false,"duration_ms":19560,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/AlexanderDuality.lean","rs_theorem":"alexander_duality_circle_linking","paper_passage":"for every m ≥ 2, we prove that the wheel graph W_{2m+1} is homologous to an explicit linear combination of 2^{m-2} graphs, each having only 3- and 4-valent vertices"}],"headline":"Wheel-graph homology reduction via binary sequences is orthogonal to RS cost/φ/periodicity forcing","alignment":"orthogonal","rationale":"Paper constructs explicit low-valence representatives for wheel classes W_{2m+1} in Kontsevich complex using left/right binary sequences and edge-contraction differentials; no J-cost, cosh identities, golden-ratio ladders, 8-tick periodicity or parameter-free constant derivations appear. RS theorems (e.g., reality_from_one_distinction, alexander_duality_circle_linking) derive spacetime and constants from a single distinction; the combinatorial graph-homology argument neither invokes nor contradicts them.","tokens_in":43646,"confidence":"high","tokens_out":254,"duration_ms":22552,"cache_read_input_tokens":32896,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Wheel graphs in the Kontsevich complex are homologous to explicit sums of 3- and 4-valent graphs.","keywords":["Kontsevich graph complex","wheel graphs","Merkulov low-valence conjecture","graph homology","deformation quantization","homology classes"],"falsifier":"For m equals 2, direct computation of the differential on the single low-valence graph to check if it is zero, together with an invariant test confirming the class equals that of W_5.","tokens_in":2499,"feed_emoji":"","tokens_out":705,"duration_ms":50255,"temperature":0.7,"pith_summary":"The paper proves that wheel classes in the Kontsevich graph complex GC_d admit representatives supported only on graphs with 3- and 4-valent vertices. For every m at least 2, the wheel graph W_{2m+1} is shown to be homologous to a specific linear combination of exactly 2 to the power of m minus 2 such low-valence graphs. This verifies Merkulov's low-valence conjecture specifically for the wheel classes. A sympathetic reader cares because these classes are central cycles whose simpler representatives could ease explicit computations in the homology that appears in deformation quantization and related algebraic structures.","feed_headline":"Wheel graphs reduced to 3- and 4-valent combinations","feed_subtitle":"For each odd wheel W_{2m+1}, an explicit sum of 2^{m-2} low-valence graphs verifies the conjecture","key_machinery":"The explicit linear combination of 2^{m-2} graphs with only 3- and 4-valent vertices that lies in the same homology class as the wheel graph W_{2m+1} under the differential of the Kontsevich graph complex.","core_discovery":"We show that the wheel classes in the Kontsevich graph complex GC_d admit representatives supported on graphs with only 3- and 4-valent vertices. More precisely, for every m greater than or equal to 2, the wheel graph W_{2m+1} is homologous to an explicit linear combination of 2^{m-2} graphs, each having only 3- and 4-valent vertices. This verifies that Merkulov's low-valence conjecture holds for the wheel classes.","pith_inferences":["The same reduction technique might extend to other families of graphs beyond the wheels.","Efficient computer-assisted calculations of the homology of GC_d become feasible when restricted to low-valence generators.","These low-valence representatives could be inserted into existing programs that enumerate cycles or compute differentials in graph complexes."],"forward_implications":["Merkulov's low-valence conjecture holds for every wheel class.","Each wheel homology class possesses an explicit representative using only 3- and 4-valent vertices.","Homology computations involving wheel classes can restrict attention to graphs of valence at most 4.","The result supplies concrete formulas rather than mere existence statements for these representatives."],"fun_headline_variants":["Kontsevich wheel classes represented by 3- and 4-valent graphs","Merkulov's low-valence conjecture verified for wheel classes","W_{2m+1} homologous to 2^{m-2} graphs of valence 3 and 4","Low-valence conjecture confirmed for wheel classes in graph complex"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The given explicit linear combination of 3- and 4-valent graphs lies in the kernel of the differential and represents exactly the same homology class as the wheel graph W_{2m+1}.","fun_headline_variants_meta":{"raw":{"variants":["Kontsevich wheel classes represented by 3- and 4-valent graphs","Merkulov's low-valence conjecture verified for wheel classes","W_{2m+1} homologous to 2^{m-2} graphs of valence 3 and 4","Low-valence conjecture confirmed for wheel classes in graph complex"]},"model":"grok-4.3","cost_usd":0.009984,"raw_usage":{"total_tokens":4306,"prompt_tokens":571,"num_sources_used":0,"completion_tokens":83,"cost_in_usd_ticks":99840500,"prompt_tokens_details":{"text_tokens":571,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3652,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":571,"tokens_out":83,"duration_ms":39045,"temperature":1.0,"reasoning_tokens":3652,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-21T08:46:11.028292+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"For m equals 2, direct computation of the differential on the single low-valence graph to check if it is zero, together with an invariant test confirming the class equals that of W_5.","supporting_citations":[],"review_version":2}