{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NEJMNXDVJSYFQMIORTS2R4OFHR","short_pith_number":"pith:NEJMNXDV","canonical_record":{"source":{"id":"1011.1830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-08T15:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"59bc9a5ccbe7f98ea8a121e8f65cdfe5606ed721ef75ca0cdcd1894b54405d86","abstract_canon_sha256":"febe91b0b3062d6c67175a44cbd75a16bf3b1c6a1d50c2f49d5f2ae1861511f1"},"schema_version":"1.0"},"canonical_sha256":"6912c6dc754cb058310e8ce5a8f1c53c78d89d0e8d4b5418d76f8cdcc55b8d61","source":{"kind":"arxiv","id":"1011.1830","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1830","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1830v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1830","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"NEJMNXDVJSYF","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NEJMNXDVJSYFQMIO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NEJMNXDV","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NEJMNXDVJSYFQMIORTS2R4OFHR","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-08T15:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"59bc9a5ccbe7f98ea8a121e8f65cdfe5606ed721ef75ca0cdcd1894b54405d86","abstract_canon_sha256":"febe91b0b3062d6c67175a44cbd75a16bf3b1c6a1d50c2f49d5f2ae1861511f1"},"schema_version":"1.0"},"canonical_sha256":"6912c6dc754cb058310e8ce5a8f1c53c78d89d0e8d4b5418d76f8cdcc55b8d61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.348045Z","signature_b64":"Au83oRFS4FFRrSTfqUjiyzKCcd0rJ9xhV2BcKx3g1pTPCgEwJwZInQPWJsdRLZ7+FQmFEgmnfl3HdJs6qrYeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6912c6dc754cb058310e8ce5a8f1c53c78d89d0e8d4b5418d76f8cdcc55b8d61","last_reissued_at":"2026-05-18T02:23:37.347416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.347416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1830","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:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUViPVzPaqV/BRknYJ4xx5ncvkYmeithS7v/urd8MCvJ954u3dRCKHGFfKoM1Xg9drNIB0/BqI1P9N7CofoiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:20:14.800651Z"},"content_sha256":"b9efc2d7a285fc593ac00868c9bee714d20aa6f2b8dafb882d7d18aefb5f99f8","schema_version":"1.0","event_id":"sha256:b9efc2d7a285fc593ac00868c9bee714d20aa6f2b8dafb882d7d18aefb5f99f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NEJMNXDVJSYFQMIORTS2R4OFHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Impossibility Result for Truthful Combinatorial Auctions with Submodular Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shahar Dobzinski","submitted_at":"2010-11-08T15:42:56Z","abstract_excerpt":"We show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that provides $m^{\\frac 1 2 -\\epsilon}$ approximation to the social welfare and uses value queries only must use exponentially many value queries, where $m$ is the number of items. In contrast, ignoring incentives there exist constant ratio approximation algorithms for this problem. Our approach is based on a novel \\emph{direct hardness} approach and completely skips the notoriously hard characterization step. The characterization step was the main obstacle for proving impossibili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1830","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:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxVwbZVqSU1Ug5ktheZj2jWcmui4dLuMWoxbek2uzNoHGK7TBbegrLt3G/863p3OeFKYDvhFUQBDJOYgwk1ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:20:14.801021Z"},"content_sha256":"d5bb87799a102923174e6856251b37fc8eb1b2c7c54554872f14e928d0149a6e","schema_version":"1.0","event_id":"sha256:d5bb87799a102923174e6856251b37fc8eb1b2c7c54554872f14e928d0149a6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/bundle.json","state_url":"https://pith.science/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/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-29T19:20:14Z","links":{"resolver":"https://pith.science/pith/NEJMNXDVJSYFQMIORTS2R4OFHR","bundle":"https://pith.science/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/bundle.json","state":"https://pith.science/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEJMNXDVJSYFQMIORTS2R4OFHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NEJMNXDVJSYFQMIORTS2R4OFHR","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":"febe91b0b3062d6c67175a44cbd75a16bf3b1c6a1d50c2f49d5f2ae1861511f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-08T15:42:56Z","title_canon_sha256":"59bc9a5ccbe7f98ea8a121e8f65cdfe5606ed721ef75ca0cdcd1894b54405d86"},"schema_version":"1.0","source":{"id":"1011.1830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1830","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1830v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1830","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"NEJMNXDVJSYF","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NEJMNXDVJSYFQMIO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NEJMNXDV","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:d5bb87799a102923174e6856251b37fc8eb1b2c7c54554872f14e928d0149a6e","target":"graph","created_at":"2026-05-18T02:23:37Z","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 show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that provides $m^{\\frac 1 2 -\\epsilon}$ approximation to the social welfare and uses value queries only must use exponentially many value queries, where $m$ is the number of items. In contrast, ignoring incentives there exist constant ratio approximation algorithms for this problem. Our approach is based on a novel \\emph{direct hardness} approach and completely skips the notoriously hard characterization step. The characterization step was the main obstacle for proving impossibili","authors_text":"Shahar Dobzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-08T15:42:56Z","title":"An Impossibility Result for Truthful Combinatorial Auctions with Submodular Valuations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1830","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:b9efc2d7a285fc593ac00868c9bee714d20aa6f2b8dafb882d7d18aefb5f99f8","target":"record","created_at":"2026-05-18T02:23:37Z","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":"febe91b0b3062d6c67175a44cbd75a16bf3b1c6a1d50c2f49d5f2ae1861511f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-08T15:42:56Z","title_canon_sha256":"59bc9a5ccbe7f98ea8a121e8f65cdfe5606ed721ef75ca0cdcd1894b54405d86"},"schema_version":"1.0","source":{"id":"1011.1830","kind":"arxiv","version":1}},"canonical_sha256":"6912c6dc754cb058310e8ce5a8f1c53c78d89d0e8d4b5418d76f8cdcc55b8d61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6912c6dc754cb058310e8ce5a8f1c53c78d89d0e8d4b5418d76f8cdcc55b8d61","first_computed_at":"2026-05-18T02:23:37.347416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.347416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Au83oRFS4FFRrSTfqUjiyzKCcd0rJ9xhV2BcKx3g1pTPCgEwJwZInQPWJsdRLZ7+FQmFEgmnfl3HdJs6qrYeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.348045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9efc2d7a285fc593ac00868c9bee714d20aa6f2b8dafb882d7d18aefb5f99f8","sha256:d5bb87799a102923174e6856251b37fc8eb1b2c7c54554872f14e928d0149a6e"],"state_sha256":"5e544e9e5b39835d080e1cf2989c0360b0339d62e64eba99f1a08e57191f675a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcE2LTOEpKxQIbLbiaZsImnwP0ncC3tuDNH0zVEnpSneulTMxgIwqvqFBmwxUGSW0AU+o/r56+wgI/hyn6g8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:20:14.803125Z","bundle_sha256":"86943aaed9fc00627d09ad27a0a9e47e67e78a574aea9f065f8c3e56ba95c32b"}}