{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AG3TCNW3L3LDQGR2KUJRCQEPOP","short_pith_number":"pith:AG3TCNW3","schema_version":"1.0","canonical_sha256":"01b73136db5ed6381a3a551311408f73fa9a6b020705fe10d647bd690aa30450","source":{"kind":"arxiv","id":"1304.2865","version":1},"attestation_state":"computed","paper":{"title":"The BOSARIS Toolkit: Theory, Algorithms and Code for Surviving the New DCF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.AP","authors_text":"Edward de Villiers, Niko Br\\\"ummer","submitted_at":"2013-04-10T07:32:31Z","abstract_excerpt":"The change of two orders of magnitude in the 'new DCF' of NIST's SRE'10, relative to the 'old DCF' evaluation criterion, posed a difficult challenge for participants and evaluator alike. Initially, participants were at a loss as to how to calibrate their systems, while the evaluator underestimated the required number of evaluation trials. After the fact, it is now obvious that both calibration and evaluation require very large sets of trials. This poses the challenges of (i) how to decide what number of trials is enough, and (ii) how to process such large data sets with reasonable memory and C"},"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":"1304.2865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2013-04-10T07:32:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"412944093b8d7c560544f7865134ef0d4da6095e3eef7da0a57989b82c379bec","abstract_canon_sha256":"7b72a3db37093752c48a1d4df7c25bc5eab02364aada9637ad98d3e36b63a859"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:28.089872Z","signature_b64":"wDr2sddbGFrLhTTcFj8Ke/jTmiboK0T65dIv1FapemWAzMgG+Nq+dhMlD4eyGBh8M4G2RkC3mg7e74EzMbieBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b73136db5ed6381a3a551311408f73fa9a6b020705fe10d647bd690aa30450","last_reissued_at":"2026-05-18T03:28:28.089233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:28.089233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The BOSARIS Toolkit: Theory, Algorithms and Code for Surviving the New DCF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.AP","authors_text":"Edward de Villiers, Niko Br\\\"ummer","submitted_at":"2013-04-10T07:32:31Z","abstract_excerpt":"The change of two orders of magnitude in the 'new DCF' of NIST's SRE'10, relative to the 'old DCF' evaluation criterion, posed a difficult challenge for participants and evaluator alike. Initially, participants were at a loss as to how to calibrate their systems, while the evaluator underestimated the required number of evaluation trials. After the fact, it is now obvious that both calibration and evaluation require very large sets of trials. This poses the challenges of (i) how to decide what number of trials is enough, and (ii) how to process such large data sets with reasonable memory and C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2865","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2865","created_at":"2026-05-18T03:28:28.089325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2865v1","created_at":"2026-05-18T03:28:28.089325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2865","created_at":"2026-05-18T03:28:28.089325+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG3TCNW3L3LD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG3TCNW3L3LDQGR2","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG3TCNW3","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.02191","citing_title":"The DKU-SMIIP System for NIST 2018 Speaker Recognition Evaluation","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02194","citing_title":"The DKU System for the Speaker Recognition Task of the 2019 VOiCES from a Distance Challenge","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26327","citing_title":"Dual-LoRA: Parameter-Efficient Adversarial Disentanglement for Cross-Lingual Speaker Verification","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19209","citing_title":"Audio Spoof Detection with GaborNet","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP","json":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP.json","graph_json":"https://pith.science/api/pith-number/AG3TCNW3L3LDQGR2KUJRCQEPOP/graph.json","events_json":"https://pith.science/api/pith-number/AG3TCNW3L3LDQGR2KUJRCQEPOP/events.json","paper":"https://pith.science/paper/AG3TCNW3"},"agent_actions":{"view_html":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP","download_json":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP.json","view_paper":"https://pith.science/paper/AG3TCNW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2865&json=true","fetch_graph":"https://pith.science/api/pith-number/AG3TCNW3L3LDQGR2KUJRCQEPOP/graph.json","fetch_events":"https://pith.science/api/pith-number/AG3TCNW3L3LDQGR2KUJRCQEPOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP/action/storage_attestation","attest_author":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP/action/author_attestation","sign_citation":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP/action/citation_signature","submit_replication":"https://pith.science/pith/AG3TCNW3L3LDQGR2KUJRCQEPOP/action/replication_record"}},"created_at":"2026-05-18T03:28:28.089325+00:00","updated_at":"2026-05-18T03:28:28.089325+00:00"}