{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XCC2PNVLNAQFTQKXO56R6TOKMV","short_pith_number":"pith:XCC2PNVL","canonical_record":{"source":{"id":"1202.2789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T17:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"912505f10af2576fca8e4bfb173d53571927073682ef9fe6a57467c98a93c5ba","abstract_canon_sha256":"fc9daf8294cd51e5b23ecca3845b833e8920b44524e0117852c2303ba66631d8"},"schema_version":"1.0"},"canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","source":{"kind":"arxiv","id":"1202.2789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2789","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2789v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2789","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"XCC2PNVLNAQF","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XCC2PNVLNAQFTQKX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XCC2PNVL","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XCC2PNVLNAQFTQKXO56R6TOKMV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T17:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"912505f10af2576fca8e4bfb173d53571927073682ef9fe6a57467c98a93c5ba","abstract_canon_sha256":"fc9daf8294cd51e5b23ecca3845b833e8920b44524e0117852c2303ba66631d8"},"schema_version":"1.0"},"canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.893342Z","signature_b64":"RqwZWwWnBe4AZ4SarbBeP63Y8/mZcjyq5lvKURnPNNzLD97YR2MyBHkewI9UmuKVdCJhvxV6oPRwQRA5h7qcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","last_reissued_at":"2026-05-18T02:21:17.892550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.892550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2789","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":"x3cBqPvROjl3py06z4HhJ/hpnRs2US/8oNbgtegGl/5wecxRp1oy2FO8/VeYIP5R1ClfPzeb3uYEOazWiJKwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:56:24.230193Z"},"content_sha256":"f35b07d3cb1677c10a524a0e5f717f4349e9a39c6a955feb524147e14ed668d2","schema_version":"1.0","event_id":"sha256:f35b07d3cb1677c10a524a0e5f717f4349e9a39c6a955feb524147e14ed668d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XCC2PNVLNAQFTQKXO56R6TOKMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Computational Complexity of Truthfulness in Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jan Vondrak, Shahar Dobzinski","submitted_at":"2012-02-13T17:05:34Z","abstract_excerpt":"One of the fundamental questions of Algorithmic Mechanism Design is whether there exists an inherent clash between truthfulness and computational tractability: in particular, whether polynomial-time truthful mechanisms for combinatorial auctions are provably weaker in terms of approximation ratio than non-truthful ones. This question was very recently answered for universally truthful mechanisms for combinatorial auctions \\cite{D11}, and even for truthful-in-expectation mechanisms \\cite{DughmiV11}. However, both of these results are based on information-theoretic arguments for valuations given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2789","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":"BZt8RCZ8Y0bhzAQEpUAsoZRSK8sKqfGaVx5xt9lcdbsboH4dU+fdiifcbD54VLv6LnXRTbyUDcfnG6KaLNFfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:56:24.230539Z"},"content_sha256":"ee7d28bcd959ec6fa6c118e9a93c89748479799252d4ea2893c8f714024edb16","schema_version":"1.0","event_id":"sha256:ee7d28bcd959ec6fa6c118e9a93c89748479799252d4ea2893c8f714024edb16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/bundle.json","state_url":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/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-29T14:56:24Z","links":{"resolver":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV","bundle":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/bundle.json","state":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XCC2PNVLNAQFTQKXO56R6TOKMV","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":"fc9daf8294cd51e5b23ecca3845b833e8920b44524e0117852c2303ba66631d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T17:05:34Z","title_canon_sha256":"912505f10af2576fca8e4bfb173d53571927073682ef9fe6a57467c98a93c5ba"},"schema_version":"1.0","source":{"id":"1202.2789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2789","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2789v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2789","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"XCC2PNVLNAQF","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XCC2PNVLNAQFTQKX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XCC2PNVL","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:ee7d28bcd959ec6fa6c118e9a93c89748479799252d4ea2893c8f714024edb16","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":"One of the fundamental questions of Algorithmic Mechanism Design is whether there exists an inherent clash between truthfulness and computational tractability: in particular, whether polynomial-time truthful mechanisms for combinatorial auctions are provably weaker in terms of approximation ratio than non-truthful ones. This question was very recently answered for universally truthful mechanisms for combinatorial auctions \\cite{D11}, and even for truthful-in-expectation mechanisms \\cite{DughmiV11}. However, both of these results are based on information-theoretic arguments for valuations given","authors_text":"Jan Vondrak, Shahar Dobzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T17:05:34Z","title":"The Computational Complexity of Truthfulness in Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2789","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:f35b07d3cb1677c10a524a0e5f717f4349e9a39c6a955feb524147e14ed668d2","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":"fc9daf8294cd51e5b23ecca3845b833e8920b44524e0117852c2303ba66631d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T17:05:34Z","title_canon_sha256":"912505f10af2576fca8e4bfb173d53571927073682ef9fe6a57467c98a93c5ba"},"schema_version":"1.0","source":{"id":"1202.2789","kind":"arxiv","version":1}},"canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","first_computed_at":"2026-05-18T02:21:17.892550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.892550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RqwZWwWnBe4AZ4SarbBeP63Y8/mZcjyq5lvKURnPNNzLD97YR2MyBHkewI9UmuKVdCJhvxV6oPRwQRA5h7qcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.893342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f35b07d3cb1677c10a524a0e5f717f4349e9a39c6a955feb524147e14ed668d2","sha256:ee7d28bcd959ec6fa6c118e9a93c89748479799252d4ea2893c8f714024edb16"],"state_sha256":"27a024224e15e46a9fc73e661329672d908813de2c22cb44006ca003a2d171b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miDrl8rPP3WIoG1CjLBCtxjUibeP84G9sKO63IDA/o6umw7ZnV3vDo/kDglFOhhiONHJDwTn4YX0shqfI5vHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:56:24.232385Z","bundle_sha256":"704e95b930b5f3fa3603ef1a2ad016f05d5884eb60047fbdca22dbbe7bca60a1"}}