{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2IMXDOFMK32JM3G2LBLXFZTMS7","short_pith_number":"pith:2IMXDOFM","canonical_record":{"source":{"id":"1409.3536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T18:42:58Z","cross_cats_sorted":[],"title_canon_sha256":"6c86b380e7a16635e1b0f12f3a7a592e8f50f41682fd0e2a3d584bfae7f41a65","abstract_canon_sha256":"6c82b6ec400a3b8505cc53d8c017df3accf0a5655dc6f969995a823b5a728259"},"schema_version":"1.0"},"canonical_sha256":"d21971b8ac56f4966cda585772e66c97cf475e596cc87129324c328f882c5e3c","source":{"kind":"arxiv","id":"1409.3536","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3536","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3536v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3536","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"2IMXDOFMK32J","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2IMXDOFMK32JM3G2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2IMXDOFM","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2IMXDOFMK32JM3G2LBLXFZTMS7","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T18:42:58Z","cross_cats_sorted":[],"title_canon_sha256":"6c86b380e7a16635e1b0f12f3a7a592e8f50f41682fd0e2a3d584bfae7f41a65","abstract_canon_sha256":"6c82b6ec400a3b8505cc53d8c017df3accf0a5655dc6f969995a823b5a728259"},"schema_version":"1.0"},"canonical_sha256":"d21971b8ac56f4966cda585772e66c97cf475e596cc87129324c328f882c5e3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.757202Z","signature_b64":"n9xdJ6yIixNJ5ePqzY/0MRJE9LYbdFQpE11u156JjzlSmS8bYhu/W6EVg8Njje7hrGsopwGGbf5d+Uv0LM3pBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d21971b8ac56f4966cda585772e66c97cf475e596cc87129324c328f882c5e3c","last_reissued_at":"2026-05-18T02:34:51.756809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.756809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3536","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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZQq95/RRExB+ux7fpSnAWJO2eLgEuSs91fqnIH+vYKRCDJ3bd3wlPksVFWIcHSmjW6Nf7eSpaefC94yIQipDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:52.398368Z"},"content_sha256":"b6dbf13055e451adbb486ae85df208a89a3a5e762bd8868351d914f59c470640","schema_version":"1.0","event_id":"sha256:b6dbf13055e451adbb486ae85df208a89a3a5e762bd8868351d914f59c470640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2IMXDOFMK32JM3G2LBLXFZTMS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Reduced Linear Program for Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Chandrashekar Lakshminarayanan, Shalabh Bhatnagar","submitted_at":"2014-09-11T18:42:58Z","abstract_excerpt":"Markov decision processes (MDPs) with large number of states are of high practical interest. However, conventional algorithms to solve MDP are computationally infeasible in this scenario. Approximate dynamic programming (ADP) methods tackle this issue by computing approximate solutions. A widely applied ADP method is approximate linear program (ALP) which makes use of linear function approximation and offers theoretical performance guarantees. Nevertheless, the ALP is difficult to solve due to the presence of a large number of constraints and in practice, a reduced linear program (RLP) is solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3536","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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcERt71DT1ZTZ/C5hpu5Fd+e0Lw+eLOjhPthEz/yjwquh5Dl3eEy0c/w+ebIBzoUcl5IbTb3DLnxjcHeD2HJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:52.398747Z"},"content_sha256":"f9ee15a2fd3b98e1b7e60a02b224fb4df21190edb7bbfaa23a486e8a496163a3","schema_version":"1.0","event_id":"sha256:f9ee15a2fd3b98e1b7e60a02b224fb4df21190edb7bbfaa23a486e8a496163a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/bundle.json","state_url":"https://pith.science/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/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-03T15:11:52Z","links":{"resolver":"https://pith.science/pith/2IMXDOFMK32JM3G2LBLXFZTMS7","bundle":"https://pith.science/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/bundle.json","state":"https://pith.science/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IMXDOFMK32JM3G2LBLXFZTMS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2IMXDOFMK32JM3G2LBLXFZTMS7","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":"6c82b6ec400a3b8505cc53d8c017df3accf0a5655dc6f969995a823b5a728259","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T18:42:58Z","title_canon_sha256":"6c86b380e7a16635e1b0f12f3a7a592e8f50f41682fd0e2a3d584bfae7f41a65"},"schema_version":"1.0","source":{"id":"1409.3536","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3536","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3536v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3536","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"2IMXDOFMK32J","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2IMXDOFMK32JM3G2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2IMXDOFM","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:f9ee15a2fd3b98e1b7e60a02b224fb4df21190edb7bbfaa23a486e8a496163a3","target":"graph","created_at":"2026-05-18T02:34:51Z","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":"Markov decision processes (MDPs) with large number of states are of high practical interest. However, conventional algorithms to solve MDP are computationally infeasible in this scenario. Approximate dynamic programming (ADP) methods tackle this issue by computing approximate solutions. A widely applied ADP method is approximate linear program (ALP) which makes use of linear function approximation and offers theoretical performance guarantees. Nevertheless, the ALP is difficult to solve due to the presence of a large number of constraints and in practice, a reduced linear program (RLP) is solv","authors_text":"Chandrashekar Lakshminarayanan, Shalabh Bhatnagar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T18:42:58Z","title":"A Generalized Reduced Linear Program for Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3536","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:b6dbf13055e451adbb486ae85df208a89a3a5e762bd8868351d914f59c470640","target":"record","created_at":"2026-05-18T02:34:51Z","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":"6c82b6ec400a3b8505cc53d8c017df3accf0a5655dc6f969995a823b5a728259","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-11T18:42:58Z","title_canon_sha256":"6c86b380e7a16635e1b0f12f3a7a592e8f50f41682fd0e2a3d584bfae7f41a65"},"schema_version":"1.0","source":{"id":"1409.3536","kind":"arxiv","version":2}},"canonical_sha256":"d21971b8ac56f4966cda585772e66c97cf475e596cc87129324c328f882c5e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d21971b8ac56f4966cda585772e66c97cf475e596cc87129324c328f882c5e3c","first_computed_at":"2026-05-18T02:34:51.756809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.756809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9xdJ6yIixNJ5ePqzY/0MRJE9LYbdFQpE11u156JjzlSmS8bYhu/W6EVg8Njje7hrGsopwGGbf5d+Uv0LM3pBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.757202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3536","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6dbf13055e451adbb486ae85df208a89a3a5e762bd8868351d914f59c470640","sha256:f9ee15a2fd3b98e1b7e60a02b224fb4df21190edb7bbfaa23a486e8a496163a3"],"state_sha256":"15a199fd1e35f3e6c78220f8d072f341b09976c93471bb6b91f7e972d8a0f410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPYzNFV5rvQX0RftM1RHKmyHe5kUalTkuACNERqScgw8/WSnFK3Xeteo/c7qoqMPQmPWPk4wIZBB0qEW6OJgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:11:52.400739Z","bundle_sha256":"ea406bedc1d40f3170eef40ce996c223b1507c23b2b8eb8818e3e235e6e450b0"}}