{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:J5UZMFHB2BBTKZQA3RLBZJJGIT","short_pith_number":"pith:J5UZMFHB","canonical_record":{"source":{"id":"1310.3153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-11T14:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"3a8849e9d4422e1066201e955b57bef94ab04fea0c47b7c67500e0095bdb2301","abstract_canon_sha256":"40e6804263fb3429993e658771b2054cca7be23fd24f5b891bca531a12699a67"},"schema_version":"1.0"},"canonical_sha256":"4f699614e1d043356600dc561ca52644ea66c53dadce48def472116f5c0994b6","source":{"kind":"arxiv","id":"1310.3153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3153","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3153v1","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3153","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"J5UZMFHB2BBT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J5UZMFHB2BBTKZQA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J5UZMFHB","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:J5UZMFHB2BBTKZQA3RLBZJJGIT","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-11T14:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"3a8849e9d4422e1066201e955b57bef94ab04fea0c47b7c67500e0095bdb2301","abstract_canon_sha256":"40e6804263fb3429993e658771b2054cca7be23fd24f5b891bca531a12699a67"},"schema_version":"1.0"},"canonical_sha256":"4f699614e1d043356600dc561ca52644ea66c53dadce48def472116f5c0994b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:44.893817Z","signature_b64":"CLf13hS114vSTzExOLt9ozMXce+j4zC1wcTEOtfGZY8MrGCWJfDWK7dFCEAGtwHu7NBr5v50KcS8+pLVx0SlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f699614e1d043356600dc561ca52644ea66c53dadce48def472116f5c0994b6","last_reissued_at":"2026-05-18T03:10:44.893274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:44.893274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3153","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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUhaYIfGkhGnP4WLz/wvD0sIgzjUgiIrNQc+TG5a1OQBLU9BndgDq/VnfeyK1///4CrGbLvsZVC2DwEXHQkdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:46:28.620387Z"},"content_sha256":"07b7ad3d95c089ea7b395af00dd9bf24fdf1ef0d97589a0278354ecb3d7fcbf4","schema_version":"1.0","event_id":"sha256:07b7ad3d95c089ea7b395af00dd9bf24fdf1ef0d97589a0278354ecb3d7fcbf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:J5UZMFHB2BBTKZQA3RLBZJJGIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Valuation Compressions in VCG-Based Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Starnberger, Monika Henzinger, Paul Duetting","submitted_at":"2013-10-11T14:58:51Z","abstract_excerpt":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3153","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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNkF9nvvE+bInJ4qN70rp3yDrYzq2ZTV77Wg+2wMwXP85rpywWs/KlYgrJ0vbxuyTUigBuGA8dJGopZrZy9JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:46:28.620732Z"},"content_sha256":"1ec72c6a616b64cbcb82f9bd009c7ed93bd88f9f2d946dba461ad0595ad208de","schema_version":"1.0","event_id":"sha256:1ec72c6a616b64cbcb82f9bd009c7ed93bd88f9f2d946dba461ad0595ad208de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/bundle.json","state_url":"https://pith.science/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/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-27T18:46:28Z","links":{"resolver":"https://pith.science/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT","bundle":"https://pith.science/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/bundle.json","state":"https://pith.science/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5UZMFHB2BBTKZQA3RLBZJJGIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:J5UZMFHB2BBTKZQA3RLBZJJGIT","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":"40e6804263fb3429993e658771b2054cca7be23fd24f5b891bca531a12699a67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-11T14:58:51Z","title_canon_sha256":"3a8849e9d4422e1066201e955b57bef94ab04fea0c47b7c67500e0095bdb2301"},"schema_version":"1.0","source":{"id":"1310.3153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3153","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3153v1","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3153","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"J5UZMFHB2BBT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"J5UZMFHB2BBTKZQA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"J5UZMFHB","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:1ec72c6a616b64cbcb82f9bd009c7ed93bd88f9f2d946dba461ad0595ad208de","target":"graph","created_at":"2026-05-18T03:10:44Z","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":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrict","authors_text":"Martin Starnberger, Monika Henzinger, Paul Duetting","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-11T14:58:51Z","title":"Valuation Compressions in VCG-Based Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3153","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:07b7ad3d95c089ea7b395af00dd9bf24fdf1ef0d97589a0278354ecb3d7fcbf4","target":"record","created_at":"2026-05-18T03:10:44Z","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":"40e6804263fb3429993e658771b2054cca7be23fd24f5b891bca531a12699a67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-11T14:58:51Z","title_canon_sha256":"3a8849e9d4422e1066201e955b57bef94ab04fea0c47b7c67500e0095bdb2301"},"schema_version":"1.0","source":{"id":"1310.3153","kind":"arxiv","version":1}},"canonical_sha256":"4f699614e1d043356600dc561ca52644ea66c53dadce48def472116f5c0994b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f699614e1d043356600dc561ca52644ea66c53dadce48def472116f5c0994b6","first_computed_at":"2026-05-18T03:10:44.893274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:44.893274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CLf13hS114vSTzExOLt9ozMXce+j4zC1wcTEOtfGZY8MrGCWJfDWK7dFCEAGtwHu7NBr5v50KcS8+pLVx0SlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:44.893817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07b7ad3d95c089ea7b395af00dd9bf24fdf1ef0d97589a0278354ecb3d7fcbf4","sha256:1ec72c6a616b64cbcb82f9bd009c7ed93bd88f9f2d946dba461ad0595ad208de"],"state_sha256":"e943c7444edcd56eac60a5d598c8a89b94f38e0bf957392621cfbdef339d5491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYpzv/aK2AsQ1pGfH++kdhszcWyNdyJelqdwgKFfL/psEIuG1tVRIiGLhTKlE4Sm/P/T/NCZfSmvEZJfrbEbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:46:28.622649Z","bundle_sha256":"c8de614fc09d7aa162c85c376549414cb8762b238691f32ba4292393ec5cd873"}}