{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WCHAWUU2O3TBA7RMUITRP6QAG2","short_pith_number":"pith:WCHAWUU2","schema_version":"1.0","canonical_sha256":"b08e0b529a76e6107e2ca22717fa0036a6100cc228377c0f9ad8bf5601ef9538","source":{"kind":"arxiv","id":"1307.1769","version":1},"attestation_state":"computed","paper":{"title":"Ensemble Methods for Multi-label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alon Schclar, Ehud Itach, Lior Rokach","submitted_at":"2013-07-06T10:17:44Z","abstract_excerpt":"Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, instead of randomly choosing subsets, we select the minimum required subsets of k labels that cover all labels and meet additional constraints such as coverage of inter-label correlations. Construction of th"},"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":"1307.1769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-06T10:17:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1f825aa670ffc2d5fe8d91395213a28f68e8fbe731409b4037e9c6352016a39e","abstract_canon_sha256":"34008e74e4746590c35f6982bd0d3e12ff2d6298dac306c9fc310e9ce32ad172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.570747Z","signature_b64":"c78IRaaNpOODpyUFjEg1DJfzJrk8HlsdZ0SKYYiyepcrneD5BzJGNzOu2NgJhgp7imQk/zodErKpELzp/iYCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b08e0b529a76e6107e2ca22717fa0036a6100cc228377c0f9ad8bf5601ef9538","last_reissued_at":"2026-05-18T03:19:03.570225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.570225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble Methods for Multi-label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alon Schclar, Ehud Itach, Lior Rokach","submitted_at":"2013-07-06T10:17:44Z","abstract_excerpt":"Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, instead of randomly choosing subsets, we select the minimum required subsets of k labels that cover all labels and meet additional constraints such as coverage of inter-label correlations. Construction of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1769","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":"1307.1769","created_at":"2026-05-18T03:19:03.570308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1769v1","created_at":"2026-05-18T03:19:03.570308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1769","created_at":"2026-05-18T03:19:03.570308+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCHAWUU2O3TB","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCHAWUU2O3TBA7RM","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCHAWUU2","created_at":"2026-05-18T12:28:04.890932+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/WCHAWUU2O3TBA7RMUITRP6QAG2","json":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2.json","graph_json":"https://pith.science/api/pith-number/WCHAWUU2O3TBA7RMUITRP6QAG2/graph.json","events_json":"https://pith.science/api/pith-number/WCHAWUU2O3TBA7RMUITRP6QAG2/events.json","paper":"https://pith.science/paper/WCHAWUU2"},"agent_actions":{"view_html":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2","download_json":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2.json","view_paper":"https://pith.science/paper/WCHAWUU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1769&json=true","fetch_graph":"https://pith.science/api/pith-number/WCHAWUU2O3TBA7RMUITRP6QAG2/graph.json","fetch_events":"https://pith.science/api/pith-number/WCHAWUU2O3TBA7RMUITRP6QAG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2/action/storage_attestation","attest_author":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2/action/author_attestation","sign_citation":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2/action/citation_signature","submit_replication":"https://pith.science/pith/WCHAWUU2O3TBA7RMUITRP6QAG2/action/replication_record"}},"created_at":"2026-05-18T03:19:03.570308+00:00","updated_at":"2026-05-18T03:19:03.570308+00:00"}