{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NAJCOS6HPEWUWS6VPNMCMDA5IR","short_pith_number":"pith:NAJCOS6H","canonical_record":{"source":{"id":"1202.2792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T17:09:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a248fdd281fe4830bb130b981b75881c030bd4d7edd250db97dc94b390e180a6","abstract_canon_sha256":"0454d44914243ab34df310d750cf7d566c9ec2040829b7389ad2f1abb2370739"},"schema_version":"1.0"},"canonical_sha256":"6812274bc7792d4b4bd57b58260c1d446571c6bf6098b55ba05dad3cdae680b8","source":{"kind":"arxiv","id":"1202.2792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2792","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2792v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2792","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"NAJCOS6HPEWU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NAJCOS6HPEWUWS6V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NAJCOS6H","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NAJCOS6HPEWUWS6VPNMCMDA5IR","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T17:09:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a248fdd281fe4830bb130b981b75881c030bd4d7edd250db97dc94b390e180a6","abstract_canon_sha256":"0454d44914243ab34df310d750cf7d566c9ec2040829b7389ad2f1abb2370739"},"schema_version":"1.0"},"canonical_sha256":"6812274bc7792d4b4bd57b58260c1d446571c6bf6098b55ba05dad3cdae680b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.884030Z","signature_b64":"s+slD52LWHZ2PUgH9HOH60ZbQOv4X+SofqHWcUXBNHCIUvBACtPh/N4SIVl9DV0LKb/5WNYltVvHqH+t8dU+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6812274bc7792d4b4bd57b58260c1d446571c6bf6098b55ba05dad3cdae680b8","last_reissued_at":"2026-05-18T02:21:17.883305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.883305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2792","source_version":1,"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-05-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Weu2xn+vGrvlIo2S2Y5sHaCiQkVmq3LYvz8OCQrnb9pWd7E+ODq+pglgtRgjIpvNlqFNhZrTfxG5qEq5bWqrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:02:15.060759Z"},"content_sha256":"100465f96f2558d12870f92243d1e81726d80d1b7ac33ea490353158eada872e","schema_version":"1.0","event_id":"sha256:100465f96f2558d12870f92243d1e81726d80d1b7ac33ea490353158eada872e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NAJCOS6HPEWUWS6VPNMCMDA5IR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Jan Vondrak, Shahar Dobzinski","submitted_at":"2012-02-13T17:09:58Z","abstract_excerpt":"We present a new type of monotone submodular functions: \\emph{multi-peak submodular functions}. Roughly speaking, given a family of sets $\\cF$, we construct a monotone submodular function $f$ with a high value $f(S)$ for every set $S \\in {\\cF}$ (a \"peak\"), and a low value on every set that does not intersect significantly any set in $\\cF$.\n  We use this construction to show that a better than $(1-\\frac{1}{2e})$-approximation ($\\simeq 0.816$) for welfare maximization in combinatorial auctions with submodular valuations is (1) impossible in the communication model, (2) NP-hard in the computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2792","kind":"arxiv","version":1},"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"},"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-05-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koXMrkMF2mqmNT3mnZeu3E6tv4EFqHnoBcS9yaAzVKPD+Jf5t81mu6zn4z1BjTRKs9RPmSwMds8BVhqLGL1rBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:02:15.061101Z"},"content_sha256":"7fdb9a3a2c7a06bc48da020583cd9f5d74158a1f80d6f8fbf78f24eb4a4fcd78","schema_version":"1.0","event_id":"sha256:7fdb9a3a2c7a06bc48da020583cd9f5d74158a1f80d6f8fbf78f24eb4a4fcd78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/bundle.json","state_url":"https://pith.science/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/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-06-29T17:02:15Z","links":{"resolver":"https://pith.science/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR","bundle":"https://pith.science/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/bundle.json","state":"https://pith.science/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAJCOS6HPEWUWS6VPNMCMDA5IR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NAJCOS6HPEWUWS6VPNMCMDA5IR","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":"0454d44914243ab34df310d750cf7d566c9ec2040829b7389ad2f1abb2370739","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T17:09:58Z","title_canon_sha256":"a248fdd281fe4830bb130b981b75881c030bd4d7edd250db97dc94b390e180a6"},"schema_version":"1.0","source":{"id":"1202.2792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2792","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2792v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2792","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"NAJCOS6HPEWU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NAJCOS6HPEWUWS6V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NAJCOS6H","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:7fdb9a3a2c7a06bc48da020583cd9f5d74158a1f80d6f8fbf78f24eb4a4fcd78","target":"graph","created_at":"2026-05-18T02:21:17Z","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"},"paper":{"abstract_excerpt":"We present a new type of monotone submodular functions: \\emph{multi-peak submodular functions}. Roughly speaking, given a family of sets $\\cF$, we construct a monotone submodular function $f$ with a high value $f(S)$ for every set $S \\in {\\cF}$ (a \"peak\"), and a low value on every set that does not intersect significantly any set in $\\cF$.\n  We use this construction to show that a better than $(1-\\frac{1}{2e})$-approximation ($\\simeq 0.816$) for welfare maximization in combinatorial auctions with submodular valuations is (1) impossible in the communication model, (2) NP-hard in the computation","authors_text":"Jan Vondrak, Shahar Dobzinski","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T17:09:58Z","title":"On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2792","kind":"arxiv","version":1},"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:100465f96f2558d12870f92243d1e81726d80d1b7ac33ea490353158eada872e","target":"record","created_at":"2026-05-18T02:21:17Z","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":"0454d44914243ab34df310d750cf7d566c9ec2040829b7389ad2f1abb2370739","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T17:09:58Z","title_canon_sha256":"a248fdd281fe4830bb130b981b75881c030bd4d7edd250db97dc94b390e180a6"},"schema_version":"1.0","source":{"id":"1202.2792","kind":"arxiv","version":1}},"canonical_sha256":"6812274bc7792d4b4bd57b58260c1d446571c6bf6098b55ba05dad3cdae680b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6812274bc7792d4b4bd57b58260c1d446571c6bf6098b55ba05dad3cdae680b8","first_computed_at":"2026-05-18T02:21:17.883305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.883305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+slD52LWHZ2PUgH9HOH60ZbQOv4X+SofqHWcUXBNHCIUvBACtPh/N4SIVl9DV0LKb/5WNYltVvHqH+t8dU+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.884030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:100465f96f2558d12870f92243d1e81726d80d1b7ac33ea490353158eada872e","sha256:7fdb9a3a2c7a06bc48da020583cd9f5d74158a1f80d6f8fbf78f24eb4a4fcd78"],"state_sha256":"a14ba72c6ec7356053060bbebef083b398f2a5ec6b211ed67cc628a8b6d485db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0INLDDNgablAkXE+cAIq0DbUQXwl4ml+qx61YKhdllgarqN8Jlsabhq/oII8Vl/fhRKLF3e2wGboCf65U0IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:02:15.063015Z","bundle_sha256":"ea2c9ad705321993c677d548138fd10a9d12cc08f263aaf3693653d68436ef0a"}}