{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HB436CFIBWNYEUKQXQB7H7PDXS","short_pith_number":"pith:HB436CFI","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"},"canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","source":{"kind":"arxiv","id":"1903.03910","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03910","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03910v4","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03910","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"HB436CFIBWNY","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_16","alias_value":"HB436CFIBWNYEUKQ","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_8","alias_value":"HB436CFI","created_at":"2026-07-05T01:42:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HB436CFIBWNYEUKQXQB7H7PDXS","target":"record","payload":{"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"},"canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","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"},"source_kind":"arxiv","source_id":"1903.03910","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhyinzoPjdn9szr+TcKOM6Fw3dnXD+fveqFCGRo2tlW4Md3Czoyw86rlZ6LozUnEVgD5uUcaBdwfVLLkw+fmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:55:14.463594Z"},"content_sha256":"848875c98d1fa95af5c20802866ad9565c449a510c3c42ac27f9891a5cfb5325","schema_version":"1.0","event_id":"sha256:848875c98d1fa95af5c20802866ad9565c449a510c3c42ac27f9891a5cfb5325"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HB436CFIBWNYEUKQXQB7H7PDXS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhGkTftprPPA+bUH9idmKexY4l/rCjicmEZDvII1hUK6ZGaFd4ZFwFwwgEbVe7wvIbtw9FA4Bc2DKdvOGD/bDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:55:14.463998Z"},"content_sha256":"08177b28bebcc6b9fe1cf6da415b7b4c60f02ba6b21892c35ae4c007cf0f0562","schema_version":"1.0","event_id":"sha256:08177b28bebcc6b9fe1cf6da415b7b4c60f02ba6b21892c35ae4c007cf0f0562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/bundle.json","state_url":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HB436CFIBWNYEUKQXQB7H7PDXS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T15:55:14Z","links":{"resolver":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS","bundle":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/bundle.json","state":"https://pith.science/pith/HB436CFIBWNYEUKQXQB7H7PDXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HB436CFIBWNYEUKQXQB7H7PDXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HB436CFIBWNYEUKQXQB7H7PDXS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"baa772a9de69f364bda597d38218060db2509c8ba32af4f0e4528d3089fd2948","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-10T03:18:33Z","title_canon_sha256":"14fb86f44cc3883177c98f3687bb45103a70ec14c0fcb1ca03fba428abe0d87c"},"schema_version":"1.0","source":{"id":"1903.03910","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03910","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03910v4","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03910","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"HB436CFIBWNY","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_16","alias_value":"HB436CFIBWNYEUKQ","created_at":"2026-07-05T01:42:51Z"},{"alias_kind":"pith_short_8","alias_value":"HB436CFI","created_at":"2026-07-05T01:42:51Z"}],"graph_snapshots":[{"event_id":"sha256:08177b28bebcc6b9fe1cf6da415b7b4c60f02ba6b21892c35ae4c007cf0f0562","target":"graph","created_at":"2026-07-05T01:42:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.03910/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ashkan Rezaei, Brian Ziebart, Omid Memarrast, Rizal Fathony","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-10T03:18:33Z","title":"Fairness for Robust Log Loss Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03910","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:848875c98d1fa95af5c20802866ad9565c449a510c3c42ac27f9891a5cfb5325","target":"record","created_at":"2026-07-05T01:42:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"baa772a9de69f364bda597d38218060db2509c8ba32af4f0e4528d3089fd2948","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-10T03:18:33Z","title_canon_sha256":"14fb86f44cc3883177c98f3687bb45103a70ec14c0fcb1ca03fba428abe0d87c"},"schema_version":"1.0","source":{"id":"1903.03910","kind":"arxiv","version":4}},"canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3879bf08a80d9b825150bc03f3fde3bc9db347baa996c27c949ff4d7f4604223","first_computed_at":"2026-07-05T01:42:51.549261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:42:51.549261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2pVKMlLKkhZE5Rc/Sqz5FC5HgKh9Fn8e+hHCqXDycwH/EVMdA47DGO5EYpmW6fmrrOizLhr6UBelRetnj9A3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:42:51.549817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03910","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848875c98d1fa95af5c20802866ad9565c449a510c3c42ac27f9891a5cfb5325","sha256:08177b28bebcc6b9fe1cf6da415b7b4c60f02ba6b21892c35ae4c007cf0f0562"],"state_sha256":"c8bb6a38c9198b86f534af331c99c1905c6c8ec4ec5931a344a09bfb5ed54c3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUWt2FTJDidYfq4eqY1fbncCQUH1QFNZdtNBlqG8J0fnJ7dKLO047Y89s2wvZCximJjZhoNA2/n72TzcPZ1ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:55:14.466398Z","bundle_sha256":"0faf9160a1c9be3455dfea9e6aed53c5059cc261bd2b986db632eb3a90bd592a"}}