{"id":"4b71879c-ef76-42ce-9ad9-21927d2a2462","arxiv_id":"2607.10155","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Under strict discretization and a generic feasible framework, the number of seed-fixed feasible CDDGP branch codes equals 2^|BF| times a binary-field rank difference of labeled partial-reflection masks and pruning-violation matrices.","lead":"The paper gives an exact formula that counts feasible solutions of a combinatorial distance-geometry problem without walking the full binary search tree. It matters for molecular conformation and sensor localization whenever predecessor sets are non-consecutive and ordinary suffix-symmetry counting fails.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the paper's own GP conditioning.","rationale":"The paper states a conditional theorem whose hypotheses are necessary for the imported partial-reflection completeness result. Soundness holds on the full SD domain; free-bit factorization is elementary; the labeled matrices correctly retain mirror identity so that F2 cancellations are geometrically meaningful. The worked example is consistent with the formula. Because the only load-bearing fragility is already flagged by the reader (GP), no verdict adjustment is warranted. The concrete test above is still worth running as an independent sanity check of the matrices and of the claim that every feasible constrained code lies in K.","tokens_in":10221,"tokens_out":469,"duration_ms":5277,"concrete_test":"Independently recompute the worked example of Section 7: build M and V from the listed components and pruning edges, verify rank_F2(V)=2 and rank_F2([M;V])=4, then exhaustively enumerate all 2^4 constrained codes under a concrete generic length assignment satisfying SD and check that exactly the four listed vectors of K are feasible. Agreement confirms the matrices and the completeness step on a nontrivial instance.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorems 6.3–6.4) is an exact rank-count under the skeletal CDDGP convention, SD (Assumption 3.2), and GP (Assumption 6.2). Soundness of K = M(ker V) is proved directly from component reflections and the labeled violation matrix (Theorem 5.3) without genericity. Completeness imports the Garamvölgyi–Jordán characterization that every equivalent generic realization of a K-joined graph arises by reduced partial K-reflections; the paper then shows those reflections produce masks in K (proof of Theorem 6.3). The only place the equality IP(s*) = K can fail is precisely when GP fails (nongeneric coincidences or no feasible generic representative). That is already the paper's explicit conditioning and the reader's weakest_assumption; no additional internal gap (e.g., unlabeled-mask cancellation, free-bit factorization, or dimension-1 special case) is visible in the argument.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper develops an exact counting theory for seed-fixed feasible branch codes of the Combinatorial Discretizable Distance Geometry Problem (CDDGP) when predecessor sets need not be consecutive. Under the skeletal CDDGP convention, strict discretization (Assumption 3.2), and a generic feasible framework assumption (Assumption 6.2), the authors partition branch bits into constrained bits BP (the predecessor closure of pruning endpoints) and free bits BF, encode partial reflections of seed-free components of the lateration skeleton by labeled binary masks collected in a matrix M, and record pruning-edge incompatibilities by a labeled violation matrix V. They prove that the compatible constrained shifts are exactly K = M(ker V), that this space is the full set of relative feasible constrained codes for a generic feasible instance (Theorem 6.3), and that the cardinality is therefore |X| = 2^{|BF| + rank_{F_2}[M;V] - rank_{F_2}(V)} (Theorem 6.4). Completeness is obtained by showing that the constrained graph is K-joined and invoking the Garamvölgyi–Jordán characterization of equivalent generic realizations by partial K-reflections; soundness of the kernel construction is proved directly. A planar worked example and a brief computational check are supplied.","tokens_in":10489,"tokens_out":967,"duration_ms":10230,"significance":"If the result holds under the stated hypotheses, it supplies the first dimension-uniform, weight-independent exact count for generic skeletal CDDGP instances whose predecessor sets are not nested. This closes a genuine gap left by the DMDGP suffix-reflection literature and by the impossibility result of Abud et al. for unrestricted DDGP. The construction is algorithmic in principle: the count is reduced to graph operations (predecessor closure, component extraction) and rank computations over F_2, without enumeration of the lateration tree. The explicit conditioning on strict discretization and generic feasibility, together with the clean separation of free and constrained bits, makes the formula usable as a certifiable counting step whenever a generic feasible representative is known. The worked example and the transparent appeal to an external rigidity theorem further strengthen the contribution.","major_comments":[{"comment":"Assumption 6.2 (Generic feasible framework) is load-bearing for the equality IP(s*) = K in Theorem 6.3, yet the manuscript gives no practical criterion, even for small instances, that would allow a reader to verify that a given numerical realization is congruent to a generic framework before seed normalization. Because completeness is imported wholesale from the Garamvölgyi–Jordán theorem, the paper should either supply a short, checkable genericity test (or a reference to one) or state more explicitly that the formula is certified only after such a representative has been independently established.","section":null},{"comment":"Section 7 presents a single planar example that yields |X| = 8 and asserts that an “exhaustive validation” accompanies the paper, but no table, code reference, or description of the validation suite appears in the manuscript. For a counting theorem whose main claim is exactness, at least a brief account of the instances checked (dimensions, sizes, comparison with Branch-and-Prune enumeration) is needed to give the reader independent evidence that the rank formula matches the true cardinality outside the worked example.","section":null}],"minor_comments":[{"comment":"Figure 1 is helpful but the caption and the surrounding text never define the starred red segments formally; a one-sentence cross-reference to Definition 5.1 would remove any ambiguity.","section":null},{"comment":"The notation for the vertical concatenation [M;V] is introduced only in Lemma 6.1; a brief remark when M and V are first defined would improve readability.","section":null},{"comment":"In the proof of Theorem 6.3 the residual global reflection across aff(V0) is handled correctly, but the argument that Mα0 = 1_BP and Vα0 = 0 could be isolated as a short lemma for easier citation.","section":null},{"comment":"A few typographical inconsistencies appear (e.g., “Garamvölgyi” vs. “Garamvölgyi and Jordán” citation style; occasional missing spaces around math operators). A light copy-edit pass would suffice.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The paper is a solid, carefully conditioned contribution that sits comfortably in the discrete-geometry / combinatorial-optimization literature. The main novelty is the labeled-mask construction that extends DMDGP counting to non-consecutive predecessors; the reliance on Garamvölgyi–Jordán is appropriate and clearly acknowledged. I see no citation or novelty issues that would affect the editorial decision."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is the first exact, dimension-uniform count for seed-fixed feasible branch codes on general CDDGP (non-consecutive predecessors). The new pieces are the free/constrained split by predecessor closure of pruning endpoints, the labeled component masks m^C_A coming from seed-free components of the lateration skeleton after removing a mirror clique, and the mirror-indexed violation matrix V that turns pruning compatibility into an F_2 kernel. The formula |X|=2^{|B_F|+rank[M;V]-rank V} follows immediately, and it recovers the classical power-of-two when there are no pruning edges.\n\nWhat works: the soundness half (Theorem 5.3) is self-contained and does not need genericity—component reflections preserve the skeleton, and ker V exactly kills the crossings that would break pruning distances. Completeness imports Garamvölgyi–Jordán on K-joined graphs (the constrained lateration skeleton is a K-tree, pruning edges keep it K-joined) and then shows those partial reflections produce masks inside K. The planar worked example is transparent and matches the ranks. Citations are honest: DMDGP suffix theory, Abud et al. impossibility for unrestricted DDGP, and the rigidity paper are used for what they actually supply.\n\nSoft spots are the ones the authors already flag. Completeness lives or dies with Assumption 6.2 (a feasible generic representative of the constrained graph before seed normalization). That is not a hidden gap; it is the explicit conditioning. There is also no shipped code or exhaustive-check artifact for the “computational validation” mentioned in Section 7, so the formula is not yet a black-box certifier. Neither issue breaks the theorem as stated.\n\nThis is for people who already work on discretizable DG, Branch-and-Prune, or K-joined rigidity and want a counting primitive that survives non-interval predecessor sets. It deserves a serious referee; the argument is fully textual and within combinatorial competence. I would engage with it and expect to cite the rank formula when I next need a CDDGP count.","headline":"Clean conditional rank-count for general CDDGP via labeled component masks; the math holds under the paper's own GP/SD hypotheses.","tokens_in":11117,"tokens_out":509,"would_cite":true,"duration_ms":4396,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C10","51K05","52C25","68R10"],"pacs":[],"model":"grok-4.5","headline":"The paper gives an exact formula for the number of seed-fixed feasible realizations of a Combinatorial Discretizable Distance Geometry Problem by reducing the count to ranks of two binary matrices built from component reflections and prunin","keywords":["distance geometry","CDDGP","partial reflections","finite-field linear algebra","realization counting","rigid graphs","lateration","K-joined graphs"],"falsifier":"Construct a small skeletal CDDGP instance that satisfies strict discretization, compute the two binary matrices M and V, evaluate the rank formula, then exhaustively enumerate every lateration embedding and count how many satisfy the pruning distances; any mismatch falsifies the claimed equality.","tokens_in":11095,"feed_emoji":"📐","tokens_out":625,"duration_ms":5031,"temperature":0.7,"pith_summary":"The Combinatorial Discretizable Distance Geometry Problem builds candidate point configurations by a sequence of binary lateration choices and then discards those that violate extra distance constraints. When the predecessor sets used for lateration are not consecutive, the familiar power-of-two counting that works for molecular instances no longer applies. The authors prove that, under strict discretization and a generic-feasible-framework hypothesis, every seed-fixed feasible branch code is obtained from free bits outside a predecessor-closed subsystem together with a vector space of constrained shifts generated by compatible partial reflections. Those reflections are encoded as labeled binary masks; a second matrix records which combinations preserve every pruning distance. The size of the feasible set is therefore given by a closed-form expression involving only the number of free bits and the ranks of the two matrices over the binary field. The result holds uniformly in every Euclidean dimension and replaces exhaustive traversal of the lateration tree by ordinary graph and linear-algebra operations.","feed_headline":"Binary ranks count feasible distance-geometry codes exactly","feed_subtitle":"Partial reflections and two matrices over F2 replace lateration-tree enumeration in every dimension","key_machinery":"The labeled mask matrix M whose columns are indicator vectors of seed-free connected components of the lateration skeleton after removal of a predecessor clique, together with the mirror-labeled violation matrix V that records pruning edges crossed by a component whose fixed endpoint lies outside that clique; their kernels and ranks identify precisely the compatible partial-reflection shifts.","core_discovery":"Under the skeletal CDDGP convention, strict discretization, and the assumption that the constrained graph admits a feasible realization congruent to a generic framework, the set of seed-fixed feasible branch codes is an affine translate of a binary vector space K = M(ker V) times a free-bit cube. Consequently its cardinality is exactly 2 raised to the power |B_F| plus rank of the stacked matrix [M;V] minus rank of V.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Binary ranks count seed-fixed CDDGP codes exactly","Partial reflections give exact feasible branch counts","F2 ranks replace lateration-tree enumeration for CDDGP","Exact cardinality of feasible distance-geometry codes via ranks","Graph operations over GF(2) count discretizable realizations"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The constrained graph must possess at least one feasible realization that is congruent to a generic framework before the seed is fixed; without that genericity the completeness argument that every feasible code arises from partial reflections fails.","fun_headline_variants_meta":{"raw":{"variants":["Binary ranks count seed-fixed CDDGP codes exactly","Partial reflections give exact feasible branch counts","F2 ranks replace lateration-tree enumeration for CDDGP","Exact cardinality of feasible distance-geometry codes via ranks","Graph operations over GF(2) count discretizable realizations"]},"model":"grok-4.5","effort":"low","cost_usd":0.003916,"raw_usage":{"total_tokens":1202,"prompt_tokens":728,"num_sources_used":0,"completion_tokens":80,"cost_in_usd_ticks":39160000,"prompt_tokens_details":{"text_tokens":728,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":394,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":728,"tokens_out":80,"duration_ms":4276,"temperature":1.0,"reasoning_tokens":394,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-14T13:52:00.422774+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Construct a small skeletal CDDGP instance that satisfies strict discretization, compute the two binary matrices M and V, evaluate the rank formula, then exhaustively enumerate every lateration embedding and count how many satisfy the pruning distances; any mismatch falsifies the claimed equality.","supporting_citations":[],"review_version":1}