{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BPJIYAEELM756MTTLSYGWMHKL6","short_pith_number":"pith:BPJIYAEE","canonical_record":{"source":{"id":"1109.1055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-06T04:22:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a7d61a9d385bbfa38a0b75d1e02a55ff36285a0224ccf625f2689293c9385d58","abstract_canon_sha256":"095c47cc93a38772a86e9058b2e4be3e5b4f67c2a99f65ce2ba437f412296383"},"schema_version":"1.0"},"canonical_sha256":"0bd28c00845b3fdf32735cb06b30ea5fa67908f5a106e3f8b6462ffa95393055","source":{"kind":"arxiv","id":"1109.1055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1055","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1055v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1055","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"BPJIYAEELM75","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BPJIYAEELM756MTT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BPJIYAEE","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BPJIYAEELM756MTTLSYGWMHKL6","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-06T04:22:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a7d61a9d385bbfa38a0b75d1e02a55ff36285a0224ccf625f2689293c9385d58","abstract_canon_sha256":"095c47cc93a38772a86e9058b2e4be3e5b4f67c2a99f65ce2ba437f412296383"},"schema_version":"1.0"},"canonical_sha256":"0bd28c00845b3fdf32735cb06b30ea5fa67908f5a106e3f8b6462ffa95393055","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.498348Z","signature_b64":"ZZsLc0oJoF4K07UctOkJyQi1HJe687KvwmlnnZmDyH7NUAvW44puxWwTTfdCdkhyTLpj9UU9wYnPAnb/lIkdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bd28c00845b3fdf32735cb06b30ea5fa67908f5a106e3f8b6462ffa95393055","last_reissued_at":"2026-05-18T04:14:05.497869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.497869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1055","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWCFm3EWwUMU6jvmQSguhwRrW3YW0UEQAgxmYHzSMBAy1lMKlepZcaX24lpk5FbzGdSvFvyWijz+KF+uW9SMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:43:29.403908Z"},"content_sha256":"57ebf08f3d09a491cad1cfdcf134a87c3722c4214b766c42d14284eb95bd6e6f","schema_version":"1.0","event_id":"sha256:57ebf08f3d09a491cad1cfdcf134a87c3722c4214b766c42d14284eb95bd6e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BPJIYAEELM756MTTLSYGWMHKL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limitations of randomized mechanisms for combinatorial auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Jan Vondrak, Shaddin Dughmi","submitted_at":"2011-09-06T04:22:10Z","abstract_excerpt":"Recently, a randomized mechanism has been discovered [Dughmi, Roughgarden and Yan; STOC'11] for combinatorial auctions that is truthful in expectation and guarantees a (1-1/e)-approximation to the optimal social welfare when players have coverage valuations. This approximation ratio is the best possible even for non-truthful algorithms, assuming $P \\neq NP$. Given the recent sequence of negative results for combinatorial auctions under more restrictive notions of incentive compatibility, this development raises a natural question: Are truthful-in-expectation mechanisms compatible with polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1055","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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEnfjjiHBUnrxy//oVE6FIB76zdZQhUgvHKVmG9yv9C2KL9V3xT18MhV50a2X3dqXUvLG5GUCEsYDAq+RZYSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:43:29.404342Z"},"content_sha256":"b094d37ca924115c3bcbdc9bc0c5f6c248a287d3d7e1cb42dd595f8611bd96c4","schema_version":"1.0","event_id":"sha256:b094d37ca924115c3bcbdc9bc0c5f6c248a287d3d7e1cb42dd595f8611bd96c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPJIYAEELM756MTTLSYGWMHKL6/bundle.json","state_url":"https://pith.science/pith/BPJIYAEELM756MTTLSYGWMHKL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPJIYAEELM756MTTLSYGWMHKL6/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-05-26T12:43:29Z","links":{"resolver":"https://pith.science/pith/BPJIYAEELM756MTTLSYGWMHKL6","bundle":"https://pith.science/pith/BPJIYAEELM756MTTLSYGWMHKL6/bundle.json","state":"https://pith.science/pith/BPJIYAEELM756MTTLSYGWMHKL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPJIYAEELM756MTTLSYGWMHKL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BPJIYAEELM756MTTLSYGWMHKL6","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":"095c47cc93a38772a86e9058b2e4be3e5b4f67c2a99f65ce2ba437f412296383","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-06T04:22:10Z","title_canon_sha256":"a7d61a9d385bbfa38a0b75d1e02a55ff36285a0224ccf625f2689293c9385d58"},"schema_version":"1.0","source":{"id":"1109.1055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1055","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1055v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1055","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"BPJIYAEELM75","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BPJIYAEELM756MTT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BPJIYAEE","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:b094d37ca924115c3bcbdc9bc0c5f6c248a287d3d7e1cb42dd595f8611bd96c4","target":"graph","created_at":"2026-05-18T04:14:05Z","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":"Recently, a randomized mechanism has been discovered [Dughmi, Roughgarden and Yan; STOC'11] for combinatorial auctions that is truthful in expectation and guarantees a (1-1/e)-approximation to the optimal social welfare when players have coverage valuations. This approximation ratio is the best possible even for non-truthful algorithms, assuming $P \\neq NP$. Given the recent sequence of negative results for combinatorial auctions under more restrictive notions of incentive compatibility, this development raises a natural question: Are truthful-in-expectation mechanisms compatible with polynomi","authors_text":"Jan Vondrak, Shaddin Dughmi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-06T04:22:10Z","title":"Limitations of randomized mechanisms for combinatorial auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1055","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:57ebf08f3d09a491cad1cfdcf134a87c3722c4214b766c42d14284eb95bd6e6f","target":"record","created_at":"2026-05-18T04:14:05Z","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":"095c47cc93a38772a86e9058b2e4be3e5b4f67c2a99f65ce2ba437f412296383","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-06T04:22:10Z","title_canon_sha256":"a7d61a9d385bbfa38a0b75d1e02a55ff36285a0224ccf625f2689293c9385d58"},"schema_version":"1.0","source":{"id":"1109.1055","kind":"arxiv","version":1}},"canonical_sha256":"0bd28c00845b3fdf32735cb06b30ea5fa67908f5a106e3f8b6462ffa95393055","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bd28c00845b3fdf32735cb06b30ea5fa67908f5a106e3f8b6462ffa95393055","first_computed_at":"2026-05-18T04:14:05.497869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.497869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZZsLc0oJoF4K07UctOkJyQi1HJe687KvwmlnnZmDyH7NUAvW44puxWwTTfdCdkhyTLpj9UU9wYnPAnb/lIkdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.498348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57ebf08f3d09a491cad1cfdcf134a87c3722c4214b766c42d14284eb95bd6e6f","sha256:b094d37ca924115c3bcbdc9bc0c5f6c248a287d3d7e1cb42dd595f8611bd96c4"],"state_sha256":"96275e38732456af9ad41d71f088d5b92bd9c0f945b54a1b8970bf9b9d734608"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHfGpNsUYIPqRRwJZdKwnqo0dRumpk4+/2tIuTEMrIrqKzla9jcl6fmUez1Y1p5nvDVZ7gGLSkkEq2tQxlI0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:43:29.406823Z","bundle_sha256":"b8be60275e94dae950d028f3faee8dd81e93e753cad8017243759e7a097155a2"}}