{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X43B7V3FIPRJSJXNS4FAFOW3WL","short_pith_number":"pith:X43B7V3F","canonical_record":{"source":{"id":"1711.06182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-16T16:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"ce13926eda870b6e4c6a0b19ea76a27cea7d1f2dc68241a7ee126889c91cf40b","abstract_canon_sha256":"cd2b1e49ea7b4ed91c55ff3fd1c9bcc0cfad8c737e3a781f7feeea8e8d891736"},"schema_version":"1.0"},"canonical_sha256":"bf361fd76543e29926ed970a02badbb2ead2a3cadd4fe87296980c3777e19c77","source":{"kind":"arxiv","id":"1711.06182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06182","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06182v1","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06182","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"X43B7V3FIPRJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X43B7V3FIPRJSJXN","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X43B7V3F","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X43B7V3FIPRJSJXNS4FAFOW3WL","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-16T16:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"ce13926eda870b6e4c6a0b19ea76a27cea7d1f2dc68241a7ee126889c91cf40b","abstract_canon_sha256":"cd2b1e49ea7b4ed91c55ff3fd1c9bcc0cfad8c737e3a781f7feeea8e8d891736"},"schema_version":"1.0"},"canonical_sha256":"bf361fd76543e29926ed970a02badbb2ead2a3cadd4fe87296980c3777e19c77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:23.126167Z","signature_b64":"Q+fj9TVrmfVc9JEI8CBbM57IlTFlq02tTCtEED89WhMGgKdR/qYaGzJ8FmAbkctLymBrC8uifnQpR7TwzR7VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf361fd76543e29926ed970a02badbb2ead2a3cadd4fe87296980c3777e19c77","last_reissued_at":"2026-05-18T00:30:23.125375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:23.125375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06182","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-18T00:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWmtEXWw6FEuzK6lMIIi8UR/kPzCBp0v3AWGOlSod++tcjkxkeNbmbL2A7d1neeHnXKdIjsUvF+2td1WyZHnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:39:20.915212Z"},"content_sha256":"d5f6bda7c2a1fa4a30fb7b7df5ce120918519adb091c1da714450a6a62437d8a","schema_version":"1.0","event_id":"sha256:d5f6bda7c2a1fa4a30fb7b7df5ce120918519adb091c1da714450a6a62437d8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X43B7V3FIPRJSJXNS4FAFOW3WL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carlile Lavor, Cristiano Torezzan, Leonardo Duarte, Nilson Moreira","submitted_at":"2017-11-16T16:37:31Z","abstract_excerpt":"A Euclidean Distance Matrix (EDM) is a table of distance-square between points on a k- dimensional Euclidean space, with applications in many fields (e.g. engineering, geodesy, economics, genetics, biochemistry, psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06182","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-18T00:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOHIL/k/bCEl8cEtld/DtLwRcnEP+gOhFNhGQcR/R4hnCr8o/aJ2TINBmH7x1WubDf6EEz822u4i4FjespJ4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:39:20.915909Z"},"content_sha256":"5ebb5b7407de5b732826ed04417071d0f2396ec964426ae2502ffbd3df3766a3","schema_version":"1.0","event_id":"sha256:5ebb5b7407de5b732826ed04417071d0f2396ec964426ae2502ffbd3df3766a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/bundle.json","state_url":"https://pith.science/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/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-29T14:39:20Z","links":{"resolver":"https://pith.science/pith/X43B7V3FIPRJSJXNS4FAFOW3WL","bundle":"https://pith.science/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/bundle.json","state":"https://pith.science/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X43B7V3FIPRJSJXNS4FAFOW3WL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X43B7V3FIPRJSJXNS4FAFOW3WL","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":"cd2b1e49ea7b4ed91c55ff3fd1c9bcc0cfad8c737e3a781f7feeea8e8d891736","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-16T16:37:31Z","title_canon_sha256":"ce13926eda870b6e4c6a0b19ea76a27cea7d1f2dc68241a7ee126889c91cf40b"},"schema_version":"1.0","source":{"id":"1711.06182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06182","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06182v1","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06182","created_at":"2026-05-18T00:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"X43B7V3FIPRJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X43B7V3FIPRJSJXN","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X43B7V3F","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5ebb5b7407de5b732826ed04417071d0f2396ec964426ae2502ffbd3df3766a3","target":"graph","created_at":"2026-05-18T00:30:23Z","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":"A Euclidean Distance Matrix (EDM) is a table of distance-square between points on a k- dimensional Euclidean space, with applications in many fields (e.g. engineering, geodesy, economics, genetics, biochemistry, psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of","authors_text":"Carlile Lavor, Cristiano Torezzan, Leonardo Duarte, Nilson Moreira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-16T16:37:31Z","title":"A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06182","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:d5f6bda7c2a1fa4a30fb7b7df5ce120918519adb091c1da714450a6a62437d8a","target":"record","created_at":"2026-05-18T00:30:23Z","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":"cd2b1e49ea7b4ed91c55ff3fd1c9bcc0cfad8c737e3a781f7feeea8e8d891736","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-16T16:37:31Z","title_canon_sha256":"ce13926eda870b6e4c6a0b19ea76a27cea7d1f2dc68241a7ee126889c91cf40b"},"schema_version":"1.0","source":{"id":"1711.06182","kind":"arxiv","version":1}},"canonical_sha256":"bf361fd76543e29926ed970a02badbb2ead2a3cadd4fe87296980c3777e19c77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf361fd76543e29926ed970a02badbb2ead2a3cadd4fe87296980c3777e19c77","first_computed_at":"2026-05-18T00:30:23.125375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:23.125375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q+fj9TVrmfVc9JEI8CBbM57IlTFlq02tTCtEED89WhMGgKdR/qYaGzJ8FmAbkctLymBrC8uifnQpR7TwzR7VAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:23.126167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5f6bda7c2a1fa4a30fb7b7df5ce120918519adb091c1da714450a6a62437d8a","sha256:5ebb5b7407de5b732826ed04417071d0f2396ec964426ae2502ffbd3df3766a3"],"state_sha256":"99df2589be2ccd359e02412b424e93c3399191c3a0dfa4e3c5c91b11f827c934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3P4q0jfb6zP3nayKdh3yQnJvW6YTXC/u4lQzQ9qcoqNfqA/yYf9q7fB7feN2SkFZStqlUBOIttskf+NZR2VCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:39:20.919620Z","bundle_sha256":"30eebd0ade18ecda820d2223a922633a9a7cf77bcf9cf4e2ff98f6f6641d081c"}}