Pith. sign in

REVIEW 2 major objections 4 minor 16 references

A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem

T0 review · 2 major / 4 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read 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

desk verdict Clean conditional rank-count for general CDDGP via labeled component masks; the math holds under the paper's own GP/SD hypotheses. read the letter →

arxiv 2607.10155 v1 pith:JBSL7TIN submitted 2026-07-11 math.CO math.MG

Michael Souza , Wagner da Rocha , Carlile Lavor This is my paper · ORCID
classification math.COmath.MG MSC 05C1051K0552C2568R10
keywords distancegeometryCDDGPpartialreflectionsfinite-fieldlinearalgebrarealizationcountingrigidgraphslaterationK-joined
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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.

What would settle it

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.

Watch

Extended reading notes

Core claim

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.

Load-bearing premise

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.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

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.

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 (2)
  1. 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.
  2. 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.
minor comments (4)
  1. 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.
  2. 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.
  3. 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.
  4. 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.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: rank-count is derived from internal F2 linear algebra plus an external K-joined partial-reflection theorem; self-citations supply only CDDGP background.

full rationale

The central claim (Theorems 6.3–6.4) equates the feasible constrained codes XP to an affine translate of the image K = M(ker V) and obtains |X| = 2^{|BF| + rank[M;V] − rank V} by free-bit factorization (Prop. 3.4) and rank-nullity (Lemma 6.1). Soundness of every shift in K (Theorem 5.3) is proved directly from component reflections (Lemmas 4.2, 5.2, Prop. 4.3) without external input. Completeness imports the independent geometric generator set of Garamvölgyi–Jordán [4, Thm. 4.5] that every equivalent generic realization of a K-joined graph arises by reduced partial K-reflections; the paper then verifies that those reflections produce labeled masks lying in ker V. Self-citations (Liberti–Lavor–Mucherino–Souza lines) appear only for the CDDGP/DMDGP model and Branch-and-Prune background, not for the rank formula or the completeness argument. There is no parameter fitting, no self-definitional identification of the count with its own input, and no uniqueness theorem imported from the authors themselves. The only conditioning is the paper’s explicit GP assumption, which is already stated as necessary for the external characterization to apply. Hence the derivation is self-contained against its stated hypotheses and exhibits no circular reduction.

Assumptions & free parameters 0 free parameters · 5 assumptions · 3 invented entities

Pure combinatorial-geometry theorem: no fitted numerical parameters. Load-bearing content is (i) standard linear algebra and graph theory, (ii) domain conventions that define the CDDGP model the authors count, (iii) two geometric hypotheses (SD, GP) required for the partial-reflection completeness argument, and (iv) the external K-joined characterization of Garamvölgyi–Jordán. Invented entities are the labeled matrices and the free/constrained bit split used to state the formula; they are definitional bookkeeping, not physical postulates.

assumptions (5)
  • domain assumption Strict discretization (Assumption 3.2): every predecessor metric clique yields exactly two distinct lateration candidates for each branch vertex.
    Required for the branch map Φ to be a bijection onto lateration embeddings (Lemma 3.3) and for free-bit extensions to always exist.
  • domain assumption Generic feasible framework (Assumption 6.2): constrained graph H has a feasible realization congruent to a generic framework in R^K before seed normalization.
    Invoked in Theorem 6.3 so that every equivalent realization is generated by partial K-reflections of a K-joined graph.
  • domain assumption Skeletal CDDGP template (Definition 3.1): each predecessor set C_i induces a K-clique already in the lateration skeleton G_D, not only after pruning edges.
    Separates branch creation from pruning; without it the counting model couples metric completion with rejection.
  • standard math Garamvölgyi–Jordán theorems: every K-connected chordal graph is K-joined; edge addition preserves K-joinedness; equivalent generic realizations of a K-joined graph arise by reduced partial K-reflections ([4, Thms. 4.5, 4.7, 4.12]).
    External rigidity results used as black boxes for completeness in Section 6.
  • standard math Rank–nullity and linear algebra over F_2 for maps M and V (Lemma 6.1).
    Converts dim M(ker V) into the rank difference that appears in the count formula.
