{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A5XPUOEIJL3NJJ4T4Z7IIWIMBG","short_pith_number":"pith:A5XPUOEI","canonical_record":{"source":{"id":"1412.1241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T09:09:32Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"47ce60cd5b048be5964e81620b8c34ed6221eded72af096af739a21c64ec72af","abstract_canon_sha256":"14800d57d7711fb5a2f62688a8b1808816a60bb3a1ee94d2dd85af4608677eec"},"schema_version":"1.0"},"canonical_sha256":"076efa38884af6d4a793e67e84590c09bc5aa0c9966845ca8d0a99a9c9b25b94","source":{"kind":"arxiv","id":"1412.1241","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A5XPUOEIJL3NJJ4T4Z7IIWIMBG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T09:09:32Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"47ce60cd5b048be5964e81620b8c34ed6221eded72af096af739a21c64ec72af","abstract_canon_sha256":"14800d57d7711fb5a2f62688a8b1808816a60bb3a1ee94d2dd85af4608677eec"},"schema_version":"1.0"},"canonical_sha256":"076efa38884af6d4a793e67e84590c09bc5aa0c9966845ca8d0a99a9c9b25b94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:13.037004Z","signature_b64":"NYch2Ng0qwpmXbULZs6Uesf6K3IrRzQTa5LvWzfT2b2EfLer5EBCO3A474g83FFjzlyB68kC23rtgBiVk6VGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076efa38884af6d4a793e67e84590c09bc5aa0c9966845ca8d0a99a9c9b25b94","last_reissued_at":"2026-05-18T02:32:13.036535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:13.036535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1241","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-18T02:32:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GSztzRbl6rJ8duy+I8G0p/gUpXH1d4mEFfDzbT4jqRZxVpiDvzmXRdsbxGfSr/pyLalCS+cw0sRb1Jp2BZ+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:02:12.044973Z"},"content_sha256":"b41705b287144e5a443d89edc9df02ead848da328f1854ac5bd7c8e4dff883f3","schema_version":"1.0","event_id":"sha256:b41705b287144e5a443d89edc9df02ead848da328f1854ac5bd7c8e4dff883f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A5XPUOEIJL3NJJ4T4Z7IIWIMBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Redundancy Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.CG","authors_text":"Bernd G\\\"artner, Komei Fukuda, May Szedl\\'ak","submitted_at":"2014-12-03T09:09:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1241","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-18T02:32:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBx17RbJaUjr2M/0YZylyYv60erQNd/e4DZn+meDWCaJ+pACpr2PpV1ximau7asoF5f4+VLTLE4sd+lkD/P6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:02:12.045339Z"},"content_sha256":"eb7e97d409509d9ec78d5cc1570170a37d3f4b4179a60b71816aa8f4b936092c","schema_version":"1.0","event_id":"sha256:eb7e97d409509d9ec78d5cc1570170a37d3f4b4179a60b71816aa8f4b936092c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/bundle.json","state_url":"https://pith.science/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/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-23T07:02:12Z","links":{"resolver":"https://pith.science/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG","bundle":"https://pith.science/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/bundle.json","state":"https://pith.science/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5XPUOEIJL3NJJ4T4Z7IIWIMBG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm5JRvFOQaB5EF/+t/8BtxbCd4S5Siv9ans4Luhi5EBrT+J3REtuEpVF5hMpu3Ji0zM4iE/QVqiV9v5F76ujDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:02:12.047343Z","bundle_sha256":"715b315c52fd9e6e4b63f6dd4129dbfdffbfc3021ad937474c94e58528d6964d"}}