{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KPHTAUXT4AWSJWOLL24IBYGGC2","short_pith_number":"pith:KPHTAUXT","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"},"canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","source":{"kind":"arxiv","id":"1103.1264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1264","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1264v1","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1264","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"KPHTAUXT4AWS","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KPHTAUXT4AWSJWOL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KPHTAUXT","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KPHTAUXT4AWSJWOLL24IBYGGC2","target":"record","payload":{"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"},"canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","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"},"source_kind":"arxiv","source_id":"1103.1264","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-05-18T04:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apTTZk2R+cn9zfSV/J4cT9RVpQy6ErCdiIvgzECUn1Bg4hF65QZaZgBI7CeTZdUChuTHeT0pqJ0/NGl84tc/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:25:21.888612Z"},"content_sha256":"b23fa7f2d2f6d20f50fb0e9b5a8f044446f0e46bf65b56822dfeb952b018dd3c","schema_version":"1.0","event_id":"sha256:b23fa7f2d2f6d20f50fb0e9b5a8f044446f0e46bf65b56822dfeb952b018dd3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KPHTAUXT4AWSJWOLL24IBYGGC2","target":"graph","payload":{"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"},"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-05-18T04:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfRuqd+LT6ycgqxkCTO3dIxqvDCAqpNDAA7vlSDUpx0ELdggEIbouIeumVEX4twP0GFmkysoRpEG9+EtpmznBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:25:21.889253Z"},"content_sha256":"f3047a1d866c8040623976e06424472d23b9cabc8bde7019426f3bfc84d13049","schema_version":"1.0","event_id":"sha256:f3047a1d866c8040623976e06424472d23b9cabc8bde7019426f3bfc84d13049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/bundle.json","state_url":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/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-05-28T10:25:21Z","links":{"resolver":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2","bundle":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/bundle.json","state":"https://pith.science/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPHTAUXT4AWSJWOLL24IBYGGC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KPHTAUXT4AWSJWOLL24IBYGGC2","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":"2d0e31cb0a5cc6ff4772f6176d6a5929544755251a558640843466f7ddc42dd4","cross_cats_sorted":["cs.CE","cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-07T12:41:44Z","title_canon_sha256":"4ad1a9710585864b7e5492b7c0d75f58be2bf61383e13ee7ee4e3557f678a97f"},"schema_version":"1.0","source":{"id":"1103.1264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1264","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1264v1","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1264","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"KPHTAUXT4AWS","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KPHTAUXT4AWSJWOL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KPHTAUXT","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:f3047a1d866c8040623976e06424472d23b9cabc8bde7019426f3bfc84d13049","target":"graph","created_at":"2026-05-18T04:27:16Z","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"},"paper":{"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","authors_text":"Antonio Mucherino, Benoit Masson, Carlile Lavor, Leo Liberti","cross_cats":["cs.CE","cs.DS","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-07T12:41:44Z","title":"Polynomial cases of the Discretizable Molecular Distance Geometry Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1264","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:b23fa7f2d2f6d20f50fb0e9b5a8f044446f0e46bf65b56822dfeb952b018dd3c","target":"record","created_at":"2026-05-18T04:27:16Z","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":"2d0e31cb0a5cc6ff4772f6176d6a5929544755251a558640843466f7ddc42dd4","cross_cats_sorted":["cs.CE","cs.DS","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-07T12:41:44Z","title_canon_sha256":"4ad1a9710585864b7e5492b7c0d75f58be2bf61383e13ee7ee4e3557f678a97f"},"schema_version":"1.0","source":{"id":"1103.1264","kind":"arxiv","version":1}},"canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53cf3052f3e02d24d9cb5eb880e0c6169e0e48160e31e47b117b378490d889af","first_computed_at":"2026-05-18T04:27:16.795847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:16.795847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIX0mAe40zIE6soLsrjfoFTJ0B90iIjbnPg6zRF+ErCnR8x3FiMiDv1jtbdQtUR3I50Bt+62jS7re0T8B88aDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:16.796605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b23fa7f2d2f6d20f50fb0e9b5a8f044446f0e46bf65b56822dfeb952b018dd3c","sha256:f3047a1d866c8040623976e06424472d23b9cabc8bde7019426f3bfc84d13049"],"state_sha256":"e7ff307533ce0ec051d63739aa65958f4d2f4fbe45c1722554e0da66510a0725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL+XmmQqz5lj3mvTqX444ez9tHvy9Wg/IEIC7u0bXBEfCcLl9h7sdEXfnGRTVAIp/cdXsm+Ywh7Z6F+1X9d4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:25:21.892649Z","bundle_sha256":"b0f533a39c6a82b73ac3f1f15be5c76df8eee55053680307447995f3fcd5f87c"}}