{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U57LUYK4D7XDT7UZHZRD64VRGJ","short_pith_number":"pith:U57LUYK4","schema_version":"1.0","canonical_sha256":"a77eba615c1fee39fe993e623f72b1324364827f7de0976bc6607c7e58343149","source":{"kind":"arxiv","id":"2408.15096","version":2},"attestation_state":"computed","paper":{"title":"Post-processing fairness with minimal changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Federico Di Gennaro, Marcin Detyniecki, Thibault Laugel, Vincent Grari, Xavier Renard","submitted_at":"2024-08-27T14:26:56Z","abstract_excerpt":"In this paper, we introduce a novel post-processing algorithm that is both model-agnostic and does not require the sensitive attribute at test time. In addition, our algorithm is explicitly designed to enforce minimal changes between biased and debiased predictions; a property that, while highly desirable, is rarely prioritized as an explicit objective in fairness literature. Our approach leverages a multiplicative factor applied to the logit value of probability scores produced by a black-box classifier. We demonstrate the efficacy of our method through empirical evaluations, comparing its pe"},"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":"2408.15096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-27T14:26:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6f892e596bc7fd3e810dffd24817d5c7c61286458292ba3e8ddad0e24769365d","abstract_canon_sha256":"37955502e410270b572b2d7081f0eb0e68ea9e790ef19f1ead31c6c1529bc8f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:38.894460Z","signature_b64":"7XIYPoqfuBF9A1IiE2kJT2pltNoEQaBjlJDOaHwKeLUJFoUWCZJJr3eyzGxkYcwShTHVEBjVrPe4/Sej3L49AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77eba615c1fee39fe993e623f72b1324364827f7de0976bc6607c7e58343149","last_reissued_at":"2026-07-05T09:00:38.894067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:38.894067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Post-processing fairness with minimal changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Federico Di Gennaro, Marcin Detyniecki, Thibault Laugel, Vincent Grari, Xavier Renard","submitted_at":"2024-08-27T14:26:56Z","abstract_excerpt":"In this paper, we introduce a novel post-processing algorithm that is both model-agnostic and does not require the sensitive attribute at test time. In addition, our algorithm is explicitly designed to enforce minimal changes between biased and debiased predictions; a property that, while highly desirable, is rarely prioritized as an explicit objective in fairness literature. Our approach leverages a multiplicative factor applied to the logit value of probability scores produced by a black-box classifier. We demonstrate the efficacy of our method through empirical evaluations, comparing its pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15096","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/2408.15096/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":"2408.15096","created_at":"2026-07-05T09:00:38.894121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.15096v2","created_at":"2026-07-05T09:00:38.894121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15096","created_at":"2026-07-05T09:00:38.894121+00:00"},{"alias_kind":"pith_short_12","alias_value":"U57LUYK4D7XD","created_at":"2026-07-05T09:00:38.894121+00:00"},{"alias_kind":"pith_short_16","alias_value":"U57LUYK4D7XDT7UZ","created_at":"2026-07-05T09:00:38.894121+00:00"},{"alias_kind":"pith_short_8","alias_value":"U57LUYK4","created_at":"2026-07-05T09:00:38.894121+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00051","citing_title":"TransFair: Transferring Fairness from Ocular Disease Classification to Progression Prediction","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ","json":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ.json","graph_json":"https://pith.science/api/pith-number/U57LUYK4D7XDT7UZHZRD64VRGJ/graph.json","events_json":"https://pith.science/api/pith-number/U57LUYK4D7XDT7UZHZRD64VRGJ/events.json","paper":"https://pith.science/paper/U57LUYK4"},"agent_actions":{"view_html":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ","download_json":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ.json","view_paper":"https://pith.science/paper/U57LUYK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.15096&json=true","fetch_graph":"https://pith.science/api/pith-number/U57LUYK4D7XDT7UZHZRD64VRGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U57LUYK4D7XDT7UZHZRD64VRGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ/action/storage_attestation","attest_author":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ/action/author_attestation","sign_citation":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ/action/citation_signature","submit_replication":"https://pith.science/pith/U57LUYK4D7XDT7UZHZRD64VRGJ/action/replication_record"}},"created_at":"2026-07-05T09:00:38.894121+00:00","updated_at":"2026-07-05T09:00:38.894121+00:00"}