{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TT52SFNHCBQW55JGV76QECHEZ6","short_pith_number":"pith:TT52SFNH","schema_version":"1.0","canonical_sha256":"9cfba915a710616ef526affd0208e4cf832f0bc4d7f9c1a1c585bf321624c350","source":{"kind":"arxiv","id":"1906.00339","version":1},"attestation_state":"computed","paper":{"title":"Sample-Optimal Low-Rank Approximation of Distance Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, David Woodruff, Piotr Indyk, Tal Wagner","submitted_at":"2019-06-02T04:15:17Z","abstract_excerpt":"A distance matrix $A \\in \\mathbb R^{n \\times m}$ represents all pairwise distances, $A_{ij}=\\mathrm{d}(x_i,y_j)$, between two point sets $x_1,...,x_n$ and $y_1,...,y_m$ in an arbitrary metric space $(\\mathcal Z, \\mathrm{d})$. Such matrices arise in various computational contexts such as learning image manifolds, handwriting recognition, and multi-dimensional unfolding.\n  In this work we study algorithms for low-rank approximation of distance matrices. Recent work by Bakshi and Woodruff (NeurIPS 2018) showed it is possible to compute a rank-$k$ approximation of a distance matrix in time $O((n+m"},"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":"1906.00339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T04:15:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81f7d7488747ddc2488ef067dcc0d1fac0ca3a75d7c5d1106f15e8d0d85dbf2d","abstract_canon_sha256":"7babc36c3d3a889190bd0e0abfccc9a815bb76e2604931b4ae9589ce23ec3760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:18.316631Z","signature_b64":"2CqVvUKN/bUGNuMtvCo8iOiLK3ZIdh/nL3ieOI+aa3N74csn1qFvBhn8rzbMS+2vuQJYEPKS4JahlqHW9I18Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cfba915a710616ef526affd0208e4cf832f0bc4d7f9c1a1c585bf321624c350","last_reissued_at":"2026-05-17T23:44:18.315936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:18.315936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample-Optimal Low-Rank Approximation of Distance Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, David Woodruff, Piotr Indyk, Tal Wagner","submitted_at":"2019-06-02T04:15:17Z","abstract_excerpt":"A distance matrix $A \\in \\mathbb R^{n \\times m}$ represents all pairwise distances, $A_{ij}=\\mathrm{d}(x_i,y_j)$, between two point sets $x_1,...,x_n$ and $y_1,...,y_m$ in an arbitrary metric space $(\\mathcal Z, \\mathrm{d})$. Such matrices arise in various computational contexts such as learning image manifolds, handwriting recognition, and multi-dimensional unfolding.\n  In this work we study algorithms for low-rank approximation of distance matrices. Recent work by Bakshi and Woodruff (NeurIPS 2018) showed it is possible to compute a rank-$k$ approximation of a distance matrix in time $O((n+m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00339","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00339","created_at":"2026-05-17T23:44:18.316043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00339v1","created_at":"2026-05-17T23:44:18.316043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00339","created_at":"2026-05-17T23:44:18.316043+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT52SFNHCBQW","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT52SFNHCBQW55JG","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT52SFNH","created_at":"2026-05-18T12:33:30.264802+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/TT52SFNHCBQW55JGV76QECHEZ6","json":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6.json","graph_json":"https://pith.science/api/pith-number/TT52SFNHCBQW55JGV76QECHEZ6/graph.json","events_json":"https://pith.science/api/pith-number/TT52SFNHCBQW55JGV76QECHEZ6/events.json","paper":"https://pith.science/paper/TT52SFNH"},"agent_actions":{"view_html":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6","download_json":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6.json","view_paper":"https://pith.science/paper/TT52SFNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00339&json=true","fetch_graph":"https://pith.science/api/pith-number/TT52SFNHCBQW55JGV76QECHEZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/TT52SFNHCBQW55JGV76QECHEZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6/action/storage_attestation","attest_author":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6/action/author_attestation","sign_citation":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6/action/citation_signature","submit_replication":"https://pith.science/pith/TT52SFNHCBQW55JGV76QECHEZ6/action/replication_record"}},"created_at":"2026-05-17T23:44:18.316043+00:00","updated_at":"2026-05-17T23:44:18.316043+00:00"}