{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LT4OL6F2XNB2MFTTC6G5R3SZMQ","short_pith_number":"pith:LT4OL6F2","schema_version":"1.0","canonical_sha256":"5cf8e5f8babb43a61673178dd8ee59640f9d5fea6fe224f88ea5f3054f47b7ed","source":{"kind":"arxiv","id":"1212.2459","version":1},"attestation_state":"computed","paper":{"title":"Symbolic Generalization for On-line Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Eric A. Hansen, Shlomo Zilberstein, Zhengzhu Feng","submitted_at":"2012-10-19T15:05:06Z","abstract_excerpt":"Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of on-line planners. In addition to reducing computation time, symbolic generalization can reduce the amount of costly real-world interactions required for convergence. We introduce Symbolic Real-Time Dynamic Programming (or sRTDP), an extension of RTDP. After each step of on-line interaction with an environment, sRTDP uses symbolic model-checking techniques to generalizes its experience by updating a group of states rather than "},"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":"1212.2459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"dd8d7b8e58c207d4100708499d37b42164d9a3e41cb20f50c59a4db3bdb36fd3","abstract_canon_sha256":"2436a2126971b67adf25c8fa600048bc538b6af28fd466bfb797885eec81157b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.828936Z","signature_b64":"XGjveNrCEARBxzRa+UhnrWF4ZeJ1oMr2fheTaKwWdbhXmsE9jH97bho+WyHuUfC9YF3E4E67V03cGxP0HiuAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf8e5f8babb43a61673178dd8ee59640f9d5fea6fe224f88ea5f3054f47b7ed","last_reissued_at":"2026-05-18T03:38:44.828464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.828464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Generalization for On-line Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Eric A. Hansen, Shlomo Zilberstein, Zhengzhu Feng","submitted_at":"2012-10-19T15:05:06Z","abstract_excerpt":"Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of on-line planners. In addition to reducing computation time, symbolic generalization can reduce the amount of costly real-world interactions required for convergence. We introduce Symbolic Real-Time Dynamic Programming (or sRTDP), an extension of RTDP. After each step of on-line interaction with an environment, sRTDP uses symbolic model-checking techniques to generalizes its experience by updating a group of states rather than "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2459","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":""},"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":"1212.2459","created_at":"2026-05-18T03:38:44.828535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2459v1","created_at":"2026-05-18T03:38:44.828535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2459","created_at":"2026-05-18T03:38:44.828535+00:00"},{"alias_kind":"pith_short_12","alias_value":"LT4OL6F2XNB2","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LT4OL6F2XNB2MFTT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LT4OL6F2","created_at":"2026-05-18T12:27:14.488303+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/LT4OL6F2XNB2MFTTC6G5R3SZMQ","json":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ.json","graph_json":"https://pith.science/api/pith-number/LT4OL6F2XNB2MFTTC6G5R3SZMQ/graph.json","events_json":"https://pith.science/api/pith-number/LT4OL6F2XNB2MFTTC6G5R3SZMQ/events.json","paper":"https://pith.science/paper/LT4OL6F2"},"agent_actions":{"view_html":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ","download_json":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ.json","view_paper":"https://pith.science/paper/LT4OL6F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2459&json=true","fetch_graph":"https://pith.science/api/pith-number/LT4OL6F2XNB2MFTTC6G5R3SZMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LT4OL6F2XNB2MFTTC6G5R3SZMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ/action/storage_attestation","attest_author":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ/action/author_attestation","sign_citation":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ/action/citation_signature","submit_replication":"https://pith.science/pith/LT4OL6F2XNB2MFTTC6G5R3SZMQ/action/replication_record"}},"created_at":"2026-05-18T03:38:44.828535+00:00","updated_at":"2026-05-18T03:38:44.828535+00:00"}