{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UAD3MYAXBIMCQGLOC5EZ2J4I6F","short_pith_number":"pith:UAD3MYAX","canonical_record":{"source":{"id":"1710.05895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ce6430091294b6c46cd44852e21b5299ff9e367c36b404c19b8c2f8b42a14560","abstract_canon_sha256":"ff9e675c6b77a807c67f491ea8918f4ce2c32eced4b9417acddc3019e7416683"},"schema_version":"1.0"},"canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","source":{"kind":"arxiv","id":"1710.05895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05895","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05895v1","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05895","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"UAD3MYAXBIMC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAD3MYAXBIMCQGLO","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAD3MYAX","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UAD3MYAXBIMCQGLOC5EZ2J4I6F","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ce6430091294b6c46cd44852e21b5299ff9e367c36b404c19b8c2f8b42a14560","abstract_canon_sha256":"ff9e675c6b77a807c67f491ea8918f4ce2c32eced4b9417acddc3019e7416683"},"schema_version":"1.0"},"canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:47.873593Z","signature_b64":"2Q7/A16XvvwxNwl2TCS8HvuE1ysfS4QC2henibOg75eCnOl25a16wd8S1gSOFBSJQYUHxQu156N5c8QjjqSuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","last_reissued_at":"2026-05-18T00:32:47.872879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:47.872879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05895","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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NGThdN6CJPq58QIFjEyZX/7L4S8LO3G3lYqemyoF45JWy4Bo4NpueBfHPEkv7gE08yAFn7ppYBh0wLtl7tTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:49.970004Z"},"content_sha256":"3f13d3e63907bd59dec6d28650c2a6a136e98f7dea61acd6a84bc3b94eddd295","schema_version":"1.0","event_id":"sha256:3f13d3e63907bd59dec6d28650c2a6a136e98f7dea61acd6a84bc3b94eddd295"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UAD3MYAXBIMCQGLOC5EZ2J4I6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Algorithms for Computing Fair Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anil Aswani, Matt Olfat","submitted_at":"2017-10-16T17:48:23Z","abstract_excerpt":"Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally tractable algorithms for designing accurate but fair support vector machines (SVM's). Our approach imposes a constraint on the covariance matrices conditioned on each protected class, which leads to a nonconvex quadratic constraint in the SVM formulation. We develop iterative al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05895","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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AxnTwonjt3c1yKEq2MVExIuH9+l39Km9im5xai961jnnYB/g9EaPnGac0+2uM+hJutdwH9d7JlSzBAoXfb/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:32:49.970375Z"},"content_sha256":"ff5f4a67a57d0f50a42de652d8f5358bf3a4df22e381084e8c5606ea53b34dba","schema_version":"1.0","event_id":"sha256:ff5f4a67a57d0f50a42de652d8f5358bf3a4df22e381084e8c5606ea53b34dba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/bundle.json","state_url":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/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-10T20:32:49Z","links":{"resolver":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F","bundle":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/bundle.json","state":"https://pith.science/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAD3MYAXBIMCQGLOC5EZ2J4I6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UAD3MYAXBIMCQGLOC5EZ2J4I6F","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":"ff9e675c6b77a807c67f491ea8918f4ce2c32eced4b9417acddc3019e7416683","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","title_canon_sha256":"ce6430091294b6c46cd44852e21b5299ff9e367c36b404c19b8c2f8b42a14560"},"schema_version":"1.0","source":{"id":"1710.05895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05895","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05895v1","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05895","created_at":"2026-05-18T00:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"UAD3MYAXBIMC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAD3MYAXBIMCQGLO","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAD3MYAX","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ff5f4a67a57d0f50a42de652d8f5358bf3a4df22e381084e8c5606ea53b34dba","target":"graph","created_at":"2026-05-18T00:32:47Z","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":"Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally tractable algorithms for designing accurate but fair support vector machines (SVM's). Our approach imposes a constraint on the covariance matrices conditioned on each protected class, which leads to a nonconvex quadratic constraint in the SVM formulation. We develop iterative al","authors_text":"Anil Aswani, Matt Olfat","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","title":"Spectral Algorithms for Computing Fair Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05895","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:3f13d3e63907bd59dec6d28650c2a6a136e98f7dea61acd6a84bc3b94eddd295","target":"record","created_at":"2026-05-18T00:32:47Z","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":"ff9e675c6b77a807c67f491ea8918f4ce2c32eced4b9417acddc3019e7416683","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-16T17:48:23Z","title_canon_sha256":"ce6430091294b6c46cd44852e21b5299ff9e367c36b404c19b8c2f8b42a14560"},"schema_version":"1.0","source":{"id":"1710.05895","kind":"arxiv","version":1}},"canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a007b660170a1828196e17499d2788f143eb582e90cc76f286ba86fd2e2097d7","first_computed_at":"2026-05-18T00:32:47.872879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:47.872879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Q7/A16XvvwxNwl2TCS8HvuE1ysfS4QC2henibOg75eCnOl25a16wd8S1gSOFBSJQYUHxQu156N5c8QjjqSuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:47.873593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f13d3e63907bd59dec6d28650c2a6a136e98f7dea61acd6a84bc3b94eddd295","sha256:ff5f4a67a57d0f50a42de652d8f5358bf3a4df22e381084e8c5606ea53b34dba"],"state_sha256":"941eee15248d8f262d453bc971fa7f99b1b96a1e5eaca28909dc97e9a70d013f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ovvb55ygmjMDJ4ZoDOapHkEG9GHOebrPVHUWDCqtF3L7sf46Usr/In8ZAwR8t8HQzm6/JJZI2wzkDBB+Jx6hDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:32:49.972270Z","bundle_sha256":"8c00643c26b5e42aeea7882a30ef46d8d06dcca7abf3dfdf9a45095018ee930c"}}