{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C3KLX2MTNHJ3RYEBUVV4E7TMEK","short_pith_number":"pith:C3KLX2MT","canonical_record":{"source":{"id":"1706.03397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-06-11T19:42:31Z","cross_cats_sorted":[],"title_canon_sha256":"d6c8df67159679df041a8b2748519202f5605cc71f58d876737f4a764fb773f6","abstract_canon_sha256":"ed6d535b089b8a5bf2397f54d7bdec9cd062c6987960b5bce3d8f8f7db793f78"},"schema_version":"1.0"},"canonical_sha256":"16d4bbe99369d3b8e081a56bc27e6c22b164425344e110ca5546750abb464d04","source":{"kind":"arxiv","id":"1706.03397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03397","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03397v1","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03397","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"C3KLX2MTNHJ3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C3KLX2MTNHJ3RYEB","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C3KLX2MT","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C3KLX2MTNHJ3RYEBUVV4E7TMEK","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-06-11T19:42:31Z","cross_cats_sorted":[],"title_canon_sha256":"d6c8df67159679df041a8b2748519202f5605cc71f58d876737f4a764fb773f6","abstract_canon_sha256":"ed6d535b089b8a5bf2397f54d7bdec9cd062c6987960b5bce3d8f8f7db793f78"},"schema_version":"1.0"},"canonical_sha256":"16d4bbe99369d3b8e081a56bc27e6c22b164425344e110ca5546750abb464d04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.808329Z","signature_b64":"MGcL+S9g2DsvNoEtseZKheb4uDe1LcPX5hHe9L5asVOiLyqr/kyDCwHcV+ukzNXElZO0sHqXLXuPvzeBQNDqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d4bbe99369d3b8e081a56bc27e6c22b164425344e110ca5546750abb464d04","last_reissued_at":"2026-05-18T00:42:35.807664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.807664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03397","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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYqMxfQCvhRNr9tJ73xslGIRQony2qumWhdDCdeRgBxzuCC9Muum9yKM1d690afFvkCWgvB39Y8MC3502TZ/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:13:01.265783Z"},"content_sha256":"f53fd9718053787d5a0fe5e0d35d9e1429d80094e800360fb9b06af7232cae04","schema_version":"1.0","event_id":"sha256:f53fd9718053787d5a0fe5e0d35d9e1429d80094e800360fb9b06af7232cae04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C3KLX2MTNHJ3RYEBUVV4E7TMEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Network Bottleneck Features for Noise Robust Speaker Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SD","authors_text":"Hong Yu, Jun Guo, Zhanyu Ma, Zheng-Hua Tan","submitted_at":"2017-06-11T19:42:31Z","abstract_excerpt":"In this paper, we propose a noise robust bottleneck feature representation which is generated by an adversarial network (AN). The AN includes two cascade connected networks, an encoding network (EN) and a discriminative network (DN). Mel-frequency cepstral coefficients (MFCCs) of clean and noisy speech are used as input to the EN and the output of the EN is used as the noise robust feature. The EN and DN are trained in turn, namely, when training the DN, noise types are selected as the training labels and when training the EN, all labels are set as the same, i.e., the clean speech label, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03397","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-18T00:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHX9jogFw23QcU8CaE7GDLDtiwVh2eJa/2vy9Y18ZVrmvCXGiZXV0GiV0PqYzJ0RZTB4VxF9vsEihEPw8OcvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:13:01.266505Z"},"content_sha256":"85316950480dfa0dca2195f3195a3e898cc6b90eef8fecd3eca8eaac82ee3d4a","schema_version":"1.0","event_id":"sha256:85316950480dfa0dca2195f3195a3e898cc6b90eef8fecd3eca8eaac82ee3d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/bundle.json","state_url":"https://pith.science/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/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-06-06T20:13:01Z","links":{"resolver":"https://pith.science/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK","bundle":"https://pith.science/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/bundle.json","state":"https://pith.science/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3KLX2MTNHJ3RYEBUVV4E7TMEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C3KLX2MTNHJ3RYEBUVV4E7TMEK","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":"ed6d535b089b8a5bf2397f54d7bdec9cd062c6987960b5bce3d8f8f7db793f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-06-11T19:42:31Z","title_canon_sha256":"d6c8df67159679df041a8b2748519202f5605cc71f58d876737f4a764fb773f6"},"schema_version":"1.0","source":{"id":"1706.03397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03397","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03397v1","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03397","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"C3KLX2MTNHJ3","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C3KLX2MTNHJ3RYEB","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C3KLX2MT","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:85316950480dfa0dca2195f3195a3e898cc6b90eef8fecd3eca8eaac82ee3d4a","target":"graph","created_at":"2026-05-18T00:42: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":"In this paper, we propose a noise robust bottleneck feature representation which is generated by an adversarial network (AN). The AN includes two cascade connected networks, an encoding network (EN) and a discriminative network (DN). Mel-frequency cepstral coefficients (MFCCs) of clean and noisy speech are used as input to the EN and the output of the EN is used as the noise robust feature. The EN and DN are trained in turn, namely, when training the DN, noise types are selected as the training labels and when training the EN, all labels are set as the same, i.e., the clean speech label, which","authors_text":"Hong Yu, Jun Guo, Zhanyu Ma, Zheng-Hua Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-06-11T19:42:31Z","title":"Adversarial Network Bottleneck Features for Noise Robust Speaker Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03397","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:f53fd9718053787d5a0fe5e0d35d9e1429d80094e800360fb9b06af7232cae04","target":"record","created_at":"2026-05-18T00:42: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":"ed6d535b089b8a5bf2397f54d7bdec9cd062c6987960b5bce3d8f8f7db793f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-06-11T19:42:31Z","title_canon_sha256":"d6c8df67159679df041a8b2748519202f5605cc71f58d876737f4a764fb773f6"},"schema_version":"1.0","source":{"id":"1706.03397","kind":"arxiv","version":1}},"canonical_sha256":"16d4bbe99369d3b8e081a56bc27e6c22b164425344e110ca5546750abb464d04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16d4bbe99369d3b8e081a56bc27e6c22b164425344e110ca5546750abb464d04","first_computed_at":"2026-05-18T00:42:35.807664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:35.807664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGcL+S9g2DsvNoEtseZKheb4uDe1LcPX5hHe9L5asVOiLyqr/kyDCwHcV+ukzNXElZO0sHqXLXuPvzeBQNDqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:35.808329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f53fd9718053787d5a0fe5e0d35d9e1429d80094e800360fb9b06af7232cae04","sha256:85316950480dfa0dca2195f3195a3e898cc6b90eef8fecd3eca8eaac82ee3d4a"],"state_sha256":"149c68f7d4b07309727082578b0a47983ef372824928dfa33f498fee7d41daf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHdT48kNp/fue+2Qwif5n/Wg520UUw+Tsapm7y0bmjvZqstvThh9YNtjCMqomZLJw0GxHNILPQ4KQARwAXCYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:13:01.270066Z","bundle_sha256":"055e9498b04f8d7c03b2ac8a936a659104c02b4ebd70bd7ed5fc2afd86b5419a"}}