{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DXE6ANLL2D7F2Y4P4VDYVTF6OV","short_pith_number":"pith:DXE6ANLL","schema_version":"1.0","canonical_sha256":"1dc9e0356bd0fe5d638fe5478accbe757291ba635a117769943f88fb9edb4148","source":{"kind":"arxiv","id":"2502.05141","version":1},"attestation_state":"computed","paper":{"title":"Maximin Share Guarantees for Few Agents with Subadditive Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, George Christodoulou, Symeon Mastrakoulis, Vasilis Christoforidis","submitted_at":"2025-02-07T18:16:06Z","abstract_excerpt":"We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of subadditive valuations when the number of agents is at most four. We also provide a tight lower bound for the case of multiple agents, when they are equipped with one of two possible types of valuations. Moreover, we propose a new model that extends previously studied models in the area of fair division, which will hopefully give rise to further research. We demons"},"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":"2502.05141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-07T18:16:06Z","cross_cats_sorted":[],"title_canon_sha256":"ed6e3214b620ac44035c29aa78a2777b3a1bdcb6d88d713cd0dc2a46079361b2","abstract_canon_sha256":"6ae89840f691228ba54f2ea72a86d43148992bcc26e9e9006357125ea6671cc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:09.994322Z","signature_b64":"fzSq17UQgunpnL+nfwfNpglkVU7bEIFbPqq34OveMxhu595F9b0f0CbWGFE6PKdQi6jxwjee4udbL58cRpsyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc9e0356bd0fe5d638fe5478accbe757291ba635a117769943f88fb9edb4148","last_reissued_at":"2026-07-05T10:11:09.993838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:09.993838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximin Share Guarantees for Few Agents with Subadditive Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alkmini Sgouritsa, George Christodoulou, Symeon Mastrakoulis, Vasilis Christoforidis","submitted_at":"2025-02-07T18:16:06Z","abstract_excerpt":"We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of subadditive valuations when the number of agents is at most four. We also provide a tight lower bound for the case of multiple agents, when they are equipped with one of two possible types of valuations. Moreover, we propose a new model that extends previously studied models in the area of fair division, which will hopefully give rise to further research. We demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05141","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/2502.05141/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":"2502.05141","created_at":"2026-07-05T10:11:09.993894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05141v1","created_at":"2026-07-05T10:11:09.993894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05141","created_at":"2026-07-05T10:11:09.993894+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXE6ANLL2D7F","created_at":"2026-07-05T10:11:09.993894+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXE6ANLL2D7F2Y4P","created_at":"2026-07-05T10:11:09.993894+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXE6ANLL","created_at":"2026-07-05T10:11:09.993894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21493","citing_title":"From multi-allocations to allocations, with subadditive valuations","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV","json":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV.json","graph_json":"https://pith.science/api/pith-number/DXE6ANLL2D7F2Y4P4VDYVTF6OV/graph.json","events_json":"https://pith.science/api/pith-number/DXE6ANLL2D7F2Y4P4VDYVTF6OV/events.json","paper":"https://pith.science/paper/DXE6ANLL"},"agent_actions":{"view_html":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV","download_json":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV.json","view_paper":"https://pith.science/paper/DXE6ANLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05141&json=true","fetch_graph":"https://pith.science/api/pith-number/DXE6ANLL2D7F2Y4P4VDYVTF6OV/graph.json","fetch_events":"https://pith.science/api/pith-number/DXE6ANLL2D7F2Y4P4VDYVTF6OV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV/action/storage_attestation","attest_author":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV/action/author_attestation","sign_citation":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV/action/citation_signature","submit_replication":"https://pith.science/pith/DXE6ANLL2D7F2Y4P4VDYVTF6OV/action/replication_record"}},"created_at":"2026-07-05T10:11:09.993894+00:00","updated_at":"2026-07-05T10:11:09.993894+00:00"}