{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XESWNNTUSAQPDJ7QF475NMSGWL","short_pith_number":"pith:XESWNNTU","schema_version":"1.0","canonical_sha256":"b92566b6749020f1a7f02f3fd6b246b2cef0ce6658e5ab4569c251e8659181ff","source":{"kind":"arxiv","id":"2303.16788","version":2},"attestation_state":"computed","paper":{"title":"Simplification and Improvement of MMS Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Hannaneh Akrami, Jugal Garg, Setareh Taki","submitted_at":"2023-03-29T15:23:32Z","abstract_excerpt":"We consider the problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations, using the popular fairness notion of maximin share (MMS). Since MMS allocations do not always exist, a series of works provided existence and algorithms for approximate MMS allocations. The Garg-Taki algorithm gives the current best approximation factor of $(\\frac{3}{4} + \\frac{1}{12n})$. Most of these results are based on complicated analyses, especially those providing better than $2/3$ factor. Moreover, since no tight example is known of the Garg-Taki algorithm, it is unclear i"},"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":"2303.16788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-03-29T15:23:32Z","cross_cats_sorted":[],"title_canon_sha256":"49278069565f4ff1d6d0074e5a9491456f2baa29c5448cdd8d0369bd93e42b07","abstract_canon_sha256":"66f958b0a4f3521d9f4cdf2015b174d49c793389aea0eec32374509aec2665b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:33.030788Z","signature_b64":"1eUxk9lLmjvj31ddLB/Ze5XF3gRxnwMcend6JFWPb7fy+No235mW6gjWe2bhagJ2mVwzbBvt1fdLi2D3uBenAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b92566b6749020f1a7f02f3fd6b246b2cef0ce6658e5ab4569c251e8659181ff","last_reissued_at":"2026-07-05T06:33:33.030375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:33.030375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplification and Improvement of MMS Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Hannaneh Akrami, Jugal Garg, Setareh Taki","submitted_at":"2023-03-29T15:23:32Z","abstract_excerpt":"We consider the problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations, using the popular fairness notion of maximin share (MMS). Since MMS allocations do not always exist, a series of works provided existence and algorithms for approximate MMS allocations. The Garg-Taki algorithm gives the current best approximation factor of $(\\frac{3}{4} + \\frac{1}{12n})$. Most of these results are based on complicated analyses, especially those providing better than $2/3$ factor. Moreover, since no tight example is known of the Garg-Taki algorithm, it is unclear i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16788","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/2303.16788/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":"2303.16788","created_at":"2026-07-05T06:33:33.030437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16788v2","created_at":"2026-07-05T06:33:33.030437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16788","created_at":"2026-07-05T06:33:33.030437+00:00"},{"alias_kind":"pith_short_12","alias_value":"XESWNNTUSAQP","created_at":"2026-07-05T06:33:33.030437+00:00"},{"alias_kind":"pith_short_16","alias_value":"XESWNNTUSAQPDJ7Q","created_at":"2026-07-05T06:33:33.030437+00:00"},{"alias_kind":"pith_short_8","alias_value":"XESWNNTU","created_at":"2026-07-05T06:33:33.030437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.20317","citing_title":"Exact and approximate maximin share allocations in multi-graphs","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL","json":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL.json","graph_json":"https://pith.science/api/pith-number/XESWNNTUSAQPDJ7QF475NMSGWL/graph.json","events_json":"https://pith.science/api/pith-number/XESWNNTUSAQPDJ7QF475NMSGWL/events.json","paper":"https://pith.science/paper/XESWNNTU"},"agent_actions":{"view_html":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL","download_json":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL.json","view_paper":"https://pith.science/paper/XESWNNTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16788&json=true","fetch_graph":"https://pith.science/api/pith-number/XESWNNTUSAQPDJ7QF475NMSGWL/graph.json","fetch_events":"https://pith.science/api/pith-number/XESWNNTUSAQPDJ7QF475NMSGWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL/action/storage_attestation","attest_author":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL/action/author_attestation","sign_citation":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL/action/citation_signature","submit_replication":"https://pith.science/pith/XESWNNTUSAQPDJ7QF475NMSGWL/action/replication_record"}},"created_at":"2026-07-05T06:33:33.030437+00:00","updated_at":"2026-07-05T06:33:33.030437+00:00"}