{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ODQSEPCA7VSGNF4TCCNGENXNL3","short_pith_number":"pith:ODQSEPCA","canonical_record":{"source":{"id":"1210.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T09:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"93931720a80c6548f747d045f7f8a4d4fc03f904078b57440734942816aec43a","abstract_canon_sha256":"fc881d37a613624d54b2e76e9dd74412aa74b1a88801b868edd8b3494ef6e7a9"},"schema_version":"1.0"},"canonical_sha256":"70e1223c40fd64669793109a6236ed5eef84174091f286f62225d18f6260aea7","source":{"kind":"arxiv","id":"1210.0706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0706","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0706v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0706","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"ODQSEPCA7VSG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ODQSEPCA7VSGNF4T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ODQSEPCA","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ODQSEPCA7VSGNF4TCCNGENXNL3","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T09:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"93931720a80c6548f747d045f7f8a4d4fc03f904078b57440734942816aec43a","abstract_canon_sha256":"fc881d37a613624d54b2e76e9dd74412aa74b1a88801b868edd8b3494ef6e7a9"},"schema_version":"1.0"},"canonical_sha256":"70e1223c40fd64669793109a6236ed5eef84174091f286f62225d18f6260aea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:14.436309Z","signature_b64":"XzWS+J4EfC7JuEmy2gIDMH1Z6wDwL3ncYsgw/hEDPGTWrVBb3NZ1kpSpfA/iVzChrfhDt/PZo0QaZWf8hd4WDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e1223c40fd64669793109a6236ed5eef84174091f286f62225d18f6260aea7","last_reissued_at":"2026-05-18T03:44:14.435884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:14.435884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0706","source_version":1,"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-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbNXN6nk6u3P1AEBOP+bC2PMNEVjJyG9K5USHxaNatmPQox/AoApHJjx2lqRhBCN3wkY6k/0q99Qkbj1ntwhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:34:50.109767Z"},"content_sha256":"2284aab8256fade76de9bec16b109c2791c51adf9d45bdb2ffa18824cb8127e2","schema_version":"1.0","event_id":"sha256:2284aab8256fade76de9bec16b109c2791c51adf9d45bdb2ffa18824cb8127e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ODQSEPCA7VSGNF4TCCNGENXNL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Dynamic Programming based on High Dimensional Model Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Miroslav Pi\\v{s}t\\v{e}k","submitted_at":"2012-10-02T09:20:47Z","abstract_excerpt":"This article introduces an algorithm for implicit High Dimensional Model Representation (HDMR) of the Bellman equation. This approximation technique reduces memory demands of the algorithm considerably. Moreover, we show that HDMR enables fast approximate minimization which is essential for evaluation of the Bellman function. In each time step, the problem of parametrized HDMR minimization is relaxed into trust region problems, all sharing the same matrix. Finding its eigenvalue decomposition, we effectively achieve estimates of all minima. Their full-domain representation is avoided by HDMR a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0706","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"},"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-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIWFAkeEf64TtQAxN7l8pGFhxOdeYmTRfecnJKgJTvbOYB950I9l4Q97g8N/48/NqwtIZpLT2mexgqFxQJHEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:34:50.110110Z"},"content_sha256":"7e4095e5a7ee615ba3e26ce9635ab311d87ff5aacddc8aa6ec79d13bb3e680ea","schema_version":"1.0","event_id":"sha256:7e4095e5a7ee615ba3e26ce9635ab311d87ff5aacddc8aa6ec79d13bb3e680ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/bundle.json","state_url":"https://pith.science/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/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-22T02:34:50Z","links":{"resolver":"https://pith.science/pith/ODQSEPCA7VSGNF4TCCNGENXNL3","bundle":"https://pith.science/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/bundle.json","state":"https://pith.science/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODQSEPCA7VSGNF4TCCNGENXNL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ODQSEPCA7VSGNF4TCCNGENXNL3","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":"fc881d37a613624d54b2e76e9dd74412aa74b1a88801b868edd8b3494ef6e7a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T09:20:47Z","title_canon_sha256":"93931720a80c6548f747d045f7f8a4d4fc03f904078b57440734942816aec43a"},"schema_version":"1.0","source":{"id":"1210.0706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0706","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0706v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0706","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"ODQSEPCA7VSG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ODQSEPCA7VSGNF4T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ODQSEPCA","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:7e4095e5a7ee615ba3e26ce9635ab311d87ff5aacddc8aa6ec79d13bb3e680ea","target":"graph","created_at":"2026-05-18T03:44:14Z","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":"This article introduces an algorithm for implicit High Dimensional Model Representation (HDMR) of the Bellman equation. This approximation technique reduces memory demands of the algorithm considerably. Moreover, we show that HDMR enables fast approximate minimization which is essential for evaluation of the Bellman function. In each time step, the problem of parametrized HDMR minimization is relaxed into trust region problems, all sharing the same matrix. Finding its eigenvalue decomposition, we effectively achieve estimates of all minima. Their full-domain representation is avoided by HDMR a","authors_text":"Miroslav Pi\\v{s}t\\v{e}k","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T09:20:47Z","title":"Approximate Dynamic Programming based on High Dimensional Model Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0706","kind":"arxiv","version":1},"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:2284aab8256fade76de9bec16b109c2791c51adf9d45bdb2ffa18824cb8127e2","target":"record","created_at":"2026-05-18T03:44:14Z","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":"fc881d37a613624d54b2e76e9dd74412aa74b1a88801b868edd8b3494ef6e7a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T09:20:47Z","title_canon_sha256":"93931720a80c6548f747d045f7f8a4d4fc03f904078b57440734942816aec43a"},"schema_version":"1.0","source":{"id":"1210.0706","kind":"arxiv","version":1}},"canonical_sha256":"70e1223c40fd64669793109a6236ed5eef84174091f286f62225d18f6260aea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70e1223c40fd64669793109a6236ed5eef84174091f286f62225d18f6260aea7","first_computed_at":"2026-05-18T03:44:14.435884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:14.435884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XzWS+J4EfC7JuEmy2gIDMH1Z6wDwL3ncYsgw/hEDPGTWrVBb3NZ1kpSpfA/iVzChrfhDt/PZo0QaZWf8hd4WDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:14.436309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2284aab8256fade76de9bec16b109c2791c51adf9d45bdb2ffa18824cb8127e2","sha256:7e4095e5a7ee615ba3e26ce9635ab311d87ff5aacddc8aa6ec79d13bb3e680ea"],"state_sha256":"2a845a10b9175b076d3e03183a0ec936dfb764de5b6fbec9ab668e8e6e66a337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+T1eszcg9Mc3Af0gwEIr/N4cwS1z29iMXSkEzqGsdD9A77L/+JRLR1NoYu61wzs9J4hXmpdf80zQVB2S/HYgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:34:50.112096Z","bundle_sha256":"e321208aa0715e767cc2e9f2f9561768a1965cd57b4ed1bb11faf55f7255fbb7"}}