{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JCZC3WXCWJAG7A63XCIHHEWH6U","short_pith_number":"pith:JCZC3WXC","schema_version":"1.0","canonical_sha256":"48b22ddae2b2406f83dbb8907392c7f52c8eb98c9c2ad74f9c4585a02a7ec52c","source":{"kind":"arxiv","id":"1609.07056","version":2},"attestation_state":"computed","paper":{"title":"Nash Social Welfare, Matrix Permanent, and Stable Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Mohit Singh, Nima Anari, Shayan Oveis Gharan","submitted_at":"2016-09-22T16:35:59Z","abstract_excerpt":"We study the problem of allocating $m$ items to $n$ agents subject to maximizing the Nash social welfare (NSW) objective. We write a novel convex programming relaxation for this problem, and we show that a simple randomized rounding algorithm gives a $1/e$ approximation factor of the objective.\n  Our main technical contribution is an extension of Gurvits's lower bound on the coefficient of the square-free monomial of a degree $m$-homogeneous stable polynomial on $m$ variables to all homogeneous polynomials. We use this extension to analyze the expected welfare of the allocation returned by 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":"1609.07056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-22T16:35:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b3afad9cb5e7237b9ce3bb0596c48a334fd84f142900a0687d2755ba1207f18c","abstract_canon_sha256":"c72a569238980dca27d55d38ea3df7d3e22a486b7754eebbbba4c912f0fa5830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:02.167094Z","signature_b64":"QXqJMfY6Y+RvtNWc1H/axQbMKdfXweOKvOKJk/Ry9ZTdTXR5Jy8TkvbpHzQOAOmY4lnoKN2svpyIwq+4XS9BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b22ddae2b2406f83dbb8907392c7f52c8eb98c9c2ad74f9c4585a02a7ec52c","last_reissued_at":"2026-05-18T01:04:02.165898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:02.165898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nash Social Welfare, Matrix Permanent, and Stable Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Mohit Singh, Nima Anari, Shayan Oveis Gharan","submitted_at":"2016-09-22T16:35:59Z","abstract_excerpt":"We study the problem of allocating $m$ items to $n$ agents subject to maximizing the Nash social welfare (NSW) objective. We write a novel convex programming relaxation for this problem, and we show that a simple randomized rounding algorithm gives a $1/e$ approximation factor of the objective.\n  Our main technical contribution is an extension of Gurvits's lower bound on the coefficient of the square-free monomial of a degree $m$-homogeneous stable polynomial on $m$ variables to all homogeneous polynomials. We use this extension to analyze the expected welfare of the allocation returned by our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07056","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":""},"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":"1609.07056","created_at":"2026-05-18T01:04:02.166079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07056v2","created_at":"2026-05-18T01:04:02.166079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07056","created_at":"2026-05-18T01:04:02.166079+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCZC3WXCWJAG","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCZC3WXCWJAG7A63","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCZC3WXC","created_at":"2026-05-18T12:30:25.849896+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/JCZC3WXCWJAG7A63XCIHHEWH6U","json":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U.json","graph_json":"https://pith.science/api/pith-number/JCZC3WXCWJAG7A63XCIHHEWH6U/graph.json","events_json":"https://pith.science/api/pith-number/JCZC3WXCWJAG7A63XCIHHEWH6U/events.json","paper":"https://pith.science/paper/JCZC3WXC"},"agent_actions":{"view_html":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U","download_json":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U.json","view_paper":"https://pith.science/paper/JCZC3WXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07056&json=true","fetch_graph":"https://pith.science/api/pith-number/JCZC3WXCWJAG7A63XCIHHEWH6U/graph.json","fetch_events":"https://pith.science/api/pith-number/JCZC3WXCWJAG7A63XCIHHEWH6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U/action/storage_attestation","attest_author":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U/action/author_attestation","sign_citation":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U/action/citation_signature","submit_replication":"https://pith.science/pith/JCZC3WXCWJAG7A63XCIHHEWH6U/action/replication_record"}},"created_at":"2026-05-18T01:04:02.166079+00:00","updated_at":"2026-05-18T01:04:02.166079+00:00"}