{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4W2ZS3OQCUXEDPDVBJC2YYNNFF","short_pith_number":"pith:4W2ZS3OQ","schema_version":"1.0","canonical_sha256":"e5b5996dd0152e41bc750a45ac61ad296f34983b94818f9dd34f4e10d09ea9fb","source":{"kind":"arxiv","id":"1503.00941","version":3},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Computing Maximin Share Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Afshin Nikzad, Amin Saberi, Evangelos Markakis, Georgios Amanatidis","submitted_at":"2015-03-03T13:37:53Z","abstract_excerpt":"We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would be allowed to partition the goods in any way she prefers, into $n$ bundles, and then receive her least desirable bundle. The objective then in our problem is to find a partition, so that each agent is guaranteed her maximin share. In settings with indivisible goods, such allocations are not guaranteed to exist, so we resort to approximation algorithms. Our "},"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":"1503.00941","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-03-03T13:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"8934d320f77cd9c7215466c8493e75fcd7bf742dfe53b7c9ca65169e384f5315","abstract_canon_sha256":"acd2a61f10b0dcc486d7cbdff808f27c9ae0bfb0b8aff6fdc59580e55e541d4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.640162Z","signature_b64":"Z6/ghONac+bsa2t1pGaPnLRxWHUPK3BLw0YwxWdc6S6NVv8wuViII2urF0ZKqMS2MRjJKbRqiB4rBZ3do6HoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b5996dd0152e41bc750a45ac61ad296f34983b94818f9dd34f4e10d09ea9fb","last_reissued_at":"2026-05-18T00:13:48.639515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.639515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Computing Maximin Share Allocations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Afshin Nikzad, Amin Saberi, Evangelos Markakis, Georgios Amanatidis","submitted_at":"2015-03-03T13:37:53Z","abstract_excerpt":"We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would be allowed to partition the goods in any way she prefers, into $n$ bundles, and then receive her least desirable bundle. The objective then in our problem is to find a partition, so that each agent is guaranteed her maximin share. In settings with indivisible goods, such allocations are not guaranteed to exist, so we resort to approximation algorithms. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00941","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":"1503.00941","created_at":"2026-05-18T00:13:48.639613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00941v3","created_at":"2026-05-18T00:13:48.639613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00941","created_at":"2026-05-18T00:13:48.639613+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W2ZS3OQCUXE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W2ZS3OQCUXEDPDV","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W2ZS3OQ","created_at":"2026-05-18T12:29:05.191682+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/4W2ZS3OQCUXEDPDVBJC2YYNNFF","json":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF.json","graph_json":"https://pith.science/api/pith-number/4W2ZS3OQCUXEDPDVBJC2YYNNFF/graph.json","events_json":"https://pith.science/api/pith-number/4W2ZS3OQCUXEDPDVBJC2YYNNFF/events.json","paper":"https://pith.science/paper/4W2ZS3OQ"},"agent_actions":{"view_html":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF","download_json":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF.json","view_paper":"https://pith.science/paper/4W2ZS3OQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00941&json=true","fetch_graph":"https://pith.science/api/pith-number/4W2ZS3OQCUXEDPDVBJC2YYNNFF/graph.json","fetch_events":"https://pith.science/api/pith-number/4W2ZS3OQCUXEDPDVBJC2YYNNFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF/action/storage_attestation","attest_author":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF/action/author_attestation","sign_citation":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF/action/citation_signature","submit_replication":"https://pith.science/pith/4W2ZS3OQCUXEDPDVBJC2YYNNFF/action/replication_record"}},"created_at":"2026-05-18T00:13:48.639613+00:00","updated_at":"2026-05-18T00:13:48.639613+00:00"}