{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TH5YM3FO6ZRQZBE4P3R4B6F2PE","short_pith_number":"pith:TH5YM3FO","schema_version":"1.0","canonical_sha256":"99fb866caef6630c849c7ee3c0f8ba7931e44254c50ba477f236bc52d6f79058","source":{"kind":"arxiv","id":"2106.07156","version":1},"attestation_state":"computed","paper":{"title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hung Bui, Rui Shu, Stefano Ermon, Tuan Pham, Tung Nguyen","submitted_at":"2021-06-14T04:31:15Z","abstract_excerpt":"High-dimensional observations are a major challenge in the application of model-based reinforcement learning (MBRL) to real-world environments. To handle high-dimensional sensory inputs, existing approaches use representation learning to map high-dimensional observations into a lower-dimensional latent space that is more amenable to dynamics estimation and planning. In this work, we present an information-theoretic approach that employs temporal predictive coding to encode elements in the environment that can be predicted across time. Since this approach focuses on encoding temporally-predicta"},"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":"2106.07156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-14T04:31:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"97e826968d64292caf8b3b35110f0d3eaef776e19cd8240a99fd6615c2d529cc","abstract_canon_sha256":"a5eea36f025061e6acedc2340c4ba6f9d31be73dac0843130b4126c8e0461081"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:02.611225Z","signature_b64":"+dp6YB6vBi6YSm2dXgNc5uJ+EJ+QnRLIxDBE46T0q9D8a8AxGUH9hZgYcT2gYnT5Gd7W7bvINV8MSNMFx1CUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99fb866caef6630c849c7ee3c0f8ba7931e44254c50ba477f236bc52d6f79058","last_reissued_at":"2026-07-05T02:49:02.610670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:02.610670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hung Bui, Rui Shu, Stefano Ermon, Tuan Pham, Tung Nguyen","submitted_at":"2021-06-14T04:31:15Z","abstract_excerpt":"High-dimensional observations are a major challenge in the application of model-based reinforcement learning (MBRL) to real-world environments. To handle high-dimensional sensory inputs, existing approaches use representation learning to map high-dimensional observations into a lower-dimensional latent space that is more amenable to dynamics estimation and planning. In this work, we present an information-theoretic approach that employs temporal predictive coding to encode elements in the environment that can be predicted across time. Since this approach focuses on encoding temporally-predicta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07156","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/2106.07156/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":"2106.07156","created_at":"2026-07-05T02:49:02.610736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07156v1","created_at":"2026-07-05T02:49:02.610736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07156","created_at":"2026-07-05T02:49:02.610736+00:00"},{"alias_kind":"pith_short_12","alias_value":"TH5YM3FO6ZRQ","created_at":"2026-07-05T02:49:02.610736+00:00"},{"alias_kind":"pith_short_16","alias_value":"TH5YM3FO6ZRQZBE4","created_at":"2026-07-05T02:49:02.610736+00:00"},{"alias_kind":"pith_short_8","alias_value":"TH5YM3FO","created_at":"2026-07-05T02:49:02.610736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01694","citing_title":"Latent State Design for World Models under Sufficiency Constraints","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE","json":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE.json","graph_json":"https://pith.science/api/pith-number/TH5YM3FO6ZRQZBE4P3R4B6F2PE/graph.json","events_json":"https://pith.science/api/pith-number/TH5YM3FO6ZRQZBE4P3R4B6F2PE/events.json","paper":"https://pith.science/paper/TH5YM3FO"},"agent_actions":{"view_html":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE","download_json":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE.json","view_paper":"https://pith.science/paper/TH5YM3FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07156&json=true","fetch_graph":"https://pith.science/api/pith-number/TH5YM3FO6ZRQZBE4P3R4B6F2PE/graph.json","fetch_events":"https://pith.science/api/pith-number/TH5YM3FO6ZRQZBE4P3R4B6F2PE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE/action/storage_attestation","attest_author":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE/action/author_attestation","sign_citation":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE/action/citation_signature","submit_replication":"https://pith.science/pith/TH5YM3FO6ZRQZBE4P3R4B6F2PE/action/replication_record"}},"created_at":"2026-07-05T02:49:02.610736+00:00","updated_at":"2026-07-05T02:49:02.610736+00:00"}