{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RRP4HPXYL5HGRT4EGYYIJGFW4H","short_pith_number":"pith:RRP4HPXY","canonical_record":{"source":{"id":"1904.12406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2019-04-29T00:37:27Z","cross_cats_sorted":["cs.CL","cs.LG","eess.AS","stat.ML"],"title_canon_sha256":"025606f4962d89d1dc4b225e34003c0b9735d759478be71510cee38695ad6a4a","abstract_canon_sha256":"8b5e1d6479fb72a6c01f5bb3145e04cac3044a81d236a3eac4313497bbe923ee"},"schema_version":"1.0"},"canonical_sha256":"8c5fc3bef85f4e68cf8436308498b6e1debd9c30cf453099c217c20fbd7223fe","source":{"kind":"arxiv","id":"1904.12406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12406","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12406v1","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12406","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"RRP4HPXYL5HG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RRP4HPXYL5HGRT4E","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RRP4HPXY","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RRP4HPXYL5HGRT4EGYYIJGFW4H","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2019-04-29T00:37:27Z","cross_cats_sorted":["cs.CL","cs.LG","eess.AS","stat.ML"],"title_canon_sha256":"025606f4962d89d1dc4b225e34003c0b9735d759478be71510cee38695ad6a4a","abstract_canon_sha256":"8b5e1d6479fb72a6c01f5bb3145e04cac3044a81d236a3eac4313497bbe923ee"},"schema_version":"1.0"},"canonical_sha256":"8c5fc3bef85f4e68cf8436308498b6e1debd9c30cf453099c217c20fbd7223fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.239944Z","signature_b64":"0b6B3YDd2EU+gZGw5eD7uUneKb0jmNJsRZCXzb0iWRRPLU9ZSPsgpYeIoTGstolq+lI/RJVJ8fetHi3CQULoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5fc3bef85f4e68cf8436308498b6e1debd9c30cf453099c217c20fbd7223fe","last_reissued_at":"2026-05-17T23:47:35.239593Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.239593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12406","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:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nG4r2H3r2eVHftdLnRAc2o9jJWj92Jgkb7q8lrUPRLl3OMOJlU9ErJ5icbgHokH8srk6VXjKXq9Zxx1NKXLpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:10.452924Z"},"content_sha256":"72848ef279edfef9f73ef61fe92403a76ebf1bae123119c99dd1762d36cf2601","schema_version":"1.0","event_id":"sha256:72848ef279edfef9f73ef61fe92403a76ebf1bae123119c99dd1762d36cf2601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RRP4HPXYL5HGRT4EGYYIJGFW4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Speaker Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG","eess.AS","stat.ML"],"primary_cat":"cs.SD","authors_text":"Jinyu Li, Yifan Gong, Yong Zhao, Zhong Meng","submitted_at":"2019-04-29T00:37:27Z","abstract_excerpt":"The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to learn the condition-invariant deep embedding via adversarial multi-task training. In ASV, a speaker classification network and a condition identification network are jointly optimized to minimize the speaker classification loss and simultaneously mini-maximize the condition loss. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12406","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:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbDHDLzSBKX0wgWLcT2qHdkIicgu0TohPMiXoMXPscAiRoyyLJ8LdILl67p9h+9UKu9rgPsfK1cb7oaJT3PWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:10.453720Z"},"content_sha256":"438ff945bff913a1696859b7d44887ba9c69d427a3b44d6d96cd767a81e3d400","schema_version":"1.0","event_id":"sha256:438ff945bff913a1696859b7d44887ba9c69d427a3b44d6d96cd767a81e3d400"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/bundle.json","state_url":"https://pith.science/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/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-30T23:11:10Z","links":{"resolver":"https://pith.science/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H","bundle":"https://pith.science/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/bundle.json","state":"https://pith.science/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRP4HPXYL5HGRT4EGYYIJGFW4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RRP4HPXYL5HGRT4EGYYIJGFW4H","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":"8b5e1d6479fb72a6c01f5bb3145e04cac3044a81d236a3eac4313497bbe923ee","cross_cats_sorted":["cs.CL","cs.LG","eess.AS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2019-04-29T00:37:27Z","title_canon_sha256":"025606f4962d89d1dc4b225e34003c0b9735d759478be71510cee38695ad6a4a"},"schema_version":"1.0","source":{"id":"1904.12406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12406","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12406v1","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12406","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"RRP4HPXYL5HG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RRP4HPXYL5HGRT4E","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RRP4HPXY","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:438ff945bff913a1696859b7d44887ba9c69d427a3b44d6d96cd767a81e3d400","target":"graph","created_at":"2026-05-17T23:47:35Z","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":"The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to learn the condition-invariant deep embedding via adversarial multi-task training. In ASV, a speaker classification network and a condition identification network are jointly optimized to minimize the speaker classification loss and simultaneously mini-maximize the condition loss. The","authors_text":"Jinyu Li, Yifan Gong, Yong Zhao, Zhong Meng","cross_cats":["cs.CL","cs.LG","eess.AS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2019-04-29T00:37:27Z","title":"Adversarial Speaker Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12406","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:72848ef279edfef9f73ef61fe92403a76ebf1bae123119c99dd1762d36cf2601","target":"record","created_at":"2026-05-17T23:47:35Z","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":"8b5e1d6479fb72a6c01f5bb3145e04cac3044a81d236a3eac4313497bbe923ee","cross_cats_sorted":["cs.CL","cs.LG","eess.AS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2019-04-29T00:37:27Z","title_canon_sha256":"025606f4962d89d1dc4b225e34003c0b9735d759478be71510cee38695ad6a4a"},"schema_version":"1.0","source":{"id":"1904.12406","kind":"arxiv","version":1}},"canonical_sha256":"8c5fc3bef85f4e68cf8436308498b6e1debd9c30cf453099c217c20fbd7223fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c5fc3bef85f4e68cf8436308498b6e1debd9c30cf453099c217c20fbd7223fe","first_computed_at":"2026-05-17T23:47:35.239593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:35.239593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0b6B3YDd2EU+gZGw5eD7uUneKb0jmNJsRZCXzb0iWRRPLU9ZSPsgpYeIoTGstolq+lI/RJVJ8fetHi3CQULoDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:35.239944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72848ef279edfef9f73ef61fe92403a76ebf1bae123119c99dd1762d36cf2601","sha256:438ff945bff913a1696859b7d44887ba9c69d427a3b44d6d96cd767a81e3d400"],"state_sha256":"3d86bf03de8218fae8f6a9af41406aa294173984c04030d897976304ea853cf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1YUBnWM1LcwGFmuyexhLoZunWu7r68Zm6sGTJupKEFiKWv4e96TFkQE9nW69VIzbQY0R6qqItnHDVb1A+h6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:11:10.458232Z","bundle_sha256":"5f12568e27a97adcd6f83afcdbcdb81112c77b6cdbdf4c167e21bf1fda007877"}}