{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X5H4PWH246KHRO7MKNXDCISPIZ","short_pith_number":"pith:X5H4PWH2","schema_version":"1.0","canonical_sha256":"bf4fc7d8fae79478bbec536e31224f466540c29aaa6c802836879fc6569d23e2","source":{"kind":"arxiv","id":"1803.03242","version":2},"attestation_state":"computed","paper":{"title":"Probably Approximately Metric-Fair Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Gal Yona, Guy N. Rothblum","submitted_at":"2018-03-08T18:35:08Z","abstract_excerpt":"The seminal work of Dwork {\\em et al.} [ITCS 2012] introduced a metric-based notion of individual fairness. Given a task-specific similarity metric, their notion required that every pair of similar individuals should be treated similarly. In the context of machine learning, however, individual fairness does not generalize from a training set to the underlying population. We show that this can lead to computational intractability even for simple fair-learning tasks.\n  With this motivation in mind, we introduce and study a relaxed notion of {\\em approximate metric-fairness}: for a random pair 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":"1803.03242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-08T18:35:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96d0fa79b507e0eed6bdbba7cf8b2cc5a66eb41ef34b5428e0cbbac680b5d203","abstract_canon_sha256":"6aba0d156284ef7ebc7a0d13d6e310a28cad1eeba497444ed8f8b578f3bce7a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:57.212458Z","signature_b64":"THlhWok/J6q9j3pKi4+LnTgavntAP2tyBjjfu+YZJrAbkIil9iB9e2w3wQBx5aCwM62kauhj5xWLUWNQJsZIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf4fc7d8fae79478bbec536e31224f466540c29aaa6c802836879fc6569d23e2","last_reissued_at":"2026-05-18T00:11:57.211754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:57.211754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probably Approximately Metric-Fair Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Gal Yona, Guy N. Rothblum","submitted_at":"2018-03-08T18:35:08Z","abstract_excerpt":"The seminal work of Dwork {\\em et al.} [ITCS 2012] introduced a metric-based notion of individual fairness. Given a task-specific similarity metric, their notion required that every pair of similar individuals should be treated similarly. In the context of machine learning, however, individual fairness does not generalize from a training set to the underlying population. We show that this can lead to computational intractability even for simple fair-learning tasks.\n  With this motivation in mind, we introduce and study a relaxed notion of {\\em approximate metric-fairness}: for a random pair of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03242","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":""},"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":"1803.03242","created_at":"2026-05-18T00:11:57.211870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03242v2","created_at":"2026-05-18T00:11:57.211870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03242","created_at":"2026-05-18T00:11:57.211870+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5H4PWH246KH","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5H4PWH246KHRO7M","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5H4PWH2","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ","json":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ.json","graph_json":"https://pith.science/api/pith-number/X5H4PWH246KHRO7MKNXDCISPIZ/graph.json","events_json":"https://pith.science/api/pith-number/X5H4PWH246KHRO7MKNXDCISPIZ/events.json","paper":"https://pith.science/paper/X5H4PWH2"},"agent_actions":{"view_html":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ","download_json":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ.json","view_paper":"https://pith.science/paper/X5H4PWH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03242&json=true","fetch_graph":"https://pith.science/api/pith-number/X5H4PWH246KHRO7MKNXDCISPIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/X5H4PWH246KHRO7MKNXDCISPIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ/action/storage_attestation","attest_author":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ/action/author_attestation","sign_citation":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ/action/citation_signature","submit_replication":"https://pith.science/pith/X5H4PWH246KHRO7MKNXDCISPIZ/action/replication_record"}},"created_at":"2026-05-18T00:11:57.211870+00:00","updated_at":"2026-05-18T00:11:57.211870+00:00"}