{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DCXZOYUD4VJJMAT444CJAFVIFN","short_pith_number":"pith:DCXZOYUD","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"},"canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","source":{"kind":"arxiv","id":"1405.1827","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1827","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1827v7","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1827","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"DCXZOYUD4VJJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DCXZOYUD4VJJMAT4","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DCXZOYUD","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DCXZOYUD4VJJMAT444CJAFVIFN","target":"record","payload":{"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"},"canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","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"},"source_kind":"arxiv","source_id":"1405.1827","source_version":7,"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LE0lwj8n364wKFDMlC+TQEqi4b52cIcPvPzpxNZt/IgLXbtWrG7NWezbOAS+m/hnlACfaVBbYMYk0VpRa2gmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:33.516805Z"},"content_sha256":"4d0b8acbded7e44866a397cf78ac5b073256bf50966eff659cd5b5ca97f4bb1e","schema_version":"1.0","event_id":"sha256:4d0b8acbded7e44866a397cf78ac5b073256bf50966eff659cd5b5ca97f4bb1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DCXZOYUD4VJJMAT444CJAFVIFN","target":"graph","payload":{"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"},"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eM9Ujc2UBQ5gSa9weKIDHSvrKkc7YwR+/fuK17tVdPLgWQp7BQ2RpEOYRWmMGlI/n9J/0DS4AhGTnDzP4IDfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:33.517522Z"},"content_sha256":"7096926cd8c8dca1334060f8e9ae289d52f815ad1e860d17649cf5469768ebe5","schema_version":"1.0","event_id":"sha256:7096926cd8c8dca1334060f8e9ae289d52f815ad1e860d17649cf5469768ebe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/bundle.json","state_url":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCXZOYUD4VJJMAT444CJAFVIFN/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-04T22:18:33Z","links":{"resolver":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN","bundle":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/bundle.json","state":"https://pith.science/pith/DCXZOYUD4VJJMAT444CJAFVIFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCXZOYUD4VJJMAT444CJAFVIFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DCXZOYUD4VJJMAT444CJAFVIFN","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":"7c6856bce8808f06204ea1e8c06c542e115926ec86706b2ecc13b8c8afaf26cc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-08T07:43:09Z","title_canon_sha256":"8e8e14fc4b5d12a4f963a9b213d7ef85afb2dea210329f1f706915a4b1ec83b0"},"schema_version":"1.0","source":{"id":"1405.1827","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1827","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1827v7","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1827","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"DCXZOYUD4VJJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DCXZOYUD4VJJMAT4","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DCXZOYUD","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:7096926cd8c8dca1334060f8e9ae289d52f815ad1e860d17649cf5469768ebe5","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"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","authors_text":"Lorenz Klaus","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-08T07:43:09Z","title":"A Strongly Polynomial Reduction for Linear Programs over Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1827","kind":"arxiv","version":7},"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:4d0b8acbded7e44866a397cf78ac5b073256bf50966eff659cd5b5ca97f4bb1e","target":"record","created_at":"2026-05-18T02:28:47Z","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":"7c6856bce8808f06204ea1e8c06c542e115926ec86706b2ecc13b8c8afaf26cc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-08T07:43:09Z","title_canon_sha256":"8e8e14fc4b5d12a4f963a9b213d7ef85afb2dea210329f1f706915a4b1ec83b0"},"schema_version":"1.0","source":{"id":"1405.1827","kind":"arxiv","version":7}},"canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18af976283e55296027ce7049016a82b4ae6e6c2ccf056f7b66968e627851c1a","first_computed_at":"2026-05-18T02:28:47.869546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.869546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lidkElz5argUQxMM4t7B2Lk86KRgM9Jmc0TFy6RhSybiTqAk6RogHliL/KswQlDJDnghp7/QYaDVc9PR9qByAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.869904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1827","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d0b8acbded7e44866a397cf78ac5b073256bf50966eff659cd5b5ca97f4bb1e","sha256:7096926cd8c8dca1334060f8e9ae289d52f815ad1e860d17649cf5469768ebe5"],"state_sha256":"e450a57573f370f76e28c465caf5fb5fb9aae728e101ad61a2518b067506e899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nP31TrLH47N+kjBRa6bt6CRX7PJg/9pHHiHOvHofGAWkEQZjaXJSFkMNDl2g3a9hV2MsBNi0qgKTmSh9MV6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:18:33.520994Z","bundle_sha256":"1c9147aa09d97ad2c0fe1b4c6d0c156f6cf95968f47e3a396c1acde9298ee102"}}