{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N3SXD7AELD4RZDDMU5LF3ND5FN","short_pith_number":"pith:N3SXD7AE","canonical_record":{"source":{"id":"1502.07541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-02-26T13:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"6a7ee98db82438a9aa592f70d04ebc7a4f23dd4ee77a759794a6c43acfeb2284","abstract_canon_sha256":"25e7c456a917110749bf7fcacd01f8e561e3239dc57856f094447bcaf82e2139"},"schema_version":"1.0"},"canonical_sha256":"6ee571fc0458f91c8c6ca7565db47d2b78eed75f2faf2799e5094d86080e164c","source":{"kind":"arxiv","id":"1502.07541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07541","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07541v2","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07541","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"N3SXD7AELD4R","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3SXD7AELD4RZDDM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3SXD7AE","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N3SXD7AELD4RZDDMU5LF3ND5FN","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-02-26T13:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"6a7ee98db82438a9aa592f70d04ebc7a4f23dd4ee77a759794a6c43acfeb2284","abstract_canon_sha256":"25e7c456a917110749bf7fcacd01f8e561e3239dc57856f094447bcaf82e2139"},"schema_version":"1.0"},"canonical_sha256":"6ee571fc0458f91c8c6ca7565db47d2b78eed75f2faf2799e5094d86080e164c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.097674Z","signature_b64":"apdRqfbHLCdnkpuZ2CwLGqFzUVKh/LNJmIlB576ttORejhKk3sNkHyzB3JrY022DgwYiaemPk7afZxKh/vUcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee571fc0458f91c8c6ca7565db47d2b78eed75f2faf2799e5094d86080e164c","last_reissued_at":"2026-05-18T00:59:02.097170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.097170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07541","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7hC9Oc1mBb4DKAWaTHLBY5WDvoJc61U36d9HavIj/p9ZgmNxfALSITSwo3KSzJdRdM5xvuDsw1K+zrehv23CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:13:35.765053Z"},"content_sha256":"f1801a0957fcf2df815c627aad852feec2888085c15a4c2c95422ef7451972fa","schema_version":"1.0","event_id":"sha256:f1801a0957fcf2df815c627aad852feec2888085c15a4c2c95422ef7451972fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N3SXD7AELD4RZDDMU5LF3ND5FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Euclidean Distance Matrices: Essential Theory, Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Ivan Dokmanic, Juri Ranieri, Martin Vetterli, Reza Parhizkar","submitted_at":"2015-02-26T13:18:37Z","abstract_excerpt":"Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition is deceivingly simple: thanks to their many useful properties they have found applications in psychometrics, crystallography, machine learning, wireless sensor networks, acoustics, and more. Despite the usefulness of EDMs, they seem to be insufficiently known in the signal processing community. Our goal is to rectify this mishap in a concise tutorial. We review the fundamental properties of EDMs, such as rank or (non)definiteness. We show how various EDM properties can be used to design algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07541","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv/QOBIodNC5Obo5YrAqAhtZ94H1vCl5KsDiTKX0xQCmN5rxWNFDNIPsTMiUMi/zlYtIUxyKolxWtbfdRL2DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:13:35.765687Z"},"content_sha256":"7851ea658d1f01694136df935d9aa1cda98995aef1f0b6a53157dc99d68175c8","schema_version":"1.0","event_id":"sha256:7851ea658d1f01694136df935d9aa1cda98995aef1f0b6a53157dc99d68175c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/bundle.json","state_url":"https://pith.science/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/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-18T19:13:35Z","links":{"resolver":"https://pith.science/pith/N3SXD7AELD4RZDDMU5LF3ND5FN","bundle":"https://pith.science/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/bundle.json","state":"https://pith.science/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3SXD7AELD4RZDDMU5LF3ND5FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N3SXD7AELD4RZDDMU5LF3ND5FN","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":"25e7c456a917110749bf7fcacd01f8e561e3239dc57856f094447bcaf82e2139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-02-26T13:18:37Z","title_canon_sha256":"6a7ee98db82438a9aa592f70d04ebc7a4f23dd4ee77a759794a6c43acfeb2284"},"schema_version":"1.0","source":{"id":"1502.07541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07541","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07541v2","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07541","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"N3SXD7AELD4R","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3SXD7AELD4RZDDM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3SXD7AE","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:7851ea658d1f01694136df935d9aa1cda98995aef1f0b6a53157dc99d68175c8","target":"graph","created_at":"2026-05-18T00:59:02Z","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":"Euclidean distance matrices (EDM) are matrices of squared distances between points. The definition is deceivingly simple: thanks to their many useful properties they have found applications in psychometrics, crystallography, machine learning, wireless sensor networks, acoustics, and more. Despite the usefulness of EDMs, they seem to be insufficiently known in the signal processing community. Our goal is to rectify this mishap in a concise tutorial. We review the fundamental properties of EDMs, such as rank or (non)definiteness. We show how various EDM properties can be used to design algorithm","authors_text":"Ivan Dokmanic, Juri Ranieri, Martin Vetterli, Reza Parhizkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-02-26T13:18:37Z","title":"Euclidean Distance Matrices: Essential Theory, Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07541","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:f1801a0957fcf2df815c627aad852feec2888085c15a4c2c95422ef7451972fa","target":"record","created_at":"2026-05-18T00:59:02Z","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":"25e7c456a917110749bf7fcacd01f8e561e3239dc57856f094447bcaf82e2139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-02-26T13:18:37Z","title_canon_sha256":"6a7ee98db82438a9aa592f70d04ebc7a4f23dd4ee77a759794a6c43acfeb2284"},"schema_version":"1.0","source":{"id":"1502.07541","kind":"arxiv","version":2}},"canonical_sha256":"6ee571fc0458f91c8c6ca7565db47d2b78eed75f2faf2799e5094d86080e164c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee571fc0458f91c8c6ca7565db47d2b78eed75f2faf2799e5094d86080e164c","first_computed_at":"2026-05-18T00:59:02.097170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.097170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apdRqfbHLCdnkpuZ2CwLGqFzUVKh/LNJmIlB576ttORejhKk3sNkHyzB3JrY022DgwYiaemPk7afZxKh/vUcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.097674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1801a0957fcf2df815c627aad852feec2888085c15a4c2c95422ef7451972fa","sha256:7851ea658d1f01694136df935d9aa1cda98995aef1f0b6a53157dc99d68175c8"],"state_sha256":"0715e30f3951c47254f7b2dce062b9559939eebfdf2a0197e94751ee873178ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xb+5N9XlvIiCXXyg7Vk5paBVWAo6s05QQMbo6ueAEsyfiCSZqoSevHex+QoF1QV8Q8u+6ZUsZ71kZT/q7Mn0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:13:35.767327Z","bundle_sha256":"8c23d08c2f84854928db20b6546dcf52232160fc31a797ad0215bb952c9c2726"}}