{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EWUGNPFQ3ALPE3YEPNEVOCV3UA","short_pith_number":"pith:EWUGNPFQ","schema_version":"1.0","canonical_sha256":"25a866bcb0d816f26f047b49570abba0065f140fff27996c652f19221fd04510","source":{"kind":"arxiv","id":"2212.02614","version":1},"attestation_state":"computed","paper":{"title":"Can Ensembling Pre-processing Algorithms Lead to Better Machine Learning Fairness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.LG","authors_text":"Amanda Kolopanis, Antonio Collante, Diego Elias Costa, Emad Shihab, Foutse Khomh, Khaled Badran, Pierre-Olivier C\\^ot\\'e, Rached Bouchoucha","submitted_at":"2022-12-05T21:54:29Z","abstract_excerpt":"As machine learning (ML) systems get adopted in more critical areas, it has become increasingly crucial to address the bias that could occur in these systems. Several fairness pre-processing algorithms are available to alleviate implicit biases during model training. These algorithms employ different concepts of fairness, often leading to conflicting strategies with consequential trade-offs between fairness and accuracy. In this work, we evaluate three popular fairness pre-processing algorithms and investigate the potential for combining all algorithms into a more robust pre-processing ensembl"},"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":"2212.02614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-05T21:54:29Z","cross_cats_sorted":["cs.AI","cs.CY"],"title_canon_sha256":"6e11213d7bad1408b45ac229afc1d496d977aabcec534852fa31b8159a131b08","abstract_canon_sha256":"4365b848f064a9c9ccdd7164110254fcfaff1358b586287ac783d48e3fe4c8ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:32.744048Z","signature_b64":"YepaPP34q8+C79yJi5jU6TAwx1cfbUQS/MSA7Mx7ZwIVIvUbPIcLN/IfS9tEsf+KirDO9P2dw7mAlrr95duTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25a866bcb0d816f26f047b49570abba0065f140fff27996c652f19221fd04510","last_reissued_at":"2026-07-05T05:22:32.743636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:32.743636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Ensembling Pre-processing Algorithms Lead to Better Machine Learning Fairness?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.LG","authors_text":"Amanda Kolopanis, Antonio Collante, Diego Elias Costa, Emad Shihab, Foutse Khomh, Khaled Badran, Pierre-Olivier C\\^ot\\'e, Rached Bouchoucha","submitted_at":"2022-12-05T21:54:29Z","abstract_excerpt":"As machine learning (ML) systems get adopted in more critical areas, it has become increasingly crucial to address the bias that could occur in these systems. Several fairness pre-processing algorithms are available to alleviate implicit biases during model training. These algorithms employ different concepts of fairness, often leading to conflicting strategies with consequential trade-offs between fairness and accuracy. In this work, we evaluate three popular fairness pre-processing algorithms and investigate the potential for combining all algorithms into a more robust pre-processing ensembl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02614","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/2212.02614/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":"2212.02614","created_at":"2026-07-05T05:22:32.743693+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02614v1","created_at":"2026-07-05T05:22:32.743693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02614","created_at":"2026-07-05T05:22:32.743693+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWUGNPFQ3ALP","created_at":"2026-07-05T05:22:32.743693+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWUGNPFQ3ALPE3YE","created_at":"2026-07-05T05:22:32.743693+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWUGNPFQ","created_at":"2026-07-05T05:22:32.743693+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA","json":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA.json","graph_json":"https://pith.science/api/pith-number/EWUGNPFQ3ALPE3YEPNEVOCV3UA/graph.json","events_json":"https://pith.science/api/pith-number/EWUGNPFQ3ALPE3YEPNEVOCV3UA/events.json","paper":"https://pith.science/paper/EWUGNPFQ"},"agent_actions":{"view_html":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA","download_json":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA.json","view_paper":"https://pith.science/paper/EWUGNPFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02614&json=true","fetch_graph":"https://pith.science/api/pith-number/EWUGNPFQ3ALPE3YEPNEVOCV3UA/graph.json","fetch_events":"https://pith.science/api/pith-number/EWUGNPFQ3ALPE3YEPNEVOCV3UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA/action/storage_attestation","attest_author":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA/action/author_attestation","sign_citation":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA/action/citation_signature","submit_replication":"https://pith.science/pith/EWUGNPFQ3ALPE3YEPNEVOCV3UA/action/replication_record"}},"created_at":"2026-07-05T05:22:32.743693+00:00","updated_at":"2026-07-05T05:22:32.743693+00:00"}