{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XJYQZG7D2XCB5XSBIGCGJIGGH2","short_pith_number":"pith:XJYQZG7D","schema_version":"1.0","canonical_sha256":"ba710c9be3d5c41ede41418464a0c63e81864689968a1a04fc49184c24d2bb19","source":{"kind":"arxiv","id":"2307.12916","version":2},"attestation_state":"computed","paper":{"title":"Improving Approximation Guarantees for Maximin Share","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Hannaneh Akrami, Jugal Garg, Setareh Taki","submitted_at":"2023-07-24T16:17:45Z","abstract_excerpt":"We consider fair division of a set of indivisible goods among $n$ agents with additive valuations using the fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to her if she receives goods worth at least her ($1$-out-of-$n$) MMS value. An allocation is called MMS if all agents receive their MMS values. However, since MMS allocations do not always exist, the focus shifted to investigating its ordinal and multiplicative approximations.\n  In the ordinal approximation, the goal is to show the existence of $1$-out-of-$d$ MMS"},"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":"2307.12916","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-24T16:17:45Z","cross_cats_sorted":[],"title_canon_sha256":"b16f094dd8b8af70ff139ac5c876c1522ee649d45354ebab4970f2186f8026eb","abstract_canon_sha256":"5e03ee5e3e68ad556ec23a34b5de7f7151436898865e390e6e05cfb5b885aa71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:47.590256Z","signature_b64":"14CzffcdQt4LZBCCDsPsZsyjg5O+muZf1mInBZdH4HeLlLDMDpbanMzYGilUJOsgHfIJqismricnH4uJxqoECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba710c9be3d5c41ede41418464a0c63e81864689968a1a04fc49184c24d2bb19","last_reissued_at":"2026-07-05T07:45:47.589826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:47.589826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Approximation Guarantees for Maximin Share","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Hannaneh Akrami, Jugal Garg, Setareh Taki","submitted_at":"2023-07-24T16:17:45Z","abstract_excerpt":"We consider fair division of a set of indivisible goods among $n$ agents with additive valuations using the fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to her if she receives goods worth at least her ($1$-out-of-$n$) MMS value. An allocation is called MMS if all agents receive their MMS values. However, since MMS allocations do not always exist, the focus shifted to investigating its ordinal and multiplicative approximations.\n  In the ordinal approximation, the goal is to show the existence of $1$-out-of-$d$ MMS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12916","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/2307.12916/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":"2307.12916","created_at":"2026-07-05T07:45:47.589880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.12916v2","created_at":"2026-07-05T07:45:47.589880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12916","created_at":"2026-07-05T07:45:47.589880+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJYQZG7D2XCB","created_at":"2026-07-05T07:45:47.589880+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJYQZG7D2XCB5XSB","created_at":"2026-07-05T07:45:47.589880+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJYQZG7D","created_at":"2026-07-05T07:45:47.589880+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":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2","json":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2.json","graph_json":"https://pith.science/api/pith-number/XJYQZG7D2XCB5XSBIGCGJIGGH2/graph.json","events_json":"https://pith.science/api/pith-number/XJYQZG7D2XCB5XSBIGCGJIGGH2/events.json","paper":"https://pith.science/paper/XJYQZG7D"},"agent_actions":{"view_html":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2","download_json":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2.json","view_paper":"https://pith.science/paper/XJYQZG7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.12916&json=true","fetch_graph":"https://pith.science/api/pith-number/XJYQZG7D2XCB5XSBIGCGJIGGH2/graph.json","fetch_events":"https://pith.science/api/pith-number/XJYQZG7D2XCB5XSBIGCGJIGGH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2/action/storage_attestation","attest_author":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2/action/author_attestation","sign_citation":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2/action/citation_signature","submit_replication":"https://pith.science/pith/XJYQZG7D2XCB5XSBIGCGJIGGH2/action/replication_record"}},"created_at":"2026-07-05T07:45:47.589880+00:00","updated_at":"2026-07-05T07:45:47.589880+00:00"}