{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KHMFE2HE4ZRRXBAGKF76BKNUNM","short_pith_number":"pith:KHMFE2HE","schema_version":"1.0","canonical_sha256":"51d85268e4e6631b8406517fe0a9b46b00241a735fb50e271b29826a197849b3","source":{"kind":"arxiv","id":"1204.5043","version":2},"attestation_state":"computed","paper":{"title":"Sparse Prediction with the $k$-Support Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Argyriou, Nathan Srebro, Rina Foygel","submitted_at":"2012-04-23T12:35:56Z","abstract_excerpt":"We derive a novel norm that corresponds to the tightest convex relaxation of sparsity combined with an $\\ell_2$ penalty. We show that this new {\\em $k$-support norm} provides a tighter relaxation than the elastic net and is thus a good replacement for the Lasso or the elastic net in sparse prediction problems. Through the study of the $k$-support norm, we also bound the looseness of the elastic net, thus shedding new light on it and providing justification for its use."},"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":"1204.5043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-23T12:35:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cdd5a2c20d4e9c236f1d097b8906d4dc85bb244c269fcf5ddddb2b29223897b7","abstract_canon_sha256":"c372216ebf8378b977321c002c1f44c74c04afc7e1679a4f9a8c3c826e0d32db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.709482Z","signature_b64":"5WOykwKSgMxyNmcy8xjqetd3p8AWIAcjnGweV/z6Fk5OF6kyMhTFnxSok7ixdUDKZ4RyRASQ/BSnlYNGhYtEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d85268e4e6631b8406517fe0a9b46b00241a735fb50e271b29826a197849b3","last_reissued_at":"2026-05-18T03:53:44.708975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.708975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Prediction with the $k$-Support Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Argyriou, Nathan Srebro, Rina Foygel","submitted_at":"2012-04-23T12:35:56Z","abstract_excerpt":"We derive a novel norm that corresponds to the tightest convex relaxation of sparsity combined with an $\\ell_2$ penalty. We show that this new {\\em $k$-support norm} provides a tighter relaxation than the elastic net and is thus a good replacement for the Lasso or the elastic net in sparse prediction problems. Through the study of the $k$-support norm, we also bound the looseness of the elastic net, thus shedding new light on it and providing justification for its use."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5043","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":"1204.5043","created_at":"2026-05-18T03:53:44.709052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5043v2","created_at":"2026-05-18T03:53:44.709052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5043","created_at":"2026-05-18T03:53:44.709052+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHMFE2HE4ZRR","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHMFE2HE4ZRRXBAG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHMFE2HE","created_at":"2026-05-18T12:27:11.947152+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/KHMFE2HE4ZRRXBAGKF76BKNUNM","json":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM.json","graph_json":"https://pith.science/api/pith-number/KHMFE2HE4ZRRXBAGKF76BKNUNM/graph.json","events_json":"https://pith.science/api/pith-number/KHMFE2HE4ZRRXBAGKF76BKNUNM/events.json","paper":"https://pith.science/paper/KHMFE2HE"},"agent_actions":{"view_html":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM","download_json":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM.json","view_paper":"https://pith.science/paper/KHMFE2HE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5043&json=true","fetch_graph":"https://pith.science/api/pith-number/KHMFE2HE4ZRRXBAGKF76BKNUNM/graph.json","fetch_events":"https://pith.science/api/pith-number/KHMFE2HE4ZRRXBAGKF76BKNUNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM/action/storage_attestation","attest_author":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM/action/author_attestation","sign_citation":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM/action/citation_signature","submit_replication":"https://pith.science/pith/KHMFE2HE4ZRRXBAGKF76BKNUNM/action/replication_record"}},"created_at":"2026-05-18T03:53:44.709052+00:00","updated_at":"2026-05-18T03:53:44.709052+00:00"}