{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QSRXFINBBMRKHN4VGLA2FMFMLO","short_pith_number":"pith:QSRXFINB","schema_version":"1.0","canonical_sha256":"84a372a1a10b22a3b79532c1a2b0ac5b8d9a38e6e27694da756e2445c1654d7b","source":{"kind":"arxiv","id":"2509.19250","version":1},"attestation_state":"computed","paper":{"title":"Recovering Wasserstein Distance Matrices from Few Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abiy Tasissa, HanQin Cai, Keaton Hamm, Muhammad Rana, Yakov Gavriyelov","submitted_at":"2025-09-23T17:11:33Z","abstract_excerpt":"This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddings like multidimensional scaling (MDS) or Isomap, but contrary to Euclidean distance matrices, are extremely costly to compute. We analyze matrix completion from upper triangular samples and Nystr\\\"{o}m completion in which $\\mathcal{O}(d\\log(d))$ columns of the distance matrices are computed where $d$ is the desired embedding dimension, prove stability of MDS under Nystr\\\"{o}m completion, and show that it can outperf"},"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":"2509.19250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-09-23T17:11:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"91909fb64e563d09acb2023eb77e855d3cfa909b33d7a98bd55acb2ebc361934","abstract_canon_sha256":"3409595c6973cf584d4e778231cb89eae6973b01c00376ee2ae4a725d2e4727f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:58.133356Z","signature_b64":"yioNEIkbYpy4WSDczRORyHdi5lnpChws/M0fg6dlkdu+Up/y7CQwO0y6gcAwTLAbxoje7Q7qVPEa5UaDeBd+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84a372a1a10b22a3b79532c1a2b0ac5b8d9a38e6e27694da756e2445c1654d7b","last_reissued_at":"2026-05-20T01:04:58.132484Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:58.132484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovering Wasserstein Distance Matrices from Few Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abiy Tasissa, HanQin Cai, Keaton Hamm, Muhammad Rana, Yakov Gavriyelov","submitted_at":"2025-09-23T17:11:33Z","abstract_excerpt":"This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddings like multidimensional scaling (MDS) or Isomap, but contrary to Euclidean distance matrices, are extremely costly to compute. We analyze matrix completion from upper triangular samples and Nystr\\\"{o}m completion in which $\\mathcal{O}(d\\log(d))$ columns of the distance matrices are computed where $d$ is the desired embedding dimension, prove stability of MDS under Nystr\\\"{o}m completion, and show that it can outperf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.19250","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.19250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.19250","created_at":"2026-05-20T01:04:58.132596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.19250v1","created_at":"2026-05-20T01:04:58.132596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.19250","created_at":"2026-05-20T01:04:58.132596+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSRXFINBBMRK","created_at":"2026-05-20T01:04:58.132596+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSRXFINBBMRKHN4V","created_at":"2026-05-20T01:04:58.132596+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSRXFINB","created_at":"2026-05-20T01:04:58.132596+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/QSRXFINBBMRKHN4VGLA2FMFMLO","json":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO.json","graph_json":"https://pith.science/api/pith-number/QSRXFINBBMRKHN4VGLA2FMFMLO/graph.json","events_json":"https://pith.science/api/pith-number/QSRXFINBBMRKHN4VGLA2FMFMLO/events.json","paper":"https://pith.science/paper/QSRXFINB"},"agent_actions":{"view_html":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO","download_json":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO.json","view_paper":"https://pith.science/paper/QSRXFINB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.19250&json=true","fetch_graph":"https://pith.science/api/pith-number/QSRXFINBBMRKHN4VGLA2FMFMLO/graph.json","fetch_events":"https://pith.science/api/pith-number/QSRXFINBBMRKHN4VGLA2FMFMLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO/action/storage_attestation","attest_author":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO/action/author_attestation","sign_citation":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO/action/citation_signature","submit_replication":"https://pith.science/pith/QSRXFINBBMRKHN4VGLA2FMFMLO/action/replication_record"}},"created_at":"2026-05-20T01:04:58.132596+00:00","updated_at":"2026-05-20T01:04:58.132596+00:00"}