{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:YGMDRKNECJ2HHGFRTHPCHN26BC","short_pith_number":"pith:YGMDRKNE","schema_version":"1.0","canonical_sha256":"c19838a9a412747398b199de23b75e08b851f9dac322588317f2d0ac50953363","source":{"kind":"arxiv","id":"0707.1714","version":1},"attestation_state":"computed","paper":{"title":"Sampling Algorithms and Coresets for Lp Regression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Boulos Harb, Michael W. Mahoney, Petros Drineas, Ravi Kumar","submitted_at":"2007-07-11T22:04:18Z","abstract_excerpt":"The Lp regression problem takes as input a matrix $A \\in \\Real^{n \\times d}$, a vector $b \\in \\Real^n$, and a number $p \\in [1,\\infty)$, and it returns as output a number ${\\cal Z}$ and a vector $x_{opt} \\in \\Real^d$ such that ${\\cal Z} = \\min_{x \\in \\Real^d} ||Ax -b||_p = ||Ax_{opt}-b||_p$. In this paper, we construct coresets and obtain an efficient two-stage sampling-based approximation algorithm for the very overconstrained ($n \\gg d$) version of this classical problem, for all $p \\in [1, \\infty)$. The first stage of our algorithm non-uniformly samples $\\hat{r}_1 = O(36^p d^{\\max\\{p/2+1, p"},"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":"0707.1714","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-07-11T22:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"e21b62965e3355dc7630b445ea464bcd1082d2305c20ae233c2d2c0ff26e08a1","abstract_canon_sha256":"ca5f0270204c35c1903653dbd55b8bd57b8e7a06c1dbd14deebcca916df8485b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:50.135328Z","signature_b64":"Wwdfj59vkRv2nFnO0NmhF9KHJ7Zyl3u/AYFQ/NcsXzRbbdr5jcutfAPBS86Dk75ZWKyIs/+IiLhfuRgEkRU/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c19838a9a412747398b199de23b75e08b851f9dac322588317f2d0ac50953363","last_reissued_at":"2026-07-04T15:02:50.134921Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:50.134921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling Algorithms and Coresets for Lp Regression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anirban Dasgupta, Boulos Harb, Michael W. Mahoney, Petros Drineas, Ravi Kumar","submitted_at":"2007-07-11T22:04:18Z","abstract_excerpt":"The Lp regression problem takes as input a matrix $A \\in \\Real^{n \\times d}$, a vector $b \\in \\Real^n$, and a number $p \\in [1,\\infty)$, and it returns as output a number ${\\cal Z}$ and a vector $x_{opt} \\in \\Real^d$ such that ${\\cal Z} = \\min_{x \\in \\Real^d} ||Ax -b||_p = ||Ax_{opt}-b||_p$. In this paper, we construct coresets and obtain an efficient two-stage sampling-based approximation algorithm for the very overconstrained ($n \\gg d$) version of this classical problem, for all $p \\in [1, \\infty)$. The first stage of our algorithm non-uniformly samples $\\hat{r}_1 = O(36^p d^{\\max\\{p/2+1, p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1714","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/0707.1714/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":"0707.1714","created_at":"2026-07-04T15:02:50.134983+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.1714v1","created_at":"2026-07-04T15:02:50.134983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1714","created_at":"2026-07-04T15:02:50.134983+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGMDRKNECJ2H","created_at":"2026-07-04T15:02:50.134983+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGMDRKNECJ2HHGFR","created_at":"2026-07-04T15:02:50.134983+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGMDRKNE","created_at":"2026-07-04T15:02:50.134983+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/YGMDRKNECJ2HHGFRTHPCHN26BC","json":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC.json","graph_json":"https://pith.science/api/pith-number/YGMDRKNECJ2HHGFRTHPCHN26BC/graph.json","events_json":"https://pith.science/api/pith-number/YGMDRKNECJ2HHGFRTHPCHN26BC/events.json","paper":"https://pith.science/paper/YGMDRKNE"},"agent_actions":{"view_html":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC","download_json":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC.json","view_paper":"https://pith.science/paper/YGMDRKNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.1714&json=true","fetch_graph":"https://pith.science/api/pith-number/YGMDRKNECJ2HHGFRTHPCHN26BC/graph.json","fetch_events":"https://pith.science/api/pith-number/YGMDRKNECJ2HHGFRTHPCHN26BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC/action/storage_attestation","attest_author":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC/action/author_attestation","sign_citation":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC/action/citation_signature","submit_replication":"https://pith.science/pith/YGMDRKNECJ2HHGFRTHPCHN26BC/action/replication_record"}},"created_at":"2026-07-04T15:02:50.134983+00:00","updated_at":"2026-07-04T15:02:50.134983+00:00"}