{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SVET33RB65TIIBKH34KDMSRO4Z","short_pith_number":"pith:SVET33RB","schema_version":"1.0","canonical_sha256":"95493dee21f766840547df14364a2ee6432049034f4c7f3882ca805651310891","source":{"kind":"arxiv","id":"1804.04310","version":2},"attestation_state":"computed","paper":{"title":"Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.NA","math.OC"],"primary_cat":"cs.IT","authors_text":"Abiy Tasissa, Rongjie Lai","submitted_at":"2018-04-12T04:28:06Z","abstract_excerpt":"The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the problem can be formulated as a nuclear norm minimization problem. In this paper, this minimization program is recast as a matrix completion problem of a low-rank $r$ Gram matrix with respect to a suitable basis. The well known restricted isometry property can not be satisfied in this scenario. Instead, a dual basis approach is introduced to theoretically analyze "},"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":"1804.04310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-12T04:28:06Z","cross_cats_sorted":["cs.LG","math.IT","math.NA","math.OC"],"title_canon_sha256":"33ef498373e3e3e56e31af936affe2f4d1865be310b12603a8bc3a8c327f9a12","abstract_canon_sha256":"d43899d3b8ed85f639ca0da203c8f73e0d7ff551459f3ca27b2a05c49ee771b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:10.203545Z","signature_b64":"UAzqND1TiHV2UJquOl7Iay9kMnEkKwIncqGrP8XN04nN8LE6EjfbA1eSaxzuAalDDwF+d3FAOiAywL/xsoAdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95493dee21f766840547df14364a2ee6432049034f4c7f3882ca805651310891","last_reissued_at":"2026-05-18T00:02:10.202851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:10.202851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.NA","math.OC"],"primary_cat":"cs.IT","authors_text":"Abiy Tasissa, Rongjie Lai","submitted_at":"2018-04-12T04:28:06Z","abstract_excerpt":"The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the problem can be formulated as a nuclear norm minimization problem. In this paper, this minimization program is recast as a matrix completion problem of a low-rank $r$ Gram matrix with respect to a suitable basis. The well known restricted isometry property can not be satisfied in this scenario. Instead, a dual basis approach is introduced to theoretically analyze "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04310","kind":"arxiv","version":2},"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":"1804.04310","created_at":"2026-05-18T00:02:10.202957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04310v2","created_at":"2026-05-18T00:02:10.202957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04310","created_at":"2026-05-18T00:02:10.202957+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVET33RB65TI","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVET33RB65TIIBKH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVET33RB","created_at":"2026-05-18T12:32:53.628368+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/SVET33RB65TIIBKH34KDMSRO4Z","json":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z.json","graph_json":"https://pith.science/api/pith-number/SVET33RB65TIIBKH34KDMSRO4Z/graph.json","events_json":"https://pith.science/api/pith-number/SVET33RB65TIIBKH34KDMSRO4Z/events.json","paper":"https://pith.science/paper/SVET33RB"},"agent_actions":{"view_html":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z","download_json":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z.json","view_paper":"https://pith.science/paper/SVET33RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04310&json=true","fetch_graph":"https://pith.science/api/pith-number/SVET33RB65TIIBKH34KDMSRO4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SVET33RB65TIIBKH34KDMSRO4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z/action/storage_attestation","attest_author":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z/action/author_attestation","sign_citation":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z/action/citation_signature","submit_replication":"https://pith.science/pith/SVET33RB65TIIBKH34KDMSRO4Z/action/replication_record"}},"created_at":"2026-05-18T00:02:10.202957+00:00","updated_at":"2026-05-18T00:02:10.202957+00:00"}