{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WX2YEC4I463WSIJ764PMIZIFW7","short_pith_number":"pith:WX2YEC4I","schema_version":"1.0","canonical_sha256":"b5f5820b88e7b769213ff71ec46505b7f6f6cca0e6d3b2c9922c499499641ff1","source":{"kind":"arxiv","id":"2202.10678","version":1},"attestation_state":"computed","paper":{"title":"Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","econ.TH"],"primary_cat":"cs.AI","authors_text":"Haifeng Xu, Jibang Wu, Michael I. Jordan, Zhaoran Wang, Zhe Feng, Zhuoran Yang, Zixuan Zhang","submitted_at":"2022-02-22T05:41:43Z","abstract_excerpt":"In today's economy, it becomes important for Internet platforms to consider the sequential information design problem to align its long term interest with incentives of the gig service providers. This paper proposes a novel model of sequential information design, namely the Markov persuasion processes (MPPs), where a sender, with informational advantage, seeks to persuade a stream of myopic receivers to take actions that maximizes the sender's cumulative utilities in a finite horizon Markovian environment with varying prior and utility functions. Planning in MPPs thus faces the unique challeng"},"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":"2202.10678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-02-22T05:41:43Z","cross_cats_sorted":["cs.GT","cs.LG","econ.TH"],"title_canon_sha256":"f713e830b40ac1f6702eb8f72a0f476a902280624131febebe5f50b6fc4f2ff5","abstract_canon_sha256":"3c4db11a287b3e61a46906674cc50a01b0e76f9b400c42110489eb778c27b042"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:07.211705Z","signature_b64":"KetBW2pPvMsos6mw/FCcivmK/Y83NJJ9MFKZvmFkL8Z9+eU+XDhbiu7LbjDOz3stumA3iiaCPGC5fr2pwjSQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5f5820b88e7b769213ff71ec46505b7f6f6cca0e6d3b2c9922c499499641ff1","last_reissued_at":"2026-07-05T03:59:07.211269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:07.211269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","econ.TH"],"primary_cat":"cs.AI","authors_text":"Haifeng Xu, Jibang Wu, Michael I. Jordan, Zhaoran Wang, Zhe Feng, Zhuoran Yang, Zixuan Zhang","submitted_at":"2022-02-22T05:41:43Z","abstract_excerpt":"In today's economy, it becomes important for Internet platforms to consider the sequential information design problem to align its long term interest with incentives of the gig service providers. This paper proposes a novel model of sequential information design, namely the Markov persuasion processes (MPPs), where a sender, with informational advantage, seeks to persuade a stream of myopic receivers to take actions that maximizes the sender's cumulative utilities in a finite horizon Markovian environment with varying prior and utility functions. Planning in MPPs thus faces the unique challeng"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10678","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/2202.10678/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":"2202.10678","created_at":"2026-07-05T03:59:07.211339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.10678v1","created_at":"2026-07-05T03:59:07.211339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10678","created_at":"2026-07-05T03:59:07.211339+00:00"},{"alias_kind":"pith_short_12","alias_value":"WX2YEC4I463W","created_at":"2026-07-05T03:59:07.211339+00:00"},{"alias_kind":"pith_short_16","alias_value":"WX2YEC4I463WSIJ7","created_at":"2026-07-05T03:59:07.211339+00:00"},{"alias_kind":"pith_short_8","alias_value":"WX2YEC4I","created_at":"2026-07-05T03:59:07.211339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15331","citing_title":"Learning to Persuade a Biased Receiver","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7","json":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7.json","graph_json":"https://pith.science/api/pith-number/WX2YEC4I463WSIJ764PMIZIFW7/graph.json","events_json":"https://pith.science/api/pith-number/WX2YEC4I463WSIJ764PMIZIFW7/events.json","paper":"https://pith.science/paper/WX2YEC4I"},"agent_actions":{"view_html":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7","download_json":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7.json","view_paper":"https://pith.science/paper/WX2YEC4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.10678&json=true","fetch_graph":"https://pith.science/api/pith-number/WX2YEC4I463WSIJ764PMIZIFW7/graph.json","fetch_events":"https://pith.science/api/pith-number/WX2YEC4I463WSIJ764PMIZIFW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7/action/storage_attestation","attest_author":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7/action/author_attestation","sign_citation":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7/action/citation_signature","submit_replication":"https://pith.science/pith/WX2YEC4I463WSIJ764PMIZIFW7/action/replication_record"}},"created_at":"2026-07-05T03:59:07.211339+00:00","updated_at":"2026-07-05T03:59:07.211339+00:00"}