{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AOQS6RL5HI2THHUB6FXP4QT7T2","short_pith_number":"pith:AOQS6RL5","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"},"canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","source":{"kind":"arxiv","id":"1906.09838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09838","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09838v1","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09838","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"AOQS6RL5HI2T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AOQS6RL5HI2THHUB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AOQS6RL5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AOQS6RL5HI2THHUB6FXP4QT7T2","target":"record","payload":{"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"},"canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","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"},"source_kind":"arxiv","source_id":"1906.09838","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFNg8QZKXUk7nu8XqOHJfyXwlxVBGKf9N1tld5BivjNHgrBME81+dsYrgxC+gBohGTSd1eS8/4so/AM0Yi02Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:05:58.195102Z"},"content_sha256":"279cac4fa50484421c00120eaa7915fc785980e548f1bd33dac1baf90ab252fe","schema_version":"1.0","event_id":"sha256:279cac4fa50484421c00120eaa7915fc785980e548f1bd33dac1baf90ab252fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AOQS6RL5HI2THHUB6FXP4QT7T2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkwrWVKX7fzfoc+PsGgFsYiTAPGZn/m9kPvyWmNLBqTFqgdF3/hdafBLA7X2yLoz4hF5fufSl1loP+ahbQwGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:05:58.195596Z"},"content_sha256":"eecaf7d356c8001230c86c972a583ef36251995fe141f798904f92a7f895fad3","schema_version":"1.0","event_id":"sha256:eecaf7d356c8001230c86c972a583ef36251995fe141f798904f92a7f895fad3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/bundle.json","state_url":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T21:05:58Z","links":{"resolver":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2","bundle":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/bundle.json","state":"https://pith.science/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOQS6RL5HI2THHUB6FXP4QT7T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AOQS6RL5HI2THHUB6FXP4QT7T2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e4709cc42762d246f0fa89d3193f11507af6a3db51a8c0ade8ba7907ef2e3a0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T10:20:45Z","title_canon_sha256":"783f9bf7c4bd9ea5ff7c043aeda212cbf46ebdec4c70bd821baf541d2ad14595"},"schema_version":"1.0","source":{"id":"1906.09838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09838","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09838v1","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09838","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"AOQS6RL5HI2T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AOQS6RL5HI2THHUB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AOQS6RL5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:eecaf7d356c8001230c86c972a583ef36251995fe141f798904f92a7f895fad3","target":"graph","created_at":"2026-05-17T23:42:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aur\\'elia L\\'eon, Ludovic Denoyer, Nicolas Baskiotis, Thomas Gerald","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T10:20:45Z","title":"Binary Stochastic Representations for Large Multi-class Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09838","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:279cac4fa50484421c00120eaa7915fc785980e548f1bd33dac1baf90ab252fe","target":"record","created_at":"2026-05-17T23:42:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e4709cc42762d246f0fa89d3193f11507af6a3db51a8c0ade8ba7907ef2e3a0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-24T10:20:45Z","title_canon_sha256":"783f9bf7c4bd9ea5ff7c043aeda212cbf46ebdec4c70bd821baf541d2ad14595"},"schema_version":"1.0","source":{"id":"1906.09838","kind":"arxiv","version":1}},"canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03a12f457d3a35339e81f16efe427f9e8dc0aa47450d4a9b8098636812bde0da","first_computed_at":"2026-05-17T23:42:36.498035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:36.498035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FY56amAV3wlGdwXqYXzOIwfMSyLH5dHqwBVWJVyxyObTEzQL0eLU1EHGE+0mUbk/MB3botTf01ZPpWjdbB7jAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:36.498673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:279cac4fa50484421c00120eaa7915fc785980e548f1bd33dac1baf90ab252fe","sha256:eecaf7d356c8001230c86c972a583ef36251995fe141f798904f92a7f895fad3"],"state_sha256":"205d9df2c79a040c53d272681228999fe11d7c62fd9efbf9f002a0ee86dd6603"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC1ufcALf5JcYU0QuINPHvhmLhzUnrpAxuuw6gSxK/U4GiUcqDtuwre35rjD5xbQz8j+zhK4a2XOQokeXia6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:05:58.199126Z","bundle_sha256":"187de85586e8b41f73334ceb3967a457408864bbb3780e277f70109497cb2fc7"}}