{"paper":{"title":"Designing Information in a Forest: Algorithmic Aspects","arxiv_id":"2611.16327","primary_cat":"cs.GT","submitted_at":"2026-11-12T05:49:55+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"The Bayesian persuasion framework models strategic information revelation by a sender to one or more receivers.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.92,"id":"s1","own":false,"role":"contribution","text":"We study an intricate version of the multi-receiver persuasion setting in which the communication hierarchy is a forest - i.e., some receivers observe more informative signals than others, and the partial ordering of the receivers according to the information they get is represented by a pre-specified directed forest.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.43,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.04,"result":0.0,"background":0.04,"limitation":0.0,"future_work":0.0,"contribution":0.92,"interpretation":0.0}},{"i":2,"p":0.49,"id":"s2","own":false,"role":"interpretation","text":"This model naturally captures interactions in hierarchical organizations, and it lies in between the two most commonly studied versions of Bayesian persuasion: private persuasion and public persuasion.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.19,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.49,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.0,"background":0.48,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.49}},{"i":3,"p":0.59,"id":"s3","own":true,"role":"method","text":"Inspired by the classic model of private persuasion, we focus on a setting with a binary state of nature and binary-action heterogeneous receivers s.t. the sender's utility is a monotone function of the set of receivers taking a specific desirable action.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.51,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.45,"role_probabilities":{"gap":0.0,"method":0.59,"result":0.0,"background":0.23,"limitation":0.0,"future_work":0.0,"contribution":0.18,"interpretation":0.0}},{"i":4,"p":0.62,"id":"s4","own":true,"role":"contribution","text":"We extend the computational tractability result for symmetric sender's utility from private persuasion to the forest hierarchy framework using methodology inspired by optimal transport theory.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.16,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.36,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.62,"interpretation":0.0}},{"i":5,"p":0.77,"id":"s5","own":true,"role":"result","text":"We further provide a polynomial-time algorithm when the sender's utility is modular.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.1,"quantitative":false,"quantitative_p":0.32,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.77,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.23,"interpretation":0.0}},{"i":6,"p":0.95,"id":"s6","own":true,"role":"result","text":"On the negative side, we show that, unlike in private persuasion, the case of a supermodular sender's utility function leads to an NP-hard optimization problem which further does not admit an FPTAS unless P=NP; this result holds even when each tree component of the forest is a chain of 3 receivers.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.24,"quantitative":true,"quantitative_p":0.9,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.95,"background":0.0,"limitation":0.03,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":7,"p":0.58,"id":"s7","own":true,"role":"contribution","text":"To complement the hardness result, we provide a simple approximation algorithm with the approximation ratio depending linearly on the depth of the forest hierarchy.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.08,"quantitative":true,"quantitative_p":0.68,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.42,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.58,"interpretation":0.0}},{"i":8,"p":0.54,"id":"s8","own":true,"role":"contribution","text":"We further provide an analogous algorithm for the submodular utility case.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.46,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.54,"interpretation":0.0}},{"i":9,"p":0.92,"id":"s9","own":true,"role":"result","text":"Finally, beyond forest communication hierarchies, we rule out an FPTAS for the sender's optimal utility even in the symmetric utility case, unless P=NP.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.2,"quantitative":false,"quantitative_p":0.27,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.92,"background":0.0,"limitation":0.04,"future_work":0.0,"contribution":0.04,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.45,"text":"On the negative side, we show that, unlike in private persuasion, the case of a supermodular sender's utility function leads to an NP-hard optimization problem which further does not admit an FPTAS unless P=NP; this result holds even when each tree component of the forest is a chain of 3 receivers.","location":"abstract s6","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":7684,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.06,"states_limitation":0.92,"human_participants":0.02,"controlled_comparison":0.05,"randomized_assignment":0.01,"states_quantitative_result":0.64,"compares_with_prior_results":0.93,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.9,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.1,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.9,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.55,"text":"We study an intricate version of the multi-receiver persuasion setting in which the communication hierarchy is a forest - i.e., some receivers observe more informative signals than others, and the partial ordering of the receivers according to the information they get is represented by a pre-specified directed forest.","location":"abstract s1"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":10,"sentences_in_abstract":10},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}