{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MBIQ4MP5IH6VR5DM3EHA33EK72","short_pith_number":"pith:MBIQ4MP5","schema_version":"1.0","canonical_sha256":"60510e31fd41fd58f46cd90e0dec8afe89d51c67e5b6921e24a3f47928b72883","source":{"kind":"arxiv","id":"1903.11867","version":1},"attestation_state":"computed","paper":{"title":"Classification of sparse binary vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Evgenii Chzhen","submitted_at":"2019-03-28T09:57:17Z","abstract_excerpt":"In this work we consider a problem of multi-label classification, where each instance is associated with some binary vector. Our focus is to find a classifier which minimizes false negative discoveries under constraints. Depending on the considered set of constraints we propose plug-in methods and provide non-asymptotic analysis under margin type assumptions. Specifically, we analyze two particular examples of constraints that promote sparse predictions: in the first one, we focus on classifiers with $\\ell_0$-type constraints and in the second one, we address classifiers with bounded false pos"},"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":"1903.11867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-03-28T09:57:17Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"eb2b31a7a606995f45bc920e579692fc1dd0866552fa0b0d879c93feeb6ab955","abstract_canon_sha256":"aaebb05fbfc19ada367998227754dfe4e7cbf70db61655853db4f646abaae10c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:58.855245Z","signature_b64":"XDBh12Da3zY904RqDqzTuyAKx6SEc4R0kgukoil6oMfBGwYn3mNRD7rie3UymKPUpQi1V+qsngo5HBEryzArBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60510e31fd41fd58f46cd90e0dec8afe89d51c67e5b6921e24a3f47928b72883","last_reissued_at":"2026-05-17T23:49:58.854720Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:58.854720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of sparse binary vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Evgenii Chzhen","submitted_at":"2019-03-28T09:57:17Z","abstract_excerpt":"In this work we consider a problem of multi-label classification, where each instance is associated with some binary vector. Our focus is to find a classifier which minimizes false negative discoveries under constraints. Depending on the considered set of constraints we propose plug-in methods and provide non-asymptotic analysis under margin type assumptions. Specifically, we analyze two particular examples of constraints that promote sparse predictions: in the first one, we focus on classifiers with $\\ell_0$-type constraints and in the second one, we address classifiers with bounded false pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11867","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":"1903.11867","created_at":"2026-05-17T23:49:58.854790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11867v1","created_at":"2026-05-17T23:49:58.854790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11867","created_at":"2026-05-17T23:49:58.854790+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBIQ4MP5IH6V","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBIQ4MP5IH6VR5DM","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBIQ4MP5","created_at":"2026-05-18T12:33:21.387695+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/MBIQ4MP5IH6VR5DM3EHA33EK72","json":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72.json","graph_json":"https://pith.science/api/pith-number/MBIQ4MP5IH6VR5DM3EHA33EK72/graph.json","events_json":"https://pith.science/api/pith-number/MBIQ4MP5IH6VR5DM3EHA33EK72/events.json","paper":"https://pith.science/paper/MBIQ4MP5"},"agent_actions":{"view_html":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72","download_json":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72.json","view_paper":"https://pith.science/paper/MBIQ4MP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11867&json=true","fetch_graph":"https://pith.science/api/pith-number/MBIQ4MP5IH6VR5DM3EHA33EK72/graph.json","fetch_events":"https://pith.science/api/pith-number/MBIQ4MP5IH6VR5DM3EHA33EK72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72/action/storage_attestation","attest_author":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72/action/author_attestation","sign_citation":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72/action/citation_signature","submit_replication":"https://pith.science/pith/MBIQ4MP5IH6VR5DM3EHA33EK72/action/replication_record"}},"created_at":"2026-05-17T23:49:58.854790+00:00","updated_at":"2026-05-17T23:49:58.854790+00:00"}