{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7ECV3ZCQE65EPLTFD6KIUI5DP3","short_pith_number":"pith:7ECV3ZCQ","schema_version":"1.0","canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","source":{"kind":"arxiv","id":"2406.02910","version":1},"attestation_state":"computed","paper":{"title":"High-Dimensional Geometric Streaming for Nearly Low Rank Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hossein Esfandiari, Peilin Zhong, Praneeth Kacham, Vahab Mirrokni","submitted_at":"2024-06-05T04:03:44Z","abstract_excerpt":"We study streaming algorithms for the $\\ell_p$ subspace approximation problem. Given points $a_1, \\ldots, a_n$ as an insertion-only stream and a rank parameter $k$, the $\\ell_p$ subspace approximation problem is to find a $k$-dimensional subspace $V$ such that $(\\sum_{i=1}^n d(a_i, V)^p)^{1/p}$ is minimized, where $d(a, V)$ denotes the Euclidean distance between $a$ and $V$ defined as $\\min_{v \\in V}\\|{a - v}\\|_{\\infty}$. When $p = \\infty$, we need to find a subspace $V$ that minimizes $\\max_i d(a_i, V)$. For $\\ell_{\\infty}$ subspace approximation, we give a deterministic strong coreset constr"},"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":"2406.02910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"b0034cadafbd6614a5992512e2fd8d7dd5e50ff381eae9269e49b8d0eaf6e166","abstract_canon_sha256":"e45d74d051276e6072cc4b46adc4e6b68c2385535bd2e456df755fc680422741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:32.422693Z","signature_b64":"3vUT1zHZN+JX+KpJn5E0k+yXTUNYP8x/BV+ZsPCTUiMz/qVCLsF8JJ0Tyi2szHicGpQ6ocxEEB9U/hCxjILRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","last_reissued_at":"2026-07-05T08:27:32.422195Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:32.422195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Geometric Streaming for Nearly Low Rank Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hossein Esfandiari, Peilin Zhong, Praneeth Kacham, Vahab Mirrokni","submitted_at":"2024-06-05T04:03:44Z","abstract_excerpt":"We study streaming algorithms for the $\\ell_p$ subspace approximation problem. Given points $a_1, \\ldots, a_n$ as an insertion-only stream and a rank parameter $k$, the $\\ell_p$ subspace approximation problem is to find a $k$-dimensional subspace $V$ such that $(\\sum_{i=1}^n d(a_i, V)^p)^{1/p}$ is minimized, where $d(a, V)$ denotes the Euclidean distance between $a$ and $V$ defined as $\\min_{v \\in V}\\|{a - v}\\|_{\\infty}$. When $p = \\infty$, we need to find a subspace $V$ that minimizes $\\max_i d(a_i, V)$. For $\\ell_{\\infty}$ subspace approximation, we give a deterministic strong coreset constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02910","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/2406.02910/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":"2406.02910","created_at":"2026-07-05T08:27:32.422250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02910v1","created_at":"2026-07-05T08:27:32.422250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02910","created_at":"2026-07-05T08:27:32.422250+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ECV3ZCQE65E","created_at":"2026-07-05T08:27:32.422250+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ECV3ZCQE65EPLTF","created_at":"2026-07-05T08:27:32.422250+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ECV3ZCQ","created_at":"2026-07-05T08:27:32.422250+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/7ECV3ZCQE65EPLTFD6KIUI5DP3","json":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3.json","graph_json":"https://pith.science/api/pith-number/7ECV3ZCQE65EPLTFD6KIUI5DP3/graph.json","events_json":"https://pith.science/api/pith-number/7ECV3ZCQE65EPLTFD6KIUI5DP3/events.json","paper":"https://pith.science/paper/7ECV3ZCQ"},"agent_actions":{"view_html":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3","download_json":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3.json","view_paper":"https://pith.science/paper/7ECV3ZCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02910&json=true","fetch_graph":"https://pith.science/api/pith-number/7ECV3ZCQE65EPLTFD6KIUI5DP3/graph.json","fetch_events":"https://pith.science/api/pith-number/7ECV3ZCQE65EPLTFD6KIUI5DP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/action/storage_attestation","attest_author":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/action/author_attestation","sign_citation":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/action/citation_signature","submit_replication":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/action/replication_record"}},"created_at":"2026-07-05T08:27:32.422250+00:00","updated_at":"2026-07-05T08:27:32.422250+00:00"}