{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4A4TXNZHWAAOEBFJYPOTOQ4ELE","short_pith_number":"pith:4A4TXNZH","schema_version":"1.0","canonical_sha256":"e0393bb727b000e204a9c3dd3743845916f77a6cfa26903275b8332b83acf830","source":{"kind":"arxiv","id":"1704.02544","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.02544","created_at":"2026-05-18T00:46:45.167573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02544v1","created_at":"2026-05-18T00:46:45.167573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02544","created_at":"2026-05-18T00:46:45.167573+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A4TXNZHWAAO","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A4TXNZHWAAOEBFJ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A4TXNZH","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE","json":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE.json","graph_json":"https://pith.science/api/pith-number/4A4TXNZHWAAOEBFJYPOTOQ4ELE/graph.json","events_json":"https://pith.science/api/pith-number/4A4TXNZHWAAOEBFJYPOTOQ4ELE/events.json","paper":"https://pith.science/paper/4A4TXNZH"},"agent_actions":{"view_html":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE","download_json":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE.json","view_paper":"https://pith.science/paper/4A4TXNZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02544&json=true","fetch_graph":"https://pith.science/api/pith-number/4A4TXNZHWAAOEBFJYPOTOQ4ELE/graph.json","fetch_events":"https://pith.science/api/pith-number/4A4TXNZHWAAOEBFJYPOTOQ4ELE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/action/storage_attestation","attest_author":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/action/author_attestation","sign_citation":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/action/citation_signature","submit_replication":"https://pith.science/pith/4A4TXNZHWAAOEBFJYPOTOQ4ELE/action/replication_record"}},"created_at":"2026-05-18T00:46:45.167573+00:00","updated_at":"2026-05-18T00:46:45.167573+00:00"}