{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RHKUTEMEAIK3MYJNGRZIRNDQPD","short_pith_number":"pith:RHKUTEME","schema_version":"1.0","canonical_sha256":"89d54991840215b6612d347288b47078e91cf979c9e00354275f13f92bfef1ee","source":{"kind":"arxiv","id":"2312.04745","version":1},"attestation_state":"computed","paper":{"title":"A Brief Tutorial on Sample Size Calculations for Fairness Audits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.AP","authors_text":"Fan Xia, Harvineet Singh, Jean Feng, Mi-Ok Kim, Romain Pirracchio, Rumi Chunara","submitted_at":"2023-12-07T22:59:12Z","abstract_excerpt":"In fairness audits, a standard objective is to detect whether a given algorithm performs substantially differently between subgroups. Properly powering the statistical analysis of such audits is crucial for obtaining informative fairness assessments, as it ensures a high probability of detecting unfairness when it exists. However, limited guidance is available on the amount of data necessary for a fairness audit, lacking directly applicable results concerning commonly used fairness metrics. Additionally, the consideration of unequal subgroup sample sizes is also missing. In this tutorial, we a"},"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":"2312.04745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.AP","submitted_at":"2023-12-07T22:59:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9038e6649b05a0a8e5dde290aa29eeebec8ff4f593de964bf3eab79ab2687812","abstract_canon_sha256":"a3c1cc7f7e46a33416b25f2bc86d99024c46da62dbe6eee1b1f7ae5a8bb7a312"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:50.681146Z","signature_b64":"GS1/ovroHrBAoA9PbUbqykqTrC/CkA9A/6jDd1v0D7+vMQWfAWrgosXFV3/vLRS7MpKTXpeSYVs/JGc81rjWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89d54991840215b6612d347288b47078e91cf979c9e00354275f13f92bfef1ee","last_reissued_at":"2026-07-05T07:21:50.680683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:50.680683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Brief Tutorial on Sample Size Calculations for Fairness Audits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.AP","authors_text":"Fan Xia, Harvineet Singh, Jean Feng, Mi-Ok Kim, Romain Pirracchio, Rumi Chunara","submitted_at":"2023-12-07T22:59:12Z","abstract_excerpt":"In fairness audits, a standard objective is to detect whether a given algorithm performs substantially differently between subgroups. Properly powering the statistical analysis of such audits is crucial for obtaining informative fairness assessments, as it ensures a high probability of detecting unfairness when it exists. However, limited guidance is available on the amount of data necessary for a fairness audit, lacking directly applicable results concerning commonly used fairness metrics. Additionally, the consideration of unequal subgroup sample sizes is also missing. In this tutorial, we a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04745","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/2312.04745/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":"2312.04745","created_at":"2026-07-05T07:21:50.680734+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04745v1","created_at":"2026-07-05T07:21:50.680734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04745","created_at":"2026-07-05T07:21:50.680734+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHKUTEMEAIK3","created_at":"2026-07-05T07:21:50.680734+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHKUTEMEAIK3MYJN","created_at":"2026-07-05T07:21:50.680734+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHKUTEME","created_at":"2026-07-05T07:21:50.680734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05830","citing_title":"\"OK Aura, Be Fair With Me\": Demographics-Agnostic Training for Bias Mitigation in Wake-up Word Detection","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD","json":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD.json","graph_json":"https://pith.science/api/pith-number/RHKUTEMEAIK3MYJNGRZIRNDQPD/graph.json","events_json":"https://pith.science/api/pith-number/RHKUTEMEAIK3MYJNGRZIRNDQPD/events.json","paper":"https://pith.science/paper/RHKUTEME"},"agent_actions":{"view_html":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD","download_json":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD.json","view_paper":"https://pith.science/paper/RHKUTEME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04745&json=true","fetch_graph":"https://pith.science/api/pith-number/RHKUTEMEAIK3MYJNGRZIRNDQPD/graph.json","fetch_events":"https://pith.science/api/pith-number/RHKUTEMEAIK3MYJNGRZIRNDQPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD/action/storage_attestation","attest_author":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD/action/author_attestation","sign_citation":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD/action/citation_signature","submit_replication":"https://pith.science/pith/RHKUTEMEAIK3MYJNGRZIRNDQPD/action/replication_record"}},"created_at":"2026-07-05T07:21:50.680734+00:00","updated_at":"2026-07-05T07:21:50.680734+00:00"}