{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BVRQ6FMUDT5Q53IL6ZNHIJGIWT","short_pith_number":"pith:BVRQ6FMU","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"},"canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","source":{"kind":"arxiv","id":"2005.07370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.07370","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2005.07370v2","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07370","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"BVRQ6FMUDT5Q","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"BVRQ6FMUDT5Q53IL","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"BVRQ6FMU","created_at":"2026-07-05T01:16:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BVRQ6FMUDT5Q53IL6ZNHIJGIWT","target":"record","payload":{"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"},"canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","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"},"source_kind":"arxiv","source_id":"2005.07370","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-05T01:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5Dk8ORCGuNGz71S1tbmYsAxsylo8i/yHPLV8SqCmxffM9pDbhGvSs5Iuq6yWh6bzCEePiMcS/SDcp8z1KJNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:33:36.163585Z"},"content_sha256":"e36410d7713159e84fa5cef3f360cf3935b95b52e15282c9eb9c77cd53ffa7fe","schema_version":"1.0","event_id":"sha256:e36410d7713159e84fa5cef3f360cf3935b95b52e15282c9eb9c77cd53ffa7fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BVRQ6FMUDT5Q53IL6ZNHIJGIWT","target":"graph","payload":{"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"},"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-05T01:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+em+rlElm3jCDO3on59/jf24W9/w/5w/WxdjEqybJwTDgXByhkt+GX/NorIk22prjI67N0d4GypVDoFEd5SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:33:36.164174Z"},"content_sha256":"ff0d940ecfa3342b06589f4c88587b90ded60cd35e64cf989c1e840834e6ee81","schema_version":"1.0","event_id":"sha256:ff0d940ecfa3342b06589f4c88587b90ded60cd35e64cf989c1e840834e6ee81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/bundle.json","state_url":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/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-09T19:33:36Z","links":{"resolver":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT","bundle":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/bundle.json","state":"https://pith.science/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVRQ6FMUDT5Q53IL6ZNHIJGIWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BVRQ6FMUDT5Q53IL6ZNHIJGIWT","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":"a25d8ef287014033ca59daee3c492f396129a08cd33987ebb8f6d87a24ee4759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-15T05:57:26Z","title_canon_sha256":"25ee3b9e3fbee6541d1642b8c5dca1aaae6f94a630d04a2d741228384c8926e5"},"schema_version":"1.0","source":{"id":"2005.07370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.07370","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"2005.07370v2","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07370","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"BVRQ6FMUDT5Q","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_16","alias_value":"BVRQ6FMUDT5Q53IL","created_at":"2026-07-05T01:16:15Z"},{"alias_kind":"pith_short_8","alias_value":"BVRQ6FMU","created_at":"2026-07-05T01:16:15Z"}],"graph_snapshots":[{"event_id":"sha256:ff0d940ecfa3342b06589f4c88587b90ded60cd35e64cf989c1e840834e6ee81","target":"graph","created_at":"2026-07-05T01:16:15Z","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/2005.07370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anand Krishna, Ranjani G. Sundaram, Siddharth Barman, Umang Bhaskar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-15T05:57:26Z","title":"Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07370","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:e36410d7713159e84fa5cef3f360cf3935b95b52e15282c9eb9c77cd53ffa7fe","target":"record","created_at":"2026-07-05T01:16:15Z","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":"a25d8ef287014033ca59daee3c492f396129a08cd33987ebb8f6d87a24ee4759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-05-15T05:57:26Z","title_canon_sha256":"25ee3b9e3fbee6541d1642b8c5dca1aaae6f94a630d04a2d741228384c8926e5"},"schema_version":"1.0","source":{"id":"2005.07370","kind":"arxiv","version":2}},"canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d630f15941cfb0eed0bf65a7424c8b4ce51672661d5a57367ca6cafa707aab2","first_computed_at":"2026-07-05T01:16:15.099365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:15.099365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vw/ANoLe1ealbKDyHNPkbcFiWDEHe6W13Spw/UKosMiIPHnXqsoysFfiU4IrZe1/OguTcgeLeB9fTg0H/P+tCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:15.099959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.07370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e36410d7713159e84fa5cef3f360cf3935b95b52e15282c9eb9c77cd53ffa7fe","sha256:ff0d940ecfa3342b06589f4c88587b90ded60cd35e64cf989c1e840834e6ee81"],"state_sha256":"9e404079dc0e9f2a821ea36114bb21f65c6a422d1336db449e5aa6d39dd4db83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5bLPiS9WVFpJOYdo+X/FxfE6GWZeQws9KsPpjRlLivfmITS0cXX2C9mjEG42H1uSk5GuzAj4NxCCwbnsRTCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:33:36.172561Z","bundle_sha256":"05feaebffb89a56cc28b4ac0841b25e673c9f1517e2706007287847dea162b88"}}