{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:33BOP2XWGHWBTLRG3UHAI3C7DS","short_pith_number":"pith:33BOP2XW","schema_version":"1.0","canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","source":{"kind":"arxiv","id":"1207.4684","version":3},"attestation_state":"computed","paper":{"title":"The Fast Cauchy Transform and Faster Robust Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Kenneth L. Clarkson, Malik Magdon-Ismail, Michael W. Mahoney, Petros Drineas, Xiangrui Meng","submitted_at":"2012-07-19T14:26:05Z","abstract_excerpt":"We provide fast algorithms for overconstrained $\\ell_p$ regression and related problems: for an $n\\times d$ input matrix $A$ and vector $b\\in\\mathbb{R}^n$, in $O(nd\\log n)$ time we reduce the problem $\\min_{x\\in\\mathbb{R}^d} \\|Ax-b\\|_p$ to the same problem with input matrix $\\tilde A$ of dimension $s \\times d$ and corresponding $\\tilde b$ of dimension $s\\times 1$. Here, $\\tilde A$ and $\\tilde b$ are a coreset for the problem, consisting of sampled and rescaled rows of $A$ and $b$; and $s$ is independent of $n$ and polynomial in $d$. Our results improve on the best previous algorithms when $n\\g"},"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":"1207.4684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:26:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eaaae3a67274572e9684302bba95bf716356cc85e6d6c742a3563eabfd477aea","abstract_canon_sha256":"6e41f2d2ebd9c17708e6d25387dddb0aec024745315d569e91f005e7fe135e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.289383Z","signature_b64":"lotiQbePHCe8SxH3g6Z0lWC5H3XlKwJw6ndUNNB+FnzHpQjUl0pbfpGb0B5HkOwZ0X5RadXkt960tPg3LRobCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dec2e7eaf631ec19ae26dd0e046c5f1ca0150ae49122804eaf831f8addb345bf","last_reissued_at":"2026-05-18T02:54:47.288990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.288990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fast Cauchy Transform and Faster Robust Linear Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Kenneth L. Clarkson, Malik Magdon-Ismail, Michael W. Mahoney, Petros Drineas, Xiangrui Meng","submitted_at":"2012-07-19T14:26:05Z","abstract_excerpt":"We provide fast algorithms for overconstrained $\\ell_p$ regression and related problems: for an $n\\times d$ input matrix $A$ and vector $b\\in\\mathbb{R}^n$, in $O(nd\\log n)$ time we reduce the problem $\\min_{x\\in\\mathbb{R}^d} \\|Ax-b\\|_p$ to the same problem with input matrix $\\tilde A$ of dimension $s \\times d$ and corresponding $\\tilde b$ of dimension $s\\times 1$. Here, $\\tilde A$ and $\\tilde b$ are a coreset for the problem, consisting of sampled and rescaled rows of $A$ and $b$; and $s$ is independent of $n$ and polynomial in $d$. Our results improve on the best previous algorithms when $n\\g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4684","kind":"arxiv","version":3},"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":"1207.4684","created_at":"2026-05-18T02:54:47.289051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4684v3","created_at":"2026-05-18T02:54:47.289051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4684","created_at":"2026-05-18T02:54:47.289051+00:00"},{"alias_kind":"pith_short_12","alias_value":"33BOP2XWGHWB","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"33BOP2XWGHWBTLRG","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"33BOP2XW","created_at":"2026-05-18T12:26:50.516681+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/33BOP2XWGHWBTLRG3UHAI3C7DS","json":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS.json","graph_json":"https://pith.science/api/pith-number/33BOP2XWGHWBTLRG3UHAI3C7DS/graph.json","events_json":"https://pith.science/api/pith-number/33BOP2XWGHWBTLRG3UHAI3C7DS/events.json","paper":"https://pith.science/paper/33BOP2XW"},"agent_actions":{"view_html":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS","download_json":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS.json","view_paper":"https://pith.science/paper/33BOP2XW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4684&json=true","fetch_graph":"https://pith.science/api/pith-number/33BOP2XWGHWBTLRG3UHAI3C7DS/graph.json","fetch_events":"https://pith.science/api/pith-number/33BOP2XWGHWBTLRG3UHAI3C7DS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/action/storage_attestation","attest_author":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/action/author_attestation","sign_citation":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/action/citation_signature","submit_replication":"https://pith.science/pith/33BOP2XWGHWBTLRG3UHAI3C7DS/action/replication_record"}},"created_at":"2026-05-18T02:54:47.289051+00:00","updated_at":"2026-05-18T02:54:47.289051+00:00"}