REVIEW
Exploring topological features of a complex network of prime factors and composite numbers
Number Theory · Submitted 24 Oct 2026 · 37 references
Pith's verdict: Nice core result—constant diameter for large N—but the theorem claim is overblown; small-N cases are not handled and the statement is technically false for N<9.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
The diameter of a bipartite network of primes and composites is exactly 5 for any size.
The reading
What carries the argument
The key machinery is Lemma 1, which guarantees at least one prime in the interval (N/3, N/2] for all N ≥ 4 except N = 9,21. Its proof uses the Rosser–Schoenfeld bounds for π(N) to show that for N ≥ 116 the lower bound exceeds the upper bound, forcing a positive count; smaller N are checked individually. This lemma provides the 'long bridge' needed to prove that the diameter is exactly 5: for any odd composite m and any such prime p̃, the unique shortest path goes m → (a prime factor of m) → 2·(that factor) → 2 → 2p̃ → p̃, which is five steps. Without this interval prime, the diameter might be smaller or larger.
Extended reading notes
Core claim
The core discovery is that the bipartite network R(N) – whose nodes are all integers from2 to N except primes larger than N/2, with edges between a prime and any composite having that prime in its factorization – has a diameter of exactly 5 for every positive integer N. The proof constructs a path of at most five steps between any two nodes and exhibits a concrete pair (an odd composite and a prime from (N/3,N/2]) whose shortest path is exactly five steps. The existence of such a prime (Lemma 1) is established using Rosser–Schoenfeld bounds on the prime-counting function and a manual check for small N, so the diameter is unconditional and does not depend on open conjectures. Additionally, the subnetwork R'(N) (which omits primes larger than √N) has diameter 4, confirming that both networks are small-world. The paper also proves that boundary nodes are exactly prime powers and primes in (N/3,N/2], and shows that the classic disconnection algorithm (Algorithm 1) misidentifies many low-degree primes as relevant; two alternative algorithms (weighted-degree-difference and no-disconnection) give a much smaller and more plausible set of relevant nodes (essentially the primes ≤ √N). Finally, the Shannon and Tsallis information dimensions are computed numerically: both decrease with N, and for box sizes ε =3 or 4 the number of covering boxes becomes roughly constant.
Load-bearing premise
Lemma 1 asserts that for every N ≥ 4 except N = 9, 21, the interval (N/3, N/2] contains at least one prime; the proof relies on the Rosser–Schoenfeld bounds for π(N) and a manual verification of small N, and if either the bounds or the manual check were flawed, the diameter‑5 proof would collapse.
Editorial extensions
If this is right
- The constant diameter of 5 (independent of N) provides a rare example of a network whose diameter does not increase at all with size, making it a candidate for modeling systems where communication steps are bounded.
- The proof that R'(N) has diameter 4 shows that removing a sparse set of primes (those between √N and N/2) reduces the diameter by exactly one, indicating that those primes occupy a bottleneck role in the metric structure.
- The characterization of boundary nodes (prime powers and primes in (N/3,N/2]) gives a simple, number‑theoretic rule for identifying nodes at the periphery of the network.
- The proposed weighted-degree-difference algorithm (Algorithm 2) can select relevant nodes with O(N log N) complexity, offering a practical alternative for large networks where the classic disconnection algorithm is costly.
- The numerical observation that Shannon and Tsallis entropies both decrease with N, and that box covers at ε =3,4 stabilize in number, suggests an emergent self‑similarity in the network's large‑scale topology.
Reading between the lines
- Because the network's diameter does not grow with N, the network is a member of a very small class of graphs where the small‑world property is taken to the extreme: the diameter is not just logarithmic, but constant. This behavior likely arises from the multiplicative structure of integers and the density of primes.
- A natural extension would be to ask what happens when the exclusion of primes larger than N/2 is lifted. Including those primes would create additional short paths, possibly reducing the diameter to 4 or even 3 for sufficiently large N.
- The fact that the weighted-degree-difference algorithm produces a list very close to the primes ≤ √N suggests that a purely number‑theoretic rule (a node is relevant if its order of magnitude is at most √N) may be derivable analytically, not just numerically.
Original abstract
Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. The last shows that this network is of small-world type. We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. The results show both decreasing as the number of nodes increases. Furthermore, both entropies indicate that box coverings at the diameters \(\varepsilon=[3,4]\), group nodes into roughly the same number of boxes, independent of the number of nodes in the network.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. The last shows that this network is of small-world type. We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. The results show both decreasing as the number of nodes increases. Furthermore, both entropies indicate that box coverings at the diameters \(\varepsilon=[3,4]\), group nodes into roughly the same number of boxes, independent of the number of nodes in the network.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. | background 1.00 | 0.04 | 0.01 | asserted 1.00 |
| s1 | They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. | background 1.00 | 0.04 | 0.02 | asserted 1.00 |
| s2 | Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. | background 1.00 | 0.03 | 0.02 | asserted 0.89 |
| s3 | In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. | contribution 1.00 | 0.96 | 0.14 | asserted 0.99 |
| s4 | More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. | result 0.99 | 0.96 | 0.49 | asserted 1.00 |
| s5 | In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. | result 1.00 | 0.97 | 0.14 | asserted 1.00 |
| s6 | The last shows that this network is of small-world type. | interpretation 0.97 | 0.90 | 0.24 | asserted 0.98 |
| s7 | We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. | contribution 0.90 | 0.96 | 0.07 | asserted 1.00 |
| s8 | Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. | contribution 0.75 | 0.94 | 0.05 | asserted 0.82 |
| s9 | The results show both decreasing as the number of nodes increases. | result 1.00 | 0.94 | 0.10 | asserted 1.00 |
| s10 | Furthermore, both entropies indicate that box coverings at the diameters \(\varepsilon=[3,4]\), group nodes into roughly the same number of boxes, independent of the number of nodes in the network. | result 0.98 | 0.94 | 0.11 | asserted 0.56 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
Figures
Figures reproduced from arXiv:2610.33873 by the authors.
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.