{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FBGF2YXAQU2SIVLEOGRSXSBH3Q","short_pith_number":"pith:FBGF2YXA","canonical_record":{"source":{"id":"1304.6663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-24T16:52:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"999e67d0d5a61f8fad8d64e8ef62da31dc6e4771f01238414c902dffb690fb29","abstract_canon_sha256":"5c60ea33e9d0d3ec03d50644b075fd49e19eab68e55c6356f8a86ff225e2c579"},"schema_version":"1.0"},"canonical_sha256":"284c5d62e0853524556471a32bc827dc33adc4960c4209bddc1a70400f174bc0","source":{"kind":"arxiv","id":"1304.6663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6663","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6663v2","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6663","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"FBGF2YXAQU2S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBGF2YXAQU2SIVLE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBGF2YXA","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FBGF2YXAQU2SIVLEOGRSXSBH3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-24T16:52:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"999e67d0d5a61f8fad8d64e8ef62da31dc6e4771f01238414c902dffb690fb29","abstract_canon_sha256":"5c60ea33e9d0d3ec03d50644b075fd49e19eab68e55c6356f8a86ff225e2c579"},"schema_version":"1.0"},"canonical_sha256":"284c5d62e0853524556471a32bc827dc33adc4960c4209bddc1a70400f174bc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.034815Z","signature_b64":"mmvEzAJcDyL2lN7tJeb+/KDbXh7eHrSrjO03I4txlWNZb2Wn7BOn/UrWw1E2PR+GlaucBcU8YtM5v3AIqDgjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284c5d62e0853524556471a32bc827dc33adc4960c4209bddc1a70400f174bc0","last_reissued_at":"2026-05-18T03:27:11.034199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.034199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6663","source_version":2,"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"he9s0bB5RimxBodcHbzO0IyXCF+CkEUexhyJ19fYNNxKVTJ/Ju9DebsUGeB8NUKUv1pi9hIxhy5rX+2aYirdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:48:35.601296Z"},"content_sha256":"b06b3c570635c23db9c286a2ee03ee8480030218e9db99e64f862d9d67748f11","schema_version":"1.0","event_id":"sha256:b06b3c570635c23db9c286a2ee03ee8480030218e9db99e64f862d9d67748f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FBGF2YXAQU2SIVLEOGRSXSBH3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank optimization for distance matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"B. Mishra, G. Meyer, R. Sepulchre","submitted_at":"2013-04-24T16:52:34Z","abstract_excerpt":"This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6663","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"},"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2DhKiduhuW2KNkC7y6iKKnOgtNZwsPxup/ObPHwFhNjypMowCwlSUCcPU9W/jgQnHA4DCJRTdLH8DAX/svcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:48:35.601660Z"},"content_sha256":"8cfc98bec3fbbef2bab9f634563d7b2ba0c1997588a2cdab4d94eb7f23197f84","schema_version":"1.0","event_id":"sha256:8cfc98bec3fbbef2bab9f634563d7b2ba0c1997588a2cdab4d94eb7f23197f84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/bundle.json","state_url":"https://pith.science/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/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-06-02T15:48:35Z","links":{"resolver":"https://pith.science/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q","bundle":"https://pith.science/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/bundle.json","state":"https://pith.science/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBGF2YXAQU2SIVLEOGRSXSBH3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FBGF2YXAQU2SIVLEOGRSXSBH3Q","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":"5c60ea33e9d0d3ec03d50644b075fd49e19eab68e55c6356f8a86ff225e2c579","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-24T16:52:34Z","title_canon_sha256":"999e67d0d5a61f8fad8d64e8ef62da31dc6e4771f01238414c902dffb690fb29"},"schema_version":"1.0","source":{"id":"1304.6663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6663","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6663v2","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6663","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"FBGF2YXAQU2S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBGF2YXAQU2SIVLE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBGF2YXA","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:8cfc98bec3fbbef2bab9f634563d7b2ba0c1997588a2cdab4d94eb7f23197f84","target":"graph","created_at":"2026-05-18T03:27:11Z","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":"This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. Th","authors_text":"B. Mishra, G. Meyer, R. Sepulchre","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-24T16:52:34Z","title":"Low-rank optimization for distance matrix completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6663","kind":"arxiv","version":2},"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:b06b3c570635c23db9c286a2ee03ee8480030218e9db99e64f862d9d67748f11","target":"record","created_at":"2026-05-18T03:27:11Z","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":"5c60ea33e9d0d3ec03d50644b075fd49e19eab68e55c6356f8a86ff225e2c579","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-24T16:52:34Z","title_canon_sha256":"999e67d0d5a61f8fad8d64e8ef62da31dc6e4771f01238414c902dffb690fb29"},"schema_version":"1.0","source":{"id":"1304.6663","kind":"arxiv","version":2}},"canonical_sha256":"284c5d62e0853524556471a32bc827dc33adc4960c4209bddc1a70400f174bc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284c5d62e0853524556471a32bc827dc33adc4960c4209bddc1a70400f174bc0","first_computed_at":"2026-05-18T03:27:11.034199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:11.034199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmvEzAJcDyL2lN7tJeb+/KDbXh7eHrSrjO03I4txlWNZb2Wn7BOn/UrWw1E2PR+GlaucBcU8YtM5v3AIqDgjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:11.034815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b06b3c570635c23db9c286a2ee03ee8480030218e9db99e64f862d9d67748f11","sha256:8cfc98bec3fbbef2bab9f634563d7b2ba0c1997588a2cdab4d94eb7f23197f84"],"state_sha256":"a37c773634dcef98d906b4046178a117af54d3f317c8604cdd8846da4b1c84e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qCvEqS7YsJvBz2YuOvBpLKBCdl5JQKLioaLuw1DvaaKYbSq1Y9Eq8zVLTrqHGTB6MEErv1iABO/O7F0o0LfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:48:35.603538Z","bundle_sha256":"957deceb39e721d5b6e1301a693f4f24af85de967a8aa6d337e0d2b1a63dd56f"}}