{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NJZDL5I3ZT2VVP5OUW5DTCU2TP","short_pith_number":"pith:NJZDL5I3","schema_version":"1.0","canonical_sha256":"6a7235f51bccf55abfaea5ba398a9a9bf86d7be304a673d8bf491718fcaab0b4","source":{"kind":"arxiv","id":"1907.01433","version":1},"attestation_state":"computed","paper":{"title":"Tight Sensitivity Bounds For Smaller Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adiel Statman, Alaa Maalouf, Dan Feldman","submitted_at":"2019-07-02T15:19:37Z","abstract_excerpt":"An $\\varepsilon$-coreset for Least-Mean-Squares (LMS) of a matrix $A\\in{\\mathbb{R}}^{n\\times d}$ is a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine $k$-dimensional subspace of ${\\mathbb{R}}^d$, up to a factor of $1\\pm\\varepsilon$.\n  Such coresets are useful for hyper-parameter tuning and solving many least-mean-squares problems such as low-rank approximation ($k$-SVD), $k$-PCA, Lassso/Ridge/Linear regression and many more. Coresets are also useful for handling streaming, dynamic and distributed big data in parallel. With high pro"},"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":"1907.01433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T15:19:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43c93dfd9d42b40570842cfcf5577c420ac9aa3e99c9f510a677b29dc8d44fbb","abstract_canon_sha256":"2746d6577c97dbc43cd257c1bad06b8bb09b454692b40adacf335dc4321b548f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.409072Z","signature_b64":"s6fTzyo4jMeFVeCIMCuce+BT892Y3EUKBvFTsY3bnFRtEaVQwScAWuiBYZlG6GuH1JF09ikqen0jlmPn8F63Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a7235f51bccf55abfaea5ba398a9a9bf86d7be304a673d8bf491718fcaab0b4","last_reissued_at":"2026-05-17T23:41:40.408557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.408557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Sensitivity Bounds For Smaller Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adiel Statman, Alaa Maalouf, Dan Feldman","submitted_at":"2019-07-02T15:19:37Z","abstract_excerpt":"An $\\varepsilon$-coreset for Least-Mean-Squares (LMS) of a matrix $A\\in{\\mathbb{R}}^{n\\times d}$ is a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine $k$-dimensional subspace of ${\\mathbb{R}}^d$, up to a factor of $1\\pm\\varepsilon$.\n  Such coresets are useful for hyper-parameter tuning and solving many least-mean-squares problems such as low-rank approximation ($k$-SVD), $k$-PCA, Lassso/Ridge/Linear regression and many more. Coresets are also useful for handling streaming, dynamic and distributed big data in parallel. With high pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01433","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":"1907.01433","created_at":"2026-05-17T23:41:40.408635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01433v1","created_at":"2026-05-17T23:41:40.408635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01433","created_at":"2026-05-17T23:41:40.408635+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJZDL5I3ZT2V","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJZDL5I3ZT2VVP5O","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJZDL5I3","created_at":"2026-05-18T12:33:24.271573+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/NJZDL5I3ZT2VVP5OUW5DTCU2TP","json":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP.json","graph_json":"https://pith.science/api/pith-number/NJZDL5I3ZT2VVP5OUW5DTCU2TP/graph.json","events_json":"https://pith.science/api/pith-number/NJZDL5I3ZT2VVP5OUW5DTCU2TP/events.json","paper":"https://pith.science/paper/NJZDL5I3"},"agent_actions":{"view_html":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP","download_json":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP.json","view_paper":"https://pith.science/paper/NJZDL5I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01433&json=true","fetch_graph":"https://pith.science/api/pith-number/NJZDL5I3ZT2VVP5OUW5DTCU2TP/graph.json","fetch_events":"https://pith.science/api/pith-number/NJZDL5I3ZT2VVP5OUW5DTCU2TP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP/action/storage_attestation","attest_author":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP/action/author_attestation","sign_citation":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP/action/citation_signature","submit_replication":"https://pith.science/pith/NJZDL5I3ZT2VVP5OUW5DTCU2TP/action/replication_record"}},"created_at":"2026-05-17T23:41:40.408635+00:00","updated_at":"2026-05-17T23:41:40.408635+00:00"}