{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FNLBRTCL54O6MG3Z5SJJKFXBQP","short_pith_number":"pith:FNLBRTCL","canonical_record":{"source":{"id":"1802.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-07T17:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"7a9576e2bc9ee83c0531b243608a0df74580b4ffaa72ed555edd60c508ba9e1d","abstract_canon_sha256":"f404556df79eed1702286aada91be1da4a75eadb5d313f8da9953f23693dd4fd"},"schema_version":"1.0"},"canonical_sha256":"2b5618cc4bef1de61b79ec929516e183ec7fd9fd9942767b6a7290e5c6df4db5","source":{"kind":"arxiv","id":"1802.02544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02544","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02544v1","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02544","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"FNLBRTCL54O6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FNLBRTCL54O6MG3Z","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FNLBRTCL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FNLBRTCL54O6MG3Z5SJJKFXBQP","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-07T17:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"7a9576e2bc9ee83c0531b243608a0df74580b4ffaa72ed555edd60c508ba9e1d","abstract_canon_sha256":"f404556df79eed1702286aada91be1da4a75eadb5d313f8da9953f23693dd4fd"},"schema_version":"1.0"},"canonical_sha256":"2b5618cc4bef1de61b79ec929516e183ec7fd9fd9942767b6a7290e5c6df4db5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:07.870855Z","signature_b64":"af9VVgXRlHYwe2P5Df2z+kZqZJyB7RVbHYAgrxCtbnh/VKHdyutx/E0sqE0+9d+NoPPxZhDDI5pcrmgFGc0iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b5618cc4bef1de61b79ec929516e183ec7fd9fd9942767b6a7290e5c6df4db5","last_reissued_at":"2026-05-18T00:24:07.870303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:07.870303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02544","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:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zldav5XslBqqNnPk6L7EJ3vXBLfKMRvw8HMrEKZzINnMwOJkEsK/z/N3wKFE8PlrcQpvfjlMk7PDXfnIywXOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:02:31.912844Z"},"content_sha256":"3628820da10dab94a2bd9188353a4f60adbd101c4d00b9a4ce83ab663725b950","schema_version":"1.0","event_id":"sha256:3628820da10dab94a2bd9188353a4f60adbd101c4d00b9a4ce83ab663725b950"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FNLBRTCL54O6MG3Z5SJJKFXBQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Dynamic Programming Approach to Evaluating Multivariate Gaussian Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matthew M. Peet, Morgan Jones","submitted_at":"2018-02-07T17:33:10Z","abstract_excerpt":"We propose a method of approximating multivariate Gaussian probabilities using dynamic programming. We show that solving the optimization problem associated with a class of discrete-time finite horizon Markov decision processes with non-Lipschitz cost functions is equivalent to integrating a Gaussian functions over polytopes. An approximation scheme for this class of MDPs is proposed and explicit error bounds under the supremum norm for the optimal cost to go functions are derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02544","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:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bT+s9MGhe8Q/cWZVD248urRlKvgDvYtaN5N+dpgHSifjXGbEV3aFSCRXkuCmIjNebBmYgi0eesPCLf0CCgCJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:02:31.913183Z"},"content_sha256":"f517a7befa3964a3912f4216d13e5cbd879e742ff1aa2fdbf42ec7779f5b6871","schema_version":"1.0","event_id":"sha256:f517a7befa3964a3912f4216d13e5cbd879e742ff1aa2fdbf42ec7779f5b6871"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/bundle.json","state_url":"https://pith.science/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/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-25T19:02:31Z","links":{"resolver":"https://pith.science/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP","bundle":"https://pith.science/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/bundle.json","state":"https://pith.science/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNLBRTCL54O6MG3Z5SJJKFXBQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FNLBRTCL54O6MG3Z5SJJKFXBQP","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":"f404556df79eed1702286aada91be1da4a75eadb5d313f8da9953f23693dd4fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-07T17:33:10Z","title_canon_sha256":"7a9576e2bc9ee83c0531b243608a0df74580b4ffaa72ed555edd60c508ba9e1d"},"schema_version":"1.0","source":{"id":"1802.02544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02544","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02544v1","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02544","created_at":"2026-05-18T00:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"FNLBRTCL54O6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FNLBRTCL54O6MG3Z","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FNLBRTCL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:f517a7befa3964a3912f4216d13e5cbd879e742ff1aa2fdbf42ec7779f5b6871","target":"graph","created_at":"2026-05-18T00:24:07Z","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 method of approximating multivariate Gaussian probabilities using dynamic programming. We show that solving the optimization problem associated with a class of discrete-time finite horizon Markov decision processes with non-Lipschitz cost functions is equivalent to integrating a Gaussian functions over polytopes. An approximation scheme for this class of MDPs is proposed and explicit error bounds under the supremum norm for the optimal cost to go functions are derived.","authors_text":"Matthew M. Peet, Morgan Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-07T17:33:10Z","title":"A Dynamic Programming Approach to Evaluating Multivariate Gaussian Probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02544","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:3628820da10dab94a2bd9188353a4f60adbd101c4d00b9a4ce83ab663725b950","target":"record","created_at":"2026-05-18T00:24:07Z","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":"f404556df79eed1702286aada91be1da4a75eadb5d313f8da9953f23693dd4fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-07T17:33:10Z","title_canon_sha256":"7a9576e2bc9ee83c0531b243608a0df74580b4ffaa72ed555edd60c508ba9e1d"},"schema_version":"1.0","source":{"id":"1802.02544","kind":"arxiv","version":1}},"canonical_sha256":"2b5618cc4bef1de61b79ec929516e183ec7fd9fd9942767b6a7290e5c6df4db5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b5618cc4bef1de61b79ec929516e183ec7fd9fd9942767b6a7290e5c6df4db5","first_computed_at":"2026-05-18T00:24:07.870303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:07.870303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"af9VVgXRlHYwe2P5Df2z+kZqZJyB7RVbHYAgrxCtbnh/VKHdyutx/E0sqE0+9d+NoPPxZhDDI5pcrmgFGc0iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:07.870855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3628820da10dab94a2bd9188353a4f60adbd101c4d00b9a4ce83ab663725b950","sha256:f517a7befa3964a3912f4216d13e5cbd879e742ff1aa2fdbf42ec7779f5b6871"],"state_sha256":"305de4fc106a14124bb98eb9d7919d2207cc40c63e33741f44630ab3b173f90f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vf3hScqvnD24sOT9FZddQyhFzS+H3nJnPIOWu6JotF440pdRpHAnodi1UiuFs17KRQpqoTUPChPM+OGKJ82kCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:02:31.915081Z","bundle_sha256":"e654fadf0586393c0ea604788ac0288d908c3908a1d5967fc30609aba990258a"}}