{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MEST7ESPP4OYQXE2I7ST6AJKXQ","short_pith_number":"pith:MEST7ESP","schema_version":"1.0","canonical_sha256":"61253f924f7f1d885c9a47e53f012abc2f9bcdad835f9a8f14043a460bb17cc9","source":{"kind":"arxiv","id":"1510.05937","version":2},"attestation_state":"computed","paper":{"title":"Binary Speaker Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SD","authors_text":"Chao Xing, Dong Wang, Kaimin Yu, Lantian Li, Thomas Fang Zheng","submitted_at":"2015-10-20T15:49:59Z","abstract_excerpt":"The popular i-vector model represents speakers as low-dimensional continuous vectors (i-vectors), and hence it is a way of continuous speaker embedding. In this paper, we investigate binary speaker embedding, which transforms i-vectors to binary vectors (codes) by a hash function. We start from locality sensitive hashing (LSH), a simple binarization approach where binary codes are derived from a set of random hash functions. A potential problem of LSH is that the randomly sampled hash functions might be suboptimal. We therefore propose an improved Hamming distance learning approach, where the "},"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":"1510.05937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2015-10-20T15:49:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9d478eeebf9931b616002971ff45c9925953749393ff3d93b7ea69cfc05db404","abstract_canon_sha256":"167cedeffc438eef50851f6354c2050745937c9af38518410995e59904e72a72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:59.600838Z","signature_b64":"1XMc8s7Jem8pgKMs3TNRJ83DFiqwQkgbNBpQdcEqIXPFtTK27rxUa2HLE5PqXacd2O80rKYsuryStaVVUTNbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61253f924f7f1d885c9a47e53f012abc2f9bcdad835f9a8f14043a460bb17cc9","last_reissued_at":"2026-05-18T01:17:59.600055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:59.600055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Speaker Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SD","authors_text":"Chao Xing, Dong Wang, Kaimin Yu, Lantian Li, Thomas Fang Zheng","submitted_at":"2015-10-20T15:49:59Z","abstract_excerpt":"The popular i-vector model represents speakers as low-dimensional continuous vectors (i-vectors), and hence it is a way of continuous speaker embedding. In this paper, we investigate binary speaker embedding, which transforms i-vectors to binary vectors (codes) by a hash function. We start from locality sensitive hashing (LSH), a simple binarization approach where binary codes are derived from a set of random hash functions. A potential problem of LSH is that the randomly sampled hash functions might be suboptimal. We therefore propose an improved Hamming distance learning approach, where the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05937","kind":"arxiv","version":2},"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":"1510.05937","created_at":"2026-05-18T01:17:59.600191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05937v2","created_at":"2026-05-18T01:17:59.600191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05937","created_at":"2026-05-18T01:17:59.600191+00:00"},{"alias_kind":"pith_short_12","alias_value":"MEST7ESPP4OY","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MEST7ESPP4OYQXE2","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MEST7ESP","created_at":"2026-05-18T12:29:32.376354+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/MEST7ESPP4OYQXE2I7ST6AJKXQ","json":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ.json","graph_json":"https://pith.science/api/pith-number/MEST7ESPP4OYQXE2I7ST6AJKXQ/graph.json","events_json":"https://pith.science/api/pith-number/MEST7ESPP4OYQXE2I7ST6AJKXQ/events.json","paper":"https://pith.science/paper/MEST7ESP"},"agent_actions":{"view_html":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ","download_json":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ.json","view_paper":"https://pith.science/paper/MEST7ESP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05937&json=true","fetch_graph":"https://pith.science/api/pith-number/MEST7ESPP4OYQXE2I7ST6AJKXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MEST7ESPP4OYQXE2I7ST6AJKXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ/action/storage_attestation","attest_author":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ/action/author_attestation","sign_citation":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ/action/citation_signature","submit_replication":"https://pith.science/pith/MEST7ESPP4OYQXE2I7ST6AJKXQ/action/replication_record"}},"created_at":"2026-05-18T01:17:59.600191+00:00","updated_at":"2026-05-18T01:17:59.600191+00:00"}