{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4FVVXYQE3KJMSQ3TISM6EMYOIF","short_pith_number":"pith:4FVVXYQE","schema_version":"1.0","canonical_sha256":"e16b5be204da92c943734499e2330e414fc0ffb6e9ec43275d2972cef2da0eff","source":{"kind":"arxiv","id":"2405.01207","version":1},"attestation_state":"computed","paper":{"title":"Improving Membership Inference in ASR Model Auditing with Perturbed Loss Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SD","eess.AS"],"primary_cat":"cs.LG","authors_text":"Alberto Abad, Bhiksha Raj, Francisco Teixeira, Isabel Trancoso, Karla Pizzi, Raphael Olivier","submitted_at":"2024-05-02T11:48:30Z","abstract_excerpt":"Membership Inference (MI) poses a substantial privacy threat to the training data of Automatic Speech Recognition (ASR) systems, while also offering an opportunity to audit these models with regard to user data. This paper explores the effectiveness of loss-based features in combination with Gaussian and adversarial perturbations to perform MI in ASR models. To the best of our knowledge, this approach has not yet been investigated. We compare our proposed features with commonly used error-based features and find that the proposed features greatly enhance performance for sample-level MI. For sp"},"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":"2405.01207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-02T11:48:30Z","cross_cats_sorted":["cs.CR","cs.SD","eess.AS"],"title_canon_sha256":"8dd15667a9f60bfb2a080ef26dc5bca6d8a7ad986d4359a0dbccfb26ad7d5b0f","abstract_canon_sha256":"486353a48f429c9fa4738363f5c31646b89a3de0f25412e3dcf057c2563a4904"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:42.064878Z","signature_b64":"BXZkjGMV0X8Esn1PyA9GYbY8/qR3njsk8YXp1u8lylewL7QzVdohI5/W1F21chQS6NcfWuJh604NMbp/6LzjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e16b5be204da92c943734499e2330e414fc0ffb6e9ec43275d2972cef2da0eff","last_reissued_at":"2026-07-05T08:14:42.064409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:42.064409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Membership Inference in ASR Model Auditing with Perturbed Loss Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SD","eess.AS"],"primary_cat":"cs.LG","authors_text":"Alberto Abad, Bhiksha Raj, Francisco Teixeira, Isabel Trancoso, Karla Pizzi, Raphael Olivier","submitted_at":"2024-05-02T11:48:30Z","abstract_excerpt":"Membership Inference (MI) poses a substantial privacy threat to the training data of Automatic Speech Recognition (ASR) systems, while also offering an opportunity to audit these models with regard to user data. This paper explores the effectiveness of loss-based features in combination with Gaussian and adversarial perturbations to perform MI in ASR models. To the best of our knowledge, this approach has not yet been investigated. We compare our proposed features with commonly used error-based features and find that the proposed features greatly enhance performance for sample-level MI. For sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01207","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.01207/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":"2405.01207","created_at":"2026-07-05T08:14:42.064468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01207v1","created_at":"2026-07-05T08:14:42.064468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01207","created_at":"2026-07-05T08:14:42.064468+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FVVXYQE3KJM","created_at":"2026-07-05T08:14:42.064468+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FVVXYQE3KJMSQ3T","created_at":"2026-07-05T08:14:42.064468+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FVVXYQE","created_at":"2026-07-05T08:14:42.064468+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.10500","citing_title":"Quantized Approximate Signal Processing (QASP): Towards Homomorphic Encryption for audio","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF","json":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF.json","graph_json":"https://pith.science/api/pith-number/4FVVXYQE3KJMSQ3TISM6EMYOIF/graph.json","events_json":"https://pith.science/api/pith-number/4FVVXYQE3KJMSQ3TISM6EMYOIF/events.json","paper":"https://pith.science/paper/4FVVXYQE"},"agent_actions":{"view_html":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF","download_json":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF.json","view_paper":"https://pith.science/paper/4FVVXYQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01207&json=true","fetch_graph":"https://pith.science/api/pith-number/4FVVXYQE3KJMSQ3TISM6EMYOIF/graph.json","fetch_events":"https://pith.science/api/pith-number/4FVVXYQE3KJMSQ3TISM6EMYOIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF/action/storage_attestation","attest_author":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF/action/author_attestation","sign_citation":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF/action/citation_signature","submit_replication":"https://pith.science/pith/4FVVXYQE3KJMSQ3TISM6EMYOIF/action/replication_record"}},"created_at":"2026-07-05T08:14:42.064468+00:00","updated_at":"2026-07-05T08:14:42.064468+00:00"}