{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QRQDBAGL7C7ZVLJJSTLAUCAWLU","short_pith_number":"pith:QRQDBAGL","schema_version":"1.0","canonical_sha256":"84603080cbf8bf9aad2994d60a08165d2bc6cc9edd2a363aa76a0651f6beecad","source":{"kind":"arxiv","id":"2106.06480","version":1},"attestation_state":"computed","paper":{"title":"Multi-Receiver Online Bayesian Persuasion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Andrea Celli, Matteo Castiglioni, Nicola Gatti","submitted_at":"2021-06-11T16:05:31Z","abstract_excerpt":"Bayesian persuasion studies how an informed sender should partially disclose information to influence the behavior of a self-interested receiver. Classical models make the stringent assumption that the sender knows the receiver's utility. This can be relaxed by considering an online learning framework in which the sender repeatedly faces a receiver of an unknown, adversarially selected type. We study, for the first time, an online Bayesian persuasion setting with multiple receivers. We focus on the case with no externalities and binary actions, as customary in offline models. Our goal is to de"},"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":"2106.06480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-06-11T16:05:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6523bedf5663ebabf9603195bff16382cddf9b49785d6ee5d4125ec8c39839bc","abstract_canon_sha256":"deea03f20c6916453a65baf39693de0dc09252db48954dff69e52f09a66bad34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:30.456089Z","signature_b64":"iuKyc9Hlu9Reaz2/kj/kZQidkVwbQG3yAyO8LMYFhOp4Jp0u+TCGZX2MvGs6TtZt4YpdW5lhW39x2P8A5YAPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84603080cbf8bf9aad2994d60a08165d2bc6cc9edd2a363aa76a0651f6beecad","last_reissued_at":"2026-07-05T02:48:30.455562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:30.455562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Receiver Online Bayesian Persuasion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Andrea Celli, Matteo Castiglioni, Nicola Gatti","submitted_at":"2021-06-11T16:05:31Z","abstract_excerpt":"Bayesian persuasion studies how an informed sender should partially disclose information to influence the behavior of a self-interested receiver. Classical models make the stringent assumption that the sender knows the receiver's utility. This can be relaxed by considering an online learning framework in which the sender repeatedly faces a receiver of an unknown, adversarially selected type. We study, for the first time, an online Bayesian persuasion setting with multiple receivers. We focus on the case with no externalities and binary actions, as customary in offline models. Our goal is to de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06480","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06480/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":"2106.06480","created_at":"2026-07-05T02:48:30.455622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.06480v1","created_at":"2026-07-05T02:48:30.455622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06480","created_at":"2026-07-05T02:48:30.455622+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRQDBAGL7C7Z","created_at":"2026-07-05T02:48:30.455622+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRQDBAGL7C7ZVLJJ","created_at":"2026-07-05T02:48:30.455622+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRQDBAGL","created_at":"2026-07-05T02:48:30.455622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12094","citing_title":"Bayesian Persuasion with a Risk-Conscious Receiver","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU","json":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU.json","graph_json":"https://pith.science/api/pith-number/QRQDBAGL7C7ZVLJJSTLAUCAWLU/graph.json","events_json":"https://pith.science/api/pith-number/QRQDBAGL7C7ZVLJJSTLAUCAWLU/events.json","paper":"https://pith.science/paper/QRQDBAGL"},"agent_actions":{"view_html":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU","download_json":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU.json","view_paper":"https://pith.science/paper/QRQDBAGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.06480&json=true","fetch_graph":"https://pith.science/api/pith-number/QRQDBAGL7C7ZVLJJSTLAUCAWLU/graph.json","fetch_events":"https://pith.science/api/pith-number/QRQDBAGL7C7ZVLJJSTLAUCAWLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU/action/storage_attestation","attest_author":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU/action/author_attestation","sign_citation":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU/action/citation_signature","submit_replication":"https://pith.science/pith/QRQDBAGL7C7ZVLJJSTLAUCAWLU/action/replication_record"}},"created_at":"2026-07-05T02:48:30.455622+00:00","updated_at":"2026-07-05T02:48:30.455622+00:00"}