{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RXBBLA72C3DFFRB5WIGJNACSX5","short_pith_number":"pith:RXBBLA72","schema_version":"1.0","canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","source":{"kind":"arxiv","id":"1502.03762","version":3},"attestation_state":"computed","paper":{"title":"Rationally inattentive control of Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ehsan Shafieepoorfard, Maxim Raginsky, Sean P. Meyn","submitted_at":"2015-02-12T18:19:38Z","abstract_excerpt":"The article poses a general model for optimal control subject to information constraints, motivated in part by recent work of Sims and others on information-constrained decision-making by economic agents. In the average-cost optimal control framework, the general model introduced in this paper reduces to a variant of the linear-programming representation of the average-cost optimal control problem, subject to an additional mutual information constraint on the randomized stationary policy. The resulting optimization problem is convex and admits a decomposition based on the Bellman error, which "},"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":"1502.03762","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T18:19:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"532af0c1602f77c924502613975723efb050d025eb8df8abeac2dd0beb0193e1","abstract_canon_sha256":"131de8aa657e39cb949da3328d4e2f806dcc5ce613b04073a41f83dd6dbc4567"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.005954Z","signature_b64":"/a4QOP9EBUB8FiB7RbHBLeJwiwUmthY6/5Wr+t0saZrbM18+ErpDhSgH2rZqXL3ezIl7FDLBZy+KHxg0lovSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","last_reissued_at":"2026-05-18T01:20:12.005228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.005228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rationally inattentive control of Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ehsan Shafieepoorfard, Maxim Raginsky, Sean P. Meyn","submitted_at":"2015-02-12T18:19:38Z","abstract_excerpt":"The article poses a general model for optimal control subject to information constraints, motivated in part by recent work of Sims and others on information-constrained decision-making by economic agents. In the average-cost optimal control framework, the general model introduced in this paper reduces to a variant of the linear-programming representation of the average-cost optimal control problem, subject to an additional mutual information constraint on the randomized stationary policy. The resulting optimization problem is convex and admits a decomposition based on the Bellman error, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03762","kind":"arxiv","version":3},"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":"1502.03762","created_at":"2026-05-18T01:20:12.005349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03762v3","created_at":"2026-05-18T01:20:12.005349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03762","created_at":"2026-05-18T01:20:12.005349+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXBBLA72C3DF","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXBBLA72C3DFFRB5","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXBBLA72","created_at":"2026-05-18T12:29:39.896362+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/RXBBLA72C3DFFRB5WIGJNACSX5","json":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5.json","graph_json":"https://pith.science/api/pith-number/RXBBLA72C3DFFRB5WIGJNACSX5/graph.json","events_json":"https://pith.science/api/pith-number/RXBBLA72C3DFFRB5WIGJNACSX5/events.json","paper":"https://pith.science/paper/RXBBLA72"},"agent_actions":{"view_html":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5","download_json":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5.json","view_paper":"https://pith.science/paper/RXBBLA72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03762&json=true","fetch_graph":"https://pith.science/api/pith-number/RXBBLA72C3DFFRB5WIGJNACSX5/graph.json","fetch_events":"https://pith.science/api/pith-number/RXBBLA72C3DFFRB5WIGJNACSX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/action/storage_attestation","attest_author":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/action/author_attestation","sign_citation":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/action/citation_signature","submit_replication":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/action/replication_record"}},"created_at":"2026-05-18T01:20:12.005349+00:00","updated_at":"2026-05-18T01:20:12.005349+00:00"}