{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4DRBOI674ZKHSQ65AJS7KKCRKB","short_pith_number":"pith:4DRBOI67","schema_version":"1.0","canonical_sha256":"e0e21723dfe6547943dd0265f52851507f6051e007a552c6d58c28f551cae329","source":{"kind":"arxiv","id":"2110.03869","version":3},"attestation_state":"computed","paper":{"title":"Self-supervised Speaker Recognition with Loss-gated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"eess.AS","authors_text":"Haizhou Li, Kong Aik Lee, Rohan Kumar Das, Ruijie Tao, Ville Hautam\\\"aki","submitted_at":"2021-10-08T02:57:19Z","abstract_excerpt":"In self-supervised learning for speaker recognition, pseudo labels are useful as the supervision signals. It is a known fact that a speaker recognition model doesn't always benefit from pseudo labels due to their unreliability. In this work, we observe that a speaker recognition network tends to model the data with reliable labels faster than those with unreliable labels. This motivates us to study a loss-gated learning (LGL) strategy, which extracts the reliable labels through the fitting ability of the neural network during training. With the proposed LGL, our speaker recognition model obtai"},"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":"2110.03869","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.AS","submitted_at":"2021-10-08T02:57:19Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"3e5352dbc9aa8d347f7f88f933ebf7d90913938cd379024c8e7b540b881ab14f","abstract_canon_sha256":"c6b8df88eee248ef3c4143ff35ae66174dd5a8e1ace1e20ba4077384230c3b25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:07.836266Z","signature_b64":"wM0PRgRJhBtFnwhcn+Y76p0dZ7jg4lzaoi8sdXFapebmhO8J83nFyny9KHoWUOECXBH3oRZ1el2M4LA3z4OHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e21723dfe6547943dd0265f52851507f6051e007a552c6d58c28f551cae329","last_reissued_at":"2026-07-05T04:40:07.835925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:07.835925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-supervised Speaker Recognition with Loss-gated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"eess.AS","authors_text":"Haizhou Li, Kong Aik Lee, Rohan Kumar Das, Ruijie Tao, Ville Hautam\\\"aki","submitted_at":"2021-10-08T02:57:19Z","abstract_excerpt":"In self-supervised learning for speaker recognition, pseudo labels are useful as the supervision signals. It is a known fact that a speaker recognition model doesn't always benefit from pseudo labels due to their unreliability. In this work, we observe that a speaker recognition network tends to model the data with reliable labels faster than those with unreliable labels. This motivates us to study a loss-gated learning (LGL) strategy, which extracts the reliable labels through the fitting ability of the neural network during training. With the proposed LGL, our speaker recognition model obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03869","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.03869/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.03869","created_at":"2026-07-05T04:40:07.835980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03869v3","created_at":"2026-07-05T04:40:07.835980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03869","created_at":"2026-07-05T04:40:07.835980+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DRBOI674ZKH","created_at":"2026-07-05T04:40:07.835980+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DRBOI674ZKHSQ65","created_at":"2026-07-05T04:40:07.835980+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DRBOI67","created_at":"2026-07-05T04:40:07.835980+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04147","citing_title":"Enhancing Self-Supervised Speaker Verification Using Similarity-Connected Graphs and GCN","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB","json":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB.json","graph_json":"https://pith.science/api/pith-number/4DRBOI674ZKHSQ65AJS7KKCRKB/graph.json","events_json":"https://pith.science/api/pith-number/4DRBOI674ZKHSQ65AJS7KKCRKB/events.json","paper":"https://pith.science/paper/4DRBOI67"},"agent_actions":{"view_html":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB","download_json":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB.json","view_paper":"https://pith.science/paper/4DRBOI67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03869&json=true","fetch_graph":"https://pith.science/api/pith-number/4DRBOI674ZKHSQ65AJS7KKCRKB/graph.json","fetch_events":"https://pith.science/api/pith-number/4DRBOI674ZKHSQ65AJS7KKCRKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB/action/storage_attestation","attest_author":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB/action/author_attestation","sign_citation":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB/action/citation_signature","submit_replication":"https://pith.science/pith/4DRBOI674ZKHSQ65AJS7KKCRKB/action/replication_record"}},"created_at":"2026-07-05T04:40:07.835980+00:00","updated_at":"2026-07-05T04:40:07.835980+00:00"}