{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XJFMFB5D2CQEGMKRGFJNX3KMTE","short_pith_number":"pith:XJFMFB5D","schema_version":"1.0","canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","source":{"kind":"arxiv","id":"2107.08965","version":2},"attestation_state":"computed","paper":{"title":"Maximizing Nash Social Welfare in 2-Value Instances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bhaskar Ray Chaudhury, Ernest van Wijland, Giovanna Varricchio, Golnoosh Shahkarami, Hannaneh Akrami, Kurt Mehlhorn, Marco Schmalhofer, Martin Hoefer, Quentin Vermande","submitted_at":"2021-07-19T15:27:04Z","abstract_excerpt":"We consider the problem of maximizing the Nash social welfare when allocating a set $\\mathcal{G}$ of indivisible goods to a set $\\mathcal{N}$ of agents. We study instances, in which all agents have 2-value additive valuations: The value of every agent $i \\in \\mathcal{N}$ for every good $j \\in \\mathcal{G}$ is $v_{ij} \\in \\{p,q\\}$, for $p,q \\in \\mathbb{N}$, $p \\le q$. Maybe surprisingly, we design an algorithm to compute an optimal allocation in polynomial time if $p$ divides $q$, i.e., when $p=1$ and $q \\in \\mathbb{N}$ after appropriate scaling. The problem is \\classNP-hard whenever $p$ and $q$"},"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":"2107.08965","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-07-19T15:27:04Z","cross_cats_sorted":[],"title_canon_sha256":"0680511a7081fbcc6790c494cb63ba54e3491557515257b2be0332122931460d","abstract_canon_sha256":"c3b5e78d2aa5101c2560996024ce6be683c6c0bf02f9548a1d8547fce090dd2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:18.599409Z","signature_b64":"KxIhlQcd9pd5HenitHPgRif/xB8JaTSvrPg9luqSCP3MCWfYnSomPz10apRYJ+b+faNdar3XkHMB/GjkEj1xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","last_reissued_at":"2026-07-05T03:19:18.598998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:18.598998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Nash Social Welfare in 2-Value Instances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bhaskar Ray Chaudhury, Ernest van Wijland, Giovanna Varricchio, Golnoosh Shahkarami, Hannaneh Akrami, Kurt Mehlhorn, Marco Schmalhofer, Martin Hoefer, Quentin Vermande","submitted_at":"2021-07-19T15:27:04Z","abstract_excerpt":"We consider the problem of maximizing the Nash social welfare when allocating a set $\\mathcal{G}$ of indivisible goods to a set $\\mathcal{N}$ of agents. We study instances, in which all agents have 2-value additive valuations: The value of every agent $i \\in \\mathcal{N}$ for every good $j \\in \\mathcal{G}$ is $v_{ij} \\in \\{p,q\\}$, for $p,q \\in \\mathbb{N}$, $p \\le q$. Maybe surprisingly, we design an algorithm to compute an optimal allocation in polynomial time if $p$ divides $q$, i.e., when $p=1$ and $q \\in \\mathbb{N}$ after appropriate scaling. The problem is \\classNP-hard whenever $p$ and $q$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.08965","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/2107.08965/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":"2107.08965","created_at":"2026-07-05T03:19:18.599063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.08965v2","created_at":"2026-07-05T03:19:18.599063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.08965","created_at":"2026-07-05T03:19:18.599063+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJFMFB5D2CQE","created_at":"2026-07-05T03:19:18.599063+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJFMFB5D2CQEGMKR","created_at":"2026-07-05T03:19:18.599063+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJFMFB5D","created_at":"2026-07-05T03:19:18.599063+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/XJFMFB5D2CQEGMKRGFJNX3KMTE","json":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE.json","graph_json":"https://pith.science/api/pith-number/XJFMFB5D2CQEGMKRGFJNX3KMTE/graph.json","events_json":"https://pith.science/api/pith-number/XJFMFB5D2CQEGMKRGFJNX3KMTE/events.json","paper":"https://pith.science/paper/XJFMFB5D"},"agent_actions":{"view_html":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE","download_json":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE.json","view_paper":"https://pith.science/paper/XJFMFB5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.08965&json=true","fetch_graph":"https://pith.science/api/pith-number/XJFMFB5D2CQEGMKRGFJNX3KMTE/graph.json","fetch_events":"https://pith.science/api/pith-number/XJFMFB5D2CQEGMKRGFJNX3KMTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/action/storage_attestation","attest_author":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/action/author_attestation","sign_citation":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/action/citation_signature","submit_replication":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/action/replication_record"}},"created_at":"2026-07-05T03:19:18.599063+00:00","updated_at":"2026-07-05T03:19:18.599063+00:00"}