{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6FNTA3M3AJSIU5B4RY7ZHBSRVG","short_pith_number":"pith:6FNTA3M3","schema_version":"1.0","canonical_sha256":"f15b306d9b02648a743c8e3f938651a9b08584291bb45bdbd48664f7e92148b2","source":{"kind":"arxiv","id":"1804.10512","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Verification for Obviously Strategyproof Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Carmine Ventre, Diodato Ferraioli","submitted_at":"2018-04-27T13:57:37Z","abstract_excerpt":"Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in [Ferraioli&Ventre, AAAI 2017], is to find a small (possibly, the smallest) set of conditions allowing to implement an OSP mechanism. To this aim, we define a model of probabilistic verification wherein agents are caught misbehaving with a certain probability, and show how OSP mechanisms can implement every social choice function at the cost of either imposing very large fi"},"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":"1804.10512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-27T13:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"4e7fa707d3858f55e78f01d7eee944193cf77a2c04d3de1adc7948466a4b5a3f","abstract_canon_sha256":"c8d797299f7110efdee81fbf8e27a213ca3cb3863ebe62ea8ab2b22b4ac65e32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:20.554942Z","signature_b64":"PmwBAYi2JEIuePk9yIcKIoro5aS6UsOsKax5pTisanspX77BqgkITfkDx6kcwATuoMsZxfh8M8p9QExCuQVhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15b306d9b02648a743c8e3f938651a9b08584291bb45bdbd48664f7e92148b2","last_reissued_at":"2026-05-18T00:17:20.554181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:20.554181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Verification for Obviously Strategyproof Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Carmine Ventre, Diodato Ferraioli","submitted_at":"2018-04-27T13:57:37Z","abstract_excerpt":"Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in [Ferraioli&Ventre, AAAI 2017], is to find a small (possibly, the smallest) set of conditions allowing to implement an OSP mechanism. To this aim, we define a model of probabilistic verification wherein agents are caught misbehaving with a certain probability, and show how OSP mechanisms can implement every social choice function at the cost of either imposing very large fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10512","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":"1804.10512","created_at":"2026-05-18T00:17:20.554266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10512v1","created_at":"2026-05-18T00:17:20.554266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10512","created_at":"2026-05-18T00:17:20.554266+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FNTA3M3AJSI","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FNTA3M3AJSIU5B4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FNTA3M3","created_at":"2026-05-18T12:32:08.215937+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/6FNTA3M3AJSIU5B4RY7ZHBSRVG","json":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG.json","graph_json":"https://pith.science/api/pith-number/6FNTA3M3AJSIU5B4RY7ZHBSRVG/graph.json","events_json":"https://pith.science/api/pith-number/6FNTA3M3AJSIU5B4RY7ZHBSRVG/events.json","paper":"https://pith.science/paper/6FNTA3M3"},"agent_actions":{"view_html":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG","download_json":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG.json","view_paper":"https://pith.science/paper/6FNTA3M3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10512&json=true","fetch_graph":"https://pith.science/api/pith-number/6FNTA3M3AJSIU5B4RY7ZHBSRVG/graph.json","fetch_events":"https://pith.science/api/pith-number/6FNTA3M3AJSIU5B4RY7ZHBSRVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG/action/storage_attestation","attest_author":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG/action/author_attestation","sign_citation":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG/action/citation_signature","submit_replication":"https://pith.science/pith/6FNTA3M3AJSIU5B4RY7ZHBSRVG/action/replication_record"}},"created_at":"2026-05-18T00:17:20.554266+00:00","updated_at":"2026-05-18T00:17:20.554266+00:00"}