Paper Citation Record · LEDGER

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

As of 22 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.27213.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.27213 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T12:41:37.194928Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

verified exact0
verified fuzzy0
unresolved16
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 38cce86b-cf20-43ee-bc25-18a48d5cc6c3 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem The K- discretization and K-incident graphs for discretizable distance geometry.Optimization Letters, 14(2):1–14, 2018

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:35.497505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4690d449-1134-49bc-8bdd-4688ede5c475 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem An impossible combinatorial counting method in distance geometry.Discrete Applied Mathematics, 354:83–93, 2024

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:35.595375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24a20a72-5287-4d70-9319-233a888c1e04 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:35.713301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3248b034-50f2-4b63-afbb-a88f5ba01ea0 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8):2400–2426, 2021

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:35.843889Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7858c80-e6e8-4e6b-a5bf-e5741c2975cc · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem The discretizable molecular distance geometry problem.Computational Optimization and Applications, 52(1):115–146, 2012

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:35.952747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77ddc65f-8a1f-4543-aada-0b787984b93b · outbound

This paper cites On the optimality of finding DMDGP symmetries.Computational and Applied Mathematics, 40(3):98, 2021.

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem On the optimality of finding DMDGP symmetries.Computational and Applied Mathematics, 40(3):98, 2021

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.068601Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ed14fce-db09-499b-85e2-0c9ea51d84d4 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem Distance geometry and data science.Top, 28(2):271–339, 2020

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.183698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f03e9ff7-659f-4c6e-a08e-5119ac53a38e · outbound

This paper cites Counting the number of solutions of kdmdgp instances.

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem Counting the number of solutions of kdmdgp instances

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.300398Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c1f5d37-2e3e-45bc-b148-ca44be1688b6 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem A branch-and-prune algorithm for the molecular distance geometry problem.International Transactions in Operational Research, 15(1):1–17, 2008

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.425762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e42307ec-312c-4689-9338-7d225f4260c8 · outbound

This paper cites The discretizable molecular distance geometry problem seems easier on proteins.

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem The discretizable molecular distance geometry problem seems easier on proteins

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.539332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91741fe9-8fc1-4ce2-a68c-6facffd7635e · outbound

This paper cites On the number of solutions of the discretizable molecular distance geometry problem.

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem On the number of solutions of the discretizable molecular distance geometry problem

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.649855Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a907788-4c0f-4250-a845-4b3b5a5350ac · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem On the number of realizations of certain henneberg graphs arising in protein conformation.Discrete Applied Mathematics, 165:213–232, 2014

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.763679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 972a5e87-219e-4bcb-a492-2703de41ec05 · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem An analysis on the degrees of freedom of binary representations for solutions to discretizable distance geometry problems

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:36.882433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e09884b9-2a31-4836-a3fa-bea10ee96fdc · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem The discretizable distance geometry problem.Optimization Letters, 6(8):1671–1686, 2012

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:37.005410Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e55c171f-200f-41d7-b958-2a0128ea5ebc · outbound

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

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem Exploiting symmetry properties of the dis- cretizable molecular distance geometry problem.Journal of Bioinformatics and Computational Biology, 10(03):1242009, 2012

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:37.120483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f0bd3a9-106d-45ea-9c91-a91963e6e32c · outbound

This paper cites The positioning problem—a draft of an intermediate summary.

A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem The positioning problem—a draft of an intermediate summary

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T12:41:37.194928Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.