{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DBNWYUEHNHHZJSXIIVKRXQELKB","short_pith_number":"pith:DBNWYUEH","schema_version":"1.0","canonical_sha256":"185b6c508769cf94cae845551bc08b50705247c2438715f26d26e60cd72cb836","source":{"kind":"arxiv","id":"1108.5668","version":1},"attestation_state":"computed","paper":{"title":"Datum-Wise Classification: A Sequential Approach to Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Gabriel Dulac-Arnold, Ludovic Denoyer, Patrick Gallinari, Philippe Preux","submitted_at":"2011-08-29T17:46:08Z","abstract_excerpt":"We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe "},"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":"1108.5668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-29T17:46:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3ceb78df9816d4441023266db8d22ba241793a49840b581c1a4f2b257ecfaaae","abstract_canon_sha256":"211b590b2494c53ac861a8dc7b7b6b603998171f0d0dcd79442724d4b9da7400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:11.424727Z","signature_b64":"99abDaqFs0paQVkTTJGEHCOegg1W8KOQz3W3pklbITGecgXIt/XjG48BFwNa69Dkwm5RsAkLf/myQims51ttDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185b6c508769cf94cae845551bc08b50705247c2438715f26d26e60cd72cb836","last_reissued_at":"2026-05-18T04:01:11.424096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:11.424096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Datum-Wise Classification: A Sequential Approach to Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Gabriel Dulac-Arnold, Ludovic Denoyer, Patrick Gallinari, Philippe Preux","submitted_at":"2011-08-29T17:46:08Z","abstract_excerpt":"We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5668","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":""},"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":"1108.5668","created_at":"2026-05-18T04:01:11.424173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5668v1","created_at":"2026-05-18T04:01:11.424173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5668","created_at":"2026-05-18T04:01:11.424173+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBNWYUEHNHHZ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBNWYUEHNHHZJSXI","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBNWYUEH","created_at":"2026-05-18T12:26:26.731475+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/DBNWYUEHNHHZJSXIIVKRXQELKB","json":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB.json","graph_json":"https://pith.science/api/pith-number/DBNWYUEHNHHZJSXIIVKRXQELKB/graph.json","events_json":"https://pith.science/api/pith-number/DBNWYUEHNHHZJSXIIVKRXQELKB/events.json","paper":"https://pith.science/paper/DBNWYUEH"},"agent_actions":{"view_html":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB","download_json":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB.json","view_paper":"https://pith.science/paper/DBNWYUEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5668&json=true","fetch_graph":"https://pith.science/api/pith-number/DBNWYUEHNHHZJSXIIVKRXQELKB/graph.json","fetch_events":"https://pith.science/api/pith-number/DBNWYUEHNHHZJSXIIVKRXQELKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB/action/storage_attestation","attest_author":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB/action/author_attestation","sign_citation":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB/action/citation_signature","submit_replication":"https://pith.science/pith/DBNWYUEHNHHZJSXIIVKRXQELKB/action/replication_record"}},"created_at":"2026-05-18T04:01:11.424173+00:00","updated_at":"2026-05-18T04:01:11.424173+00:00"}