{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZUKIHY2WNDDGAR3VEQALPS47E2","short_pith_number":"pith:ZUKIHY2W","schema_version":"1.0","canonical_sha256":"cd1483e35668c66047752400b7cb9f26934228d29c88a99d0cf253ec6c77d5be","source":{"kind":"arxiv","id":"1907.01439","version":2},"attestation_state":"computed","paper":{"title":"Operationalizing Individual Fairness with Pairwise Fair Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gerhard Weikum, Krishna P. Gummadi, Preethi Lahoti","submitted_at":"2019-07-02T15:23:01Z","abstract_excerpt":"We revisit the notion of individual fairness proposed by Dwork et al. A central challenge in operationalizing their approach is the difficulty in eliciting a human specification of a similarity metric. In this paper, we propose an operationalization of individual fairness that does not rely on a human specification of a distance metric. Instead, we propose novel approaches to elicit and leverage side-information on equally deserving individuals to counter subordination between social groups. We model this knowledge as a fairness graph, and learn a unified Pairwise Fair Representation (PFR) of "},"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":"1907.01439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-02T15:23:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4505bbf06a36413aa9d0bf16689148bd9d208400506b38123ccb126cf922d5dc","abstract_canon_sha256":"1f52645cb9dc97348ca64185e625c57ecedd79d3daea0da8e5793d7466eb4a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:05.882964Z","signature_b64":"AjnAq47JJ/uWbNkZGxgdBvd3nPHG66XBRy624gNj1cQlTP4NOLv2Gx7Oqlkr1s3XIZuUADj6iFJltJxDHqXfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd1483e35668c66047752400b7cb9f26934228d29c88a99d0cf253ec6c77d5be","last_reissued_at":"2026-07-05T00:23:05.882583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:05.882583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Operationalizing Individual Fairness with Pairwise Fair Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gerhard Weikum, Krishna P. Gummadi, Preethi Lahoti","submitted_at":"2019-07-02T15:23:01Z","abstract_excerpt":"We revisit the notion of individual fairness proposed by Dwork et al. A central challenge in operationalizing their approach is the difficulty in eliciting a human specification of a similarity metric. In this paper, we propose an operationalization of individual fairness that does not rely on a human specification of a distance metric. Instead, we propose novel approaches to elicit and leverage side-information on equally deserving individuals to counter subordination between social groups. We model this knowledge as a fairness graph, and learn a unified Pairwise Fair Representation (PFR) of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01439","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/1907.01439/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":"1907.01439","created_at":"2026-07-05T00:23:05.882639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01439v2","created_at":"2026-07-05T00:23:05.882639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01439","created_at":"2026-07-05T00:23:05.882639+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUKIHY2WNDDG","created_at":"2026-07-05T00:23:05.882639+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUKIHY2WNDDGAR3V","created_at":"2026-07-05T00:23:05.882639+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUKIHY2W","created_at":"2026-07-05T00:23:05.882639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18696","citing_title":"SaGIF: Improving Individual Fairness in Graph Neural Networks via Similarity Encoding","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2","json":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2.json","graph_json":"https://pith.science/api/pith-number/ZUKIHY2WNDDGAR3VEQALPS47E2/graph.json","events_json":"https://pith.science/api/pith-number/ZUKIHY2WNDDGAR3VEQALPS47E2/events.json","paper":"https://pith.science/paper/ZUKIHY2W"},"agent_actions":{"view_html":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2","download_json":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2.json","view_paper":"https://pith.science/paper/ZUKIHY2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01439&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUKIHY2WNDDGAR3VEQALPS47E2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUKIHY2WNDDGAR3VEQALPS47E2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2/action/storage_attestation","attest_author":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2/action/author_attestation","sign_citation":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2/action/citation_signature","submit_replication":"https://pith.science/pith/ZUKIHY2WNDDGAR3VEQALPS47E2/action/replication_record"}},"created_at":"2026-07-05T00:23:05.882639+00:00","updated_at":"2026-07-05T00:23:05.882639+00:00"}