{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DCXZOYUD4VJJMAT444CJAFVIFN","short_pith_number":"pith:DCXZOYUD","schema_version":"1.0","canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","source":{"kind":"arxiv","id":"1405.1827","version":7},"attestation_state":"computed","paper":{"title":"A Strongly Polynomial Reduction for Linear Programs over Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CC","authors_text":"Lorenz Klaus","submitted_at":"2014-05-08T07:43:09Z","abstract_excerpt":"We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with discounted Markov decision processes (MDPs). Through proposing reduction schemes for the GLCP, we obtain a strongly polynomial reduction from Grid-LPs to linear programs over cubes (Cube-LPs). As an application, we obtain a scheme to reduce discounted MDPs to their binary counterparts. This result also suggests that Cube-LPs are the key problems with respect to solva"},"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":"1405.1827","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-08T07:43:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8e8e14fc4b5d12a4f963a9b213d7ef85afb2dea210329f1f706915a4b1ec83b0","abstract_canon_sha256":"7c6856bce8808f06204ea1e8c06c542e115926ec86706b2ecc13b8c8afaf26cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.869904Z","signature_b64":"lidkElz5argUQxMM4t7B2Lk86KRgM9Jmc0TFy6RhSybiTqAk6RogHliL/KswQlDJDnghp7/QYaDVc9PR9qByAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","last_reissued_at":"2026-05-18T02:28:47.869546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.869546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Strongly Polynomial Reduction for Linear Programs over Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CC","authors_text":"Lorenz Klaus","submitted_at":"2014-05-08T07:43:09Z","abstract_excerpt":"We investigate the duality relation between linear programs over grids (Grid-LPs) and generalized linear complementarity problems (GLCPs) with hidden K-matrices. The two problems, moreover, share their combinatorial structure with discounted Markov decision processes (MDPs). Through proposing reduction schemes for the GLCP, we obtain a strongly polynomial reduction from Grid-LPs to linear programs over cubes (Cube-LPs). As an application, we obtain a scheme to reduce discounted MDPs to their binary counterparts. This result also suggests that Cube-LPs are the key problems with respect to solva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1827","kind":"arxiv","version":7},"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":"1405.1827","created_at":"2026-05-18T02:28:47.869599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1827v7","created_at":"2026-05-18T02:28:47.869599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1827","created_at":"2026-05-18T02:28:47.869599+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCXZOYUD4VJJ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCXZOYUD4VJJMAT4","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCXZOYUD","created_at":"2026-05-18T12:28:25.294606+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/DCXZOYUD4VJJMAT444CJAFVIFN","json":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN.json","graph_json":"https://pith.science/api/pith-number/DCXZOYUD4VJJMAT444CJAFVIFN/graph.json","events_json":"https://pith.science/api/pith-number/DCXZOYUD4VJJMAT444CJAFVIFN/events.json","paper":"https://pith.science/paper/DCXZOYUD"},"agent_actions":{"view_html":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN","download_json":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN.json","view_paper":"https://pith.science/paper/DCXZOYUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1827&json=true","fetch_graph":"https://pith.science/api/pith-number/DCXZOYUD4VJJMAT444CJAFVIFN/graph.json","fetch_events":"https://pith.science/api/pith-number/DCXZOYUD4VJJMAT444CJAFVIFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/action/storage_attestation","attest_author":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/action/author_attestation","sign_citation":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/action/citation_signature","submit_replication":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/action/replication_record"}},"created_at":"2026-05-18T02:28:47.869599+00:00","updated_at":"2026-05-18T02:28:47.869599+00:00"}