{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:INTBAOGT5QAI75PBHNYK5DEWLU","short_pith_number":"pith:INTBAOGT","schema_version":"1.0","canonical_sha256":"43661038d3ec008ff5e13b70ae8c965d39523f5fef8ee8efa4f29b0a54453882","source":{"kind":"arxiv","id":"1711.07621","version":1},"attestation_state":"computed","paper":{"title":"Groupwise Maximin Fair Allocation of Indivisible Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Arpita Biswas, Sanath Kumar Krishnamurthy, Siddharth Barman, Y. Narahari","submitted_at":"2017-11-21T04:00:30Z","abstract_excerpt":"We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as the minimum utility that an agent can guarantee for herself when asked to partition the set of goods into n bundles such that the remaining (n-1) agents pick their bundles adversarially. An allocation is deemed to be fair if every agent gets a bundle whose valuation is at least her maximin share.\n  Even though maximin shares provide a natural benchmark for fai"},"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":"1711.07621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-21T04:00:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d470d9f4b386d5370653cec6742d44e702088b908607d5d99df730045d7547f6","abstract_canon_sha256":"2d6e4a1d1368333e453371168484ecead91657783c94da886fc7f90bcddead57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.833769Z","signature_b64":"tXfu1hIvG9Xpwth11UYOM/O+ICXwBDe3bAOstphK5jgaFJfdTBQlBqA8AvbfS4WolmQre3CyeeRN/cLzRqn7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43661038d3ec008ff5e13b70ae8c965d39523f5fef8ee8efa4f29b0a54453882","last_reissued_at":"2026-05-18T00:29:56.833373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.833373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Groupwise Maximin Fair Allocation of Indivisible Goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Arpita Biswas, Sanath Kumar Krishnamurthy, Siddharth Barman, Y. Narahari","submitted_at":"2017-11-21T04:00:30Z","abstract_excerpt":"We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as the minimum utility that an agent can guarantee for herself when asked to partition the set of goods into n bundles such that the remaining (n-1) agents pick their bundles adversarially. An allocation is deemed to be fair if every agent gets a bundle whose valuation is at least her maximin share.\n  Even though maximin shares provide a natural benchmark for fai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07621","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":""},"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":"1711.07621","created_at":"2026-05-18T00:29:56.833443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07621v1","created_at":"2026-05-18T00:29:56.833443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07621","created_at":"2026-05-18T00:29:56.833443+00:00"},{"alias_kind":"pith_short_12","alias_value":"INTBAOGT5QAI","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"INTBAOGT5QAI75PB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"INTBAOGT","created_at":"2026-05-18T12:31:21.493067+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/INTBAOGT5QAI75PBHNYK5DEWLU","json":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU.json","graph_json":"https://pith.science/api/pith-number/INTBAOGT5QAI75PBHNYK5DEWLU/graph.json","events_json":"https://pith.science/api/pith-number/INTBAOGT5QAI75PBHNYK5DEWLU/events.json","paper":"https://pith.science/paper/INTBAOGT"},"agent_actions":{"view_html":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU","download_json":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU.json","view_paper":"https://pith.science/paper/INTBAOGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07621&json=true","fetch_graph":"https://pith.science/api/pith-number/INTBAOGT5QAI75PBHNYK5DEWLU/graph.json","fetch_events":"https://pith.science/api/pith-number/INTBAOGT5QAI75PBHNYK5DEWLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU/action/storage_attestation","attest_author":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU/action/author_attestation","sign_citation":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU/action/citation_signature","submit_replication":"https://pith.science/pith/INTBAOGT5QAI75PBHNYK5DEWLU/action/replication_record"}},"created_at":"2026-05-18T00:29:56.833443+00:00","updated_at":"2026-05-18T00:29:56.833443+00:00"}