{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HB436CFIBWNYEUKQXQB7H7PDXS","short_pith_number":"pith:HB436CFI","schema_version":"1.0","canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","source":{"kind":"arxiv","id":"1903.03910","version":4},"attestation_state":"computed","paper":{"title":"Fairness for Robust Log Loss Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashkan Rezaei, Brian Ziebart, Omid Memarrast, Rizal Fathony","submitted_at":"2019-03-10T03:18:33Z","abstract_excerpt":"Developing classification methods with high accuracy that also avoid unfair treatment of different groups has become increasingly important for data-driven decision making in social applications. Many existing methods enforce fairness constraints on a selected classifier (e.g., logistic regression) by directly forming constrained optimizations. We instead re-derive a new classifier from the first principles of distributional robustness that incorporates fairness criteria into a worst-case logarithmic loss minimization. This construction takes the form of a minimax game and produces a parametri"},"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":"1903.03910","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-10T03:18:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"14fb86f44cc3883177c98f3687bb45103a70ec14c0fcb1ca03fba428abe0d87c","abstract_canon_sha256":"baa772a9de69f364bda597d38218060db2509c8ba32af4f0e4528d3089fd2948"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:51.549817Z","signature_b64":"2pVKMlLKkhZE5Rc/Sqz5FC5HgKh9Fn8e+hHCqXDycwH/EVMdA47DGO5EYpmW6fmrrOizLhr6UBelRetnj9A3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","last_reissued_at":"2026-07-05T01:42:51.549261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:51.549261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness for Robust Log Loss Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashkan Rezaei, Brian Ziebart, Omid Memarrast, Rizal Fathony","submitted_at":"2019-03-10T03:18:33Z","abstract_excerpt":"Developing classification methods with high accuracy that also avoid unfair treatment of different groups has become increasingly important for data-driven decision making in social applications. Many existing methods enforce fairness constraints on a selected classifier (e.g., logistic regression) by directly forming constrained optimizations. We instead re-derive a new classifier from the first principles of distributional robustness that incorporates fairness criteria into a worst-case logarithmic loss minimization. This construction takes the form of a minimax game and produces a parametri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03910","kind":"arxiv","version":4},"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/1903.03910/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":"1903.03910","created_at":"2026-07-05T01:42:51.549322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03910v4","created_at":"2026-07-05T01:42:51.549322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03910","created_at":"2026-07-05T01:42:51.549322+00:00"},{"alias_kind":"pith_short_12","alias_value":"HB436CFIBWNY","created_at":"2026-07-05T01:42:51.549322+00:00"},{"alias_kind":"pith_short_16","alias_value":"HB436CFIBWNYEUKQ","created_at":"2026-07-05T01:42:51.549322+00:00"},{"alias_kind":"pith_short_8","alias_value":"HB436CFI","created_at":"2026-07-05T01:42:51.549322+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/HB436CFIBWNYEUKQXQB7H7PDXS","json":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS.json","graph_json":"https://pith.science/api/pith-number/HB436CFIBWNYEUKQXQB7H7PDXS/graph.json","events_json":"https://pith.science/api/pith-number/HB436CFIBWNYEUKQXQB7H7PDXS/events.json","paper":"https://pith.science/paper/HB436CFI"},"agent_actions":{"view_html":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS","download_json":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS.json","view_paper":"https://pith.science/paper/HB436CFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03910&json=true","fetch_graph":"https://pith.science/api/pith-number/HB436CFIBWNYEUKQXQB7H7PDXS/graph.json","fetch_events":"https://pith.science/api/pith-number/HB436CFIBWNYEUKQXQB7H7PDXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/action/storage_attestation","attest_author":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/action/author_attestation","sign_citation":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/action/citation_signature","submit_replication":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/action/replication_record"}},"created_at":"2026-07-05T01:42:51.549322+00:00","updated_at":"2026-07-05T01:42:51.549322+00:00"}