invented entities (3)
  • Labeled mirror masks m^C_A and mask matrix M
    purpose: Encode partial reflections of seed-free components as binary shifts on constrained branch bits, retaining the mirror clique label.
    Definitional construction of the paper; equal vectors with different labels remain distinct columns so cancellations are mirror-local.
  • Labeled violation matrix V
    purpose: Detect which component reflections cross a pruning edge with fixed endpoint outside the mirror clique; define ker V of compatible combinations.
    Ad hoc matrix design that turns geometric compatibility into an F_2 kernel; not an external physical object.
  • Constrained/free bit partition (B_P, B_F) via predecessor closure of pruning endpoints
    purpose: Factor |X| = 2^{|B_F|} |X_P| so only the pruning-closed subsystem needs reflection analysis.
    Graph-theoretic bookkeeping introduced in §3.1; standard closure idea specialized to CDDGP orders.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem." pith.science (2026). https://pith.science/paper/JBSL7TIN

@misc{pith2026260710155,
  author       = {Pith},
  title        = {Pith review of: A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JBSL7TIN}},
  note         = {Machine review of arXiv:2607.10155}
}
read the original abstract

The Combinatorial Discretizable Distance Geometry Problem combines a finite binary lateration process with additional distance constraints. When predecessor sets are not consecutive, these pruning constraints interact in ways that make the symmetry-based counting methods available for molecular instances insufficient. We establish an exact, dimension-uniform counting theorem for seed-fixed feasible realizations under strict discretization and a generic feasible framework assumption. Our approach identifies partial reflections through seed-free connected components of the lateration skeleton. These reflections are encoded by binary masks, while a labeled constraint matrix detects combinations that preserve all pruning distances. The feasible branch choices split into constrained choices generated by compatible partial reflections and unconstrained choices outside the predecessor closure of the pruning endpoints. The resulting count is obtained from graph operations and rank computations over the binary field, without enumerating the lateration tree. Completeness follows from the characterization of generic realizations of the relevant joined graphs by partial reflections. The theorem applies in every Euclidean dimension, including dimension one.

Figures

Figures reproduced from arXiv: 2607.10155 by the authors.

Figure 1
Figure 1. Component reflection across a separator C. The blue segments represent distances before reflection and the red segments the corresponding tests after reflecting A1. The starred red segments are crossed pruning edges whose fixed endpoints lie outside C; they are precisely the local violations recorded by the labeled matrix V. Lemma 4.2 (Structural preservation). Let S be a union of components of GC with S ∩ V0 = ∅. T… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references · 10 canonical work pages

  1. [1]

    The K- discretization and K-incident graphs for discretizable distance geometry.Optimization Letters, 14(2):1–14, 2018

    Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, and Antonio Mucherino. The K- discretization and K-incident graphs for discretizable distance geometry.Optimization Letters, 14(2):1–14, 2018. doi: 10.1007/s11590-018-1294-2

    work page doi:10.1007/s11590-018-1294-2 2018

  2. [2]

    An impossible combinatorial counting method in distance geometry.Discrete Applied Mathematics, 354:83–93, 2024

    Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, and Antonio Mucherino. An impossible combinatorial counting method in distance geometry.Discrete Applied Mathematics, 354:83–93, 2024. doi: 10.1016/j.dam.2024.02.018

    work page doi:10.1016/j.dam.2024.02.018 2024

  3. [3]

    Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015

    Andrea Cassioli, Oktay Günlük, Carlile Lavor, and Leo Liberti. Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015. doi: 10.1016/j.dam.2014.08. 035

    work page doi:10.1016/j.dam.2014.08 2015

  4. [4]

    Partial reflections and globally linked pairs in rigid graphs.SIAM Journal on Discrete Mathematics, 38(3):2005–2040, 2024

    Dániel Garamvölgyi and Tibor Jordán. Partial reflections and globally linked pairs in rigid graphs.SIAM Journal on Discrete Mathematics, 38(3):2005–2040, 2024. doi: 10.1137/ 23M157065X

    2005

  5. [5]

    A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8): 2400–2426, 2021

    Douglas S Gonçalves, Carlile Lavor, Leo Liberti, and Michael Souza. A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8): 2400–2426, 2021. doi: 10.1007/s00453-021-00835-6

    work page doi:10.1007/s00453-021-00835-6 2021

  6. [6]

    The discretizable molecular distance geometry problem.Computational Optimization and Applications, 52(1):115–146, 2012

    Carlile Lavor, Leo Liberti, Nelson Maculan, and Antonio Mucherino. The discretizable molecular distance geometry problem.Computational Optimization and Applications, 52(1):115–146, 2012. doi: 10.1007/s10589-011-9402-6

    work page doi:10.1007/s10589-011-9402-6 2012

  7. [7]

    Distance geometry and data science.Top, 28(2):271–339, 2020

    Leo Liberti. Distance geometry and data science.Top, 28(2):271–339, 2020. doi: 10.1007/ s11750-020-00563-0. 11

    2020

  8. [8]

    A branch-and-prune algorithm for the molecular distance geometry problem.International Transactions in Operational Research, 15(1):1–17,

    Leo Liberti, Carlile Lavor, and Nelson Maculan. A branch-and-prune algorithm for the molecular distance geometry problem.International Transactions in Operational Research, 15(1):1–17,

