{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:666QDZ7U6ZLYNKRY6SEIM4YCU3","short_pith_number":"pith:666QDZ7U","canonical_record":{"source":{"id":"1103.0040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bdce53516eef8e6c8572d46ce072ddc7f0d4ec86efe74a49b394d611a21b2384","abstract_canon_sha256":"f0b188dd7abf57b8c79135aaefb4678a3ac5d680beb7d3f340f405941cc22e5a"},"schema_version":"1.0"},"canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","source":{"kind":"arxiv","id":"1103.0040","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0040","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0040v3","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0040","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"666QDZ7U6ZLY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"666QDZ7U6ZLYNKRY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"666QDZ7U","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:666QDZ7U6ZLYNKRY6SEIM4YCU3","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0040","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bdce53516eef8e6c8572d46ce072ddc7f0d4ec86efe74a49b394d611a21b2384","abstract_canon_sha256":"f0b188dd7abf57b8c79135aaefb4678a3ac5d680beb7d3f340f405941cc22e5a"},"schema_version":"1.0"},"canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.875770Z","signature_b64":"f4+sJI0P1O5FclbpSGdAVh/XR3WoCyClZ6A1iBziKR9A3Zv1RtaAoaZy9LbB/wy1LFTlOy4EhWK/uc3zHNFlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","last_reissued_at":"2026-05-18T04:24:05.875088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.875088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0040","source_version":3,"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:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ogOj03SfrzAcS0GJ85i+2d/XgxsIEr0D7dW8IkxKpUdYz/qX3lILmbzG/sJT/LcoJx7Cg0NAu3ik/H/TOglDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:45:07.352140Z"},"content_sha256":"606b2d88f6800fc356b07885a642313d4c9c9348f8f0dc138bce035f9b633c0d","schema_version":"1.0","event_id":"sha256:606b2d88f6800fc356b07885a642313d4c9c9348f8f0dc138bce035f9b633c0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:666QDZ7U6ZLYNKRY6SEIM4YCU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Qiqi Yan, Shaddin Dughmi, Tim Roughgarden","submitted_at":"2011-02-28T22:18:01Z","abstract_excerpt":"We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank sums (MRS), which encompass most concrete examples of submodular functions studied in this context, including coverage functions, matroid weighted-rank functions, and convex combinations thereof. Our approximation factor is the best possible, even for known and explicitly given coverage valuations, assuming P != NP. Ours is the first truthful-in-expectation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0040","kind":"arxiv","version":3},"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:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2Ywm03G/U3qYrPhNILLg5pXYQ1KRqMhDAM4nQDLLeA1rVX8KLiHf1cE1ELJXBLpJKP72IB2gZ1ht3ALfdkiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:45:07.352771Z"},"content_sha256":"37aa3422a30ed99315c28da19196b2d73d4b51bcc226c082c2ff294cad214c6a","schema_version":"1.0","event_id":"sha256:37aa3422a30ed99315c28da19196b2d73d4b51bcc226c082c2ff294cad214c6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/bundle.json","state_url":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/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-26T03:45:07Z","links":{"resolver":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3","bundle":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/bundle.json","state":"https://pith.science/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/666QDZ7U6ZLYNKRY6SEIM4YCU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:666QDZ7U6ZLYNKRY6SEIM4YCU3","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":"f0b188dd7abf57b8c79135aaefb4678a3ac5d680beb7d3f340f405941cc22e5a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","title_canon_sha256":"bdce53516eef8e6c8572d46ce072ddc7f0d4ec86efe74a49b394d611a21b2384"},"schema_version":"1.0","source":{"id":"1103.0040","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0040","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0040v3","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0040","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"666QDZ7U6ZLY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"666QDZ7U6ZLYNKRY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"666QDZ7U","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:37aa3422a30ed99315c28da19196b2d73d4b51bcc226c082c2ff294cad214c6a","target":"graph","created_at":"2026-05-18T04:24: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":"We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank sums (MRS), which encompass most concrete examples of submodular functions studied in this context, including coverage functions, matroid weighted-rank functions, and convex combinations thereof. Our approximation factor is the best possible, even for known and explicitly given coverage valuations, assuming P != NP. Ours is the first truthful-in-expectation ","authors_text":"Qiqi Yan, Shaddin Dughmi, Tim Roughgarden","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","title":"From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0040","kind":"arxiv","version":3},"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:606b2d88f6800fc356b07885a642313d4c9c9348f8f0dc138bce035f9b633c0d","target":"record","created_at":"2026-05-18T04:24: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":"f0b188dd7abf57b8c79135aaefb4678a3ac5d680beb7d3f340f405941cc22e5a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-28T22:18:01Z","title_canon_sha256":"bdce53516eef8e6c8572d46ce072ddc7f0d4ec86efe74a49b394d611a21b2384"},"schema_version":"1.0","source":{"id":"1103.0040","kind":"arxiv","version":3}},"canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7bd01e7f4f65786aa38f488867302a6dd40a171d7ec77b176906646408fbe87","first_computed_at":"2026-05-18T04:24:05.875088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.875088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4+sJI0P1O5FclbpSGdAVh/XR3WoCyClZ6A1iBziKR9A3Zv1RtaAoaZy9LbB/wy1LFTlOy4EhWK/uc3zHNFlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.875770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0040","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:606b2d88f6800fc356b07885a642313d4c9c9348f8f0dc138bce035f9b633c0d","sha256:37aa3422a30ed99315c28da19196b2d73d4b51bcc226c082c2ff294cad214c6a"],"state_sha256":"0314a6ed7d36f880750034d667c440e41a2b48daadec7efaa00cfd03b2e67f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNbQPmezY/LRiqssnR/e2JCnwHTJ0spo+HXBfq2Z/cZ98WxhVnnBGc2y+9Y+/r4x1/JRR/loxjYwo2EO/BMQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:45:07.356046Z","bundle_sha256":"1ced55410944948e9538f327c59cf5053eb95b055924f0aade8300948f5695de"}}