{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TO7L6C5JSBI7TPVSIVYOPOZ7QZ","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":"f818a2236f8923c781149187cc8374e3e75f689603dea55e61a473e9205e8bb4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-29T15:06:52Z","title_canon_sha256":"62f0ba766957c6f49b23cee7b3c19293a0d90efe1762b9f8c40b041b888e5c97"},"schema_version":"1.0","source":{"id":"1907.12468","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12468","created_at":"2026-07-05T01:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12468v3","created_at":"2026-07-05T01:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12468","created_at":"2026-07-05T01:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"TO7L6C5JSBI7","created_at":"2026-07-05T01:41:48Z"},{"alias_kind":"pith_short_16","alias_value":"TO7L6C5JSBI7TPVS","created_at":"2026-07-05T01:41:48Z"},{"alias_kind":"pith_short_8","alias_value":"TO7L6C5J","created_at":"2026-07-05T01:41:48Z"}],"graph_snapshots":[{"event_id":"sha256:c638b0c5113399e5ded6f4c0284a478cd66a339bdd03f87381f5dbf2471686b9","target":"graph","created_at":"2026-07-05T01:41:48Z","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/1907.12468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an integer dimension K and a simple, undirected graph G with positive edge weights, the Distance Geometry Problem (DGP) aims to find a realization function mapping each vertex to a coordinate in K-dimensional space such that the distance between pairs of vertex coordinates is equal to the corresponding edge weights in G. The so-called discretization assumptions reduce the search space of the realization to a finite discrete one which can be explored via the branch-and-prune (BP) algorithm. Given a discretization vertex order in G, the BP algorithm constructs a binary tree where the nodes","authors_text":"Merve Bodur, Moira MacNeil","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-29T15:06:52Z","title":"Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12468","kind":"arxiv","version":3},"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:baa122476fde0d988f959c5a1c6b924664c7a9bf826a757ed2854be4867f2f3f","target":"record","created_at":"2026-07-05T01:41:48Z","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":"f818a2236f8923c781149187cc8374e3e75f689603dea55e61a473e9205e8bb4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-29T15:06:52Z","title_canon_sha256":"62f0ba766957c6f49b23cee7b3c19293a0d90efe1762b9f8c40b041b888e5c97"},"schema_version":"1.0","source":{"id":"1907.12468","kind":"arxiv","version":3}},"canonical_sha256":"9bbebf0ba99051f9beb24570e7bb3f8662c05d3f1d6003876200ef766672b25e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bbebf0ba99051f9beb24570e7bb3f8662c05d3f1d6003876200ef766672b25e","first_computed_at":"2026-07-05T01:41:48.691571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:41:48.691571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"plazrun2mXf/M7GdCirpq487Br9tHmz2Ra9kMG8wJgKn9TiZHSia5X/wUNNpVVDsONANnkRK6UCZ7glHLEepBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:41:48.692037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.12468","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baa122476fde0d988f959c5a1c6b924664c7a9bf826a757ed2854be4867f2f3f","sha256:c638b0c5113399e5ded6f4c0284a478cd66a339bdd03f87381f5dbf2471686b9"],"state_sha256":"6e365d7796a2c94774d7051022ac8b529bc7240f102b86842c07dc76480123c2"}