{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NPXRX5GUWCNTLVBCYO7TGCKN25","short_pith_number":"pith:NPXRX5GU","schema_version":"1.0","canonical_sha256":"6bef1bf4d4b09b35d422c3bf33094dd7487a1e2da910bf71b5d1369d7a2ed5e6","source":{"kind":"arxiv","id":"2405.14575","version":1},"attestation_state":"computed","paper":{"title":"Share-Based Fairness for Arbitrary Entitlements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Moshe Babaioff, Uriel Feige","submitted_at":"2024-05-23T13:50:01Z","abstract_excerpt":"We consider the problem of fair allocation of indivisible items to agents that have arbitrary entitlements to the items. Every agent $i$ has a valuation function $v_i$ and an entitlement $b_i$, where entitlements sum up to~1. Which allocation should one choose in situations in which agents fail to agree on one acceptable fairness notion? We study this problem in the case in which each agent focuses on the value she gets, and fairness notions are restricted to be {\\em share based}. A {\\em share} $s$ is an function that maps every $(v_i,b_i)$ to a value $s(v_i,b_i)$, representing the minimal val"},"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":"2405.14575","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-23T13:50:01Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"fed70fa32eedc8f3e5503ee4d7367fe8c08509caf79ce55b0d8ccb4c961e0f82","abstract_canon_sha256":"efd955bfb6a4f256a2bbb9765865b322719e07202772910ccb16c4eda384b47c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:25.356763Z","signature_b64":"ZgKZkQiunXVrhAhdF8VV78lpRT7IA8PrtYoG6QLUJZcT1aWwem7ce+v8hUQ79M2qmgRbbsFNj1wRaf6RniN+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bef1bf4d4b09b35d422c3bf33094dd7487a1e2da910bf71b5d1369d7a2ed5e6","last_reissued_at":"2026-07-05T08:22:25.356325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:25.356325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Share-Based Fairness for Arbitrary Entitlements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Moshe Babaioff, Uriel Feige","submitted_at":"2024-05-23T13:50:01Z","abstract_excerpt":"We consider the problem of fair allocation of indivisible items to agents that have arbitrary entitlements to the items. Every agent $i$ has a valuation function $v_i$ and an entitlement $b_i$, where entitlements sum up to~1. Which allocation should one choose in situations in which agents fail to agree on one acceptable fairness notion? We study this problem in the case in which each agent focuses on the value she gets, and fairness notions are restricted to be {\\em share based}. A {\\em share} $s$ is an function that maps every $(v_i,b_i)$ to a value $s(v_i,b_i)$, representing the minimal val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14575","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.14575/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":"2405.14575","created_at":"2026-07-05T08:22:25.356379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14575v1","created_at":"2026-07-05T08:22:25.356379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14575","created_at":"2026-07-05T08:22:25.356379+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPXRX5GUWCNT","created_at":"2026-07-05T08:22:25.356379+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPXRX5GUWCNTLVBC","created_at":"2026-07-05T08:22:25.356379+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPXRX5GU","created_at":"2026-07-05T08:22:25.356379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.11131","citing_title":"On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25","json":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25.json","graph_json":"https://pith.science/api/pith-number/NPXRX5GUWCNTLVBCYO7TGCKN25/graph.json","events_json":"https://pith.science/api/pith-number/NPXRX5GUWCNTLVBCYO7TGCKN25/events.json","paper":"https://pith.science/paper/NPXRX5GU"},"agent_actions":{"view_html":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25","download_json":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25.json","view_paper":"https://pith.science/paper/NPXRX5GU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14575&json=true","fetch_graph":"https://pith.science/api/pith-number/NPXRX5GUWCNTLVBCYO7TGCKN25/graph.json","fetch_events":"https://pith.science/api/pith-number/NPXRX5GUWCNTLVBCYO7TGCKN25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25/action/storage_attestation","attest_author":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25/action/author_attestation","sign_citation":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25/action/citation_signature","submit_replication":"https://pith.science/pith/NPXRX5GUWCNTLVBCYO7TGCKN25/action/replication_record"}},"created_at":"2026-07-05T08:22:25.356379+00:00","updated_at":"2026-07-05T08:22:25.356379+00:00"}