{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MH57MDJDHSIJ6TCMBYV22YLTTO","short_pith_number":"pith:MH57MDJD","schema_version":"1.0","canonical_sha256":"61fbf60d233c909f4c4c0e2bad61739ba3ed4568cb1e3528e7b6bc80ea1e2746","source":{"kind":"arxiv","id":"2007.12489","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Persuasion with Limited Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Hoefer, Niklas Hahn, Rann Smorodinsky, Ronen Gradwohl","submitted_at":"2020-07-24T12:30:38Z","abstract_excerpt":"The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the receiver. The goal is typically to design a (near-)optimal communication (or signaling) scheme for the sender. It enables the sender to disclose information to the receiver in a way as to incentivize her to take an action that is preferred by the sender. Finding the optimal signaling scheme is known to be computationally difficult in general. This hardness is further exacerbated when there is also a constraint on th"},"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":"2007.12489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-24T12:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"1a8ecb236df4018453dba8e3b422102eac71cc7e50a12887ce6e1400dc57d8fa","abstract_canon_sha256":"541dccbc6d437dc30f6f2d2fb15a2bda88a10c7fcb3fe936e5016c182f81b2b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:27.427111Z","signature_b64":"1RSc4gd5fSKlDPySVbdnvOMcKZJztht7Tc91BsKWXYGTD0gaZvY2tDIF667pMemnq5+JVk1g7MxjMB0nR/TOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61fbf60d233c909f4c4c0e2bad61739ba3ed4568cb1e3528e7b6bc80ea1e2746","last_reissued_at":"2026-07-05T02:50:27.426676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:27.426676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Persuasion with Limited Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Hoefer, Niklas Hahn, Rann Smorodinsky, Ronen Gradwohl","submitted_at":"2020-07-24T12:30:38Z","abstract_excerpt":"The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the receiver. The goal is typically to design a (near-)optimal communication (or signaling) scheme for the sender. It enables the sender to disclose information to the receiver in a way as to incentivize her to take an action that is preferred by the sender. Finding the optimal signaling scheme is known to be computationally difficult in general. This hardness is further exacerbated when there is also a constraint on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12489","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.12489/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.12489","created_at":"2026-07-05T02:50:27.426742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.12489v2","created_at":"2026-07-05T02:50:27.426742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12489","created_at":"2026-07-05T02:50:27.426742+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH57MDJDHSIJ","created_at":"2026-07-05T02:50:27.426742+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH57MDJDHSIJ6TCM","created_at":"2026-07-05T02:50:27.426742+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH57MDJD","created_at":"2026-07-05T02:50:27.426742+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/MH57MDJDHSIJ6TCMBYV22YLTTO","json":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO.json","graph_json":"https://pith.science/api/pith-number/MH57MDJDHSIJ6TCMBYV22YLTTO/graph.json","events_json":"https://pith.science/api/pith-number/MH57MDJDHSIJ6TCMBYV22YLTTO/events.json","paper":"https://pith.science/paper/MH57MDJD"},"agent_actions":{"view_html":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO","download_json":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO.json","view_paper":"https://pith.science/paper/MH57MDJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.12489&json=true","fetch_graph":"https://pith.science/api/pith-number/MH57MDJDHSIJ6TCMBYV22YLTTO/graph.json","fetch_events":"https://pith.science/api/pith-number/MH57MDJDHSIJ6TCMBYV22YLTTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO/action/storage_attestation","attest_author":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO/action/author_attestation","sign_citation":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO/action/citation_signature","submit_replication":"https://pith.science/pith/MH57MDJDHSIJ6TCMBYV22YLTTO/action/replication_record"}},"created_at":"2026-07-05T02:50:27.426742+00:00","updated_at":"2026-07-05T02:50:27.426742+00:00"}