{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:E6A2HEEBFSLRV7VXMKK4HPCN72","short_pith_number":"pith:E6A2HEEB","schema_version":"1.0","canonical_sha256":"2781a390812c971afeb76295c3bc4dfe91fcaab18bd1c324b3e6b73acd5b3474","source":{"kind":"arxiv","id":"2203.04370","version":1},"attestation_state":"computed","paper":{"title":"New Coresets for Projective Clustering and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Murad Tukan, Samson Zhou, Vladimir Braverman, Xuan Wu","submitted_at":"2022-03-08T19:50:27Z","abstract_excerpt":"$(j,k)$-projective clustering is the natural generalization of the family of $k$-clustering and $j$-subspace clustering problems. Given a set of points $P$ in $\\mathbb{R}^d$, the goal is to find $k$ flats of dimension $j$, i.e., affine subspaces, that best fit $P$ under a given distance measure. In this paper, we propose the first algorithm that returns an $L_\\infty$ coreset of size polynomial in $d$. Moreover, we give the first strong coreset construction for general $M$-estimator regression. Specifically, we show that our construction provides efficient coreset constructions for Cauchy, Wels"},"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":"2203.04370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-08T19:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"c000d067b0f6844d89f038cd7dad9de0e5d23ff99cb31f668a6959e5ef8eec65","abstract_canon_sha256":"38c44f07f9dc7397ddf49e1ef91e9d51be193288a85c63f549c3521a7e3bcc90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:17.404943Z","signature_b64":"vj7Bu2hMMp9f+OeMhaZgy5pqkXtqHFcXnfHXbHCB5LfjxzL9pu6gGZkJe7XASLcwC5SKOgqRv1ngw6iTLPOSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2781a390812c971afeb76295c3bc4dfe91fcaab18bd1c324b3e6b73acd5b3474","last_reissued_at":"2026-07-05T04:03:17.404510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:17.404510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Coresets for Projective Clustering and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Murad Tukan, Samson Zhou, Vladimir Braverman, Xuan Wu","submitted_at":"2022-03-08T19:50:27Z","abstract_excerpt":"$(j,k)$-projective clustering is the natural generalization of the family of $k$-clustering and $j$-subspace clustering problems. Given a set of points $P$ in $\\mathbb{R}^d$, the goal is to find $k$ flats of dimension $j$, i.e., affine subspaces, that best fit $P$ under a given distance measure. In this paper, we propose the first algorithm that returns an $L_\\infty$ coreset of size polynomial in $d$. Moreover, we give the first strong coreset construction for general $M$-estimator regression. Specifically, we show that our construction provides efficient coreset constructions for Cauchy, Wels"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04370","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/2203.04370/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":"2203.04370","created_at":"2026-07-05T04:03:17.404567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.04370v1","created_at":"2026-07-05T04:03:17.404567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04370","created_at":"2026-07-05T04:03:17.404567+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6A2HEEBFSLR","created_at":"2026-07-05T04:03:17.404567+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6A2HEEBFSLRV7VX","created_at":"2026-07-05T04:03:17.404567+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6A2HEEB","created_at":"2026-07-05T04:03:17.404567+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/E6A2HEEBFSLRV7VXMKK4HPCN72","json":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72.json","graph_json":"https://pith.science/api/pith-number/E6A2HEEBFSLRV7VXMKK4HPCN72/graph.json","events_json":"https://pith.science/api/pith-number/E6A2HEEBFSLRV7VXMKK4HPCN72/events.json","paper":"https://pith.science/paper/E6A2HEEB"},"agent_actions":{"view_html":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72","download_json":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72.json","view_paper":"https://pith.science/paper/E6A2HEEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.04370&json=true","fetch_graph":"https://pith.science/api/pith-number/E6A2HEEBFSLRV7VXMKK4HPCN72/graph.json","fetch_events":"https://pith.science/api/pith-number/E6A2HEEBFSLRV7VXMKK4HPCN72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72/action/storage_attestation","attest_author":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72/action/author_attestation","sign_citation":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72/action/citation_signature","submit_replication":"https://pith.science/pith/E6A2HEEBFSLRV7VXMKK4HPCN72/action/replication_record"}},"created_at":"2026-07-05T04:03:17.404567+00:00","updated_at":"2026-07-05T04:03:17.404567+00:00"}