{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZRMLWM45XN5OTGORJR5IWFNLVP","short_pith_number":"pith:ZRMLWM45","schema_version":"1.0","canonical_sha256":"cc58bb339dbb7ae999d14c7a8b15ababfaec811a4d89dfcdff10d25450e3d4b4","source":{"kind":"arxiv","id":"1511.05897","version":3},"attestation_state":"computed","paper":{"title":"Censoring Representations with an Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Storkey, Harrison Edwards","submitted_at":"2015-11-18T18:06:24Z","abstract_excerpt":"In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversa"},"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":"1511.05897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T18:06:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b3ab64c197c8b167ed8d5fde7e04199e9e6de4243ffb9b6e466e58cb814e71ec","abstract_canon_sha256":"8d05c4d35ef08ec9861191e0d86443e969ec45f163b9cab116b92e8d219d1f4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:28.783497Z","signature_b64":"VuM6CuODf0fNXDli0856y6Dix2qkSBFehGLcHt0XaH+x3iLxUVqbq77ng0gj9KkvF2plpz5TS+L5oQs6r/8UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc58bb339dbb7ae999d14c7a8b15ababfaec811a4d89dfcdff10d25450e3d4b4","last_reissued_at":"2026-05-18T01:19:28.782878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:28.782878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Censoring Representations with an Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Storkey, Harrison Edwards","submitted_at":"2015-11-18T18:06:24Z","abstract_excerpt":"In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05897","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05897","created_at":"2026-05-18T01:19:28.782965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05897v3","created_at":"2026-05-18T01:19:28.782965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05897","created_at":"2026-05-18T01:19:28.782965+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRMLWM45XN5O","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRMLWM45XN5OTGOR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRMLWM45","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.08887","citing_title":"FAST-CAD: A Fairness-Aware Framework for Non-Contact Stroke Diagnosis","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03069","citing_title":"Distributed Deep Variational Approach for Privacy-preserving Data Release","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP","json":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP.json","graph_json":"https://pith.science/api/pith-number/ZRMLWM45XN5OTGORJR5IWFNLVP/graph.json","events_json":"https://pith.science/api/pith-number/ZRMLWM45XN5OTGORJR5IWFNLVP/events.json","paper":"https://pith.science/paper/ZRMLWM45"},"agent_actions":{"view_html":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP","download_json":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP.json","view_paper":"https://pith.science/paper/ZRMLWM45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05897&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRMLWM45XN5OTGORJR5IWFNLVP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRMLWM45XN5OTGORJR5IWFNLVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP/action/storage_attestation","attest_author":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP/action/author_attestation","sign_citation":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP/action/citation_signature","submit_replication":"https://pith.science/pith/ZRMLWM45XN5OTGORJR5IWFNLVP/action/replication_record"}},"created_at":"2026-05-18T01:19:28.782965+00:00","updated_at":"2026-05-18T01:19:28.782965+00:00"}