{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GGMQROMIYZIO3SSBVD4OADN4S","short_pith_number":"pith:3GGMQROM","schema_version":"1.0","canonical_sha256":"d98cc845cc4632876e520d47c7006de4a217ade8af0fe3b98351ad835c1bed11","source":{"kind":"arxiv","id":"1202.3505","version":2},"attestation_state":"computed","paper":{"title":"Near-optimal Coresets For Least-Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas","submitted_at":"2012-02-16T03:07:35Z","abstract_excerpt":"We study (constrained) least-squares regression as well as multiple response least-squares regression and ask the question of whether a subset of the data, a coreset, suffices to compute a good approximate solution to the regression. We give deterministic, low order polynomial-time algorithms to construct such coresets with approximation guarantees, together with lower bounds indicating that there is not much room for improvement upon our results."},"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":"1202.3505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-16T03:07:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3d66f5f0604657aca00e85c11f1dbad3aa38aa7dc178502228d6a56c32b5043","abstract_canon_sha256":"ef306f9ee4fd10e94585132552191c04886670b6746d50cd034c81b98627b69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.055047Z","signature_b64":"+pt2w1A3BCY66zZLNQI0/Q2THj+dLEUvhHYnWczOUyIxVZFWZTQnhuBhJdRpqR0sUbDfpndiTPF9JU/rsQ27DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98cc845cc4632876e520d47c7006de4a217ade8af0fe3b98351ad835c1bed11","last_reissued_at":"2026-05-18T00:57:57.054567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.054567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal Coresets For Least-Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Malik Magdon-Ismail, Petros Drineas","submitted_at":"2012-02-16T03:07:35Z","abstract_excerpt":"We study (constrained) least-squares regression as well as multiple response least-squares regression and ask the question of whether a subset of the data, a coreset, suffices to compute a good approximate solution to the regression. We give deterministic, low order polynomial-time algorithms to construct such coresets with approximation guarantees, together with lower bounds indicating that there is not much room for improvement upon our results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3505","kind":"arxiv","version":2},"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":"1202.3505","created_at":"2026-05-18T00:57:57.054650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3505v2","created_at":"2026-05-18T00:57:57.054650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3505","created_at":"2026-05-18T00:57:57.054650+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GGMQROMIYZI","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GGMQROMIYZIO3SS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GGMQROM","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/3GGMQROMIYZIO3SSBVD4OADN4S","json":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S.json","graph_json":"https://pith.science/api/pith-number/3GGMQROMIYZIO3SSBVD4OADN4S/graph.json","events_json":"https://pith.science/api/pith-number/3GGMQROMIYZIO3SSBVD4OADN4S/events.json","paper":"https://pith.science/paper/3GGMQROM"},"agent_actions":{"view_html":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S","download_json":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S.json","view_paper":"https://pith.science/paper/3GGMQROM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3505&json=true","fetch_graph":"https://pith.science/api/pith-number/3GGMQROMIYZIO3SSBVD4OADN4S/graph.json","fetch_events":"https://pith.science/api/pith-number/3GGMQROMIYZIO3SSBVD4OADN4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S/action/storage_attestation","attest_author":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S/action/author_attestation","sign_citation":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S/action/citation_signature","submit_replication":"https://pith.science/pith/3GGMQROMIYZIO3SSBVD4OADN4S/action/replication_record"}},"created_at":"2026-05-18T00:57:57.054650+00:00","updated_at":"2026-05-18T00:57:57.054650+00:00"}