Show all 16 references
  1. [9]

    doi: 10.1111/j.1475-3995.2007.00622.x

    2007 doi

  2. [10]

    On the number of solutions of the discretizable molecular distance geometry problem

    Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, and Antonio Mucherino. On the number of solutions of the discretizable molecular distance geometry problem. InInternational Conference on Combinatorial Optimization and Applications, pages 322–342. Springer, 2011. doi: 10.100...

    2011

  3. [11]

    Counting the number of solutions of kdmdgp instances

    Leo Liberti, Carlile Lavor, Jorge Alencar, and Germano Abud. Counting the number of solutions of kdmdgp instances. InInternational Conference on Geometric Science of Information, pages 224–230. Springer, 2013. doi: 10.1007/978-3-642-40020-9_23

    2013 doi

  4. [12]

    On the number of realizations of certain henneberg graphs arising in protein conformation.Discrete Applied Mathematics, 165:213–232, 2014

    Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, and Antonio Mucherino. On the number of realizations of certain henneberg graphs arising in protein conformation.Discrete Applied Mathematics, 165:213–232, 2014. doi: 10.1016/j.dam.2013.01.020

    2014 doi

  5. [13]

    An analysis on the degrees of freedom of binary representations for solutions to discretizable distance geometry problems

    Antonio Mucherino. An analysis on the degrees of freedom of binary representations for solutions to discretizable distance geometry problems. InRecent Advances in Computational Optimization, pages 251–255. Springer, 2021. doi: 10.1007/978-3-030-82397-9

    2021 doi

  6. [14]

    The discretizable distance geometry problem.Optimization Letters, 6(8):1671–1686, 2012

    Antonio Mucherino, Carlile Lavor, and Leo Liberti. The discretizable distance geometry problem.Optimization Letters, 6(8):1671–1686, 2012. doi: 10.1007/s11590-011-0358-3

    2012 doi

  7. [15]

    Exploiting symmetry properties of the dis- cretizable molecular distance geometry problem.Journal of Bioinformatics and Computational Biology, 10(03):1242009, 2012

    Antonio Mucherino, Carlile Lavor, and Leo Liberti. Exploiting symmetry properties of the dis- cretizable molecular distance geometry problem.Journal of Bioinformatics and Computational Biology, 10(03):1242009, 2012. doi: 10.1142/S0219720012420097

    2012 doi

  8. [16]

    The positioning problem—a draft of an intermediate summary

    Yechiam Yemini. The positioning problem—a draft of an intermediate summary. InProceedings of the Conference on Distributed Sensor Networks, pages 137–145. sn, 1978. 12

    1978

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.