{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4A4TXNZHWAAOEBFJYPOTOQ4ELE","short_pith_number":"pith:4A4TXNZH","canonical_record":{"source":{"id":"1704.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-09T00:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"47d0f8ece683ffb37d54f3501f1acf004e0a58e1d14fd54e9e10007784f1a9f1","abstract_canon_sha256":"778aef7e6f58a6887d39de0ff3ce704e298c5933cc447f598d8e202ba6657a19"},"schema_version":"1.0"},"canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","source":{"kind":"arxiv","id":"1704.02544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02544","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02544v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02544","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"4A4TXNZHWAAO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4A4TXNZHWAAOEBFJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4A4TXNZH","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4A4TXNZHWAAOEBFJYPOTOQ4ELE","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-09T00:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"47d0f8ece683ffb37d54f3501f1acf004e0a58e1d14fd54e9e10007784f1a9f1","abstract_canon_sha256":"778aef7e6f58a6887d39de0ff3ce704e298c5933cc447f598d8e202ba6657a19"},"schema_version":"1.0"},"canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.168151Z","signature_b64":"dB+EauuaAAZr4gP/7YUkoJ/6LP4WA/uxlklsr9iHLfR9/C+7MXyxEx5V4qMUB7oUcn6XkfIt9Z6hEDZLqa9mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","last_reissued_at":"2026-05-18T00:46:45.167465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.167465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgAyTww8P1YyBavW4wZTDWKuKN5VjYh4Q+xghkLBlLcLr0Oi7yoV8AL44iOpj0lesgTiVsIkiqFtReTEbo4aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:21:47.351925Z"},"content_sha256":"854d98501a86971f98c5aa021d01a93fcdaa2324f11afff030a731a71d3ace0a","schema_version":"1.0","event_id":"sha256:854d98501a86971f98c5aa021d01a93fcdaa2324f11afff030a731a71d3ace0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4A4TXNZHWAAOEBFJYPOTOQ4ELE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linearly Relaxed Approximate 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, Csaba Szepesvari, Shalabh Bhatnagar","submitted_at":"2017-04-09T00:33:53Z","abstract_excerpt":"Approximate linear programming (ALP) and its variants have been widely applied to Markov Decision Processes (MDPs) with a large number of states. A serious limitation of ALP is that it has an intractable number of constraints, as a result of which constraint approximations are of interest. In this paper, we define a linearly relaxed approximation linear program (LRALP) that has a tractable number of constraints, obtained as positive linear combinations of the original constraints of the ALP. The main contribution is a novel performance bound for LRALP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6AMYBCdmEt+ABmZzGp5U1pz5sZPxfI9gt5KHbWN5Lr+k5ljpCbZjoLnf+4OnsSBunEPIdVWWiGqngBFDhLLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:21:47.352267Z"},"content_sha256":"79a9de87a9865f25e051b6fd50d0412e5bab4fa6713232191861f06f169a09db","schema_version":"1.0","event_id":"sha256:79a9de87a9865f25e051b6fd50d0412e5bab4fa6713232191861f06f169a09db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/bundle.json","state_url":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/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-03T17:21:47Z","links":{"resolver":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE","bundle":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/bundle.json","state":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4A4TXNZHWAAOEBFJYPOTOQ4ELE","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":"778aef7e6f58a6887d39de0ff3ce704e298c5933cc447f598d8e202ba6657a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-09T00:33:53Z","title_canon_sha256":"47d0f8ece683ffb37d54f3501f1acf004e0a58e1d14fd54e9e10007784f1a9f1"},"schema_version":"1.0","source":{"id":"1704.02544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02544","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02544v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02544","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"4A4TXNZHWAAO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4A4TXNZHWAAOEBFJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4A4TXNZH","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:79a9de87a9865f25e051b6fd50d0412e5bab4fa6713232191861f06f169a09db","target":"graph","created_at":"2026-05-18T00:46:45Z","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":"Approximate linear programming (ALP) and its variants have been widely applied to Markov Decision Processes (MDPs) with a large number of states. A serious limitation of ALP is that it has an intractable number of constraints, as a result of which constraint approximations are of interest. In this paper, we define a linearly relaxed approximation linear program (LRALP) that has a tractable number of constraints, obtained as positive linear combinations of the original constraints of the ALP. The main contribution is a novel performance bound for LRALP.","authors_text":"Chandrashekar Lakshminarayanan, Csaba Szepesvari, Shalabh Bhatnagar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-09T00:33:53Z","title":"A Linearly Relaxed Approximate Linear Program for Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.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:854d98501a86971f98c5aa021d01a93fcdaa2324f11afff030a731a71d3ace0a","target":"record","created_at":"2026-05-18T00:46:45Z","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":"778aef7e6f58a6887d39de0ff3ce704e298c5933cc447f598d8e202ba6657a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-09T00:33:53Z","title_canon_sha256":"47d0f8ece683ffb37d54f3501f1acf004e0a58e1d14fd54e9e10007784f1a9f1"},"schema_version":"1.0","source":{"id":"1704.02544","kind":"arxiv","version":1}},"canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","first_computed_at":"2026-05-18T00:46:45.167465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:45.167465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dB+EauuaAAZr4gP/7YUkoJ/6LP4WA/uxlklsr9iHLfR9/C+7MXyxEx5V4qMUB7oUcn6XkfIt9Z6hEDZLqa9mCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:45.168151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854d98501a86971f98c5aa021d01a93fcdaa2324f11afff030a731a71d3ace0a","sha256:79a9de87a9865f25e051b6fd50d0412e5bab4fa6713232191861f06f169a09db"],"state_sha256":"fca729953d5f358f5602ee1542f07646c1bde9fb7124e66f7bbb7d6edb9c84e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKieQbKQ3hHDbVFkhxBCgmQWoUgCntGr++xhC0+VxNBmONAGgjfXNZ+cd92GL4GndVODorGkeIEuhbl149ztCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:21:47.354193Z","bundle_sha256":"ae87c72a06e6a83b43a0667047576fbbe7fe97f1cdd0cd451961c371e609c848"}}