{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AOQS6RL5HI2THHUB6FXP4QT7T2","short_pith_number":"pith:AOQS6RL5","schema_version":"1.0","canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","source":{"kind":"arxiv","id":"1906.09838","version":1},"attestation_state":"computed","paper":{"title":"Binary Stochastic Representations for Large Multi-class Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer, Nicolas Baskiotis, Thomas Gerald","submitted_at":"2019-06-24T10:20:45Z","abstract_excerpt":"Classification with a large number of classes is a key problem in machine learning and corresponds to many real-world applications like tagging of images or textual documents in social networks. If one-vs-all methods usually reach top performance in this context, these approaches suffer from a high inference complexity, linear w.r.t the number of categories. Different models based on the notion of binary codes have been proposed to overcome this limitation, achieving in a sublinear inference complexity. But they a priori need to decide which binary code to associate to which category before le"},"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":"1906.09838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T10:20:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"783f9bf7c4bd9ea5ff7c043aeda212cbf46ebdec4c70bd821baf541d2ad14595","abstract_canon_sha256":"6e4709cc42762d246f0fa89d3193f11507af6a3db51a8c0ade8ba7907ef2e3a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:36.498673Z","signature_b64":"FY56amAV3wlGdwXqYXzOIwfMSyLH5dHqwBVWJVyxyObTEzQL0eLU1EHGE+0mUbk/MB3botTf01ZPpWjdbB7jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","last_reissued_at":"2026-05-17T23:42:36.498035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:36.498035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Stochastic Representations for Large Multi-class Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer, Nicolas Baskiotis, Thomas Gerald","submitted_at":"2019-06-24T10:20:45Z","abstract_excerpt":"Classification with a large number of classes is a key problem in machine learning and corresponds to many real-world applications like tagging of images or textual documents in social networks. If one-vs-all methods usually reach top performance in this context, these approaches suffer from a high inference complexity, linear w.r.t the number of categories. Different models based on the notion of binary codes have been proposed to overcome this limitation, achieving in a sublinear inference complexity. But they a priori need to decide which binary code to associate to which category before le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09838","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":"1906.09838","created_at":"2026-05-17T23:42:36.498116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09838v1","created_at":"2026-05-17T23:42:36.498116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09838","created_at":"2026-05-17T23:42:36.498116+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOQS6RL5HI2T","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOQS6RL5HI2THHUB","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOQS6RL5","created_at":"2026-05-18T12:33:12.712433+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/AOQS6RL5HI2THHUB6FXP4QT7T2","json":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2.json","graph_json":"https://pith.science/api/pith-number/AOQS6RL5HI2THHUB6FXP4QT7T2/graph.json","events_json":"https://pith.science/api/pith-number/AOQS6RL5HI2THHUB6FXP4QT7T2/events.json","paper":"https://pith.science/paper/AOQS6RL5"},"agent_actions":{"view_html":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2","download_json":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2.json","view_paper":"https://pith.science/paper/AOQS6RL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09838&json=true","fetch_graph":"https://pith.science/api/pith-number/AOQS6RL5HI2THHUB6FXP4QT7T2/graph.json","fetch_events":"https://pith.science/api/pith-number/AOQS6RL5HI2THHUB6FXP4QT7T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/action/storage_attestation","attest_author":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/action/author_attestation","sign_citation":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/action/citation_signature","submit_replication":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/action/replication_record"}},"created_at":"2026-05-17T23:42:36.498116+00:00","updated_at":"2026-05-17T23:42:36.498116+00:00"}