{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RB5GJVPSGZI74A4MKSI5ONUHP7","short_pith_number":"pith:RB5GJVPS","schema_version":"1.0","canonical_sha256":"887a64d5f23651fe038c5491d736877fc53432d00547d08bfa665be23ca4b6de","source":{"kind":"arxiv","id":"1810.04254","version":1},"attestation_state":"computed","paper":{"title":"Extreme Classification in Log Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DC","authors_text":"Anshumali Shrivastava, Qixuan Huang, Tharun Medini, Yiqiu Wang","submitted_at":"2018-10-09T21:43:57Z","abstract_excerpt":"We present Merged-Averaged Classifiers via Hashing (MACH) for K-classification with ultra-large values of K. Compared to traditional one-vs-all classifiers that require O(Kd) memory and inference cost, MACH only need O(d log K) (d is dimensionality )memory while only requiring O(K log K + d log K) operation for inference. MACH is a generic K-classification algorithm, with provably theoretical guarantees, which requires O(log K) memory without any assumption on the relationship between classes. MACH uses universal hashing to reduce classification with a large number of classes to few independen"},"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":"1810.04254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-09T21:43:57Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"e1bf9928aa26bf53285f9a30b47e07f41e04a0ede231b2ac14122e55d146c719","abstract_canon_sha256":"e9c1430177a5685bf1bcb873e411a2f7d543a847aaff0e2b064a20447350c4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.694446Z","signature_b64":"ZS4WpyZylU1WDpvMwx0UuFZBc945omw+Zs7bC7E7VZ4UaFzwqF2OmOutNcMANKYr3d4Ty01TzLduUZqW9+qgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"887a64d5f23651fe038c5491d736877fc53432d00547d08bfa665be23ca4b6de","last_reissued_at":"2026-05-18T00:03:40.693961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.693961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extreme Classification in Log Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DC","authors_text":"Anshumali Shrivastava, Qixuan Huang, Tharun Medini, Yiqiu Wang","submitted_at":"2018-10-09T21:43:57Z","abstract_excerpt":"We present Merged-Averaged Classifiers via Hashing (MACH) for K-classification with ultra-large values of K. Compared to traditional one-vs-all classifiers that require O(Kd) memory and inference cost, MACH only need O(d log K) (d is dimensionality )memory while only requiring O(K log K + d log K) operation for inference. MACH is a generic K-classification algorithm, with provably theoretical guarantees, which requires O(log K) memory without any assumption on the relationship between classes. MACH uses universal hashing to reduce classification with a large number of classes to few independen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04254","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":"1810.04254","created_at":"2026-05-18T00:03:40.694035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04254v1","created_at":"2026-05-18T00:03:40.694035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04254","created_at":"2026-05-18T00:03:40.694035+00:00"},{"alias_kind":"pith_short_12","alias_value":"RB5GJVPSGZI7","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RB5GJVPSGZI74A4M","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RB5GJVPS","created_at":"2026-05-18T12:32:50.500415+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/RB5GJVPSGZI74A4MKSI5ONUHP7","json":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7.json","graph_json":"https://pith.science/api/pith-number/RB5GJVPSGZI74A4MKSI5ONUHP7/graph.json","events_json":"https://pith.science/api/pith-number/RB5GJVPSGZI74A4MKSI5ONUHP7/events.json","paper":"https://pith.science/paper/RB5GJVPS"},"agent_actions":{"view_html":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7","download_json":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7.json","view_paper":"https://pith.science/paper/RB5GJVPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04254&json=true","fetch_graph":"https://pith.science/api/pith-number/RB5GJVPSGZI74A4MKSI5ONUHP7/graph.json","fetch_events":"https://pith.science/api/pith-number/RB5GJVPSGZI74A4MKSI5ONUHP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7/action/storage_attestation","attest_author":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7/action/author_attestation","sign_citation":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7/action/citation_signature","submit_replication":"https://pith.science/pith/RB5GJVPSGZI74A4MKSI5ONUHP7/action/replication_record"}},"created_at":"2026-05-18T00:03:40.694035+00:00","updated_at":"2026-05-18T00:03:40.694035+00:00"}