{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YVKM5SVVM42X4TUD5ECFS33E7V","short_pith_number":"pith:YVKM5SVV","schema_version":"1.0","canonical_sha256":"c554cecab567357e4e83e904596f64fd4b614056c774b6df21b81ffed02edf89","source":{"kind":"arxiv","id":"1607.08756","version":3},"attestation_state":"computed","paper":{"title":"Data Filtering for Cluster Analysis by $\\ell_0$-Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Andrea Cristofari","submitted_at":"2016-07-29T10:21:24Z","abstract_excerpt":"A data filtering method for cluster analysis is proposed, based on minimizing a least squares function with a weighted $\\ell_0$-norm penalty. To overcome the discontinuity of the objective function, smooth non-convex functions are employed to approximate the $\\ell_0$-norm. The convergence of the global minimum points of the approximating problems towards global minimum points of the original problem is stated. The proposed method also exploits a suitable technique to choose the penalty parameter. Numerical results on synthetic and real data sets are finally provided, showing how some existing "},"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":"1607.08756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T10:21:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3f9d4a97da1c76640b4125e82ef3e18eba8a062881573ee143aa6b8be4ccf6bb","abstract_canon_sha256":"d7b25569d6c13696a3fb83358eacf6079b52502df590b11dbfd4c31e71be8cdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:09.485751Z","signature_b64":"rBNsd2rRXivaz5bSp+njUo44uLXdBmlf6cDWSjeLmsV8CNPHacZhB+pTDko+5VYUFLmIfaQ1nHqNZc9PcaaTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c554cecab567357e4e83e904596f64fd4b614056c774b6df21b81ffed02edf89","last_reissued_at":"2026-05-18T00:44:09.485289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:09.485289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Filtering for Cluster Analysis by $\\ell_0$-Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Andrea Cristofari","submitted_at":"2016-07-29T10:21:24Z","abstract_excerpt":"A data filtering method for cluster analysis is proposed, based on minimizing a least squares function with a weighted $\\ell_0$-norm penalty. To overcome the discontinuity of the objective function, smooth non-convex functions are employed to approximate the $\\ell_0$-norm. The convergence of the global minimum points of the approximating problems towards global minimum points of the original problem is stated. The proposed method also exploits a suitable technique to choose the penalty parameter. Numerical results on synthetic and real data sets are finally provided, showing how some existing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08756","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":"1607.08756","created_at":"2026-05-18T00:44:09.485371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08756v3","created_at":"2026-05-18T00:44:09.485371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08756","created_at":"2026-05-18T00:44:09.485371+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVKM5SVVM42X","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVKM5SVVM42X4TUD","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVKM5SVV","created_at":"2026-05-18T12:30:53.716459+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/YVKM5SVVM42X4TUD5ECFS33E7V","json":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V.json","graph_json":"https://pith.science/api/pith-number/YVKM5SVVM42X4TUD5ECFS33E7V/graph.json","events_json":"https://pith.science/api/pith-number/YVKM5SVVM42X4TUD5ECFS33E7V/events.json","paper":"https://pith.science/paper/YVKM5SVV"},"agent_actions":{"view_html":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V","download_json":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V.json","view_paper":"https://pith.science/paper/YVKM5SVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08756&json=true","fetch_graph":"https://pith.science/api/pith-number/YVKM5SVVM42X4TUD5ECFS33E7V/graph.json","fetch_events":"https://pith.science/api/pith-number/YVKM5SVVM42X4TUD5ECFS33E7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V/action/storage_attestation","attest_author":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V/action/author_attestation","sign_citation":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V/action/citation_signature","submit_replication":"https://pith.science/pith/YVKM5SVVM42X4TUD5ECFS33E7V/action/replication_record"}},"created_at":"2026-05-18T00:44:09.485371+00:00","updated_at":"2026-05-18T00:44:09.485371+00:00"}