{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RGW57IFGLM5ND34RNHM3OPGKZM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"00232ad9905dc022177eccae6bc03d05e1d001c56fe4ceb36ed6d49b9e6a8f2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-31T18:49:31Z","title_canon_sha256":"7ef51f5873d2b9b85f97ced0a89030125141a6dde16fd1d1a2a6f2b574775f9d"},"schema_version":"1.0","source":{"id":"1908.00048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00048","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00048v2","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00048","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"RGW57IFGLM5N","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_16","alias_value":"RGW57IFGLM5ND34R","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_8","alias_value":"RGW57IFG","created_at":"2026-07-05T02:54:12Z"}],"graph_snapshots":[{"event_id":"sha256:614ba48bc5ca18248dfdf5a06964e23fa670ce876d981743ffcc63f017772df2","target":"graph","created_at":"2026-07-05T02:54:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00048/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Distance Geometry Problem (DGP) seeks to find positions for a set of points in geometric space when some distances between pairs of these points are known. The so-called discretization assumptions allow to discretize the search space of DGP instances. In this paper, we study the Discretizable Molecular Distance Geometry Problem whose feasible solutions provide a discretization scheme for the DGP. We propose the first constraint programming formulations as well as a set of checks for proving infeasibility, domain reduction techniques, symmetry breaking constraints and valid inequalities. Ou","authors_text":"Merve Bodur, Moira MacNeil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-31T18:49:31Z","title":"Constraint Programming Approaches to the Discretizable Molecular Distance Geometry Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00048","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30f2c7e057422a1f739b9067323f46725dae2aa1aad78ca404634efc092be6c4","target":"record","created_at":"2026-07-05T02:54:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"00232ad9905dc022177eccae6bc03d05e1d001c56fe4ceb36ed6d49b9e6a8f2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-31T18:49:31Z","title_canon_sha256":"7ef51f5873d2b9b85f97ced0a89030125141a6dde16fd1d1a2a6f2b574775f9d"},"schema_version":"1.0","source":{"id":"1908.00048","kind":"arxiv","version":2}},"canonical_sha256":"89addfa0a65b3ad1ef9169d9b73ccacb023b45678848c07a826f2f11c0643449","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89addfa0a65b3ad1ef9169d9b73ccacb023b45678848c07a826f2f11c0643449","first_computed_at":"2026-07-05T02:54:12.435095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:54:12.435095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51pOTrd9OY8ahW+RAsPYqIJgh/dVQpLyjys8NDWJUxZMZh2ReLstZjkq7ylyJcndjIU2+x5MXPQ+USyU8t0TAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:54:12.435546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30f2c7e057422a1f739b9067323f46725dae2aa1aad78ca404634efc092be6c4","sha256:614ba48bc5ca18248dfdf5a06964e23fa670ce876d981743ffcc63f017772df2"],"state_sha256":"e01acc9684132bb958112fe6d9bf82f0d640bdf5dd204a65ea848cf5e23f5fb0"}