{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NOC57HOZCZO4BURGH76YTHPFOZ","short_pith_number":"pith:NOC57HOZ","schema_version":"1.0","canonical_sha256":"6b85df9dd9165dc0d2263ffd899de576753902c40e383f0cb21038411c1e3758","source":{"kind":"arxiv","id":"1511.00830","version":6},"attestation_state":"computed","paper":{"title":"The Variational Fair Autoencoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christos Louizos, Kevin Swersky, Max Welling, Richard Zemel, Yujia Li","submitted_at":"2015-11-03T09:27:49Z","abstract_excerpt":"We investigate the problem of learning representations that are invariant to certain nuisance or sensitive factors of variation in the data while retaining as much of the remaining information as possible. Our model is based on a variational autoencoding architecture with priors that encourage independence between sensitive and latent factors of variation. Any subsequent processing, such as classification, can then be performed on this purged latent representation. To remove any remaining dependencies we incorporate an additional penalty term based on the \"Maximum Mean Discrepancy\" (MMD) measu"},"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.00830","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-03T09:27:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bd363efe96606d77047452062afaca739333f44b451735ce83b51e07d75e402e","abstract_canon_sha256":"2f1be08b709967663c0d1421bfca7488481492a0e3a745b527be8a035e3d0ce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:18.791717Z","signature_b64":"vmwkaOfHI5+W08sMEVDPGWVOHnNMUkbAB9HI92GlfDBIH7uz74DcvwR69nUab+xptp/HrNcqlgG5H8KWlzGnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b85df9dd9165dc0d2263ffd899de576753902c40e383f0cb21038411c1e3758","last_reissued_at":"2026-05-18T00:38:18.790981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:18.790981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Variational Fair Autoencoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christos Louizos, Kevin Swersky, Max Welling, Richard Zemel, Yujia Li","submitted_at":"2015-11-03T09:27:49Z","abstract_excerpt":"We investigate the problem of learning representations that are invariant to certain nuisance or sensitive factors of variation in the data while retaining as much of the remaining information as possible. Our model is based on a variational autoencoding architecture with priors that encourage independence between sensitive and latent factors of variation. Any subsequent processing, such as classification, can then be performed on this purged latent representation. To remove any remaining dependencies we incorporate an additional penalty term based on the \"Maximum Mean Discrepancy\" (MMD) measu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00830","kind":"arxiv","version":6},"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.00830","created_at":"2026-05-18T00:38:18.791102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00830v6","created_at":"2026-05-18T00:38:18.791102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00830","created_at":"2026-05-18T00:38:18.791102+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOC57HOZCZO4","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOC57HOZCZO4BURG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOC57HOZ","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1612.00410","citing_title":"Deep Variational Information Bottleneck","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2602.18502","citing_title":"Mitigating Shortcut Learning via Feature Disentanglement in Medical Imaging: A Benchmark Study","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03069","citing_title":"Distributed Deep Variational Approach for Privacy-preserving Data Release","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00185","citing_title":"Fair Dataset Distillation via Cross-Group Barycenter Alignment","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ","json":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ.json","graph_json":"https://pith.science/api/pith-number/NOC57HOZCZO4BURGH76YTHPFOZ/graph.json","events_json":"https://pith.science/api/pith-number/NOC57HOZCZO4BURGH76YTHPFOZ/events.json","paper":"https://pith.science/paper/NOC57HOZ"},"agent_actions":{"view_html":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ","download_json":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ.json","view_paper":"https://pith.science/paper/NOC57HOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00830&json=true","fetch_graph":"https://pith.science/api/pith-number/NOC57HOZCZO4BURGH76YTHPFOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NOC57HOZCZO4BURGH76YTHPFOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ/action/storage_attestation","attest_author":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ/action/author_attestation","sign_citation":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ/action/citation_signature","submit_replication":"https://pith.science/pith/NOC57HOZCZO4BURGH76YTHPFOZ/action/replication_record"}},"created_at":"2026-05-18T00:38:18.791102+00:00","updated_at":"2026-05-18T00:38:18.791102+00:00"}