{"as_of":"2026-08-22T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d6d01d93133b13908155c36b4015f33cd44adf81ca333a13bb89dea56bf367b","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-08-02T12:41:37.194928Z","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.27213/citation-record","integrity":"/paper/2607.27213/integrity","json":"/paper/2607.27213/citation-record.json","paper":"/paper/2607.27213"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:35.497505Z","title":"The K- discretization and K-incident graphs for discretizable distance geometry.Optimization Letters, 14(2):1–14, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:35.497505Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:a8cd2e038f5a99a6d0c68fec26fe7185e8a24da8fd08babb7b8b3521da081aff","observation_id":"38cce86b-cf20-43ee-bc25-18a48d5cc6c3","resolution":{"observed_at":"2026-08-02T12:41:35.497505Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:35.595375Z","title":"An impossible combinatorial counting method in distance geometry.Discrete Applied Mathematics, 354:83–93, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:35.595375Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:dfc7f2134b51537ef5c81095d28df3a1582a784ab0fb025b5a3b50482190ebb2","observation_id":"4690d449-1134-49bc-8bdd-4688ede5c475","resolution":{"observed_at":"2026-08-02T12:41:35.595375Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:35.713301Z","title":"Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:35.713301Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:40e75e77b7316ff3d34d2d6ae6e81ff83e9f59dc1012c4ca910e4ec82d98b02e","observation_id":"24a20a72-5287-4d70-9319-233a888c1e04","resolution":{"observed_at":"2026-08-02T12:41:35.713301Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:35.843889Z","title":"A new algorithm for the K-DMDGP subclass of distance geometry problems with exact distances.Algorithmica, 83(8):2400–2426, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:35.843889Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:c8e2020113aecc975bc79537d6a70acc6cb784401fb4dc10f8335e3d73a4f75e","observation_id":"3248b034-50f2-4b63-afbb-a88f5ba01ea0","resolution":{"observed_at":"2026-08-02T12:41:35.843889Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:35.952747Z","title":"The discretizable molecular distance geometry problem.Computational Optimization and Applications, 52(1):115–146, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:35.952747Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:c5023e74ae48e91ff373f19243407883a27db567e2983cc1ae0dc0b62ecfaf28","observation_id":"a7858c80-e6e8-4e6b-a5bf-e5741c2975cc","resolution":{"observed_at":"2026-08-02T12:41:35.952747Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.068601Z","title":"On the optimality of finding DMDGP symmetries.Computational and Applied Mathematics, 40(3):98, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.068601Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:24d11035f1a24e15eabeb75c631710eb54377abbe6268482b0f4eaba31e343e7","observation_id":"77ddc65f-8a1f-4543-aada-0b787984b93b","resolution":{"observed_at":"2026-08-02T12:41:36.068601Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.183698Z","title":"Distance geometry and data science.Top, 28(2):271–339, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.183698Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:9d06319cd6385a8a5b99f6dee66ba23652f5c1645a9b67db22dee96c39503ee2","observation_id":"1ed14fce-db09-499b-85e2-0c9ea51d84d4","resolution":{"observed_at":"2026-08-02T12:41:36.183698Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.300398Z","title":"Counting the number of solutions of kdmdgp instances","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.300398Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:dc212febae9197ac60178e97ae841a5d499a4d5b021d48d001e0d37ef74f6650","observation_id":"f03e9ff7-659f-4c6e-a08e-5119ac53a38e","resolution":{"observed_at":"2026-08-02T12:41:36.300398Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.425762Z","title":"A branch-and-prune algorithm for the molecular distance geometry problem.International Transactions in Operational Research, 15(1):1–17, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.425762Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:3cbb59736f6182de257717524d98db12db6bf21ab06c6d35795b8e26a6c4dd5f","observation_id":"1c1f5d37-2e3e-45bc-b148-ca44be1688b6","resolution":{"observed_at":"2026-08-02T12:41:36.425762Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.539332Z","title":"The discretizable molecular distance geometry problem seems easier on proteins","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.539332Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:175528afe86039370f60d0bbd0192bfa94eb37b7bab451719372f6644a7422f4","observation_id":"e42307ec-312c-4689-9338-7d225f4260c8","resolution":{"observed_at":"2026-08-02T12:41:36.539332Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.649855Z","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.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.649855Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:e800f76875bcb3d722e5ca4540f14cf3aeb245bbb43e86680f197766c1593dba","observation_id":"91741fe9-8fc1-4ce2-a68c-6facffd7635e","resolution":{"observed_at":"2026-08-02T12:41:36.649855Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.763679Z","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.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.763679Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:e22a171414734293cf70d1066fabf394d2ede53914064f833efa497212bfab8c","observation_id":"4a907788-4c0f-4250-a845-4b3b5a5350ac","resolution":{"observed_at":"2026-08-02T12:41:36.763679Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:36.882433Z","title":"An analysis on the degrees of freedom of binary representations for solutions to discretizable distance geometry problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:36.882433Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:c6e00b476e1b4a7ddf877fd0c31eadb2685e9db3afdc39b0701ffc9a23ed06b9","observation_id":"972a5e87-219e-4bcb-a492-2703de41ec05","resolution":{"observed_at":"2026-08-02T12:41:36.882433Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:37.005410Z","title":"The discretizable distance geometry problem.Optimization Letters, 6(8):1671–1686, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:37.005410Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:5a56e663ccbfc5addf5d3ff52dbb1b6e220328ea91d57305eb3b529220253d96","observation_id":"e09884b9-2a31-4836-a3fa-bea10ee96fdc","resolution":{"observed_at":"2026-08-02T12:41:37.005410Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:37.120483Z","title":"Exploiting symmetry properties of the dis- cretizable molecular distance geometry problem.Journal of Bioinformatics and Computational Biology, 10(03):1242009, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:37.120483Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:70ec20c6a62961ec0e7b0127d345fb416ecdce5cd52573466e03cc3bfb1b446d","observation_id":"e55c171f-200f-41d7-b958-2a0128ea5ebc","resolution":{"observed_at":"2026-08-02T12:41:37.120483Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:41:37.194928Z","title":"The positioning problem—a draft of an intermediate summary","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T12:41:37.194928Z"},"links":{"citing_paper":"/paper/2607.27213"},"observation_digest":"sha256:9c7d20811fbaeb65ac87055a6a961b66cb619514c0a3adfbe16200b6f2c902f3","observation_id":"5f0bd3a9-106d-45ea-9c91-a91963e6e32c","resolution":{"observed_at":"2026-08-02T12:41:37.194928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27213","last_updated":"2026-06-01T07:42:14Z","latest_version":1,"primary_category":"math.MG","snapshot_observed_at":"2026-08-07T11:52:01.455869Z","submitted_at":"2026-06-01T07:42:14Z","title":"A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"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.27213."}