{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A5XPUOEIJL3NJJ4T4Z7IIWIMBG","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":"14800d57d7711fb5a2f62688a8b1808816a60bb3a1ee94d2dd85af4608677eec","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T09:09:32Z","title_canon_sha256":"47ce60cd5b048be5964e81620b8c34ed6221eded72af096af739a21c64ec72af"},"schema_version":"1.0","source":{"id":"1412.1241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1241","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1241v1","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1241","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"pith_short_12","alias_value":"A5XPUOEIJL3N","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A5XPUOEIJL3NJJ4T","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A5XPUOEI","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:eb7e97d409509d9ec78d5cc1570170a37d3f4b4179a60b71816aa8f4b936092c","target":"graph","created_at":"2026-05-18T02:32:13Z","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":"The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by $n$ equality constraints in $n+d$ variables, where the variables are constrained to be nonnegative. A variable $x_r$ is called redundant, if after removing $x_r \\geq 0$ the LP still has the same feasible region. The time needed to solve such an LP is denoted by $LP(n,d)$.\n  It is easy to see that solving $n+d$ LPs of the above size is sufficient to detect all redundancies. The currently fastest practical method is the one by Clar","authors_text":"Bernd G\\\"artner, Komei Fukuda, May Szedl\\'ak","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T09:09:32Z","title":"Combinatorial Redundancy Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1241","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:b41705b287144e5a443d89edc9df02ead848da328f1854ac5bd7c8e4dff883f3","target":"record","created_at":"2026-05-18T02:32:13Z","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":"14800d57d7711fb5a2f62688a8b1808816a60bb3a1ee94d2dd85af4608677eec","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T09:09:32Z","title_canon_sha256":"47ce60cd5b048be5964e81620b8c34ed6221eded72af096af739a21c64ec72af"},"schema_version":"1.0","source":{"id":"1412.1241","kind":"arxiv","version":1}},"canonical_sha256":"076efa38884af6d4a793e67e84590c09bc5aa0c9966845ca8d0a99a9c9b25b94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"076efa38884af6d4a793e67e84590c09bc5aa0c9966845ca8d0a99a9c9b25b94","first_computed_at":"2026-05-18T02:32:13.036535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:13.036535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYch2Ng0qwpmXbULZs6Uesf6K3IrRzQTa5LvWzfT2b2EfLer5EBCO3A474g83FFjzlyB68kC23rtgBiVk6VGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:13.037004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b41705b287144e5a443d89edc9df02ead848da328f1854ac5bd7c8e4dff883f3","sha256:eb7e97d409509d9ec78d5cc1570170a37d3f4b4179a60b71816aa8f4b936092c"],"state_sha256":"4ca4f0ffa03e5d1f5d913a3632d36b539e3b5d92406e60a4aa9debfca7717115"}