{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KPHTAUXT4AWSJWOLL24IBYGGC2","short_pith_number":"pith:KPHTAUXT","schema_version":"1.0","canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","source":{"kind":"arxiv","id":"1103.1264","version":1},"attestation_state":"computed","paper":{"title":"Polynomial cases of the Discretizable Molecular Distance Geometry Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","q-bio.QM"],"primary_cat":"cs.CG","authors_text":"Antonio Mucherino, Benoit Masson, Carlile Lavor, Leo Liberti","submitted_at":"2011-03-07T12:41:44Z","abstract_excerpt":"An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible embeddings is discrete. The corresponding decision problem can be solved using a binary tree based search procedure which is exponential in the worst case. We discuss assumptions that bound the search t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.1264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-07T12:41:44Z","cross_cats_sorted":["cs.CE","cs.DS","q-bio.QM"],"title_canon_sha256":"4ad1a9710585864b7e5492b7c0d75f58be2bf61383e13ee7ee4e3557f678a97f","abstract_canon_sha256":"2d0e31cb0a5cc6ff4772f6176d6a5929544755251a558640843466f7ddc42dd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:16.796605Z","signature_b64":"zIX0mAe40zIE6soLsrjfoFTJ0B90iIjbnPg6zRF+ErCnR8x3FiMiDv1jtbdQtUR3I50Bt+62jS7re0T8B88aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","last_reissued_at":"2026-05-18T04:27:16.795847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:16.795847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial cases of the Discretizable Molecular Distance Geometry Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS","q-bio.QM"],"primary_cat":"cs.CG","authors_text":"Antonio Mucherino, Benoit Masson, Carlile Lavor, Leo Liberti","submitted_at":"2011-03-07T12:41:44Z","abstract_excerpt":"An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible embeddings is discrete. The corresponding decision problem can be solved using a binary tree based search procedure which is exponential in the worst case. We discuss assumptions that bound the search t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1264","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.1264","created_at":"2026-05-18T04:27:16.795969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1264v1","created_at":"2026-05-18T04:27:16.795969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1264","created_at":"2026-05-18T04:27:16.795969+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPHTAUXT4AWS","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPHTAUXT4AWSJWOL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPHTAUXT","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2","json":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2.json","graph_json":"https://pith.science/api/pith-number/KPHTAUXT4AWSJWOLL24IBYGGC2/graph.json","events_json":"https://pith.science/api/pith-number/KPHTAUXT4AWSJWOLL24IBYGGC2/events.json","paper":"https://pith.science/paper/KPHTAUXT"},"agent_actions":{"view_html":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2","download_json":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2.json","view_paper":"https://pith.science/paper/KPHTAUXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1264&json=true","fetch_graph":"https://pith.science/api/pith-number/KPHTAUXT4AWSJWOLL24IBYGGC2/graph.json","fetch_events":"https://pith.science/api/pith-number/KPHTAUXT4AWSJWOLL24IBYGGC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/action/storage_attestation","attest_author":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/action/author_attestation","sign_citation":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/action/citation_signature","submit_replication":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/action/replication_record"}},"created_at":"2026-05-18T04:27:16.795969+00:00","updated_at":"2026-05-18T04:27:16.795969+00:00"}