{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7WFAOFADDACXS4J4FAGU47VKMX","short_pith_number":"pith:7WFAOFAD","canonical_record":{"source":{"id":"1605.04591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-15T18:48:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1d5adbeac69c81a80ada35b0d9c386a56c59e9ab09e7ba9c8beff6a21275aaf2","abstract_canon_sha256":"a0eee2421c80fb6dc4b363df80cf20e625ca323135eef3f656aa721075f1f875"},"schema_version":"1.0"},"canonical_sha256":"fd8a071403180579713c280d4e7eaa65c8abe873b289e3cf8168042897bfc462","source":{"kind":"arxiv","id":"1605.04591","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04591","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04591v2","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04591","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"7WFAOFADDACX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7WFAOFADDACXS4J4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7WFAOFAD","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7WFAOFADDACXS4J4FAGU47VKMX","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-15T18:48:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1d5adbeac69c81a80ada35b0d9c386a56c59e9ab09e7ba9c8beff6a21275aaf2","abstract_canon_sha256":"a0eee2421c80fb6dc4b363df80cf20e625ca323135eef3f656aa721075f1f875"},"schema_version":"1.0"},"canonical_sha256":"fd8a071403180579713c280d4e7eaa65c8abe873b289e3cf8168042897bfc462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:40.009284Z","signature_b64":"Ez3ntE6abJr9B8fssx8rROOgzCCoVqTdlVaFhso9VoIfnC0WQD32mBzfEaqbo3UEelHBgK+WHG+X5iS5gOwcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8a071403180579713c280d4e7eaa65c8abe873b289e3cf8168042897bfc462","last_reissued_at":"2026-05-18T00:05:40.008876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:40.008876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04591","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:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqInmCu1F/M5ABHvzwwgESygxaT39b6gMPjRtHZFiUVof2fEuQWhDZT381dzR00cAcrKcErfOt2E6PzR4b5RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:01:32.566166Z"},"content_sha256":"75e45665dd00db41917beb4ed459402083edb9c42cce076d27e001e136c84366","schema_version":"1.0","event_id":"sha256:75e45665dd00db41917beb4ed459402083edb9c42cce076d27e001e136c84366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7WFAOFADDACXS4J4FAGU47VKMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ordinary Differential Equation Methods For Markov Decision Processes and Application to Kullback-Leibler Control Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Ana Bu\\v{s}i\\'c, Sean Meyn","submitted_at":"2016-05-15T18:48:55Z","abstract_excerpt":"A new approach to computation of optimal policies for MDP (Markov decision process) models is introduced. The main idea is to solve not one, but an entire family of MDPs, parameterized by a weighting factor $\\zeta$ that appears in the one-step reward function. For an MDP with $d$ states, the family of value functions $\\{ h^*_\\zeta : \\zeta\\in\\Re\\}$ is the solution to an ODE, $$ \\frac{d}{d\\zeta} h^*_\\zeta = {\\cal V}(h^*_\\zeta) $$ where the vector field ${\\cal V}\\colon\\Re^d\\to\\Re^d$ has a simple form, based on a matrix inverse.\n  This general methodology is applied to a family of average-cost opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04591","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:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdDY6JqoV50KM0Rqux/f+8rq3tjZYoBMcl1p2wvzuHooiWI6c8+EWm39+6oSn0TeMIKyi1RmWQjT0dzk3I78Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:01:32.566719Z"},"content_sha256":"0656f6a6854c8869280fb978e68c5b4174aced988d9b36f68095e50e239d3896","schema_version":"1.0","event_id":"sha256:0656f6a6854c8869280fb978e68c5b4174aced988d9b36f68095e50e239d3896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WFAOFADDACXS4J4FAGU47VKMX/bundle.json","state_url":"https://pith.science/pith/7WFAOFADDACXS4J4FAGU47VKMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WFAOFADDACXS4J4FAGU47VKMX/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-27T10:01:32Z","links":{"resolver":"https://pith.science/pith/7WFAOFADDACXS4J4FAGU47VKMX","bundle":"https://pith.science/pith/7WFAOFADDACXS4J4FAGU47VKMX/bundle.json","state":"https://pith.science/pith/7WFAOFADDACXS4J4FAGU47VKMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WFAOFADDACXS4J4FAGU47VKMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7WFAOFADDACXS4J4FAGU47VKMX","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":"a0eee2421c80fb6dc4b363df80cf20e625ca323135eef3f656aa721075f1f875","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-15T18:48:55Z","title_canon_sha256":"1d5adbeac69c81a80ada35b0d9c386a56c59e9ab09e7ba9c8beff6a21275aaf2"},"schema_version":"1.0","source":{"id":"1605.04591","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04591","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04591v2","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04591","created_at":"2026-05-18T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"7WFAOFADDACX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7WFAOFADDACXS4J4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7WFAOFAD","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:0656f6a6854c8869280fb978e68c5b4174aced988d9b36f68095e50e239d3896","target":"graph","created_at":"2026-05-18T00:05:40Z","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":"A new approach to computation of optimal policies for MDP (Markov decision process) models is introduced. The main idea is to solve not one, but an entire family of MDPs, parameterized by a weighting factor $\\zeta$ that appears in the one-step reward function. For an MDP with $d$ states, the family of value functions $\\{ h^*_\\zeta : \\zeta\\in\\Re\\}$ is the solution to an ODE, $$ \\frac{d}{d\\zeta} h^*_\\zeta = {\\cal V}(h^*_\\zeta) $$ where the vector field ${\\cal V}\\colon\\Re^d\\to\\Re^d$ has a simple form, based on a matrix inverse.\n  This general methodology is applied to a family of average-cost opt","authors_text":"Ana Bu\\v{s}i\\'c, Sean Meyn","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-15T18:48:55Z","title":"Ordinary Differential Equation Methods For Markov Decision Processes and Application to Kullback-Leibler Control Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04591","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:75e45665dd00db41917beb4ed459402083edb9c42cce076d27e001e136c84366","target":"record","created_at":"2026-05-18T00:05:40Z","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":"a0eee2421c80fb6dc4b363df80cf20e625ca323135eef3f656aa721075f1f875","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-15T18:48:55Z","title_canon_sha256":"1d5adbeac69c81a80ada35b0d9c386a56c59e9ab09e7ba9c8beff6a21275aaf2"},"schema_version":"1.0","source":{"id":"1605.04591","kind":"arxiv","version":2}},"canonical_sha256":"fd8a071403180579713c280d4e7eaa65c8abe873b289e3cf8168042897bfc462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8a071403180579713c280d4e7eaa65c8abe873b289e3cf8168042897bfc462","first_computed_at":"2026-05-18T00:05:40.008876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:40.008876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ez3ntE6abJr9B8fssx8rROOgzCCoVqTdlVaFhso9VoIfnC0WQD32mBzfEaqbo3UEelHBgK+WHG+X5iS5gOwcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:40.009284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04591","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75e45665dd00db41917beb4ed459402083edb9c42cce076d27e001e136c84366","sha256:0656f6a6854c8869280fb978e68c5b4174aced988d9b36f68095e50e239d3896"],"state_sha256":"96ab1993f7cad602a61435411549858f0eacd88726e0656b57476466efff6960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtqEhs19ueuWHKBK+qnOPJ76sYstJ6ag0ROv4Nm/kRpaYPPbAMBRt1oxAm5d7ZXtJkGUaDRm/ic+cLcaIF+EDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:01:32.569401Z","bundle_sha256":"1e8722ab0ceeb306abad898d6b0b3c621b152629b3be9780a68c84643285f001"}}