{"as_of":"2026-08-22T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99b8f507fbab41b57c35187ccb674da5bbfa1f223aa9643427f3d4cff30083ad","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T13:52:36.230396Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.10155/citation-record","integrity":"/paper/2607.10155/integrity","json":"/paper/2607.10155/citation-record.json","paper":"/paper/2607.10155"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-018-1294-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The K- discretization and K-incident graphs for discretizable distance geometry.Optimization Letters, 14(2):1–14, 2018","venue":"Optimization Letters","work_id":"3873df95-aa87-4f28-a41a-a66f70d13c95","year":2018},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:83e322c9958e2acee274c5759f2158f7e826de08eb9e3fd8ab57a75812fa9878","observation_id":"0f387eb8-6e81-4441-b513-5543e47f1b1a","resolution":{"observed_at":"2026-07-14T14:00:32.695930Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:44.483833+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:44.483833+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2024.02.018","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An impossible combinatorial counting method in distance geometry.Discrete Applied Mathematics, 354:83–93, 2024","venue":"Discrete Applied Mathematics","work_id":"47855910-a32d-4217-8291-5f332d6caeda","year":2024},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:63c27ba7c534e9739371051fa46fcfcce2356560372c03715d06bedc63316441","observation_id":"c6d9cb68-d998-4e6b-936a-3794d6cffe35","resolution":{"observed_at":"2026-07-14T14:00:32.697169Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:45.016988+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:45.016988+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2014.08","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T14:00:32.707762Z","title":"Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015","venue":null,"work_id":"512975ff-7009-4a6b-8b28-cc6d8c3f88e6","year":2015},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:69f8e5980156a725b00facc2584deb0522f9a5f68960ed68a115cf72ed4a8b8e","observation_id":"2beae219-e89c-4bf1-9755-4312ae1b4428","resolution":{"observed_at":"2026-07-14T14:00:32.709397Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:45.384259+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:45.384259+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"Partial reflections and globally linked pairs in rigid graphs.SIAM Journal on Discrete Mathematics, 38(3):2005–2040, 2024","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:c5599987ebcdb020729c975c62619797db51819ae3756cd5b3fdb72388aade91","observation_id":"e83fa81a-4d11-485e-bbcf-8e572a91da98","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-021-00835-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8): 2400–2426, 2021","venue":"Algorithmica","work_id":"2b21e8d8-17fb-4e82-99d0-4412246c951d","year":2021},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:fc5a2b03963cccb5bec0b1288ec9c7d0c4ed7210b395e11608c4a0caf0e43b9c","observation_id":"dc6edc3a-f89f-47bc-b62f-3bc4c86c65d2","resolution":{"observed_at":"2026-07-14T14:00:32.689798Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:45.896389+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:45.896389+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-011-9402-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The discretizable molecular distance geometry problem.Computational Optimization and Applications, 52(1):115–146, 2012","venue":"Computational Optimization and Applications","work_id":"1f332ad3-3047-4587-a9fc-b649c2835f8b","year":2012},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:802fb33e0744ea9ac5776f1ee516fd79be3113ab322954d0bd557aca4c46ccdc","observation_id":"d2dae0d3-ec6f-45eb-a06b-972aa705b072","resolution":{"observed_at":"2026-07-14T14:00:32.713337Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:46.450707+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:46.450707+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"Distance geometry and data science.Top, 28(2):271–339, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:2844e0bc62f6d72bcdb97d7f9528cccc1e8191628ef9aed84a4fe2c3085f9cdd","observation_id":"e796c6ed-9cc7-4df0-b169-9e5062b9f667","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"A branch-and-prune algorithm for the molecular distance geometry problem.International Transactions in Operational Research, 15(1):1–17,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:721d6c3e5b1151bc95c4325791a916ade3e96d8024cd42a7e6edd40c599ad95c","observation_id":"c585a99c-39c8-49dc-bdaf-2f99db8a800f","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3995.2007","doi":"10.1111/j.1475-3995.2007.00622.x","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"International Transactions in Operational Research","work_id":"fe226c24-bd0a-49a6-9446-6359ddd006f8","year":2007},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:3dcfb0d47be91b46d364ac19d0d3d091d5fb0469062496effa7d3656aa5bbe44","observation_id":"58a3f760-a0f0-4e13-8bcf-b8628b356168","resolution":{"observed_at":"2026-07-14T14:00:32.722343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:46.916736+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:46.916736+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"On the number of solutions of the discretizable molecular distance geometry problem","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:4f058b3c1e69efed161cb4191a64c760c103dbfe5f4054b71c7939631cb5acdc","observation_id":"49fd5450-55da-4f10-8898-be92b5b2f8da","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-40020-9_23","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Counting the number of solutions of kdmdgp instances","venue":"Lecture notes in computer science","work_id":"eec77314-67ac-40b1-8166-3c299e64e893","year":2013},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:37fa50741e9e6f2d480c6946913d6003f679fd25b8e2a1a5ddd76130d2ca8ae0","observation_id":"8424c027-da6c-4404-ae2b-5c134a8bcc20","resolution":{"observed_at":"2026-07-14T14:00:32.718279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:47.309676+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:47.309676+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"On the number of realizations of certain henneberg graphs arising in protein conformation.Discrete Applied Mathematics, 165:213–232, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:6e4998c13c6db64e205763b7ca0cd9cfaef0c609ad1e066f458e3c9bf3dc7148","observation_id":"87191b18-bfb6-45bd-82e3-f2aea86195fe","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-82397-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An analysis on the degrees of freedom of binary representations for solutions to discretizable distance geometry problems","venue":"Studies in computational intelligence","work_id":"05a1f5d3-8562-43b9-8811-6af968911bc0","year":2021},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:c0526d9fd22ad921a0f26a4c40ce4440876dee2c6af94f820077f202c3fa1641","observation_id":"459e74ad-62c8-4d4b-a109-6dd6142910d3","resolution":{"observed_at":"2026-07-14T14:00:32.692591Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:48.181383+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:48.181383+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-011-0358-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The discretizable distance geometry problem.Optimization Letters, 6(8):1671–1686, 2012","venue":"Optimization Letters","work_id":"2ddad100-58b0-4f32-bab2-fdb122292fed","year":2012},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:55d91f8bbcfe8cc0603786dc21c17f46641e8b6df2787084027af22064c0b840","observation_id":"45eaac52-01db-463e-9130-66d6737a7679","resolution":{"observed_at":"2026-07-14T14:00:32.701775Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:48.714819+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:48.714819+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0219720012420097","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exploiting symmetry properties of the dis- cretizable molecular distance geometry problem.Journal of Bioinformatics and Computational Biology, 10(03):1242009, 2012","venue":"Journal of Bioinformatics and Computational Biology","work_id":"d2748ae2-bac7-4f4f-b619-a7703899e098","year":2012},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:251fe892df63e7ae9cd5c54b9b7806b72a6e5e45c18b4adeb2c89c4f36b7ac34","observation_id":"ba15c399-cd16-4e5c-8a5b-c1c77a05c3e6","resolution":{"observed_at":"2026-07-14T14:00:32.685048Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:50:49.157506+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:50:49.157506+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T13:52:36.230396Z","title":"The positioning problem—a draft of an intermediate summary","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T13:52:36.230396Z"},"links":{"citing_paper":"/paper/2607.10155"},"observation_digest":"sha256:f3cf0a3b7bec36dc18c36ffefb1fa354983a78983b33496a179841f46187db0b","observation_id":"44cdb97a-b2ad-4a79-b39e-4598b87bf9ed","resolution":{"observed_at":"2026-07-14T13:52:36.230396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10155","last_updated":"2026-07-11T06:34:26Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-15T03:15:14.697461Z","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":10,"verified_fuzzy":0},"total_outbound_references":16},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"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."}