{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IYYZJE7EVI2AJ5SZJZACF3UKS4","short_pith_number":"pith:IYYZJE7E","schema_version":"1.0","canonical_sha256":"46319493e4aa3404f6594e4022ee8a97389c47c3e9d226873b204364835dd557","source":{"kind":"arxiv","id":"1907.09279","version":1},"attestation_state":"computed","paper":{"title":"Almost Group Envy-free Allocation of Indivisible Goods and Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Simon Rey","submitted_at":"2019-07-16T23:46:59Z","abstract_excerpt":"We consider a multi-agent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We take the group envy-freeness concept that is well-established in the literature and present stronger and relaxed versions that are especially suitable for the allocation of indivisible items. Of particular interest is a concept called group envy-freeness up to one item (GEF1). We then present a clear taxonomy of the fairness concepts. We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural c"},"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.09279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-16T23:46:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"daf9633a00ab818305d2b722ccb3b1ccbe243ccd6e796ea2a38fcb43b856f086","abstract_canon_sha256":"08c2b93a128e555cb02daac5f22a52d8640a30ad1bf294346513d2af14380e31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.638440Z","signature_b64":"6N0B3q94qOlvjA47Je3MtwL3c/QzUBOqNG8Hg4wJ3Jfy0nERjuwWrSEOvDfMPPZsVJFQBg4p3rMTBAd6aGe0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46319493e4aa3404f6594e4022ee8a97389c47c3e9d226873b204364835dd557","last_reissued_at":"2026-05-17T23:39:59.637934Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.637934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Group Envy-free Allocation of Indivisible Goods and Chores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Simon Rey","submitted_at":"2019-07-16T23:46:59Z","abstract_excerpt":"We consider a multi-agent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We take the group envy-freeness concept that is well-established in the literature and present stronger and relaxed versions that are especially suitable for the allocation of indivisible items. Of particular interest is a concept called group envy-freeness up to one item (GEF1). We then present a clear taxonomy of the fairness concepts. We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09279","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.09279","created_at":"2026-05-17T23:39:59.638017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09279v1","created_at":"2026-05-17T23:39:59.638017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09279","created_at":"2026-05-17T23:39:59.638017+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYYZJE7EVI2A","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYYZJE7EVI2AJ5SZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYYZJE7E","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18228","citing_title":"Consistency, unanimity, and the Borda rule in social ranking","ref_index":143,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4","json":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4.json","graph_json":"https://pith.science/api/pith-number/IYYZJE7EVI2AJ5SZJZACF3UKS4/graph.json","events_json":"https://pith.science/api/pith-number/IYYZJE7EVI2AJ5SZJZACF3UKS4/events.json","paper":"https://pith.science/paper/IYYZJE7E"},"agent_actions":{"view_html":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4","download_json":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4.json","view_paper":"https://pith.science/paper/IYYZJE7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09279&json=true","fetch_graph":"https://pith.science/api/pith-number/IYYZJE7EVI2AJ5SZJZACF3UKS4/graph.json","fetch_events":"https://pith.science/api/pith-number/IYYZJE7EVI2AJ5SZJZACF3UKS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4/action/storage_attestation","attest_author":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4/action/author_attestation","sign_citation":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4/action/citation_signature","submit_replication":"https://pith.science/pith/IYYZJE7EVI2AJ5SZJZACF3UKS4/action/replication_record"}},"created_at":"2026-05-17T23:39:59.638017+00:00","updated_at":"2026-05-17T23:39:59.638017+00:00"}