{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XCC2PNVLNAQFTQKXO56R6TOKMV","short_pith_number":"pith:XCC2PNVL","schema_version":"1.0","canonical_sha256":"b885a7b6ab682059c157777d1f4dca6575c3ac71da61cad65e4f125d926bf5c8","source":{"kind":"arxiv","id":"1202.2789","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.2789","created_at":"2026-05-18T02:21:17.892675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2789v1","created_at":"2026-05-18T02:21:17.892675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2789","created_at":"2026-05-18T02:21:17.892675+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCC2PNVLNAQF","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCC2PNVLNAQFTQKX","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCC2PNVL","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV","json":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV.json","graph_json":"https://pith.science/api/pith-number/XCC2PNVLNAQFTQKXO56R6TOKMV/graph.json","events_json":"https://pith.science/api/pith-number/XCC2PNVLNAQFTQKXO56R6TOKMV/events.json","paper":"https://pith.science/paper/XCC2PNVL"},"agent_actions":{"view_html":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV","download_json":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV.json","view_paper":"https://pith.science/paper/XCC2PNVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2789&json=true","fetch_graph":"https://pith.science/api/pith-number/XCC2PNVLNAQFTQKXO56R6TOKMV/graph.json","fetch_events":"https://pith.science/api/pith-number/XCC2PNVLNAQFTQKXO56R6TOKMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/action/storage_attestation","attest_author":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/action/author_attestation","sign_citation":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/action/citation_signature","submit_replication":"https://pith.science/pith/XCC2PNVLNAQFTQKXO56R6TOKMV/action/replication_record"}},"created_at":"2026-05-18T02:21:17.892675+00:00","updated_at":"2026-05-18T02:21:17.892675+00:00"}