{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NL6J2S3SHUR4Y4EKVONMEWWD3V","short_pith_number":"pith:NL6J2S3S","schema_version":"1.0","canonical_sha256":"6afc9d4b723d23cc708aab9ac25ac3dd418ae55b4cbc52ef9419c1c0e64ad8e7","source":{"kind":"arxiv","id":"1905.13662","version":2},"attestation_state":"computed","paper":{"title":"On the Fairness of Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernhard Sch\\\"olkopf, Francesco Locatello, Gabriele Abbati, Olivier Bachem, Stefan Bauer, Tom Rainforth","submitted_at":"2019-05-31T15:03:12Z","abstract_excerpt":"Recently there has been a significant interest in learning disentangled representations, as they promise increased interpretability, generalization to unseen scenarios and faster learning on downstream tasks. In this paper, we investigate the usefulness of different notions of disentanglement for improving the fairness of downstream prediction tasks based on representations. We consider the setting where the goal is to predict a target variable based on the learned representation of high-dimensional observations (such as images) that depend on both the target variable and an \\emph{unobserved} "},"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":"1905.13662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T15:03:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ef1a535a6981b0a044a60498612d7d50c6d9cffb6588534ab099b9f9369025b7","abstract_canon_sha256":"610e8d093430ed21249a07f1a96638cd70af4f7e4430a8e3bf0a97dd6c97218d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:37.606439Z","signature_b64":"1mncSCUe3FmeLEbssoHPTDgLjBoRiz2tj7WR2amOrWNpCiwQ1/asOF9+ksU7/37p/on2lzSILymSp5k/GGRADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afc9d4b723d23cc708aab9ac25ac3dd418ae55b4cbc52ef9419c1c0e64ad8e7","last_reissued_at":"2026-07-05T00:15:37.605926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:37.605926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Fairness of Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernhard Sch\\\"olkopf, Francesco Locatello, Gabriele Abbati, Olivier Bachem, Stefan Bauer, Tom Rainforth","submitted_at":"2019-05-31T15:03:12Z","abstract_excerpt":"Recently there has been a significant interest in learning disentangled representations, as they promise increased interpretability, generalization to unseen scenarios and faster learning on downstream tasks. In this paper, we investigate the usefulness of different notions of disentanglement for improving the fairness of downstream prediction tasks based on representations. We consider the setting where the goal is to predict a target variable based on the learned representation of high-dimensional observations (such as images) that depend on both the target variable and an \\emph{unobserved} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13662","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/1905.13662/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":"1905.13662","created_at":"2026-07-05T00:15:37.605993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13662v2","created_at":"2026-07-05T00:15:37.605993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13662","created_at":"2026-07-05T00:15:37.605993+00:00"},{"alias_kind":"pith_short_12","alias_value":"NL6J2S3SHUR4","created_at":"2026-07-05T00:15:37.605993+00:00"},{"alias_kind":"pith_short_16","alias_value":"NL6J2S3SHUR4Y4EK","created_at":"2026-07-05T00:15:37.605993+00:00"},{"alias_kind":"pith_short_8","alias_value":"NL6J2S3S","created_at":"2026-07-05T00:15:37.605993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20771","citing_title":"Cumulative Meta-Learning from Active Learning Queries for Robustness to Spurious Correlations","ref_index":127,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V","json":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V.json","graph_json":"https://pith.science/api/pith-number/NL6J2S3SHUR4Y4EKVONMEWWD3V/graph.json","events_json":"https://pith.science/api/pith-number/NL6J2S3SHUR4Y4EKVONMEWWD3V/events.json","paper":"https://pith.science/paper/NL6J2S3S"},"agent_actions":{"view_html":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V","download_json":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V.json","view_paper":"https://pith.science/paper/NL6J2S3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13662&json=true","fetch_graph":"https://pith.science/api/pith-number/NL6J2S3SHUR4Y4EKVONMEWWD3V/graph.json","fetch_events":"https://pith.science/api/pith-number/NL6J2S3SHUR4Y4EKVONMEWWD3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V/action/storage_attestation","attest_author":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V/action/author_attestation","sign_citation":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V/action/citation_signature","submit_replication":"https://pith.science/pith/NL6J2S3SHUR4Y4EKVONMEWWD3V/action/replication_record"}},"created_at":"2026-07-05T00:15:37.605993+00:00","updated_at":"2026-07-05T00:15:37.605993+00:00"}