{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VJSTI6M6PFXM3WNIDQ7NP6ZNNQ","short_pith_number":"pith:VJSTI6M6","schema_version":"1.0","canonical_sha256":"aa6534799e796ecdd9a81c3ed7fb2d6c1e69d372f49a5ee522e787eb46e02a59","source":{"kind":"arxiv","id":"2303.00586","version":2},"attestation_state":"computed","paper":{"title":"FAIR-Ensemble: When Fairness Naturally Emerges From Deep Ensembling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.CY","cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniel D'souza, Karina Nguyen, Randall Balestriero, Sara Hooker, Wei-Yin Ko","submitted_at":"2023-03-01T15:28:26Z","abstract_excerpt":"Ensembling multiple Deep Neural Networks (DNNs) is a simple and effective way to improve top-line metrics and to outperform a larger single model. In this work, we go beyond top-line metrics and instead explore the impact of ensembling on subgroup performances. Surprisingly, we observe that even with a simple homogeneous ensemble -- all the individual DNNs share the same training set, architecture, and design choices -- the minority group performance disproportionately improves with the number of models compared to the majority group, i.e. fairness naturally emerges from ensembling. Even more "},"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":"2303.00586","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-03-01T15:28:26Z","cross_cats_sorted":["cs.AI","cs.CV","cs.CY","cs.LG"],"title_canon_sha256":"1155b3045b123ed01ac923fbaa63df48772a106c45b5d657037285db68929aea","abstract_canon_sha256":"e4b03443747f62268bdb8935a8ae1eef9f765d98bdec542027853ed491f6ef72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:36.404612Z","signature_b64":"uk8TCezFvMNrSpNHOdqjyYALkyvspfBxxxpF/I9jvse26HkIcivnk65mlpjtd09HYSz5AfjPyOWIN+utV0N4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa6534799e796ecdd9a81c3ed7fb2d6c1e69d372f49a5ee522e787eb46e02a59","last_reissued_at":"2026-07-05T07:26:36.404106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:36.404106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FAIR-Ensemble: When Fairness Naturally Emerges From Deep Ensembling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.CY","cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniel D'souza, Karina Nguyen, Randall Balestriero, Sara Hooker, Wei-Yin Ko","submitted_at":"2023-03-01T15:28:26Z","abstract_excerpt":"Ensembling multiple Deep Neural Networks (DNNs) is a simple and effective way to improve top-line metrics and to outperform a larger single model. In this work, we go beyond top-line metrics and instead explore the impact of ensembling on subgroup performances. Surprisingly, we observe that even with a simple homogeneous ensemble -- all the individual DNNs share the same training set, architecture, and design choices -- the minority group performance disproportionately improves with the number of models compared to the majority group, i.e. fairness naturally emerges from ensembling. Even more "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00586","kind":"arxiv","version":2},"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/2303.00586/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":"2303.00586","created_at":"2026-07-05T07:26:36.404166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.00586v2","created_at":"2026-07-05T07:26:36.404166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00586","created_at":"2026-07-05T07:26:36.404166+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJSTI6M6PFXM","created_at":"2026-07-05T07:26:36.404166+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJSTI6M6PFXM3WNI","created_at":"2026-07-05T07:26:36.404166+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJSTI6M6","created_at":"2026-07-05T07:26:36.404166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09075","citing_title":"Optimality of Sub-network Laplace Approximations: New Results and Methods","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ","json":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ.json","graph_json":"https://pith.science/api/pith-number/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/graph.json","events_json":"https://pith.science/api/pith-number/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/events.json","paper":"https://pith.science/paper/VJSTI6M6"},"agent_actions":{"view_html":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ","download_json":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ.json","view_paper":"https://pith.science/paper/VJSTI6M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.00586&json=true","fetch_graph":"https://pith.science/api/pith-number/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/action/storage_attestation","attest_author":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/action/author_attestation","sign_citation":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/action/citation_signature","submit_replication":"https://pith.science/pith/VJSTI6M6PFXM3WNIDQ7NP6ZNNQ/action/replication_record"}},"created_at":"2026-07-05T07:26:36.404166+00:00","updated_at":"2026-07-05T07:26:36.404166+00:00"}