{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ISEH5OKNKAUDPX3BO2ETJIIRWH","short_pith_number":"pith:ISEH5OKN","canonical_record":{"source":{"id":"1809.00706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-03T20:04:07Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"bc0802f77a3308c84a78bcbb794f3f2862bdc00e2ed483b57fdb177e2d3fdd58","abstract_canon_sha256":"eb8606b827c648f8f0e6f523925ba9345f1eea1b9459eccbdf596e59a49bba2e"},"schema_version":"1.0"},"canonical_sha256":"44887eb94d502837df61768934a111b1ee6a53b92ed89258ce9bd81971187022","source":{"kind":"arxiv","id":"1809.00706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00706","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00706v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00706","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"ISEH5OKNKAUD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ISEH5OKNKAUDPX3B","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ISEH5OKN","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ISEH5OKNKAUDPX3BO2ETJIIRWH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-03T20:04:07Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"bc0802f77a3308c84a78bcbb794f3f2862bdc00e2ed483b57fdb177e2d3fdd58","abstract_canon_sha256":"eb8606b827c648f8f0e6f523925ba9345f1eea1b9459eccbdf596e59a49bba2e"},"schema_version":"1.0"},"canonical_sha256":"44887eb94d502837df61768934a111b1ee6a53b92ed89258ce9bd81971187022","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.718502Z","signature_b64":"csvpGM3FP6ALI8R4SouMZpnjAy8VxOgivc2IqGmFgQqy4KeDw+8GVLUWZQrYDt7TKRqMoZ5yrBii/rGg97ZfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44887eb94d502837df61768934a111b1ee6a53b92ed89258ce9bd81971187022","last_reissued_at":"2026-05-18T00:06:32.717837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.717837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00706","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-18T00:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTRbCzM+ZGWfQq1ogb1t6x8uAzPObnLPg2Lni6wWzE1NcD2kxgJ0pcPgd/AV0uKcEy0DbHv/qqEPfDmZncUrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:44.747287Z"},"content_sha256":"c14eb106db78985ecc9f85874f8214009b27a6b8ae14f6d9590af16c0b51e39d","schema_version":"1.0","event_id":"sha256:c14eb106db78985ecc9f85874f8214009b27a6b8ae14f6d9590af16c0b51e39d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ISEH5OKNKAUDPX3BO2ETJIIRWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Minimum Discounted Reward Hamilton-Jacobi Formulation for Computing Reachable Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Anayo K. Akametalu, Claire J. Tomlin, Jaime F. Fisac, Shromona Ghosh","submitted_at":"2018-09-03T20:04:07Z","abstract_excerpt":"We propose a novel formulation for approximating reachable sets through a minimum discounted reward optimal control problem. The formulation yields a continuous solution that can be obtained by solving a Hamilton-Jacobi equation. Furthermore, the numerical approximation to this solution can be obtained as the unique fixed-point to a contraction mapping. This allows for more efficient solution methods that could not be applied under traditional formulations for solving reachable sets. In addition, this formulation provides a link between reinforcement learning and learning reachable sets for sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00706","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-18T00:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgJWp2vTZPPGTsze3P+mL5bcsKB8ZGfMXxCxIDBvpZtsFuy4M4q4U5sJJf+xjyRExu8XsoAVe39WixJtBYT2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:44.747657Z"},"content_sha256":"93310c257c88fad32f82feb74c9988c0b099761443416a3f745c53b275c008c2","schema_version":"1.0","event_id":"sha256:93310c257c88fad32f82feb74c9988c0b099761443416a3f745c53b275c008c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/bundle.json","state_url":"https://pith.science/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/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-30T06:22:44Z","links":{"resolver":"https://pith.science/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH","bundle":"https://pith.science/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/bundle.json","state":"https://pith.science/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISEH5OKNKAUDPX3BO2ETJIIRWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ISEH5OKNKAUDPX3BO2ETJIIRWH","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":"eb8606b827c648f8f0e6f523925ba9345f1eea1b9459eccbdf596e59a49bba2e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-03T20:04:07Z","title_canon_sha256":"bc0802f77a3308c84a78bcbb794f3f2862bdc00e2ed483b57fdb177e2d3fdd58"},"schema_version":"1.0","source":{"id":"1809.00706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00706","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00706v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00706","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"ISEH5OKNKAUD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"ISEH5OKNKAUDPX3B","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"ISEH5OKN","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:93310c257c88fad32f82feb74c9988c0b099761443416a3f745c53b275c008c2","target":"graph","created_at":"2026-05-18T00:06:32Z","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":"We propose a novel formulation for approximating reachable sets through a minimum discounted reward optimal control problem. The formulation yields a continuous solution that can be obtained by solving a Hamilton-Jacobi equation. Furthermore, the numerical approximation to this solution can be obtained as the unique fixed-point to a contraction mapping. This allows for more efficient solution methods that could not be applied under traditional formulations for solving reachable sets. In addition, this formulation provides a link between reinforcement learning and learning reachable sets for sy","authors_text":"Anayo K. Akametalu, Claire J. Tomlin, Jaime F. Fisac, Shromona Ghosh","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-03T20:04:07Z","title":"A Minimum Discounted Reward Hamilton-Jacobi Formulation for Computing Reachable Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00706","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:c14eb106db78985ecc9f85874f8214009b27a6b8ae14f6d9590af16c0b51e39d","target":"record","created_at":"2026-05-18T00:06:32Z","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":"eb8606b827c648f8f0e6f523925ba9345f1eea1b9459eccbdf596e59a49bba2e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-03T20:04:07Z","title_canon_sha256":"bc0802f77a3308c84a78bcbb794f3f2862bdc00e2ed483b57fdb177e2d3fdd58"},"schema_version":"1.0","source":{"id":"1809.00706","kind":"arxiv","version":1}},"canonical_sha256":"44887eb94d502837df61768934a111b1ee6a53b92ed89258ce9bd81971187022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44887eb94d502837df61768934a111b1ee6a53b92ed89258ce9bd81971187022","first_computed_at":"2026-05-18T00:06:32.717837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:32.717837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"csvpGM3FP6ALI8R4SouMZpnjAy8VxOgivc2IqGmFgQqy4KeDw+8GVLUWZQrYDt7TKRqMoZ5yrBii/rGg97ZfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:32.718502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c14eb106db78985ecc9f85874f8214009b27a6b8ae14f6d9590af16c0b51e39d","sha256:93310c257c88fad32f82feb74c9988c0b099761443416a3f745c53b275c008c2"],"state_sha256":"f14adaee0a405af645e7ce397eab609a6a12de93ab41c9bf6c6a52aa9001ada2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILBHPhhQJ2Fvm0R/ATeKLoLAPDPopTjcmsm97+gx4l3RhXDD/E1rL/CAWBfOLo9aFf8jbhg0B9qjx4AOmP8yCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:22:44.749674Z","bundle_sha256":"084f398e9790335331309e8a60b1a3a3a2f13ec78f83cca5be56852af6bf38a0"}}