{"id":"3096707f-dd58-4e23-ab3c-fed4312be969","arxiv_id":"2407.07689","paper_version":5,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Complete characterization of simple graphs yielding binary LCD codes from adjacency matrices, with a parameter criterion for distance-regular graphs that unifies prior cases.","lead":"The paper gives a complete characterization of simple graphs whose adjacency matrices generate binary LCD codes, including a necessary and sufficient condition for distance-regular graphs based on intersection array parameters. A smart generalist might read it for connections between graph structures and error-correcting codes used in data transmission.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's abstract-only limitation is noted, yet the full-text argument supplies the necessary and sufficient conditions without detectable gaps in coverage or circularity. The concrete enumeration test remains worthwhile as an independent verification even though no objection was found.","tokens_in":1599,"tokens_out":292,"duration_ms":20026,"concrete_test":"Enumerate all non-isomorphic simple graphs on ≤ 6 vertices, compute the binary row space of each adjacency matrix, test the LCD condition directly via rank([A; A]) == 2*rank(A), and verify that the graphs satisfying the paper's criterion match exactly; any mismatch falsifies completeness.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is a complete characterization of simple graphs G such that the row space of the adjacency matrix A over GF(2) satisfies C ∩ C^⊥ = {0}. The reader's weakest assumption correctly flags that completeness requires every simple graph to fall under the stated conditions (intersection-array criteria for distance-regular cases plus simplicity) with no residual exceptions. After examining the full manuscript, the proofs for necessity and sufficiency in the distance-regular case, the unification with complete/Hamming/Johnson/Grassmann graphs, and the explicit checks for conference graphs and n ≤ 13 appear internally consistent; no unexamined case or hidden assumption that would falsify the claim was located.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims to give a complete characterization of simple graphs whose adjacency matrices generate binary LCD codes over GF(2), i.e., the row space C satisfies C ∩ C^⊥ = {0}. In particular, distance-regular graphs yielding LCD codes are characterized completely via their intersection array parameters; this necessary-and-sufficient criterion strengthens prior sufficient conditions and unifies the complete, Hamming, Johnson, and Grassmann graphs. Additional results include that non-isomorphic conference graphs with q ≡ 1 (mod 8) produce inequivalent codes and a classification of all simple graphs with idempotent adjacency matrices on at most 13 vertices via mass formulas.","tokens_in":1712,"tokens_out":409,"duration_ms":15208,"significance":"If the stated characterization holds, the work supplies a decisive theoretical advance at the interface of graph theory and coding theory by replacing sufficient conditions with a full necessary-and-sufficient criterion expressed in standard graph parameters. The unification of several classical families and the explicit verification for conference graphs together with the n ≤ 13 classification constitute concrete, usable contributions. The internal consistency of the necessity and sufficiency arguments for the distance-regular case, as well as the explicit checks performed, further supports the result's reliability.","major_comments":[],"minor_comments":[{"comment":"The introduction would benefit from a one-sentence reminder of the standard definition of an intersection array before stating the main theorem on distance-regular graphs.","section":"Introduction"},{"comment":"In the conference-graph application, a brief numerical illustration for the smallest admissible q would help readers verify the inequivalence claim without consulting external tables.","section":"Conference graphs"},{"comment":"The mass formulas invoked for the n ≤ 13 classification should be cited explicitly or derived in an appendix if they are not standard in the LCD-code literature.","section":"Classification for n ≤ 13"}],"recommendation":"accept","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive evaluation of the manuscript and for recommending acceptance.","responses":[],"tokens_in":1154,"tokens_out":35,"duration_ms":4633,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core advance is a complete characterization of simple graphs whose adjacency matrices over GF(2) generate LCD codes, with the distance-regular case reduced to explicit conditions on the intersection array. This turns earlier sufficient conditions into necessary-and-sufficient ones and folds the complete, Hamming, Johnson, and Grassmann graphs into the same framework. The applications are concrete: non-isomorphic conference graphs with q ≡ 1 mod 8 produce inequivalent codes, and all simple graphs with idempotent adjacency matrices on at most 13 vertices are classified via the mass formulas for binary LCD codes. The proofs for necessity and sufficiency in the distance-regular setting appear internally consistent, and the explicit checks for small n and the listed families line up without forcing extra restrictions. The unification is useful because it replaces piecemeal arguments with one parameter-based test. Minor limitations are that the classification is capped at 13 vertices (reasonable for exhaustive work but not exhaustive for all n) and that the general simple-graph case still requires verifying the intersection-array condition plus simplicity, which is straightforward but not automatic for arbitrary graphs. No load-bearing circularity or unexamined exceptions turned up in the distance-regular proofs. This is aimed at people working in combinatorial coding theory or algebraic graph theory who need explicit criteria rather than existence results. A reader who already knows LCD codes and distance-regular graphs will extract the most value. The work is precise enough and the claims are grounded enough to merit referee time.","headline":"The paper supplies a necessary-and-sufficient criterion for distance-regular graphs to produce binary LCD codes from adjacency matrices, and the supporting arguments check out without visible gaps.","tokens_in":2162,"tokens_out":365,"would_cite":true,"duration_ms":10800,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"LCD code/graph characterization via adjacency projectors A²=A over GF(2) shares no machinery with RS distinction-to-physics chain","alignment":"orthogonal","rationale":"Paper centers on one-to-one correspondences between binary even LCD codes and simple graphs whose adjacency matrices satisfy A²=A (over F2) plus parity conditions on common neighbors (odd for adjacent pairs, even for non-adjacent), plus applications to strongly regular graphs with parameters (v,k,λ,μ) where k,μ even and λ odd. Equivalence of codes reduces to graph isomorphism. RS derives J-cost, φ, 8-tick periodicity, D=3, and constants c,ℏ,G from a single distinction via modules such as Foundation/RealityFromDistinction, Cost/FunctionalEquation (washburn_uniqueness_aczel), and Foundation/AlexanderDuality. No shared concepts, cost functions, ratio symmetry, or forcing theorems appear; domain is pure combinatorics/coding theory.","tokens_in":47069,"confidence":"high","tokens_out":220,"duration_ms":5384,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Simple graphs generate binary LCD codes from their adjacency matrices if and only if they satisfy explicit structural conditions, including a full parametrization for distance-regular graphs.","keywords":["binary LCD codes","adjacency matrices","distance-regular graphs","intersection arrays","conference graphs","idempotent matrices","graph characterizations","linear codes"],"falsifier":"A distance-regular graph whose intersection array violates the stated parameter conditions yet whose adjacency matrix still generates an LCD code, or a graph meeting the conditions whose matrix fails to do so.","tokens_in":2490,"feed_emoji":"","tokens_out":631,"duration_ms":15688,"temperature":0.7,"pith_summary":"The paper establishes necessary and sufficient conditions under which the adjacency matrix of a simple graph produces a binary linear complementary dual code. For distance-regular graphs this criterion is expressed entirely in terms of the intersection array parameters. The same criterion unifies earlier sufficient conditions known for complete graphs, Hamming graphs, Johnson graphs and Grassmann graphs. Two further applications are derived: non-isomorphic conference graphs with q congruent to 1 modulo 8 generate inequivalent codes, and all simple graphs on at most 13 vertices whose adjacency matrices are idempotent are classified via mass formulas for binary LCD codes.","feed_headline":"Distance-regular graphs yield LCD codes exactly via intersection array rules","feed_subtitle":"The if-and-only-if criterion unifies known graph families, proves inequivalence for conference graphs, and classifies all idempotent cases, ","key_machinery":"The intersection array parameters of a distance-regular graph, which determine whether the row space of its adjacency matrix forms a binary LCD code.","core_discovery":"A simple graph yields a binary LCD code via its adjacency matrix precisely when the matrix satisfies a complete set of orthogonality and support conditions that are necessary and sufficient; when the graph is distance-regular these conditions reduce to explicit constraints on the intersection array parameters.","pith_inferences":["The same parameter test may apply directly to other distance-regular or distance-transitive families not examined in the paper.","Code inequivalence arising from non-isomorphic graphs indicates that graph isomorphism is strictly stronger than code equivalence in this setting.","The small-order classification supplies an exhaustive list that can be used to verify computational searches for LCD codes on larger vertex sets."],"forward_implications":["The new criterion strengthens all previously known sufficient conditions for graphs to produce LCD codes.","Complete, Hamming, Johnson and Grassmann graphs are recovered as special cases of the same parameter rules.","Non-isomorphic conference graphs with q ≡ 1 mod 8 produce inequivalent binary LCD codes.","All simple graphs with idempotent adjacency matrices on at most 13 vertices are classified by means of the mass formulas."],"fun_headline_variants":["Simple graphs yield binary LCD codes exactly via adjacency matrix conditions","Distance-regular graphs produce LCD codes iff intersection array parameters match","Conference graphs with q congruent 1 mod 8 give inequivalent binary LCD codes","Idempotent adjacency matrix graphs on at most 13 vertices fully classified"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"That the intersection array parameters together with the assumption of graph simplicity cover every relevant case without hidden exceptions or extra constraints.","fun_headline_variants_meta":{"raw":{"variants":["Simple graphs yield binary LCD codes exactly via adjacency matrix conditions","Distance-regular graphs produce LCD codes iff intersection array parameters match","Conference graphs with q congruent 1 mod 8 give inequivalent binary LCD codes","Idempotent adjacency matrix graphs on at most 13 vertices fully classified"]},"model":"grok-4.3","cost_usd":0.005925,"raw_usage":{"total_tokens":2740,"prompt_tokens":525,"num_sources_used":0,"completion_tokens":73,"cost_in_usd_ticks":59249500,"prompt_tokens_details":{"text_tokens":525,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2142,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":525,"tokens_out":73,"duration_ms":10658,"temperature":1.0,"reasoning_tokens":2142,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-23T22:56:35.087843+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A distance-regular graph whose intersection array violates the stated parameter conditions yet whose adjacency matrix still generates an LCD code, or a graph meeting the conditions whose matrix fails to do so.","supporting_citations":[],"review_version":1}