{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BVRQ6FMUDT5Q53IL6ZNHIJGIWT","short_pith_number":"pith:BVRQ6FMU","schema_version":"1.0","canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","source":{"kind":"arxiv","id":"2005.07370","version":2},"attestation_state":"computed","paper":{"title":"Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anand Krishna, Ranjani G. Sundaram, Siddharth Barman, Umang Bhaskar","submitted_at":"2020-05-15T05:57:26Z","abstract_excerpt":"We develop polynomial-time algorithms for the fair and efficient allocation of indivisible goods among $n$ agents that have subadditive valuations over the goods. We first consider the Nash social welfare as our objective and design a polynomial-time algorithm that, in the value oracle model, finds an $8n$-approximation to the Nash optimal allocation. Subadditive valuations include XOS (fractionally subadditive) and submodular valuations as special cases. Our result, even for the special case of submodular valuations, improves upon the previously best known $O(n \\log n)$-approximation ratio of"},"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":"2005.07370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-15T05:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"25ee3b9e3fbee6541d1642b8c5dca1aaae6f94a630d04a2d741228384c8926e5","abstract_canon_sha256":"a25d8ef287014033ca59daee3c492f396129a08cd33987ebb8f6d87a24ee4759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:15.099959Z","signature_b64":"vw/ANoLe1ealbKDyHNPkbcFiWDEHe6W13Spw/UKosMiIPHnXqsoysFfiU4IrZe1/OguTcgeLeB9fTg0H/P+tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","last_reissued_at":"2026-07-05T01:16:15.099365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:15.099365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anand Krishna, Ranjani G. Sundaram, Siddharth Barman, Umang Bhaskar","submitted_at":"2020-05-15T05:57:26Z","abstract_excerpt":"We develop polynomial-time algorithms for the fair and efficient allocation of indivisible goods among $n$ agents that have subadditive valuations over the goods. We first consider the Nash social welfare as our objective and design a polynomial-time algorithm that, in the value oracle model, finds an $8n$-approximation to the Nash optimal allocation. Subadditive valuations include XOS (fractionally subadditive) and submodular valuations as special cases. Our result, even for the special case of submodular valuations, improves upon the previously best known $O(n \\log n)$-approximation ratio of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07370","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/2005.07370/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":"2005.07370","created_at":"2026-07-05T01:16:15.099452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07370v2","created_at":"2026-07-05T01:16:15.099452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07370","created_at":"2026-07-05T01:16:15.099452+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVRQ6FMUDT5Q","created_at":"2026-07-05T01:16:15.099452+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVRQ6FMUDT5Q53IL","created_at":"2026-07-05T01:16:15.099452+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVRQ6FMU","created_at":"2026-07-05T01:16:15.099452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10751","citing_title":"p-Mean Regret for Stochastic Bandits","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT","json":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT.json","graph_json":"https://pith.science/api/pith-number/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/graph.json","events_json":"https://pith.science/api/pith-number/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/events.json","paper":"https://pith.science/paper/BVRQ6FMU"},"agent_actions":{"view_html":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT","download_json":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT.json","view_paper":"https://pith.science/paper/BVRQ6FMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07370&json=true","fetch_graph":"https://pith.science/api/pith-number/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/graph.json","fetch_events":"https://pith.science/api/pith-number/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/action/storage_attestation","attest_author":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/action/author_attestation","sign_citation":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/action/citation_signature","submit_replication":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/action/replication_record"}},"created_at":"2026-07-05T01:16:15.099452+00:00","updated_at":"2026-07-05T01:16:15.099452+00:00"}