{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W5SUGRL4MQRN4YPMAVP3GIMGER","short_pith_number":"pith:W5SUGRL4","canonical_record":{"source":{"id":"1503.07189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"0650bfacf777ce55bc090a4059c282a28fd2f2e40ee3ef01e9555ebff992c8c0","abstract_canon_sha256":"280d87ccc84a9be0856a15c064b75238e437aa6044008cd5007b3121d0d690c6"},"schema_version":"1.0"},"canonical_sha256":"b76543457c6422de61ec055fb3218624477dc0a4d08173efbbb8c018c8c9a9c0","source":{"kind":"arxiv","id":"1503.07189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07189","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07189v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07189","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"W5SUGRL4MQRN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5SUGRL4MQRN4YPM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5SUGRL4","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W5SUGRL4MQRN4YPMAVP3GIMGER","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"0650bfacf777ce55bc090a4059c282a28fd2f2e40ee3ef01e9555ebff992c8c0","abstract_canon_sha256":"280d87ccc84a9be0856a15c064b75238e437aa6044008cd5007b3121d0d690c6"},"schema_version":"1.0"},"canonical_sha256":"b76543457c6422de61ec055fb3218624477dc0a4d08173efbbb8c018c8c9a9c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.096696Z","signature_b64":"rxS0lnrSY1NhU4YhOno2xehh615lrKpaREn1xQ61SvR1Dj0MYvxkELtbzL5mJwx/huPHOeIdUjJ26fWPXbXBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76543457c6422de61ec055fb3218624477dc0a4d08173efbbb8c018c8c9a9c0","last_reissued_at":"2026-05-18T02:20:28.096150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.096150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07189","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-18T02:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tx528ARxAWLdO8Q0KXVmx/TAKDcdx0X3pm+U3E8ujlkjWO2wSEIQbwtLcoyCkzfQynq0CZLDqx6LL6K9GfomBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:06:17.972573Z"},"content_sha256":"61bd378496febbea57ae97df1a8be18e8881fec097a0781ee2b79b2492f888a7","schema_version":"1.0","event_id":"sha256:61bd378496febbea57ae97df1a8be18e8881fec097a0781ee2b79b2492f888a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W5SUGRL4MQRN4YPMAVP3GIMGER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal control in Markov decision processes via distributed optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Jie Fu, Shuo Han, Ufuk Topcu","submitted_at":"2015-03-24T20:28:51Z","abstract_excerpt":"Optimal control synthesis in stochastic systems with respect to quantitative temporal logic constraints can be formulated as linear programming problems. However, centralized synthesis algorithms do not scale to many practical systems. To tackle this issue, we propose a decomposition-based distributed synthesis algorithm. By decomposing a large-scale stochastic system modeled as a Markov decision process into a collection of interacting sub-systems, the original control problem is formulated as a linear programming problem with a sparse constraint matrix, which can be solved through distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07189","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-18T02:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdCAV19LHWtT5ZFdKl0xa6xYbebuuQvvgySuMSMBPgd2bVCl98VsyEP+dXybvlui8HhX65W6J2QthQFi/iw9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:06:17.973212Z"},"content_sha256":"4892c3fe52f2efc4bbc702f4f369d3975abe44c4ee3661e4d6004a4c2f3887c0","schema_version":"1.0","event_id":"sha256:4892c3fe52f2efc4bbc702f4f369d3975abe44c4ee3661e4d6004a4c2f3887c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/bundle.json","state_url":"https://pith.science/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/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-07T14:06:17Z","links":{"resolver":"https://pith.science/pith/W5SUGRL4MQRN4YPMAVP3GIMGER","bundle":"https://pith.science/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/bundle.json","state":"https://pith.science/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5SUGRL4MQRN4YPMAVP3GIMGER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W5SUGRL4MQRN4YPMAVP3GIMGER","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":"280d87ccc84a9be0856a15c064b75238e437aa6044008cd5007b3121d0d690c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:28:51Z","title_canon_sha256":"0650bfacf777ce55bc090a4059c282a28fd2f2e40ee3ef01e9555ebff992c8c0"},"schema_version":"1.0","source":{"id":"1503.07189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07189","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07189v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07189","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"W5SUGRL4MQRN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5SUGRL4MQRN4YPM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5SUGRL4","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:4892c3fe52f2efc4bbc702f4f369d3975abe44c4ee3661e4d6004a4c2f3887c0","target":"graph","created_at":"2026-05-18T02:20:28Z","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":"Optimal control synthesis in stochastic systems with respect to quantitative temporal logic constraints can be formulated as linear programming problems. However, centralized synthesis algorithms do not scale to many practical systems. To tackle this issue, we propose a decomposition-based distributed synthesis algorithm. By decomposing a large-scale stochastic system modeled as a Markov decision process into a collection of interacting sub-systems, the original control problem is formulated as a linear programming problem with a sparse constraint matrix, which can be solved through distribute","authors_text":"Jie Fu, Shuo Han, Ufuk Topcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:28:51Z","title":"Optimal control in Markov decision processes via distributed optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07189","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:61bd378496febbea57ae97df1a8be18e8881fec097a0781ee2b79b2492f888a7","target":"record","created_at":"2026-05-18T02:20:28Z","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":"280d87ccc84a9be0856a15c064b75238e437aa6044008cd5007b3121d0d690c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:28:51Z","title_canon_sha256":"0650bfacf777ce55bc090a4059c282a28fd2f2e40ee3ef01e9555ebff992c8c0"},"schema_version":"1.0","source":{"id":"1503.07189","kind":"arxiv","version":1}},"canonical_sha256":"b76543457c6422de61ec055fb3218624477dc0a4d08173efbbb8c018c8c9a9c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76543457c6422de61ec055fb3218624477dc0a4d08173efbbb8c018c8c9a9c0","first_computed_at":"2026-05-18T02:20:28.096150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:28.096150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rxS0lnrSY1NhU4YhOno2xehh615lrKpaREn1xQ61SvR1Dj0MYvxkELtbzL5mJwx/huPHOeIdUjJ26fWPXbXBCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:28.096696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61bd378496febbea57ae97df1a8be18e8881fec097a0781ee2b79b2492f888a7","sha256:4892c3fe52f2efc4bbc702f4f369d3975abe44c4ee3661e4d6004a4c2f3887c0"],"state_sha256":"7028621e0c9b7b65a11585aada21fa27428ac1f28e8c68a633f6f42196a060c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlMl47AMKUAqOSZ59EYDbo4vHPUvSxWe6E5EoAuWrP6H1Rn3tSbWRmo5lAXtInQLzCmUMCtDvIyh23d0QoehBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:06:17.977050Z","bundle_sha256":"7fe1a97d71d6dd3c4a970344a0d18388bcc7815c0bfb8bdbd26343fd7bc5291b"}}