{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:34ZLILNSXNUN2XOMRYSGQSOBG2","short_pith_number":"pith:34ZLILNS","canonical_record":{"source":{"id":"1412.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-29T00:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"aa6bb7cda1db244b3c96e233f08ffe4e9bf60f4cb0572192ccbc29bd547f6e38","abstract_canon_sha256":"2174cc452941a9d1ae71ed02911e5834e7fc8dfcf78ee9d17dfdf29ad6874a1a"},"schema_version":"1.0"},"canonical_sha256":"df32b42db2bb68dd5dcc8e246849c136a300a02884446ac68ddc0190e338f832","source":{"kind":"arxiv","id":"1412.0056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0056","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0056v1","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0056","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"34ZLILNSXNUN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"34ZLILNSXNUN2XOM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"34ZLILNS","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:34ZLILNSXNUN2XOMRYSGQSOBG2","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-29T00:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"aa6bb7cda1db244b3c96e233f08ffe4e9bf60f4cb0572192ccbc29bd547f6e38","abstract_canon_sha256":"2174cc452941a9d1ae71ed02911e5834e7fc8dfcf78ee9d17dfdf29ad6874a1a"},"schema_version":"1.0"},"canonical_sha256":"df32b42db2bb68dd5dcc8e246849c136a300a02884446ac68ddc0190e338f832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:31.467716Z","signature_b64":"TtiRhZqjksJsqoNdnctUKZHRUa0IPUXtb3jsh5YCTv+IomYZxZ4NEHViBahivgZ14onXqBlhJUSMgY5P9E0uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df32b42db2bb68dd5dcc8e246849c136a300a02884446ac68ddc0190e338f832","last_reissued_at":"2026-05-18T02:32:31.467370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:31.467370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0056","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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFo8vlnp16ORb8fUQGMQe2++BeddyD2XazxKY751mFFk4VzFlq/cEAXQcsji9xfvIJPyamoNL87zhFEZTmcTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:40:53.678767Z"},"content_sha256":"ef7464ba19e55bc418694fba927d6e3617ca7cf770f1734580a648725bd044f4","schema_version":"1.0","event_id":"sha256:ef7464ba19e55bc418694fba927d6e3617ca7cf770f1734580a648725bd044f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:34ZLILNSXNUN2XOMRYSGQSOBG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifiably Truthful Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Simina Br\\^anzei","submitted_at":"2014-11-29T00:51:23Z","abstract_excerpt":"It is typically expected that if a mechanism is truthful, then the agents would, indeed, truthfully report their private information. But why would an agent believe that the mechanism is truthful? We wish to design truthful mechanisms, whose truthfulness can be verified efficiently (in the computational sense). Our approach involves three steps: (i) specifying the structure of mechanisms, (ii) constructing a verification algorithm, and (iii) measuring the quality of verifiably truthful mechanisms. We demonstrate this approach using a case study: approximate mechanism design without money for f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0056","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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDEvmzTbF2xnhYZVsJhzV03tMtyIQ2WmElij6YCZaE7Ilgr7a1qUtrUctYAUqJg89f8ug+VGlI7kCpw263vHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:40:53.679494Z"},"content_sha256":"3ed80214551fb7485242d895d250c2c8b27ad050cdf02834fd9262ce4f9ec00c","schema_version":"1.0","event_id":"sha256:3ed80214551fb7485242d895d250c2c8b27ad050cdf02834fd9262ce4f9ec00c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/bundle.json","state_url":"https://pith.science/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/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-05-26T00:40:53Z","links":{"resolver":"https://pith.science/pith/34ZLILNSXNUN2XOMRYSGQSOBG2","bundle":"https://pith.science/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/bundle.json","state":"https://pith.science/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34ZLILNSXNUN2XOMRYSGQSOBG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:34ZLILNSXNUN2XOMRYSGQSOBG2","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":"2174cc452941a9d1ae71ed02911e5834e7fc8dfcf78ee9d17dfdf29ad6874a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-29T00:51:23Z","title_canon_sha256":"aa6bb7cda1db244b3c96e233f08ffe4e9bf60f4cb0572192ccbc29bd547f6e38"},"schema_version":"1.0","source":{"id":"1412.0056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0056","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0056v1","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0056","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"34ZLILNSXNUN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"34ZLILNSXNUN2XOM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"34ZLILNS","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:3ed80214551fb7485242d895d250c2c8b27ad050cdf02834fd9262ce4f9ec00c","target":"graph","created_at":"2026-05-18T02:32:31Z","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":"It is typically expected that if a mechanism is truthful, then the agents would, indeed, truthfully report their private information. But why would an agent believe that the mechanism is truthful? We wish to design truthful mechanisms, whose truthfulness can be verified efficiently (in the computational sense). Our approach involves three steps: (i) specifying the structure of mechanisms, (ii) constructing a verification algorithm, and (iii) measuring the quality of verifiably truthful mechanisms. We demonstrate this approach using a case study: approximate mechanism design without money for f","authors_text":"Ariel D. Procaccia, Simina Br\\^anzei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-29T00:51:23Z","title":"Verifiably Truthful Mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0056","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:ef7464ba19e55bc418694fba927d6e3617ca7cf770f1734580a648725bd044f4","target":"record","created_at":"2026-05-18T02:32:31Z","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":"2174cc452941a9d1ae71ed02911e5834e7fc8dfcf78ee9d17dfdf29ad6874a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-11-29T00:51:23Z","title_canon_sha256":"aa6bb7cda1db244b3c96e233f08ffe4e9bf60f4cb0572192ccbc29bd547f6e38"},"schema_version":"1.0","source":{"id":"1412.0056","kind":"arxiv","version":1}},"canonical_sha256":"df32b42db2bb68dd5dcc8e246849c136a300a02884446ac68ddc0190e338f832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df32b42db2bb68dd5dcc8e246849c136a300a02884446ac68ddc0190e338f832","first_computed_at":"2026-05-18T02:32:31.467370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:31.467370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TtiRhZqjksJsqoNdnctUKZHRUa0IPUXtb3jsh5YCTv+IomYZxZ4NEHViBahivgZ14onXqBlhJUSMgY5P9E0uBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:31.467716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef7464ba19e55bc418694fba927d6e3617ca7cf770f1734580a648725bd044f4","sha256:3ed80214551fb7485242d895d250c2c8b27ad050cdf02834fd9262ce4f9ec00c"],"state_sha256":"bdc3fb106e17a1dcbb7a767bfdf62d00afc784970e2fc5a067da2e8d824ab531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mulUMjnKIrPpsYJkHqQtCiV21hSnaxqUYBCwmgHZ98wOCPyz8+qQyWd7uAhIp3ERboyS2zmAG7V59ffu0kG0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:40:53.683450Z","bundle_sha256":"cb34c7f277bfcd0e05cdf457e6012e2cd373eb478c1dfe1ff6cc4b699597c860"}}