{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ONLBFNDRUQQUMPAITNO5NYADHU","short_pith_number":"pith:ONLBFNDR","schema_version":"1.0","canonical_sha256":"735612b471a421463c089b5dd6e0033d10a1bee00c36664e0cad082ffde6ef74","source":{"kind":"arxiv","id":"1811.01305","version":1},"attestation_state":"computed","paper":{"title":"Block-wise Partitioning for Extreme Multi-label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Thomas C.M. Lee, Yuefeng Liang","submitted_at":"2018-11-04T00:54:11Z","abstract_excerpt":"Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear subspace, or examine the relevance of a test instance to every label via a linear scan. In practice, however, those approaches can be computationally exorbitant. To alleviate this drawback, we propose a Block-wise Partitioning (BP) pretreatment that divides all instances into disjoint clusters, to each of which the most frequently tagged label subset is attached. On"},"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":"1811.01305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-04T00:54:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3c91c973dfb267bf1fdea205fabdfc0dd1b1da15f55544a4d3e4c417b9e3f29f","abstract_canon_sha256":"601d7b615b4afbac3324111dc0aaab43ffbb6ebf4981827a697542fe730e204f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.699126Z","signature_b64":"6LaEtUy4j784aTe5c3U2VGaKFOlTwMDxNkzNId0YIDeZzLsDX2v5xkCBwoCyfrj0Oen7XSx6bwB5SGkDlvcfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735612b471a421463c089b5dd6e0033d10a1bee00c36664e0cad082ffde6ef74","last_reissued_at":"2026-05-18T00:01:34.698578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.698578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-wise Partitioning for Extreme Multi-label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Thomas C.M. Lee, Yuefeng Liang","submitted_at":"2018-11-04T00:54:11Z","abstract_excerpt":"Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear subspace, or examine the relevance of a test instance to every label via a linear scan. In practice, however, those approaches can be computationally exorbitant. To alleviate this drawback, we propose a Block-wise Partitioning (BP) pretreatment that divides all instances into disjoint clusters, to each of which the most frequently tagged label subset is attached. On"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01305","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":"1811.01305","created_at":"2026-05-18T00:01:34.698672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01305v1","created_at":"2026-05-18T00:01:34.698672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01305","created_at":"2026-05-18T00:01:34.698672+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONLBFNDRUQQU","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONLBFNDRUQQUMPAI","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONLBFNDR","created_at":"2026-05-18T12:32:43.782077+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/ONLBFNDRUQQUMPAITNO5NYADHU","json":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU.json","graph_json":"https://pith.science/api/pith-number/ONLBFNDRUQQUMPAITNO5NYADHU/graph.json","events_json":"https://pith.science/api/pith-number/ONLBFNDRUQQUMPAITNO5NYADHU/events.json","paper":"https://pith.science/paper/ONLBFNDR"},"agent_actions":{"view_html":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU","download_json":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU.json","view_paper":"https://pith.science/paper/ONLBFNDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01305&json=true","fetch_graph":"https://pith.science/api/pith-number/ONLBFNDRUQQUMPAITNO5NYADHU/graph.json","fetch_events":"https://pith.science/api/pith-number/ONLBFNDRUQQUMPAITNO5NYADHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU/action/storage_attestation","attest_author":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU/action/author_attestation","sign_citation":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU/action/citation_signature","submit_replication":"https://pith.science/pith/ONLBFNDRUQQUMPAITNO5NYADHU/action/replication_record"}},"created_at":"2026-05-18T00:01:34.698672+00:00","updated_at":"2026-05-18T00:01:34.698672+00:00"}