{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:77VUTAZXYOJUQFN7RQ75ARRWQC","short_pith_number":"pith:77VUTAZX","schema_version":"1.0","canonical_sha256":"ffeb498337c3934815bf8c3fd0463680801215ccd553d910316ab0f1bd6bbe39","source":{"kind":"arxiv","id":"2412.17116","version":1},"attestation_state":"computed","paper":{"title":"Fair and Accurate Regression: Strong Formulations and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alper Atamt\\\"urk, Andr\\'es G\\'omez, Anna Deza","submitted_at":"2024-12-22T18:04:54Z","abstract_excerpt":"This paper introduces mixed-integer optimization methods to solve regression problems that incorporate fairness metrics. We propose an exact formulation for training fair regression models. To tackle this computationally hard problem, we study the polynomially-solvable single-factor and single-observation subproblems as building blocks and derive their closed convex hull descriptions. Strong formulations obtained for the general fair regression problem in this manner are utilized to solve the problem with a branch-and-bound algorithm exactly or as a relaxation to produce fair and accurate mode"},"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":"2412.17116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-22T18:04:54Z","cross_cats_sorted":["cs.CY","math.OC","stat.ML"],"title_canon_sha256":"b26950f97dc7572169e86eba04835143224c2f9249c081fa1b521236e367a781","abstract_canon_sha256":"755a89ec65959d72b47c2fe0fc01ba4ed12c7b41c813f7a2ce63327e8e0b7bde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:17.775813Z","signature_b64":"CRoCMOaJ1C9PHfS/IsirertMPSzZrePDUMSCTZGudA+hKwxO+3aek0+clhqtLi5CsK7cONBitsSPTNiKxBjuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffeb498337c3934815bf8c3fd0463680801215ccd553d910316ab0f1bd6bbe39","last_reissued_at":"2026-07-05T09:53:17.775415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:17.775415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair and Accurate Regression: Strong Formulations and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alper Atamt\\\"urk, Andr\\'es G\\'omez, Anna Deza","submitted_at":"2024-12-22T18:04:54Z","abstract_excerpt":"This paper introduces mixed-integer optimization methods to solve regression problems that incorporate fairness metrics. We propose an exact formulation for training fair regression models. To tackle this computationally hard problem, we study the polynomially-solvable single-factor and single-observation subproblems as building blocks and derive their closed convex hull descriptions. Strong formulations obtained for the general fair regression problem in this manner are utilized to solve the problem with a branch-and-bound algorithm exactly or as a relaxation to produce fair and accurate mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17116","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/2412.17116/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":"2412.17116","created_at":"2026-07-05T09:53:17.775470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17116v1","created_at":"2026-07-05T09:53:17.775470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17116","created_at":"2026-07-05T09:53:17.775470+00:00"},{"alias_kind":"pith_short_12","alias_value":"77VUTAZXYOJU","created_at":"2026-07-05T09:53:17.775470+00:00"},{"alias_kind":"pith_short_16","alias_value":"77VUTAZXYOJUQFN7","created_at":"2026-07-05T09:53:17.775470+00:00"},{"alias_kind":"pith_short_8","alias_value":"77VUTAZX","created_at":"2026-07-05T09:53:17.775470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05857","citing_title":"Responsible Machine Learning via Mixed-Integer Optimization","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC","json":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC.json","graph_json":"https://pith.science/api/pith-number/77VUTAZXYOJUQFN7RQ75ARRWQC/graph.json","events_json":"https://pith.science/api/pith-number/77VUTAZXYOJUQFN7RQ75ARRWQC/events.json","paper":"https://pith.science/paper/77VUTAZX"},"agent_actions":{"view_html":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC","download_json":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC.json","view_paper":"https://pith.science/paper/77VUTAZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17116&json=true","fetch_graph":"https://pith.science/api/pith-number/77VUTAZXYOJUQFN7RQ75ARRWQC/graph.json","fetch_events":"https://pith.science/api/pith-number/77VUTAZXYOJUQFN7RQ75ARRWQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC/action/storage_attestation","attest_author":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC/action/author_attestation","sign_citation":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC/action/citation_signature","submit_replication":"https://pith.science/pith/77VUTAZXYOJUQFN7RQ75ARRWQC/action/replication_record"}},"created_at":"2026-07-05T09:53:17.775470+00:00","updated_at":"2026-07-05T09:53:17.775470+00:00"}