{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4U2RZZ34KASOXBP4VQ4AQ2NW2T","short_pith_number":"pith:4U2RZZ34","schema_version":"1.0","canonical_sha256":"e5351ce77c5024eb85fcac380869b6d4cddf3e4f9a31e2f1e864e37db93a08ac","source":{"kind":"arxiv","id":"2112.10199","version":2},"attestation_state":"computed","paper":{"title":"Tractable Fragments of the Maximum Nash Welfare Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, Edin Husi\\'c, Jugal Garg, L\\'aszl\\'o V\\'egh","submitted_at":"2021-12-19T17:16:03Z","abstract_excerpt":"We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of agents' utilities, and the allocation with maximum Nash welfare is known to satisfy several desirable fairness and efficiency properties. However, computing such an MNW allocation is NP-hard, even for two agents with identical, additive valuations. Hence, we aim to identify tractable classes that either admit a PTAS, an FPTAS, or an exact polynomial-time algorithm.\n  To this end, we design a PTAS for finding an MNW al"},"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":"2112.10199","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-12-19T17:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"cb4118726149d4297fc9c3ae8fa07178b283b1b9224d744608e518544ca1f900","abstract_canon_sha256":"a0f311afc0a744ee98e624948dadafcc5664b16dad3b5c9a379c10695e6128fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:50.131494Z","signature_b64":"fnxxUKxpLyrbLjDAB08iPsQyi6a8ujKiNXClmp/dPLt05mmm8njZswZ98brzO/zxtvqcVAbl2mbOB5QXBUX+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5351ce77c5024eb85fcac380869b6d4cddf3e4f9a31e2f1e864e37db93a08ac","last_reissued_at":"2026-07-05T04:18:50.131028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:50.131028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Fragments of the Maximum Nash Welfare Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aniket Murhekar, Edin Husi\\'c, Jugal Garg, L\\'aszl\\'o V\\'egh","submitted_at":"2021-12-19T17:16:03Z","abstract_excerpt":"We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of agents' utilities, and the allocation with maximum Nash welfare is known to satisfy several desirable fairness and efficiency properties. However, computing such an MNW allocation is NP-hard, even for two agents with identical, additive valuations. Hence, we aim to identify tractable classes that either admit a PTAS, an FPTAS, or an exact polynomial-time algorithm.\n  To this end, we design a PTAS for finding an MNW al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10199","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/2112.10199/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":"2112.10199","created_at":"2026-07-05T04:18:50.131083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10199v2","created_at":"2026-07-05T04:18:50.131083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10199","created_at":"2026-07-05T04:18:50.131083+00:00"},{"alias_kind":"pith_short_12","alias_value":"4U2RZZ34KASO","created_at":"2026-07-05T04:18:50.131083+00:00"},{"alias_kind":"pith_short_16","alias_value":"4U2RZZ34KASOXBP4","created_at":"2026-07-05T04:18:50.131083+00:00"},{"alias_kind":"pith_short_8","alias_value":"4U2RZZ34","created_at":"2026-07-05T04:18:50.131083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03238","citing_title":"Some Improved Results on Fair and Balanced Graph Partitions","ref_index":113,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T","json":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T.json","graph_json":"https://pith.science/api/pith-number/4U2RZZ34KASOXBP4VQ4AQ2NW2T/graph.json","events_json":"https://pith.science/api/pith-number/4U2RZZ34KASOXBP4VQ4AQ2NW2T/events.json","paper":"https://pith.science/paper/4U2RZZ34"},"agent_actions":{"view_html":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T","download_json":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T.json","view_paper":"https://pith.science/paper/4U2RZZ34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10199&json=true","fetch_graph":"https://pith.science/api/pith-number/4U2RZZ34KASOXBP4VQ4AQ2NW2T/graph.json","fetch_events":"https://pith.science/api/pith-number/4U2RZZ34KASOXBP4VQ4AQ2NW2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T/action/storage_attestation","attest_author":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T/action/author_attestation","sign_citation":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T/action/citation_signature","submit_replication":"https://pith.science/pith/4U2RZZ34KASOXBP4VQ4AQ2NW2T/action/replication_record"}},"created_at":"2026-07-05T04:18:50.131083+00:00","updated_at":"2026-07-05T04:18:50.131083+00:00"}