{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YGZEY62TI5QMXJO5GJ5U24SAHO","short_pith_number":"pith:YGZEY62T","canonical_record":{"source":{"id":"1611.04706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T05:19:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"291dc398c45c1af1dcf9a9522a6715250b00090446346820486baed546603eff","abstract_canon_sha256":"58d06b2a98e2d107bb76de9520c1251f2e5c3dbc4eb57f44d8343d55cb1d5406"},"schema_version":"1.0"},"canonical_sha256":"c1b24c7b534760cba5dd327b4d72403ba745350fc2686c7526b3fa7c694b3a5c","source":{"kind":"arxiv","id":"1611.04706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04706","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04706v2","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04706","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"YGZEY62TI5QM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YGZEY62TI5QMXJO5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YGZEY62T","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YGZEY62TI5QMXJO5GJ5U24SAHO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T05:19:33Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"291dc398c45c1af1dcf9a9522a6715250b00090446346820486baed546603eff","abstract_canon_sha256":"58d06b2a98e2d107bb76de9520c1251f2e5c3dbc4eb57f44d8343d55cb1d5406"},"schema_version":"1.0"},"canonical_sha256":"c1b24c7b534760cba5dd327b4d72403ba745350fc2686c7526b3fa7c694b3a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:16.616847Z","signature_b64":"3ksm4/13NKuoTSUzfVZfg4OLmWrIuG7vfomrWsqUFoVcA+CTWaxL08YzYXpvvz0iKaDc+vTRlo3u+BKlKLMZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b24c7b534760cba5dd327b4d72403ba745350fc2686c7526b3fa7c694b3a5c","last_reissued_at":"2026-05-18T00:26:16.616274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:16.616274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04706","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:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Awd3dp46d2kseFzsTdHTm9uVE4mjO3rpZxDUDgJs/T/SPf7Xa4XX0El1Honys40+WBySEXMB5OA3KYKzbeYoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:12:13.018023Z"},"content_sha256":"a7d4a82b7b635a0edb3042a12538f3974fb612b903a6e5ee9fd030d4df085a46","schema_version":"1.0","event_id":"sha256:a7d4a82b7b635a0edb3042a12538f3974fb612b903a6e5ee9fd030d4df085a46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YGZEY62TI5QMXJO5GJ5U24SAHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Stochastic Optimal Control using Continuous Tensor Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Alex A. Gorodetsky, Sertac Karaman, Youssef M. Marzouk","submitted_at":"2016-11-15T05:19:33Z","abstract_excerpt":"Motion planning and control problems are embedded and essential in almost all robotics applications. These problems are often formulated as stochastic optimal control problems and solved using dynamic programming algorithms. Unfortunately, most existing algorithms that guarantee convergence to optimal solutions suffer from the curse of dimensionality: the run time of the algorithm grows exponentially with the dimension of the state space of the system. We propose novel dynamic programming algorithms that alleviate the curse of dimensionality in problems that exhibit certain low-rank structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04706","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:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2NqJB7tg2Hjk2ljHFO8C3ZaTRQUHKd6fkztdafdPItCs17wD/kRd/hdLWxis5SYF4nF6Yzt8UuJew+v0fIpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:12:13.018693Z"},"content_sha256":"962568dcd4ca56912d8e41b84d788d2f5e678aa6121ca9784db49cde7166508d","schema_version":"1.0","event_id":"sha256:962568dcd4ca56912d8e41b84d788d2f5e678aa6121ca9784db49cde7166508d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/bundle.json","state_url":"https://pith.science/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/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-05-27T09:12:13Z","links":{"resolver":"https://pith.science/pith/YGZEY62TI5QMXJO5GJ5U24SAHO","bundle":"https://pith.science/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/bundle.json","state":"https://pith.science/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGZEY62TI5QMXJO5GJ5U24SAHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YGZEY62TI5QMXJO5GJ5U24SAHO","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":"58d06b2a98e2d107bb76de9520c1251f2e5c3dbc4eb57f44d8343d55cb1d5406","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T05:19:33Z","title_canon_sha256":"291dc398c45c1af1dcf9a9522a6715250b00090446346820486baed546603eff"},"schema_version":"1.0","source":{"id":"1611.04706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04706","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04706v2","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04706","created_at":"2026-05-18T00:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"YGZEY62TI5QM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YGZEY62TI5QMXJO5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YGZEY62T","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:962568dcd4ca56912d8e41b84d788d2f5e678aa6121ca9784db49cde7166508d","target":"graph","created_at":"2026-05-18T00:26:16Z","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":"Motion planning and control problems are embedded and essential in almost all robotics applications. These problems are often formulated as stochastic optimal control problems and solved using dynamic programming algorithms. Unfortunately, most existing algorithms that guarantee convergence to optimal solutions suffer from the curse of dimensionality: the run time of the algorithm grows exponentially with the dimension of the state space of the system. We propose novel dynamic programming algorithms that alleviate the curse of dimensionality in problems that exhibit certain low-rank structure.","authors_text":"Alex A. Gorodetsky, Sertac Karaman, Youssef M. Marzouk","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T05:19:33Z","title":"High-Dimensional Stochastic Optimal Control using Continuous Tensor Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04706","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:a7d4a82b7b635a0edb3042a12538f3974fb612b903a6e5ee9fd030d4df085a46","target":"record","created_at":"2026-05-18T00:26:16Z","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":"58d06b2a98e2d107bb76de9520c1251f2e5c3dbc4eb57f44d8343d55cb1d5406","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T05:19:33Z","title_canon_sha256":"291dc398c45c1af1dcf9a9522a6715250b00090446346820486baed546603eff"},"schema_version":"1.0","source":{"id":"1611.04706","kind":"arxiv","version":2}},"canonical_sha256":"c1b24c7b534760cba5dd327b4d72403ba745350fc2686c7526b3fa7c694b3a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1b24c7b534760cba5dd327b4d72403ba745350fc2686c7526b3fa7c694b3a5c","first_computed_at":"2026-05-18T00:26:16.616274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:16.616274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ksm4/13NKuoTSUzfVZfg4OLmWrIuG7vfomrWsqUFoVcA+CTWaxL08YzYXpvvz0iKaDc+vTRlo3u+BKlKLMZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:16.616847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d4a82b7b635a0edb3042a12538f3974fb612b903a6e5ee9fd030d4df085a46","sha256:962568dcd4ca56912d8e41b84d788d2f5e678aa6121ca9784db49cde7166508d"],"state_sha256":"40711ff1a4589f9e4ede9d148353a886c1a4f7870e94c79cc3f094c6d87ed7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vKVAeuP58jW5boY0I2LYCdd/Oi38yvuENx10xlp7Dfwpf5lvz6xm5lW70ZwCjJssgfiYtKqHX9adng+fjTGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:12:13.022421Z","bundle_sha256":"62c64b80e97c8744a1d56125c831edf9ecc89ee8e800f04f481ba15428f00f57"}}