{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A5LXNWH5K3HRCKHUONNO72TRTB","short_pith_number":"pith:A5LXNWH5","canonical_record":{"source":{"id":"1712.08197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T20:19:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b4646d0406b34cca41ed47909adefd3c3bf76b21d58a52ff5c6c9229ddfb5d38","abstract_canon_sha256":"a6b96b05f42d6e024eac3fa0c339913a3e9b816c586ef413946566cc2263d54d"},"schema_version":"1.0"},"canonical_sha256":"075776d8fd56cf1128f4735aefea7198577994697311a13f1d4d5ccade2421fa","source":{"kind":"arxiv","id":"1712.08197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08197","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08197v1","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08197","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"A5LXNWH5K3HR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A5LXNWH5K3HRCKHU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A5LXNWH5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A5LXNWH5K3HRCKHUONNO72TRTB","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T20:19:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b4646d0406b34cca41ed47909adefd3c3bf76b21d58a52ff5c6c9229ddfb5d38","abstract_canon_sha256":"a6b96b05f42d6e024eac3fa0c339913a3e9b816c586ef413946566cc2263d54d"},"schema_version":"1.0"},"canonical_sha256":"075776d8fd56cf1128f4735aefea7198577994697311a13f1d4d5ccade2421fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:24.179452Z","signature_b64":"ANAKpNffRzGy6jnwIsjMGVZvEmjkA4mHKWUjlzvlWY1g0FATgfMXGQ2dDC6kkFKrCJU/QTy50aqqkxCliHG6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"075776d8fd56cf1128f4735aefea7198577994697311a13f1d4d5ccade2421fa","last_reissued_at":"2026-05-18T00:27:24.178894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:24.178894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08197","source_version":1,"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-05-18T00:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrUD03pj35ZjZ+0SgwKmiQWKt2ZyVQdFfR41ghYSELJjzCbEiKlSa+FolanrgYJ0NWPZoi0vqUgO7SVbuJEuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:35:33.111205Z"},"content_sha256":"ce8b3b2be17efe4ac4b21f928a7f13992f581ce07708310500db0326d61be73c","schema_version":"1.0","event_id":"sha256:ce8b3b2be17efe4ac4b21f928a7f13992f581ce07708310500db0326d61be73c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A5LXNWH5K3HRCKHUONNO72TRTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Forests: Regularized Tree Induction to Minimize Model Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Edward Raff, Jared Sylvester, Steven Mills","submitted_at":"2017-12-21T20:19:48Z","abstract_excerpt":"The potential lack of fairness in the outputs of machine learning algorithms has recently gained attention both within the research community as well as in society more broadly. Surprisingly, there is no prior work developing tree-induction algorithms for building fair decision trees or fair random forests. These methods have widespread popularity as they are one of the few to be simultaneously interpretable, non-linear, and easy-to-use. In this paper we develop, to our knowledge, the first technique for the induction of fair decision trees. We show that our \"Fair Forest\" retains the benefits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08197","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":""},"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-05-18T00:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQsgkdUiy2XbysRldgSqwGPgRVg286MGqiB3EkazdsJYNuduXUK+NleL//wCA8MsTgHh/C4mxoZMPHGlPJoECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:35:33.111575Z"},"content_sha256":"a4377ecaee4f7b3ccdf52dd9b58b863341d61b81565d5f1e3e0f2eba67d52ebb","schema_version":"1.0","event_id":"sha256:a4377ecaee4f7b3ccdf52dd9b58b863341d61b81565d5f1e3e0f2eba67d52ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5LXNWH5K3HRCKHUONNO72TRTB/bundle.json","state_url":"https://pith.science/pith/A5LXNWH5K3HRCKHUONNO72TRTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5LXNWH5K3HRCKHUONNO72TRTB/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-06-22T05:35:33Z","links":{"resolver":"https://pith.science/pith/A5LXNWH5K3HRCKHUONNO72TRTB","bundle":"https://pith.science/pith/A5LXNWH5K3HRCKHUONNO72TRTB/bundle.json","state":"https://pith.science/pith/A5LXNWH5K3HRCKHUONNO72TRTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5LXNWH5K3HRCKHUONNO72TRTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A5LXNWH5K3HRCKHUONNO72TRTB","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":"a6b96b05f42d6e024eac3fa0c339913a3e9b816c586ef413946566cc2263d54d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T20:19:48Z","title_canon_sha256":"b4646d0406b34cca41ed47909adefd3c3bf76b21d58a52ff5c6c9229ddfb5d38"},"schema_version":"1.0","source":{"id":"1712.08197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08197","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08197v1","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08197","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"A5LXNWH5K3HR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A5LXNWH5K3HRCKHU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A5LXNWH5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:a4377ecaee4f7b3ccdf52dd9b58b863341d61b81565d5f1e3e0f2eba67d52ebb","target":"graph","created_at":"2026-05-18T00:27:24Z","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"},"paper":{"abstract_excerpt":"The potential lack of fairness in the outputs of machine learning algorithms has recently gained attention both within the research community as well as in society more broadly. Surprisingly, there is no prior work developing tree-induction algorithms for building fair decision trees or fair random forests. These methods have widespread popularity as they are one of the few to be simultaneously interpretable, non-linear, and easy-to-use. In this paper we develop, to our knowledge, the first technique for the induction of fair decision trees. We show that our \"Fair Forest\" retains the benefits ","authors_text":"Edward Raff, Jared Sylvester, Steven Mills","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T20:19:48Z","title":"Fair Forests: Regularized Tree Induction to Minimize Model Bias"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08197","kind":"arxiv","version":1},"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:ce8b3b2be17efe4ac4b21f928a7f13992f581ce07708310500db0326d61be73c","target":"record","created_at":"2026-05-18T00:27:24Z","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":"a6b96b05f42d6e024eac3fa0c339913a3e9b816c586ef413946566cc2263d54d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-21T20:19:48Z","title_canon_sha256":"b4646d0406b34cca41ed47909adefd3c3bf76b21d58a52ff5c6c9229ddfb5d38"},"schema_version":"1.0","source":{"id":"1712.08197","kind":"arxiv","version":1}},"canonical_sha256":"075776d8fd56cf1128f4735aefea7198577994697311a13f1d4d5ccade2421fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"075776d8fd56cf1128f4735aefea7198577994697311a13f1d4d5ccade2421fa","first_computed_at":"2026-05-18T00:27:24.178894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:24.178894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANAKpNffRzGy6jnwIsjMGVZvEmjkA4mHKWUjlzvlWY1g0FATgfMXGQ2dDC6kkFKrCJU/QTy50aqqkxCliHG6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:24.179452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce8b3b2be17efe4ac4b21f928a7f13992f581ce07708310500db0326d61be73c","sha256:a4377ecaee4f7b3ccdf52dd9b58b863341d61b81565d5f1e3e0f2eba67d52ebb"],"state_sha256":"bb332eee29753e1116e0c38aeeef935f96eefcd303bd04f18f917a979809e406"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oh+0BFNyeIJMSSUbWod4wlvtylL6dMYQxTn7OttRWCC86n9hgugrwK65+vW1eKEDN8g2+la3cCYhsnhOE7RDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T05:35:33.113477Z","bundle_sha256":"1b6fc9960c08ebe8b1d84be2852fe6752aa7e1b44e6f7044f3cb78610bfec9a1"}}