Paper Citation Record · LEDGER

A Conditional 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.10155.

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

pith.paper-citation-record.v1
2607.10155 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-14T13:52:36.230396Z

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 exact10
verified fuzzy0
unresolved3
parse uncertain0
malformed identifier3
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0f387eb8-6e81-4441-b513-5543e47f1b1a · outbound

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

A Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.695930Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation c6d9cb68-d998-4e6b-936a-3794d6cffe35 · outbound

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

A Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.697169Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 2beae219-e89c-4bf1-9755-4312ae1b4428 · outbound

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

A Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.709397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation e83fa81a-4d11-485e-bbcf-8e572a91da98 · outbound

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

A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem Partial reflections and globally linked pairs in rigid graphs.SIAM Journal on Discrete Mathematics, 38(3):2005–2040, 2024

Reference 4

Resolution: malformed identifier; no resolver link, observed 2026-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc6edc3a-f89f-47bc-b62f-3bc4c86c65d2 · 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 Conditional 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 5

Resolution: verified exact; doi, observed 2026-07-14T14:00:32.689798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d2dae0d3-ec6f-45eb-a06b-972aa705b072 · outbound

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

A Conditional 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 6

Resolution: verified exact; doi, observed 2026-07-14T14:00:32.713337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation e796c6ed-9cc7-4df0-b169-9e5062b9f667 · outbound

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

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

Reference 7

Resolution: malformed identifier; no resolver link, observed 2026-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c585a99c-39c8-49dc-bdaf-2f99db8a800f · outbound

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

A Conditional 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,

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58a3f760-a0f0-4e13-8bcf-b8628b356168 · outbound

This paper cites an unresolved cited work.

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

Reference 9

Resolution: verified exact; arxiv_id, observed 2026-07-14T14:00:32.722343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 49fd5450-55da-4f10-8898-be92b5b2f8da · outbound

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

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

Reference 10

Resolution: malformed identifier; no resolver link, observed 2026-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8424c027-da6c-4404-ae2b-5c134a8bcc20 · outbound

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

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

Reference 11

Resolution: verified exact; doi, observed 2026-07-14T14:00:32.718279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 87191b18-bfb6-45bd-82e3-f2aea86195fe · 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 Conditional 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-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 459e74ad-62c8-4d4b-a109-6dd6142910d3 · outbound

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

A Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.692591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 45eaac52-01db-463e-9130-66d6737a7679 · outbound

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

A Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.701775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ba15c399-cd16-4e5c-8a5b-c1c77a05c3e6 · 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 Conditional 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: verified exact; doi, observed 2026-07-14T14:00:32.685048Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 44cdb97a-b2ad-4a79-b39e-4598b87bf9ed · outbound

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

A Conditional 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-07-14T13:52:36.230396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.