{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KQW3INZ7GOCSMSJNW66NWRW4MS","short_pith_number":"pith:KQW3INZ7","canonical_record":{"source":{"id":"1609.07672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-24T20:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"9b62bb619adfefdb0929343e6c84d9cf5dcb877389cabfc2ea63c24e2f7914c8","abstract_canon_sha256":"e191a4546e1ee540c33d85b7a9bc8dd238783f715349d1cad1706f2ad3b01eee"},"schema_version":"1.0"},"canonical_sha256":"542db4373f338526492db7bcdb46dc6481bde5d2c9d169384acca66d36a23999","source":{"kind":"arxiv","id":"1609.07672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07672","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07672v2","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07672","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"KQW3INZ7GOCS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KQW3INZ7GOCSMSJN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KQW3INZ7","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KQW3INZ7GOCSMSJNW66NWRW4MS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-24T20:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"9b62bb619adfefdb0929343e6c84d9cf5dcb877389cabfc2ea63c24e2f7914c8","abstract_canon_sha256":"e191a4546e1ee540c33d85b7a9bc8dd238783f715349d1cad1706f2ad3b01eee"},"schema_version":"1.0"},"canonical_sha256":"542db4373f338526492db7bcdb46dc6481bde5d2c9d169384acca66d36a23999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:38.075470Z","signature_b64":"Y1s5JQVTx0mwqfoMX9KAuAV4d/2niJiMgiTQXkboxC11iS344XcuIxWArfr4erc06LX9C+LqP62uDyWHHS7MDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"542db4373f338526492db7bcdb46dc6481bde5d2c9d169384acca66d36a23999","last_reissued_at":"2026-05-18T00:47:38.074933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:38.074933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07672","source_version":2,"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-18T00:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbAN3oEwDfdSE4910neNeLyjpJ/Oag13B6a01l00Hy0GloJgP+FkHW5E9KBfuazos+WNUFnha7qUa/Uy7GN6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:32:31.338623Z"},"content_sha256":"0de5b812c21d2689c0826ef1fb151db512cc8769221cba8952e9264a6dae1f8f","schema_version":"1.0","event_id":"sha256:0de5b812c21d2689c0826ef1fb151db512cc8769221cba8952e9264a6dae1f8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KQW3INZ7GOCSMSJNW66NWRW4MS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretic Methods for Planning and Learning in Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Roy Fox","submitted_at":"2016-09-24T20:45:37Z","abstract_excerpt":"Bounded agents are limited by intrinsic constraints on their ability to process information that is available in their sensors and memory and choose actions and memory updates. In this dissertation, we model these constraints as information-rate constraints on communication channels connecting these various internal components of the agent. We make four major contributions detailed below and many smaller contributions detailed in each section. First, we formulate the problem of optimizing the agent under both extrinsic and intrinsic constraints and develop the main tools for solving it. Second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07672","kind":"arxiv","version":2},"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-18T00:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjDUBVMTWlE4JJBRG4jgKPuYMHw6d2zTubDcQ9ejTyWReOeF/RqAS4d7eT6QETWewu0O5jxTcAgbFujlHbIXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:32:31.338963Z"},"content_sha256":"5f436e01a7456f1ac8fd2445edab84141065acb508f0231113de843f63b40595","schema_version":"1.0","event_id":"sha256:5f436e01a7456f1ac8fd2445edab84141065acb508f0231113de843f63b40595"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/bundle.json","state_url":"https://pith.science/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/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-05T18:32:31Z","links":{"resolver":"https://pith.science/pith/KQW3INZ7GOCSMSJNW66NWRW4MS","bundle":"https://pith.science/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/bundle.json","state":"https://pith.science/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQW3INZ7GOCSMSJNW66NWRW4MS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KQW3INZ7GOCSMSJNW66NWRW4MS","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":"e191a4546e1ee540c33d85b7a9bc8dd238783f715349d1cad1706f2ad3b01eee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-24T20:45:37Z","title_canon_sha256":"9b62bb619adfefdb0929343e6c84d9cf5dcb877389cabfc2ea63c24e2f7914c8"},"schema_version":"1.0","source":{"id":"1609.07672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07672","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07672v2","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07672","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"KQW3INZ7GOCS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KQW3INZ7GOCSMSJN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KQW3INZ7","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:5f436e01a7456f1ac8fd2445edab84141065acb508f0231113de843f63b40595","target":"graph","created_at":"2026-05-18T00:47:38Z","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":"Bounded agents are limited by intrinsic constraints on their ability to process information that is available in their sensors and memory and choose actions and memory updates. In this dissertation, we model these constraints as information-rate constraints on communication channels connecting these various internal components of the agent. We make four major contributions detailed below and many smaller contributions detailed in each section. First, we formulate the problem of optimizing the agent under both extrinsic and intrinsic constraints and develop the main tools for solving it. Second","authors_text":"Roy Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-24T20:45:37Z","title":"Information-Theoretic Methods for Planning and Learning in Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07672","kind":"arxiv","version":2},"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:0de5b812c21d2689c0826ef1fb151db512cc8769221cba8952e9264a6dae1f8f","target":"record","created_at":"2026-05-18T00:47:38Z","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":"e191a4546e1ee540c33d85b7a9bc8dd238783f715349d1cad1706f2ad3b01eee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-24T20:45:37Z","title_canon_sha256":"9b62bb619adfefdb0929343e6c84d9cf5dcb877389cabfc2ea63c24e2f7914c8"},"schema_version":"1.0","source":{"id":"1609.07672","kind":"arxiv","version":2}},"canonical_sha256":"542db4373f338526492db7bcdb46dc6481bde5d2c9d169384acca66d36a23999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"542db4373f338526492db7bcdb46dc6481bde5d2c9d169384acca66d36a23999","first_computed_at":"2026-05-18T00:47:38.074933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:38.074933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y1s5JQVTx0mwqfoMX9KAuAV4d/2niJiMgiTQXkboxC11iS344XcuIxWArfr4erc06LX9C+LqP62uDyWHHS7MDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:38.075470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0de5b812c21d2689c0826ef1fb151db512cc8769221cba8952e9264a6dae1f8f","sha256:5f436e01a7456f1ac8fd2445edab84141065acb508f0231113de843f63b40595"],"state_sha256":"32b00703e2896a5b332b6356ecfa6417ce5e1a18043f9a2d5d58fbf01a483ecc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JdUrIu6MQomx6XzqUmkpS6rOAr8/BiZ7z+F6OtMe8PZUegj1OCENoXbcqm6r/+vDbKmfK03oqSo+S6cdUiCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:32:31.341242Z","bundle_sha256":"be0f2ab03d7ce47f574da69e7d6cd9ca899654d082704b12f71bc2d4602bf00f"}}