{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GXVZE5F7VUGMM3I5RBBD5IM5ZY","short_pith_number":"pith:GXVZE5F7","schema_version":"1.0","canonical_sha256":"35eb9274bfad0cc66d1d88423ea19dce1951d951a0138d30233fefbc4a71c9ce","source":{"kind":"arxiv","id":"1809.08700","version":2},"attestation_state":"computed","paper":{"title":"Envy-Free Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ariel D. Procaccia, Maria-Florina Balcan, Ritesh Noothigattu, Travis Dick","submitted_at":"2018-09-23T23:59:20Z","abstract_excerpt":"In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the generalizability of envy-free classification, i.e., understanding whether a classifier that is envy free on a sample would be almost envy free with respect to the underlying distribution with high probability. Our main result establishes that a small sample is sufficient to achieve "},"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":"1809.08700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-23T23:59:20Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"dfffecbae4e4106b3b7b9fe49c27d3d3bc667bd2a2eced26193dd316734dba0e","abstract_canon_sha256":"62b211d32861262a9a76cd1f70b8076216c729419be34f63430f4b36b468f63f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:38.699073Z","signature_b64":"kdFFpor1wXTI1+AgehVlRSdP6XtuL7Sc4U0pxnNa3J2UcMq2b5XoI0VC/2s7x6t14Qs2iXecycc9DLLPR5seBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35eb9274bfad0cc66d1d88423ea19dce1951d951a0138d30233fefbc4a71c9ce","last_reissued_at":"2026-07-05T01:37:38.698615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:38.698615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Envy-Free Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ariel D. Procaccia, Maria-Florina Balcan, Ritesh Noothigattu, Travis Dick","submitted_at":"2018-09-23T23:59:20Z","abstract_excerpt":"In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the generalizability of envy-free classification, i.e., understanding whether a classifier that is envy free on a sample would be almost envy free with respect to the underlying distribution with high probability. Our main result establishes that a small sample is sufficient to achieve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08700","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/1809.08700/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":"1809.08700","created_at":"2026-07-05T01:37:38.698671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08700v2","created_at":"2026-07-05T01:37:38.698671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08700","created_at":"2026-07-05T01:37:38.698671+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXVZE5F7VUGM","created_at":"2026-07-05T01:37:38.698671+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXVZE5F7VUGMM3I5","created_at":"2026-07-05T01:37:38.698671+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXVZE5F7","created_at":"2026-07-05T01:37:38.698671+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01251","citing_title":"Avoiding Resentment Via Monotonic Fairness","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY","json":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY.json","graph_json":"https://pith.science/api/pith-number/GXVZE5F7VUGMM3I5RBBD5IM5ZY/graph.json","events_json":"https://pith.science/api/pith-number/GXVZE5F7VUGMM3I5RBBD5IM5ZY/events.json","paper":"https://pith.science/paper/GXVZE5F7"},"agent_actions":{"view_html":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY","download_json":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY.json","view_paper":"https://pith.science/paper/GXVZE5F7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08700&json=true","fetch_graph":"https://pith.science/api/pith-number/GXVZE5F7VUGMM3I5RBBD5IM5ZY/graph.json","fetch_events":"https://pith.science/api/pith-number/GXVZE5F7VUGMM3I5RBBD5IM5ZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY/action/storage_attestation","attest_author":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY/action/author_attestation","sign_citation":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY/action/citation_signature","submit_replication":"https://pith.science/pith/GXVZE5F7VUGMM3I5RBBD5IM5ZY/action/replication_record"}},"created_at":"2026-07-05T01:37:38.698671+00:00","updated_at":"2026-07-05T01:37:38.698671+00:00"}