{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TONPXP7VZZA642FCQWDXGZIYJE","short_pith_number":"pith:TONPXP7V","schema_version":"1.0","canonical_sha256":"9b9afbbff5ce41ee68a285877365184925b1be5dc9a3822a920e5cea0929078c","source":{"kind":"arxiv","id":"1412.6265","version":2},"attestation_state":"computed","paper":{"title":"Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.GT","authors_text":"Amit Daniely, Gal Shahaf, Michael Schapira","submitted_at":"2014-12-19T09:57:07Z","abstract_excerpt":"Algorithmic mechanism design (AMD) studies the delicate interplay between computational efficiency, truthfulness, and optimality. We focus on AMD's paradigmatic problem: combinatorial auctions. We present a new generalization of the VC dimension to multivalued collections of functions, which encompasses the classical VC dimension, Natarajan dimension, and Steele dimension. We present a corresponding generalization of the Sauer-Shelah Lemma and harness this VC machinery to establish inapproximability results for deterministic truthful mechanisms. Our results essentially unify all inapproximabil"},"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":"1412.6265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T09:57:07Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"0a70596a77e228930d13a5d6b8e98061ffeb84165c198a078a36bfd8c2df8c2b","abstract_canon_sha256":"acb1ed29e363dac00384b8f858b0e0dfec8f3b028bc6c67daa89e07a3112ca16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:35.742631Z","signature_b64":"ERWr67yO2kPQCRd3MpKdj/k346sIrFOhjqog5vZwTKT/K416PtGMAc2if7gENwGrYQhJE9KAngzriYgJpmmwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9afbbff5ce41ee68a285877365184925b1be5dc9a3822a920e5cea0929078c","last_reissued_at":"2026-05-18T02:19:35.741810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:35.741810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.GT","authors_text":"Amit Daniely, Gal Shahaf, Michael Schapira","submitted_at":"2014-12-19T09:57:07Z","abstract_excerpt":"Algorithmic mechanism design (AMD) studies the delicate interplay between computational efficiency, truthfulness, and optimality. We focus on AMD's paradigmatic problem: combinatorial auctions. We present a new generalization of the VC dimension to multivalued collections of functions, which encompasses the classical VC dimension, Natarajan dimension, and Steele dimension. We present a corresponding generalization of the Sauer-Shelah Lemma and harness this VC machinery to establish inapproximability results for deterministic truthful mechanisms. Our results essentially unify all inapproximabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6265","kind":"arxiv","version":2},"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":"1412.6265","created_at":"2026-05-18T02:19:35.741926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6265v2","created_at":"2026-05-18T02:19:35.741926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6265","created_at":"2026-05-18T02:19:35.741926+00:00"},{"alias_kind":"pith_short_12","alias_value":"TONPXP7VZZA6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TONPXP7VZZA642FC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TONPXP7V","created_at":"2026-05-18T12:28:49.207871+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/TONPXP7VZZA642FCQWDXGZIYJE","json":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE.json","graph_json":"https://pith.science/api/pith-number/TONPXP7VZZA642FCQWDXGZIYJE/graph.json","events_json":"https://pith.science/api/pith-number/TONPXP7VZZA642FCQWDXGZIYJE/events.json","paper":"https://pith.science/paper/TONPXP7V"},"agent_actions":{"view_html":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE","download_json":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE.json","view_paper":"https://pith.science/paper/TONPXP7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6265&json=true","fetch_graph":"https://pith.science/api/pith-number/TONPXP7VZZA642FCQWDXGZIYJE/graph.json","fetch_events":"https://pith.science/api/pith-number/TONPXP7VZZA642FCQWDXGZIYJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE/action/storage_attestation","attest_author":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE/action/author_attestation","sign_citation":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE/action/citation_signature","submit_replication":"https://pith.science/pith/TONPXP7VZZA642FCQWDXGZIYJE/action/replication_record"}},"created_at":"2026-05-18T02:19:35.741926+00:00","updated_at":"2026-05-18T02:19:35.741926+00:00"}