{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QKBI4IZ7U5QXLR6NPVYXID7GF7","short_pith_number":"pith:QKBI4IZ7","schema_version":"1.0","canonical_sha256":"82828e233fa76175c7cd7d71740fe62ff9e9913737336bc4dffacdbfd745870c","source":{"kind":"arxiv","id":"1905.11518","version":1},"attestation_state":"computed","paper":{"title":"On a scalable problem transformation method for multi-label learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dora Jambor, Peng Yu","submitted_at":"2019-05-27T21:40:37Z","abstract_excerpt":"Binary relevance is a simple approach to solve multi-label learning problems where an independent binary classifier is built per each label. A common challenge with this in real-world applications is that the label space can be very large, making it difficult to use binary relevance to larger scale problems. In this paper, we propose a scalable alternative to this, via transforming the multi-label problem into a single binary classification. We experiment with a few variations of our method and show that our method achieves higher precision than binary relevance and faster execution times on a"},"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":"1905.11518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-05-27T21:40:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b8ef0d7d0d8dbef5eef94c7b33786144c7f1c89aab5e2c7e9a8d5f6981714479","abstract_canon_sha256":"57920d6acb4922db0d2115bee1dbf219580a6303930123f1e43c64edc60f005d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:53.174645Z","signature_b64":"Qj7jSzmC1C6DFzvBbv9s/xCLZXLpJsF89jhE5wE/ZRlRXqRzHpH1ZnuPeLg9m1EqOyj2X0XjcG8lLNAgj50vAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82828e233fa76175c7cd7d71740fe62ff9e9913737336bc4dffacdbfd745870c","last_reissued_at":"2026-05-17T23:44:53.174103Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:53.174103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a scalable problem transformation method for multi-label learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dora Jambor, Peng Yu","submitted_at":"2019-05-27T21:40:37Z","abstract_excerpt":"Binary relevance is a simple approach to solve multi-label learning problems where an independent binary classifier is built per each label. A common challenge with this in real-world applications is that the label space can be very large, making it difficult to use binary relevance to larger scale problems. In this paper, we propose a scalable alternative to this, via transforming the multi-label problem into a single binary classification. We experiment with a few variations of our method and show that our method achieves higher precision than binary relevance and faster execution times on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11518","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":"1905.11518","created_at":"2026-05-17T23:44:53.174182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11518v1","created_at":"2026-05-17T23:44:53.174182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11518","created_at":"2026-05-17T23:44:53.174182+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKBI4IZ7U5QX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKBI4IZ7U5QXLR6N","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKBI4IZ7","created_at":"2026-05-18T12:33:27.125529+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/QKBI4IZ7U5QXLR6NPVYXID7GF7","json":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7.json","graph_json":"https://pith.science/api/pith-number/QKBI4IZ7U5QXLR6NPVYXID7GF7/graph.json","events_json":"https://pith.science/api/pith-number/QKBI4IZ7U5QXLR6NPVYXID7GF7/events.json","paper":"https://pith.science/paper/QKBI4IZ7"},"agent_actions":{"view_html":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7","download_json":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7.json","view_paper":"https://pith.science/paper/QKBI4IZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11518&json=true","fetch_graph":"https://pith.science/api/pith-number/QKBI4IZ7U5QXLR6NPVYXID7GF7/graph.json","fetch_events":"https://pith.science/api/pith-number/QKBI4IZ7U5QXLR6NPVYXID7GF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7/action/storage_attestation","attest_author":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7/action/author_attestation","sign_citation":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7/action/citation_signature","submit_replication":"https://pith.science/pith/QKBI4IZ7U5QXLR6NPVYXID7GF7/action/replication_record"}},"created_at":"2026-05-17T23:44:53.174182+00:00","updated_at":"2026-05-17T23:44:53.174182+00:00"}