{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:F5HEHY6K62L2T3ZX46G5VSVTTJ","short_pith_number":"pith:F5HEHY6K","schema_version":"1.0","canonical_sha256":"2f4e43e3caf697a9ef37e78ddacab39a7581b6cb88f88c6d7752d874f26e20a8","source":{"kind":"arxiv","id":"2012.12356","version":2},"attestation_state":"computed","paper":{"title":"Unbiased Subdata Selection for Fair Classification: A Unified Framework and Scalable Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Qing Ye, Weijun Xie","submitted_at":"2020-12-22T21:09:38Z","abstract_excerpt":"As an important problem in modern data analytics, classification has witnessed varieties of applications from different domains. Different from conventional classification approaches, fair classification concerns the issues of unintentional biases against the sensitive features (e.g., gender, race). Due to high nonconvexity of fairness measures, existing methods are often unable to model exact fairness, which can cause inferior fair classification outcomes. This paper fills the gap by developing a novel unified framework to jointly optimize accuracy and fairness. The proposed framework is vers"},"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":"2012.12356","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ML","submitted_at":"2020-12-22T21:09:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8192ba6dbcf92252e507707a5b06280913a1a055d9543362e1b64443b5226898","abstract_canon_sha256":"e874514e792411585e7ae20c08e9188241515db953fc770b8a7984b22836ee99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:45.569573Z","signature_b64":"p6cc93BltbluJGistCvELqm2hsYpSVFyw7FjK84zeFt916vW9+riNVXxbIdUqMCLKVab2XUo1e+u7Dmq9aXGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4e43e3caf697a9ef37e78ddacab39a7581b6cb88f88c6d7752d874f26e20a8","last_reissued_at":"2026-07-05T02:01:45.568997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:45.568997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiased Subdata Selection for Fair Classification: A Unified Framework and Scalable Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Qing Ye, Weijun Xie","submitted_at":"2020-12-22T21:09:38Z","abstract_excerpt":"As an important problem in modern data analytics, classification has witnessed varieties of applications from different domains. Different from conventional classification approaches, fair classification concerns the issues of unintentional biases against the sensitive features (e.g., gender, race). Due to high nonconvexity of fairness measures, existing methods are often unable to model exact fairness, which can cause inferior fair classification outcomes. This paper fills the gap by developing a novel unified framework to jointly optimize accuracy and fairness. The proposed framework is vers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.12356","kind":"arxiv","version":2},"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/2012.12356/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":"2012.12356","created_at":"2026-07-05T02:01:45.569081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.12356v2","created_at":"2026-07-05T02:01:45.569081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.12356","created_at":"2026-07-05T02:01:45.569081+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5HEHY6K62L2","created_at":"2026-07-05T02:01:45.569081+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5HEHY6K62L2T3ZX","created_at":"2026-07-05T02:01:45.569081+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5HEHY6K","created_at":"2026-07-05T02:01:45.569081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17116","citing_title":"Fair and Accurate Regression: Strong Formulations and Algorithms","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ","json":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ.json","graph_json":"https://pith.science/api/pith-number/F5HEHY6K62L2T3ZX46G5VSVTTJ/graph.json","events_json":"https://pith.science/api/pith-number/F5HEHY6K62L2T3ZX46G5VSVTTJ/events.json","paper":"https://pith.science/paper/F5HEHY6K"},"agent_actions":{"view_html":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ","download_json":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ.json","view_paper":"https://pith.science/paper/F5HEHY6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.12356&json=true","fetch_graph":"https://pith.science/api/pith-number/F5HEHY6K62L2T3ZX46G5VSVTTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/F5HEHY6K62L2T3ZX46G5VSVTTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ/action/storage_attestation","attest_author":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ/action/author_attestation","sign_citation":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ/action/citation_signature","submit_replication":"https://pith.science/pith/F5HEHY6K62L2T3ZX46G5VSVTTJ/action/replication_record"}},"created_at":"2026-07-05T02:01:45.569081+00:00","updated_at":"2026-07-05T02:01:45.569081+00:00"}