{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XJFMFB5D2CQEGMKRGFJNX3KMTE","short_pith_number":"pith:XJFMFB5D","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"},"canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","source":{"kind":"arxiv","id":"2107.08965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.08965","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2107.08965v2","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.08965","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"XJFMFB5D2CQE","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"XJFMFB5D2CQEGMKR","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"XJFMFB5D","created_at":"2026-07-05T03:19:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XJFMFB5D2CQEGMKRGFJNX3KMTE","target":"record","payload":{"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"},"canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","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"},"source_kind":"arxiv","source_id":"2107.08965","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sOPc6nU+OaQeRo8z5nrBTGNJ+mZXCOAUk0wOeUtxYazXS5mq0G6fKUEliD48oe5+VJ4lOA1x81kKYDThBYvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:00:41.157120Z"},"content_sha256":"ec786c619cd413083f8fab7acab318ba79283a8bc5fe3f1729ead5a86d943820","schema_version":"1.0","event_id":"sha256:ec786c619cd413083f8fab7acab318ba79283a8bc5fe3f1729ead5a86d943820"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XJFMFB5D2CQEGMKRGFJNX3KMTE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmsa/3sAS+7lf7kBsC4lwVRxSMTT3JwMGoBAFxT/LlBR4WjDIWdGG5MHV0mJ2qkgDh98oyj71FNJeVkaAloPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:00:41.157660Z"},"content_sha256":"09cf542a77d8f2a1ad56e2076494066f4d8ad4f2a53d793d638d94cd91df682b","schema_version":"1.0","event_id":"sha256:09cf542a77d8f2a1ad56e2076494066f4d8ad4f2a53d793d638d94cd91df682b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/bundle.json","state_url":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T22:00:41Z","links":{"resolver":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE","bundle":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/bundle.json","state":"https://pith.science/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJFMFB5D2CQEGMKRGFJNX3KMTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XJFMFB5D2CQEGMKRGFJNX3KMTE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3b5e78d2aa5101c2560996024ce6be683c6c0bf02f9548a1d8547fce090dd2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-07-19T15:27:04Z","title_canon_sha256":"0680511a7081fbcc6790c494cb63ba54e3491557515257b2be0332122931460d"},"schema_version":"1.0","source":{"id":"2107.08965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.08965","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2107.08965v2","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.08965","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"XJFMFB5D2CQE","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"XJFMFB5D2CQEGMKR","created_at":"2026-07-05T03:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"XJFMFB5D","created_at":"2026-07-05T03:19:18Z"}],"graph_snapshots":[{"event_id":"sha256:09cf542a77d8f2a1ad56e2076494066f4d8ad4f2a53d793d638d94cd91df682b","target":"graph","created_at":"2026-07-05T03:19:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.08965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$","authors_text":"Bhaskar Ray Chaudhury, Ernest van Wijland, Giovanna Varricchio, Golnoosh Shahkarami, Hannaneh Akrami, Kurt Mehlhorn, Marco Schmalhofer, Martin Hoefer, Quentin Vermande","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-07-19T15:27:04Z","title":"Maximizing Nash Social Welfare in 2-Value Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.08965","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ec786c619cd413083f8fab7acab318ba79283a8bc5fe3f1729ead5a86d943820","target":"record","created_at":"2026-07-05T03:19:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3b5e78d2aa5101c2560996024ce6be683c6c0bf02f9548a1d8547fce090dd2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-07-19T15:27:04Z","title_canon_sha256":"0680511a7081fbcc6790c494cb63ba54e3491557515257b2be0332122931460d"},"schema_version":"1.0","source":{"id":"2107.08965","kind":"arxiv","version":2}},"canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba4ac287a3d0a04331513152dbed4c99255c45382f251c5152f9b44a717abf06","first_computed_at":"2026-07-05T03:19:18.598998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:18.598998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KxIhlQcd9pd5HenitHPgRif/xB8JaTSvrPg9luqSCP3MCWfYnSomPz10apRYJ+b+faNdar3XkHMB/GjkEj1xAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:18.599409Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.08965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec786c619cd413083f8fab7acab318ba79283a8bc5fe3f1729ead5a86d943820","sha256:09cf542a77d8f2a1ad56e2076494066f4d8ad4f2a53d793d638d94cd91df682b"],"state_sha256":"660eb1c0802ccd5bc9571f01f4f974009db1ea3b8a455cccd5a254198733d88c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlVYuu8z+90AuPXUzH/m5bd+sNGI8XpPoQYwM0Ott9Ri0wivAa/MFFh+FcSl3EIsc/1SNoOdavovYwzIt1cgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:00:41.161571Z","bundle_sha256":"0654248a26a5a726a4d307e1c9a509b1255b86d8fb403636fa397f58bbd35f97"}}