{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RXBBLA72C3DFFRB5WIGJNACSX5","short_pith_number":"pith:RXBBLA72","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"},"canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","source":{"kind":"arxiv","id":"1502.03762","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03762","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03762v3","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03762","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"RXBBLA72C3DF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RXBBLA72C3DFFRB5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RXBBLA72","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RXBBLA72C3DFFRB5WIGJNACSX5","target":"record","payload":{"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"},"canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","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"},"source_kind":"arxiv","source_id":"1502.03762","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MIgL7G3CkxZyFLDWTDQBRqOeKBU9fd3tFA8kcAtRFm+ymQWgI5HxLR+O/J5SiB0iL9dwC8Hib0ytPj8qdR/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:35:59.480747Z"},"content_sha256":"1dbb690e33de095de88cdbd1a70ae46da23d937f3f4650225e7b8896058fcb9f","schema_version":"1.0","event_id":"sha256:1dbb690e33de095de88cdbd1a70ae46da23d937f3f4650225e7b8896058fcb9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RXBBLA72C3DFFRB5WIGJNACSX5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HT2LhI2fMSZZ6qKi0deThy6V+Qmvt2nsf7guRNjG/JA7wRL2R9vc+M92UvQkULqT/ZzD0bw/W36CgKuHgCpaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:35:59.481086Z"},"content_sha256":"a7ddfc01362485b50c73a76a29eea280a116d4453f7b5b0140aeb0783d40b054","schema_version":"1.0","event_id":"sha256:a7ddfc01362485b50c73a76a29eea280a116d4453f7b5b0140aeb0783d40b054"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/bundle.json","state_url":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXBBLA72C3DFFRB5WIGJNACSX5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T03:35:59Z","links":{"resolver":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5","bundle":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/bundle.json","state":"https://pith.science/pith/RXBBLA72C3DFFRB5WIGJNACSX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXBBLA72C3DFFRB5WIGJNACSX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RXBBLA72C3DFFRB5WIGJNACSX5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"131de8aa657e39cb949da3328d4e2f806dcc5ce613b04073a41f83dd6dbc4567","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T18:19:38Z","title_canon_sha256":"532af0c1602f77c924502613975723efb050d025eb8df8abeac2dd0beb0193e1"},"schema_version":"1.0","source":{"id":"1502.03762","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03762","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03762v3","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03762","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"RXBBLA72C3DF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RXBBLA72C3DFFRB5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RXBBLA72","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a7ddfc01362485b50c73a76a29eea280a116d4453f7b5b0140aeb0783d40b054","target":"graph","created_at":"2026-05-18T01:20:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ehsan Shafieepoorfard, Maxim Raginsky, Sean P. Meyn","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T18:19:38Z","title":"Rationally inattentive control of Markov processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03762","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1dbb690e33de095de88cdbd1a70ae46da23d937f3f4650225e7b8896058fcb9f","target":"record","created_at":"2026-05-18T01:20:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"131de8aa657e39cb949da3328d4e2f806dcc5ce613b04073a41f83dd6dbc4567","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-12T18:19:38Z","title_canon_sha256":"532af0c1602f77c924502613975723efb050d025eb8df8abeac2dd0beb0193e1"},"schema_version":"1.0","source":{"id":"1502.03762","kind":"arxiv","version":3}},"canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dc21583fa16c652c43db20c968052bf5cd678e059d73f0c78c5736b7fad6bdb","first_computed_at":"2026-05-18T01:20:12.005228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:12.005228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/a4QOP9EBUB8FiB7RbHBLeJwiwUmthY6/5Wr+t0saZrbM18+ErpDhSgH2rZqXL3ezIl7FDLBZy+KHxg0lovSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:12.005954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03762","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dbb690e33de095de88cdbd1a70ae46da23d937f3f4650225e7b8896058fcb9f","sha256:a7ddfc01362485b50c73a76a29eea280a116d4453f7b5b0140aeb0783d40b054"],"state_sha256":"e7fe073066ace468cf69b13173dd89437522c9100a98d438f8a6f9707d92bf8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4C4q6IYTJmrS9ronGSxAWkYTJE53igRCyFd/ZAWg5rsXEDxDiy5fWoZTJ8FkqbHa9j4KA+79XMwo0B3fcFBSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:35:59.482978Z","bundle_sha256":"dc896307195f5f6baa6e1f328752fd1a4724acc9bdd2d1fe7d188e51519ee17e"}}