{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WCCW3MMPVPPV62SZ2NF5673W4M","short_pith_number":"pith:WCCW3MMP","schema_version":"1.0","canonical_sha256":"b0856db18fabdf5f6a59d34bdf7f76e31227653aa3e5a0f74571724341d13a72","source":{"kind":"arxiv","id":"1704.00222","version":3},"attestation_state":"computed","paper":{"title":"Fair Allocation of Indivisible Goods: Improvement and Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hadi Yami, Masoud Seddighin, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin","submitted_at":"2017-04-01T20:00:35Z","abstract_excerpt":"We study the problem of fair allocation for indivisible goods. We use the the maxmin share paradigm introduced by Budish as a measure for fairness. Procaccia and Wang (EC'14) were first to investigate this fundamental problem in the additive setting. In contrast to what real-world experiments suggest, they show that a maxmin guarantee (1-MMS allocation) is not always possible even when the number of agents is limited to 3. While the existence of an approximation solution (e.g. a $1/2$-MMS allocation) is quite straightforward, improving the guarantee becomes subtler for larger constants. Procac"},"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":"1704.00222","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-01T20:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"ef9e8f03d7962bf9ba5f328167519e0b74aecdffac07771c79314d019f9b70ee","abstract_canon_sha256":"56aeb24fc980ec53ec97d684018c07184368b3f4ea38074b0e8c94439c222e56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:46.521724Z","signature_b64":"TXFzr38R7k/32XWI1CnCS3DLHV5dZsBOsNUwYIF/bV7RWWnzIggN5rQGN2Tg/CemLQy9T0dCj1YQy+XMY1MTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0856db18fabdf5f6a59d34bdf7f76e31227653aa3e5a0f74571724341d13a72","last_reissued_at":"2026-05-18T00:39:46.521169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:46.521169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Allocation of Indivisible Goods: Improvement and Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hadi Yami, Masoud Seddighin, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin","submitted_at":"2017-04-01T20:00:35Z","abstract_excerpt":"We study the problem of fair allocation for indivisible goods. We use the the maxmin share paradigm introduced by Budish as a measure for fairness. Procaccia and Wang (EC'14) were first to investigate this fundamental problem in the additive setting. In contrast to what real-world experiments suggest, they show that a maxmin guarantee (1-MMS allocation) is not always possible even when the number of agents is limited to 3. While the existence of an approximation solution (e.g. a $1/2$-MMS allocation) is quite straightforward, improving the guarantee becomes subtler for larger constants. Procac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00222","kind":"arxiv","version":3},"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":"1704.00222","created_at":"2026-05-18T00:39:46.521251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00222v3","created_at":"2026-05-18T00:39:46.521251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00222","created_at":"2026-05-18T00:39:46.521251+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCCW3MMPVPPV","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCCW3MMPVPPV62SZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCCW3MMP","created_at":"2026-05-18T12:31:53.515858+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/WCCW3MMPVPPV62SZ2NF5673W4M","json":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M.json","graph_json":"https://pith.science/api/pith-number/WCCW3MMPVPPV62SZ2NF5673W4M/graph.json","events_json":"https://pith.science/api/pith-number/WCCW3MMPVPPV62SZ2NF5673W4M/events.json","paper":"https://pith.science/paper/WCCW3MMP"},"agent_actions":{"view_html":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M","download_json":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M.json","view_paper":"https://pith.science/paper/WCCW3MMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00222&json=true","fetch_graph":"https://pith.science/api/pith-number/WCCW3MMPVPPV62SZ2NF5673W4M/graph.json","fetch_events":"https://pith.science/api/pith-number/WCCW3MMPVPPV62SZ2NF5673W4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M/action/storage_attestation","attest_author":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M/action/author_attestation","sign_citation":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M/action/citation_signature","submit_replication":"https://pith.science/pith/WCCW3MMPVPPV62SZ2NF5673W4M/action/replication_record"}},"created_at":"2026-05-18T00:39:46.521251+00:00","updated_at":"2026-05-18T00:39:46.521251+00:00"}