{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EXULVUC3NLFEXJJQHJQQJJTHAT","short_pith_number":"pith:EXULVUC3","canonical_record":{"source":{"id":"2009.05404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-11T12:50:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"45a79ea89648c32759f0ce78977e88ae5484312d6d5e95fd876e321ae91d7924","abstract_canon_sha256":"51e529f89e5a02b2d293ca4b0be9ddba650326a15e08d2163ad177be422eef7f"},"schema_version":"1.0"},"canonical_sha256":"25e8bad05b6aca4ba5303a6104a66704d0b000e1f5f12bc9faea2477b247e728","source":{"kind":"arxiv","id":"2009.05404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05404","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05404v1","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05404","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"EXULVUC3NLFE","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXULVUC3NLFEXJJQ","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXULVUC3","created_at":"2026-07-05T03:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EXULVUC3NLFEXJJQHJQQJJTHAT","target":"record","payload":{"canonical_record":{"source":{"id":"2009.05404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-11T12:50:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"45a79ea89648c32759f0ce78977e88ae5484312d6d5e95fd876e321ae91d7924","abstract_canon_sha256":"51e529f89e5a02b2d293ca4b0be9ddba650326a15e08d2163ad177be422eef7f"},"schema_version":"1.0"},"canonical_sha256":"25e8bad05b6aca4ba5303a6104a66704d0b000e1f5f12bc9faea2477b247e728","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:12.266521Z","signature_b64":"EifoeWN40eyCOopnwMfxrG4EUmZcJoXHEd4ilfp9dkW1w7uGc5ki9KdlIwTSJgL4RNnA055I5PwJfrp/8WcCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e8bad05b6aca4ba5303a6104a66704d0b000e1f5f12bc9faea2477b247e728","last_reissued_at":"2026-07-05T03:31:12.266068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:12.266068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.05404","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnWerl7efdzsblhyTFn40h1pDDja4MoMmufmpSJ1rjRRxG1tmLmMdhFk+keihBNFQUbtBI2+YRmXOiMn5+6AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T01:01:51.438570Z"},"content_sha256":"91b4229f454a446e37eeadb507bd4d072a58dd9356faab1a9c56d6ea627669dd","schema_version":"1.0","event_id":"sha256:91b4229f454a446e37eeadb507bd4d072a58dd9356faab1a9c56d6ea627669dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EXULVUC3NLFEXJJQHJQQJJTHAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new algorithm for the $^K$DMDGP subclass of Distance Geometry Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carlile Lavor, Douglas S. Goncalves, Leo Liberti, Michael Souza","submitted_at":"2020-09-11T12:50:05Z","abstract_excerpt":"The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the Distance Geometry Problem (DGP) whose search space can be discretized and represented by a binary tree, which can be explored by a Branch-and-Prune (BP) algorithm. It turns out that this combinatorial search space possesses many interesting symmetry properties that were studied in the last decade. In this paper, we present a new algorithm for this subclass of the DGP, which exploits DMDGP symmetries m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05404","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.05404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iD396S9VjhWFKdmwOP5KEhsdk1/18hmeE43Wc6ru4qS38s0lg0RrHxX4QOvn0dPTiV31ME1x23ofv5gpsQ2+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T01:01:51.439501Z"},"content_sha256":"ec0696b75770c519f9cc8a0ca7eeb6f2405ee9401878410a0e90221d55da9f41","schema_version":"1.0","event_id":"sha256:ec0696b75770c519f9cc8a0ca7eeb6f2405ee9401878410a0e90221d55da9f41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/bundle.json","state_url":"https://pith.science/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T01:01:51Z","links":{"resolver":"https://pith.science/pith/EXULVUC3NLFEXJJQHJQQJJTHAT","bundle":"https://pith.science/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/bundle.json","state":"https://pith.science/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXULVUC3NLFEXJJQHJQQJJTHAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EXULVUC3NLFEXJJQHJQQJJTHAT","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":"51e529f89e5a02b2d293ca4b0be9ddba650326a15e08d2163ad177be422eef7f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-11T12:50:05Z","title_canon_sha256":"45a79ea89648c32759f0ce78977e88ae5484312d6d5e95fd876e321ae91d7924"},"schema_version":"1.0","source":{"id":"2009.05404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05404","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05404v1","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05404","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"EXULVUC3NLFE","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXULVUC3NLFEXJJQ","created_at":"2026-07-05T03:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXULVUC3","created_at":"2026-07-05T03:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ec0696b75770c519f9cc8a0ca7eeb6f2405ee9401878410a0e90221d55da9f41","target":"graph","created_at":"2026-07-05T03:31: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/2009.05404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the Distance Geometry Problem (DGP) whose search space can be discretized and represented by a binary tree, which can be explored by a Branch-and-Prune (BP) algorithm. It turns out that this combinatorial search space possesses many interesting symmetry properties that were studied in the last decade. In this paper, we present a new algorithm for this subclass of the DGP, which exploits DMDGP symmetries m","authors_text":"Carlile Lavor, Douglas S. Goncalves, Leo Liberti, Michael Souza","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-11T12:50:05Z","title":"A new algorithm for the $^K$DMDGP subclass of Distance Geometry Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05404","kind":"arxiv","version":1},"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:91b4229f454a446e37eeadb507bd4d072a58dd9356faab1a9c56d6ea627669dd","target":"record","created_at":"2026-07-05T03:31: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":"51e529f89e5a02b2d293ca4b0be9ddba650326a15e08d2163ad177be422eef7f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-11T12:50:05Z","title_canon_sha256":"45a79ea89648c32759f0ce78977e88ae5484312d6d5e95fd876e321ae91d7924"},"schema_version":"1.0","source":{"id":"2009.05404","kind":"arxiv","version":1}},"canonical_sha256":"25e8bad05b6aca4ba5303a6104a66704d0b000e1f5f12bc9faea2477b247e728","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25e8bad05b6aca4ba5303a6104a66704d0b000e1f5f12bc9faea2477b247e728","first_computed_at":"2026-07-05T03:31:12.266068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:31:12.266068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EifoeWN40eyCOopnwMfxrG4EUmZcJoXHEd4ilfp9dkW1w7uGc5ki9KdlIwTSJgL4RNnA055I5PwJfrp/8WcCCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:31:12.266521Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.05404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91b4229f454a446e37eeadb507bd4d072a58dd9356faab1a9c56d6ea627669dd","sha256:ec0696b75770c519f9cc8a0ca7eeb6f2405ee9401878410a0e90221d55da9f41"],"state_sha256":"82cffec85f089ee6bbc519b2d3f52cce8de7be3cf4d1e2f0191897efdf68d6be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvS+3NFQSXllwCUKEdpGlzLQ7m9yJzdMNR4ZWyS0pf0k9E7rRyeThGwep/616pDDsHYn5o0vPgQL0RaIavYEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T01:01:51.443961Z","bundle_sha256":"f74effe5454a1b418de2e249452c9896b3e9e53d4ab3886f144762a50de9e71b"}}