{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TT52SFNHCBQW55JGV76QECHEZ6","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":"7babc36c3d3a889190bd0e0abfccc9a815bb76e2604931b4ae9589ce23ec3760","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T04:15:17Z","title_canon_sha256":"81f7d7488747ddc2488ef067dcc0d1fac0ca3a75d7c5d1106f15e8d0d85dbf2d"},"schema_version":"1.0","source":{"id":"1906.00339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00339","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00339v1","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00339","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"TT52SFNHCBQW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TT52SFNHCBQW55JG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TT52SFNH","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:3ac2b33c8a88f3bbded4b3abc406db3751c639f55d32e3d188428654e8bf68b8","target":"graph","created_at":"2026-05-17T23:44:18Z","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 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","authors_text":"Ali Vakilian, David Woodruff, Piotr Indyk, Tal Wagner","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T04:15:17Z","title":"Sample-Optimal Low-Rank Approximation of Distance Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00339","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:bbe1f4567ed5b6b60b60ff1484245a42cf4e8ca6ae8fba415bf883b0752faab5","target":"record","created_at":"2026-05-17T23:44:18Z","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":"7babc36c3d3a889190bd0e0abfccc9a815bb76e2604931b4ae9589ce23ec3760","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T04:15:17Z","title_canon_sha256":"81f7d7488747ddc2488ef067dcc0d1fac0ca3a75d7c5d1106f15e8d0d85dbf2d"},"schema_version":"1.0","source":{"id":"1906.00339","kind":"arxiv","version":1}},"canonical_sha256":"9cfba915a710616ef526affd0208e4cf832f0bc4d7f9c1a1c585bf321624c350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cfba915a710616ef526affd0208e4cf832f0bc4d7f9c1a1c585bf321624c350","first_computed_at":"2026-05-17T23:44:18.315936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:18.315936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CqVvUKN/bUGNuMtvCo8iOiLK3ZIdh/nL3ieOI+aa3N74csn1qFvBhn8rzbMS+2vuQJYEPKS4JahlqHW9I18Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:18.316631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe1f4567ed5b6b60b60ff1484245a42cf4e8ca6ae8fba415bf883b0752faab5","sha256:3ac2b33c8a88f3bbded4b3abc406db3751c639f55d32e3d188428654e8bf68b8"],"state_sha256":"a830c042ff037b0e1ace36394b0d5d20c4618d16e96b449bb66f18731fc291da"}