{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DIWBKNYV7IFAQ6AZ6Q4KYBYLK6","short_pith_number":"pith:DIWBKNYV","canonical_record":{"source":{"id":"1906.02589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T13:56:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"7c86c7d4317a52d77673ac79d7eca05dcabf735f58f216ff7e902dfdedcf7b05","abstract_canon_sha256":"6d78e879231571b852bf4191f9bce55d5b63e057457a976be29ffd539c5186ac"},"schema_version":"1.0"},"canonical_sha256":"1a2c153715fa0a087819f438ac070b57b186d5417d13ef37bf6674bb111a6341","source":{"kind":"arxiv","id":"1906.02589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02589","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02589v1","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02589","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"DIWBKNYV7IFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DIWBKNYV7IFAQ6AZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DIWBKNYV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DIWBKNYV7IFAQ6AZ6Q4KYBYLK6","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T13:56:24Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"7c86c7d4317a52d77673ac79d7eca05dcabf735f58f216ff7e902dfdedcf7b05","abstract_canon_sha256":"6d78e879231571b852bf4191f9bce55d5b63e057457a976be29ffd539c5186ac"},"schema_version":"1.0"},"canonical_sha256":"1a2c153715fa0a087819f438ac070b57b186d5417d13ef37bf6674bb111a6341","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:00.690881Z","signature_b64":"XpVS9rayLz2aisDOkAQVoWF4wz2+Z/803NkLhr7hAQAJ/MVwXskYj43DYpfi+5rpsrCYQEnsl2pSYmgd7ANHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a2c153715fa0a087819f438ac070b57b186d5417d13ef37bf6674bb111a6341","last_reissued_at":"2026-05-17T23:44:00.690394Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:00.690394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02589","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-17T23:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pq9KBGCG7XLNeKRxImWiuKt5Mx1dxLvbEJf9XwWGPm/qBtPNVdQpEi+jyzGHms8xxOgyi3Ng+J7zeEJrAbe5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:11:47.914713Z"},"content_sha256":"840a583036e5504d08975c5c7ec4c84071e1ae1e0b98f728cb9cc5c8e3ecbf71","schema_version":"1.0","event_id":"sha256:840a583036e5504d08975c5c7ec4c84071e1ae1e0b98f728cb9cc5c8e3ecbf71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DIWBKNYV7IFAQ6AZ6Q4KYBYLK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flexibly Fair Representation Learning by Disentanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Madras, Elliot Creager, J\\\"orn-Henrik Jacobsen, Kevin Swersky, Marissa A. Weis, Richard Zemel, Toniann Pitassi","submitted_at":"2019-06-06T13:56:24Z","abstract_excerpt":"We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are useful for reconstruction and prediction, but are also \\emph{flexibly fair}, meaning they can be easily modified at test time to achieve subgroup demographic parity with respect to multiple sensitive attributes and their conjunctions. We show empirically that the resulting encoder---which does not re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02589","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-17T23:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yVe2FDGqCHm1N6hAoZXJuFVjvzirktMdr+Lvh3wFTTnEvrUJXlr1G/Zm8naLmESl1U0luKFHvngqR/bP5RXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:11:47.915466Z"},"content_sha256":"477b62612961f73214e5c6b9af31c3478b0b219ef1bc931bebfcab4cb3590917","schema_version":"1.0","event_id":"sha256:477b62612961f73214e5c6b9af31c3478b0b219ef1bc931bebfcab4cb3590917"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/bundle.json","state_url":"https://pith.science/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/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-06T09:11:47Z","links":{"resolver":"https://pith.science/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6","bundle":"https://pith.science/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/bundle.json","state":"https://pith.science/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIWBKNYV7IFAQ6AZ6Q4KYBYLK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DIWBKNYV7IFAQ6AZ6Q4KYBYLK6","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":"6d78e879231571b852bf4191f9bce55d5b63e057457a976be29ffd539c5186ac","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T13:56:24Z","title_canon_sha256":"7c86c7d4317a52d77673ac79d7eca05dcabf735f58f216ff7e902dfdedcf7b05"},"schema_version":"1.0","source":{"id":"1906.02589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02589","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02589v1","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02589","created_at":"2026-05-17T23:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"DIWBKNYV7IFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DIWBKNYV7IFAQ6AZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DIWBKNYV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:477b62612961f73214e5c6b9af31c3478b0b219ef1bc931bebfcab4cb3590917","target":"graph","created_at":"2026-05-17T23:44:00Z","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":"We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are useful for reconstruction and prediction, but are also \\emph{flexibly fair}, meaning they can be easily modified at test time to achieve subgroup demographic parity with respect to multiple sensitive attributes and their conjunctions. We show empirically that the resulting encoder---which does not re","authors_text":"David Madras, Elliot Creager, J\\\"orn-Henrik Jacobsen, Kevin Swersky, Marissa A. Weis, Richard Zemel, Toniann Pitassi","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T13:56:24Z","title":"Flexibly Fair Representation Learning by Disentanglement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02589","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:840a583036e5504d08975c5c7ec4c84071e1ae1e0b98f728cb9cc5c8e3ecbf71","target":"record","created_at":"2026-05-17T23:44:00Z","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":"6d78e879231571b852bf4191f9bce55d5b63e057457a976be29ffd539c5186ac","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T13:56:24Z","title_canon_sha256":"7c86c7d4317a52d77673ac79d7eca05dcabf735f58f216ff7e902dfdedcf7b05"},"schema_version":"1.0","source":{"id":"1906.02589","kind":"arxiv","version":1}},"canonical_sha256":"1a2c153715fa0a087819f438ac070b57b186d5417d13ef37bf6674bb111a6341","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a2c153715fa0a087819f438ac070b57b186d5417d13ef37bf6674bb111a6341","first_computed_at":"2026-05-17T23:44:00.690394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:00.690394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XpVS9rayLz2aisDOkAQVoWF4wz2+Z/803NkLhr7hAQAJ/MVwXskYj43DYpfi+5rpsrCYQEnsl2pSYmgd7ANHBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:00.690881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:840a583036e5504d08975c5c7ec4c84071e1ae1e0b98f728cb9cc5c8e3ecbf71","sha256:477b62612961f73214e5c6b9af31c3478b0b219ef1bc931bebfcab4cb3590917"],"state_sha256":"d625c7f374b7984faccd149ff8f683b49111ccfd5f88cd4040d9783782fe82e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8a2SgEQb1MO3Yl+Slnl42/gTWKz2F1njkeuJ0FPkAphrwk/H1VQxRNEWkpByCP4osC9c22Z1dRRH2BDvttgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:11:47.919089Z","bundle_sha256":"4874f8bb0af8f4389cbe71c540e8e8953f111eb9ac7d55ecbc480440da6948c9"}}