{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FLRBVF2R25CAF4Y4PCMMWWTPAB","short_pith_number":"pith:FLRBVF2R","schema_version":"1.0","canonical_sha256":"2ae21a9751d74402f31c7898cb5a6f00589b2ea3635cd03ff0f908f1533c5f9a","source":{"kind":"arxiv","id":"2308.14545","version":2},"attestation_state":"computed","paper":{"title":"Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Golnoosh Shahkarami, Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin","submitted_at":"2023-08-28T12:58:33Z","abstract_excerpt":"We consider the problem of guaranteeing maximin-share (MMS) when allocating a set of indivisible items to a set of agents with fractionally subadditive (XOS) valuations. For XOS valuations, it has been previously shown that for some instances no allocation can guarantee a fraction better than $1/2$ of maximin-share to all the agents. Also, a deterministic allocation exists that guarantees $0.219225$ of the maximin-share of each agent. Our results involve both deterministic and randomized allocations. On the deterministic side, we improve the best approximation guarantee for fractionally subadd"},"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":"2308.14545","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-08-28T12:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"3516de103341eb7678cc67316eb6813b3e56f5584c9738b50052d7f8706a5a22","abstract_canon_sha256":"f93d1abbe650df3a95e07064a6378e8e6dda2dd9f97cb0a515d7fcb49bc10962"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:30.529664Z","signature_b64":"7VD1YShTYxI5KRVzEkxGB53nRMIbybTHFyQQnG7MUp/Gm1HY3WWbBHanPtXwfoImjZKJtv8HCoAP+7o9jnfhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae21a9751d74402f31c7898cb5a6f00589b2ea3635cd03ff0f908f1533c5f9a","last_reissued_at":"2026-07-05T07:03:30.529181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:30.529181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Golnoosh Shahkarami, Hannaneh Akrami, Kurt Mehlhorn, Masoud Seddighin","submitted_at":"2023-08-28T12:58:33Z","abstract_excerpt":"We consider the problem of guaranteeing maximin-share (MMS) when allocating a set of indivisible items to a set of agents with fractionally subadditive (XOS) valuations. For XOS valuations, it has been previously shown that for some instances no allocation can guarantee a fraction better than $1/2$ of maximin-share to all the agents. Also, a deterministic allocation exists that guarantees $0.219225$ of the maximin-share of each agent. Our results involve both deterministic and randomized allocations. On the deterministic side, we improve the best approximation guarantee for fractionally subadd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14545","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/2308.14545/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":"2308.14545","created_at":"2026-07-05T07:03:30.529239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.14545v2","created_at":"2026-07-05T07:03:30.529239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14545","created_at":"2026-07-05T07:03:30.529239+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLRBVF2R25CA","created_at":"2026-07-05T07:03:30.529239+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLRBVF2R25CAF4Y4","created_at":"2026-07-05T07:03:30.529239+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLRBVF2R","created_at":"2026-07-05T07:03:30.529239+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":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB","json":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB.json","graph_json":"https://pith.science/api/pith-number/FLRBVF2R25CAF4Y4PCMMWWTPAB/graph.json","events_json":"https://pith.science/api/pith-number/FLRBVF2R25CAF4Y4PCMMWWTPAB/events.json","paper":"https://pith.science/paper/FLRBVF2R"},"agent_actions":{"view_html":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB","download_json":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB.json","view_paper":"https://pith.science/paper/FLRBVF2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.14545&json=true","fetch_graph":"https://pith.science/api/pith-number/FLRBVF2R25CAF4Y4PCMMWWTPAB/graph.json","fetch_events":"https://pith.science/api/pith-number/FLRBVF2R25CAF4Y4PCMMWWTPAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB/action/storage_attestation","attest_author":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB/action/author_attestation","sign_citation":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB/action/citation_signature","submit_replication":"https://pith.science/pith/FLRBVF2R25CAF4Y4PCMMWWTPAB/action/replication_record"}},"created_at":"2026-07-05T07:03:30.529239+00:00","updated_at":"2026-07-05T07:03:30.529239+00:00"}