{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RNF4FM4MXDWFUCZJIX4352AWHP","short_pith_number":"pith:RNF4FM4M","schema_version":"1.0","canonical_sha256":"8b4bc2b38cb8ec5a0b2945f9bee8163be83ba12a72cef777560224245da1e57a","source":{"kind":"arxiv","id":"1604.01971","version":1},"attestation_state":"computed","paper":{"title":"Computational Efficiency Requires Simple Taxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shahar Dobzinski","submitted_at":"2016-04-07T12:13:12Z","abstract_excerpt":"We characterize the communication complexity of truthful mechanisms. Our departure point is the well known taxation principle. The taxation principle asserts that every truthful mechanism can be interpreted as follows: every player is presented with a menu that consists of a price for each bundle (the prices depend only on the valuations of the other players). Each player is allocated a bundle that maximizes his profit according to this menu. We define the taxation complexity of a truthful mechanism to be the logarithm of the maximum number of menus that may be presented to a player.\n  Our mai"},"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":"1604.01971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-07T12:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"55b2c9c702b7da86504d08e9d5a4db4204aa18a7772d2b31ac5066a9abc86c50","abstract_canon_sha256":"8aea3d448094739492315e4a73df7e02c3ff9aa0214bbc9387eab2755262eb0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:31.541420Z","signature_b64":"bj9u4MScAcdbfgi68vgNHwl0XNxdIB9VjHdMwATC2sLN36R8b6e4yll8Vki7XS3dnC6gWbhbniGg/dsEJhAGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4bc2b38cb8ec5a0b2945f9bee8163be83ba12a72cef777560224245da1e57a","last_reissued_at":"2026-05-18T01:17:31.540841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:31.540841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Efficiency Requires Simple Taxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Shahar Dobzinski","submitted_at":"2016-04-07T12:13:12Z","abstract_excerpt":"We characterize the communication complexity of truthful mechanisms. Our departure point is the well known taxation principle. The taxation principle asserts that every truthful mechanism can be interpreted as follows: every player is presented with a menu that consists of a price for each bundle (the prices depend only on the valuations of the other players). Each player is allocated a bundle that maximizes his profit according to this menu. We define the taxation complexity of a truthful mechanism to be the logarithm of the maximum number of menus that may be presented to a player.\n  Our mai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01971","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":"1604.01971","created_at":"2026-05-18T01:17:31.540928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01971v1","created_at":"2026-05-18T01:17:31.540928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01971","created_at":"2026-05-18T01:17:31.540928+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNF4FM4MXDWF","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNF4FM4MXDWFUCZJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNF4FM4M","created_at":"2026-05-18T12:30:41.710351+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/RNF4FM4MXDWFUCZJIX4352AWHP","json":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP.json","graph_json":"https://pith.science/api/pith-number/RNF4FM4MXDWFUCZJIX4352AWHP/graph.json","events_json":"https://pith.science/api/pith-number/RNF4FM4MXDWFUCZJIX4352AWHP/events.json","paper":"https://pith.science/paper/RNF4FM4M"},"agent_actions":{"view_html":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP","download_json":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP.json","view_paper":"https://pith.science/paper/RNF4FM4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01971&json=true","fetch_graph":"https://pith.science/api/pith-number/RNF4FM4MXDWFUCZJIX4352AWHP/graph.json","fetch_events":"https://pith.science/api/pith-number/RNF4FM4MXDWFUCZJIX4352AWHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP/action/storage_attestation","attest_author":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP/action/author_attestation","sign_citation":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP/action/citation_signature","submit_replication":"https://pith.science/pith/RNF4FM4MXDWFUCZJIX4352AWHP/action/replication_record"}},"created_at":"2026-05-18T01:17:31.540928+00:00","updated_at":"2026-05-18T01:17:31.540928+00:00"}