{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ONODBIEHPZL4YWMEGP7M5T3PSK","short_pith_number":"pith:ONODBIEH","schema_version":"1.0","canonical_sha256":"735c30a0877e57cc598433fececf6f92bf20d28bdf79158c513a2d108d3be7c7","source":{"kind":"arxiv","id":"2411.14007","version":3},"attestation_state":"computed","paper":{"title":"Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Harshul Sagar, Jatin Yadav, Rohit Vaish, Salil Gokhale, Vignesh Viswanathan","submitted_at":"2024-11-21T10:42:38Z","abstract_excerpt":"We study the problem of maximizing Nash social welfare, which is the geometric mean of agents' utilities, in two well-known models. The first model involves one-sided preferences, where a set of indivisible items is allocated among a group of agents (commonly studied in fair division). The second model deals with two-sided preferences, where a set of workers and firms, each having numerical valuations for the other side, are matched with each other (commonly studied in matching-under-preferences literature). We study these models under capacity constraints, which restrict the number of items ("},"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":"2411.14007","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-21T10:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"71325045d5a7f0ecc96f3bbb2c647a6ddf7ed4bae9e427e456b156fa02b5273c","abstract_canon_sha256":"d0b5f14b62012932ed24a28ea265f3a8737c49c7362a289b0a540cb5b92da2bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:54.095175Z","signature_b64":"C+gYmdkzV/ZzfPKI3q6VtOvAqY0WvsSSGk6YTA8HRk1mjlBmLiPJEzm82DLNlAXQnKfdDuLd6klk6F5N8D/RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735c30a0877e57cc598433fececf6f92bf20d28bdf79158c513a2d108d3be7c7","last_reissued_at":"2026-07-05T11:03:54.094744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:54.094744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Harshul Sagar, Jatin Yadav, Rohit Vaish, Salil Gokhale, Vignesh Viswanathan","submitted_at":"2024-11-21T10:42:38Z","abstract_excerpt":"We study the problem of maximizing Nash social welfare, which is the geometric mean of agents' utilities, in two well-known models. The first model involves one-sided preferences, where a set of indivisible items is allocated among a group of agents (commonly studied in fair division). The second model deals with two-sided preferences, where a set of workers and firms, each having numerical valuations for the other side, are matched with each other (commonly studied in matching-under-preferences literature). We study these models under capacity constraints, which restrict the number of items ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14007","kind":"arxiv","version":3},"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/2411.14007/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":"2411.14007","created_at":"2026-07-05T11:03:54.094799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14007v3","created_at":"2026-07-05T11:03:54.094799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14007","created_at":"2026-07-05T11:03:54.094799+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONODBIEHPZL4","created_at":"2026-07-05T11:03:54.094799+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONODBIEHPZL4YWME","created_at":"2026-07-05T11:03:54.094799+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONODBIEH","created_at":"2026-07-05T11:03:54.094799+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/ONODBIEHPZL4YWMEGP7M5T3PSK","json":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK.json","graph_json":"https://pith.science/api/pith-number/ONODBIEHPZL4YWMEGP7M5T3PSK/graph.json","events_json":"https://pith.science/api/pith-number/ONODBIEHPZL4YWMEGP7M5T3PSK/events.json","paper":"https://pith.science/paper/ONODBIEH"},"agent_actions":{"view_html":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK","download_json":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK.json","view_paper":"https://pith.science/paper/ONODBIEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14007&json=true","fetch_graph":"https://pith.science/api/pith-number/ONODBIEHPZL4YWMEGP7M5T3PSK/graph.json","fetch_events":"https://pith.science/api/pith-number/ONODBIEHPZL4YWMEGP7M5T3PSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK/action/storage_attestation","attest_author":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK/action/author_attestation","sign_citation":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK/action/citation_signature","submit_replication":"https://pith.science/pith/ONODBIEHPZL4YWMEGP7M5T3PSK/action/replication_record"}},"created_at":"2026-07-05T11:03:54.094799+00:00","updated_at":"2026-07-05T11:03:54.094799+00:00"}