{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RSAEG66VYCETMLIHDLDJR7HNT3","short_pith_number":"pith:RSAEG66V","schema_version":"1.0","canonical_sha256":"8c80437bd5c089362d071ac698fced9ed291a520566266bfdd5b6ea2db79753b","source":{"kind":"arxiv","id":"2605.28251","version":1},"attestation_state":"computed","paper":{"title":"Counterfactually Fair Regression via Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"stat.ML","authors_text":"J-J. Vie, M. Generali Lince, P. Loiseau, S. Gaucher","submitted_at":"2026-05-27T10:00:54Z","abstract_excerpt":"We consider the problem of learning a counterfactually fair regressor. We adopt a causal uncertainty view in which counterfactual fairness is defined with resampled noise. We focus on obtaining theoretical fairness guarantees for a new post-processing estimator. We begin by showing that counterfactual fairness is equivalent to satisfying demographic parity conditional on the latent variable. This allows us to provide a closed-form expression of the optimal fair regressor via a barycentric quantile map. In order to handle continuous latent variables, we propose a discretized post-processing met"},"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":"2605.28251","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-27T10:00:54Z","cross_cats_sorted":["cs.CY","cs.LG"],"title_canon_sha256":"003150a52b1d88b024129b72e767d1b92ea38f699f88f9379f9c8ef735a14a68","abstract_canon_sha256":"bf6d508e5502a9f2e207ebaf5c076aa7648846de58576b214d57c325ad17ebd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:04.147159Z","signature_b64":"eaZrz09/OENhhP9zY67Q4B3Dnar8tiYzIf/BvhraqHkVYLmc1r8K60HLxi1hoI53ylYYHoTIODF0pGyb8+CkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c80437bd5c089362d071ac698fced9ed291a520566266bfdd5b6ea2db79753b","last_reissued_at":"2026-05-28T01:05:04.146761Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:04.146761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterfactually Fair Regression via Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"stat.ML","authors_text":"J-J. Vie, M. Generali Lince, P. Loiseau, S. Gaucher","submitted_at":"2026-05-27T10:00:54Z","abstract_excerpt":"We consider the problem of learning a counterfactually fair regressor. We adopt a causal uncertainty view in which counterfactual fairness is defined with resampled noise. We focus on obtaining theoretical fairness guarantees for a new post-processing estimator. We begin by showing that counterfactual fairness is equivalent to satisfying demographic parity conditional on the latent variable. This allows us to provide a closed-form expression of the optimal fair regressor via a barycentric quantile map. In order to handle continuous latent variables, we propose a discretized post-processing met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28251","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/2605.28251/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":"2605.28251","created_at":"2026-05-28T01:05:04.146816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28251v1","created_at":"2026-05-28T01:05:04.146816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28251","created_at":"2026-05-28T01:05:04.146816+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSAEG66VYCET","created_at":"2026-05-28T01:05:04.146816+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSAEG66VYCETMLIH","created_at":"2026-05-28T01:05:04.146816+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSAEG66V","created_at":"2026-05-28T01:05:04.146816+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/RSAEG66VYCETMLIHDLDJR7HNT3","json":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3.json","graph_json":"https://pith.science/api/pith-number/RSAEG66VYCETMLIHDLDJR7HNT3/graph.json","events_json":"https://pith.science/api/pith-number/RSAEG66VYCETMLIHDLDJR7HNT3/events.json","paper":"https://pith.science/paper/RSAEG66V"},"agent_actions":{"view_html":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3","download_json":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3.json","view_paper":"https://pith.science/paper/RSAEG66V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28251&json=true","fetch_graph":"https://pith.science/api/pith-number/RSAEG66VYCETMLIHDLDJR7HNT3/graph.json","fetch_events":"https://pith.science/api/pith-number/RSAEG66VYCETMLIHDLDJR7HNT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3/action/storage_attestation","attest_author":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3/action/author_attestation","sign_citation":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3/action/citation_signature","submit_replication":"https://pith.science/pith/RSAEG66VYCETMLIHDLDJR7HNT3/action/replication_record"}},"created_at":"2026-05-28T01:05:04.146816+00:00","updated_at":"2026-05-28T01:05:04.146816+00:00"}