{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ECI4NIX4PM3W57GW3NOD664TVS","short_pith_number":"pith:ECI4NIX4","schema_version":"1.0","canonical_sha256":"2091c6a2fc7b376efcd6db5c3f7b93acbee9d1073815d0d15247a54e58f3b8f0","source":{"kind":"arxiv","id":"1209.4893","version":2},"attestation_state":"computed","paper":{"title":"On the Sensitivity of Shape Fitting Problems","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Xin Xiao","submitted_at":"2012-09-21T19:55:53Z","abstract_excerpt":"In this article, we study shape fitting problems, $\\epsilon$-coresets, and total sensitivity. We focus on the $(j,k)$-projective clustering problems, including $k$-median/$k$-means, $k$-line clustering, $j$-subspace approximation, and the integer $(j,k)$-projective clustering problem. We derive upper bounds of total sensitivities for these problems, and obtain $\\epsilon$-coresets using these upper bounds. Using a dimension-reduction type argument, we are able to greatly simplify earlier results on total sensitivity for the $k$-median/$k$-means clustering problems, and obtain positively-weighte"},"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":"1209.4893","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2012-09-21T19:55:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff086f5ccd80ee542fce88ed13d01b371c564fb28257283d62b3bc3e665e093b","abstract_canon_sha256":"5b5ec5ba2983074face0b2ab2f68a4c075fca8be00de12ca00b32a0c0dc06bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:29.359923Z","signature_b64":"nUYF6EBPBZF9jlhxXxY1WF3s8s0RK3F/sUGF5dY/6wlNjtGD8eEHEh0OGDtcLsCqV5wzH5cNyGn8oWoUC9ABBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2091c6a2fc7b376efcd6db5c3f7b93acbee9d1073815d0d15247a54e58f3b8f0","last_reissued_at":"2026-05-18T03:43:29.358629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:29.358629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sensitivity of Shape Fitting Problems","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Xin Xiao","submitted_at":"2012-09-21T19:55:53Z","abstract_excerpt":"In this article, we study shape fitting problems, $\\epsilon$-coresets, and total sensitivity. We focus on the $(j,k)$-projective clustering problems, including $k$-median/$k$-means, $k$-line clustering, $j$-subspace approximation, and the integer $(j,k)$-projective clustering problem. We derive upper bounds of total sensitivities for these problems, and obtain $\\epsilon$-coresets using these upper bounds. Using a dimension-reduction type argument, we are able to greatly simplify earlier results on total sensitivity for the $k$-median/$k$-means clustering problems, and obtain positively-weighte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4893","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":"1209.4893","created_at":"2026-05-18T03:43:29.358777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4893v2","created_at":"2026-05-18T03:43:29.358777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4893","created_at":"2026-05-18T03:43:29.358777+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECI4NIX4PM3W","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECI4NIX4PM3W57GW","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECI4NIX4","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.01433","citing_title":"Tight Sensitivity Bounds For Smaller Coresets","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02171","citing_title":"Sketched MinDist","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS","json":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS.json","graph_json":"https://pith.science/api/pith-number/ECI4NIX4PM3W57GW3NOD664TVS/graph.json","events_json":"https://pith.science/api/pith-number/ECI4NIX4PM3W57GW3NOD664TVS/events.json","paper":"https://pith.science/paper/ECI4NIX4"},"agent_actions":{"view_html":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS","download_json":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS.json","view_paper":"https://pith.science/paper/ECI4NIX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4893&json=true","fetch_graph":"https://pith.science/api/pith-number/ECI4NIX4PM3W57GW3NOD664TVS/graph.json","fetch_events":"https://pith.science/api/pith-number/ECI4NIX4PM3W57GW3NOD664TVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS/action/storage_attestation","attest_author":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS/action/author_attestation","sign_citation":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS/action/citation_signature","submit_replication":"https://pith.science/pith/ECI4NIX4PM3W57GW3NOD664TVS/action/replication_record"}},"created_at":"2026-05-18T03:43:29.358777+00:00","updated_at":"2026-05-18T03:43:29.358777+00:00"}