{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3LCNSQA4VGSWOFMSIVQHVZCWJW","short_pith_number":"pith:3LCNSQA4","canonical_record":{"source":{"id":"1610.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T09:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"101bf2f3bf3ca9f016f994fb9e5e911af857fbbc30aecb7701f07141d472eb6a","abstract_canon_sha256":"609abb78374a8a2718256ea18f7bea9b94390a2e8da21d43f8cfbc4ccb8b99b5"},"schema_version":"1.0"},"canonical_sha256":"dac4d9401ca9a567159245607ae4564da6b170f9cca1fd8e48f03aa276c7d44e","source":{"kind":"arxiv","id":"1610.02820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02820","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02820v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02820","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"3LCNSQA4VGSW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3LCNSQA4VGSWOFMS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3LCNSQA4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3LCNSQA4VGSWOFMSIVQHVZCWJW","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T09:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"101bf2f3bf3ca9f016f994fb9e5e911af857fbbc30aecb7701f07141d472eb6a","abstract_canon_sha256":"609abb78374a8a2718256ea18f7bea9b94390a2e8da21d43f8cfbc4ccb8b99b5"},"schema_version":"1.0"},"canonical_sha256":"dac4d9401ca9a567159245607ae4564da6b170f9cca1fd8e48f03aa276c7d44e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.630049Z","signature_b64":"nSeGHXKy9rZB0NLCciMQDUOZk9uAnbNUzLlk1qGgUAwgD9P9PcUFs9qStg1YWTrsKTjNFPeUaG/IvCT9X4SLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac4d9401ca9a567159245607ae4564da6b170f9cca1fd8e48f03aa276c7d44e","last_reissued_at":"2026-05-18T01:02:50.629579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.629579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02820","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"do1JVv/k+bniozJSBkLhCB6nAQNPRSkTpz+ieA3Lql4vubufpk6aQOnGeOOhVbeRCbqxb6JcS0tMG9BnVFMTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:14.940735Z"},"content_sha256":"79ef2ef09586fac1c74063a03a4e66fa51a777f9c3921071f052f36a4e8b1667","schema_version":"1.0","event_id":"sha256:79ef2ef09586fac1c74063a03a4e66fa51a777f9c3921071f052f36a4e8b1667"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3LCNSQA4VGSWOFMSIVQHVZCWJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Redundancies in Linear Systems with two Variables per Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Komei Fukuda, May Szedlak","submitted_at":"2016-10-10T09:30:23Z","abstract_excerpt":"The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs), given by $d$ variables with $n$ inequality constraints. A constraint is called \\emph{redundant}, if after its removal, the LP still has the same feasible region. The currently fastest method to detect all redundancies is due to Clarkson: it solves $n$ linear programs, but each of them has at most $s$ constraints, where $s$ is the number of nonredundant constraints.\n  In this paper, we study the special case where every constraint has at most two variables w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02820","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qivP6FPd+0W4GVNjmixEs/hgI85k2Ri4btvSuv4Azhg16LsulLGBbuM3HDytPLgyEdPuc3wpw9MjIXC5GuR3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:14.941108Z"},"content_sha256":"ccacbc28127d5f87b0e9bac9921549d613cae47dcf75d0293a110bd640e4b230","schema_version":"1.0","event_id":"sha256:ccacbc28127d5f87b0e9bac9921549d613cae47dcf75d0293a110bd640e4b230"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/bundle.json","state_url":"https://pith.science/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/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-01T11:25:14Z","links":{"resolver":"https://pith.science/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW","bundle":"https://pith.science/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/bundle.json","state":"https://pith.science/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LCNSQA4VGSWOFMSIVQHVZCWJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3LCNSQA4VGSWOFMSIVQHVZCWJW","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":"609abb78374a8a2718256ea18f7bea9b94390a2e8da21d43f8cfbc4ccb8b99b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T09:30:23Z","title_canon_sha256":"101bf2f3bf3ca9f016f994fb9e5e911af857fbbc30aecb7701f07141d472eb6a"},"schema_version":"1.0","source":{"id":"1610.02820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02820","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02820v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02820","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"3LCNSQA4VGSW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3LCNSQA4VGSWOFMS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3LCNSQA4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:ccacbc28127d5f87b0e9bac9921549d613cae47dcf75d0293a110bd640e4b230","target":"graph","created_at":"2026-05-18T01:02:50Z","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), given by $d$ variables with $n$ inequality constraints. A constraint is called \\emph{redundant}, if after its removal, the LP still has the same feasible region. The currently fastest method to detect all redundancies is due to Clarkson: it solves $n$ linear programs, but each of them has at most $s$ constraints, where $s$ is the number of nonredundant constraints.\n  In this paper, we study the special case where every constraint has at most two variables w","authors_text":"Komei Fukuda, May Szedlak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T09:30:23Z","title":"Redundancies in Linear Systems with two Variables per Inequality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02820","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:79ef2ef09586fac1c74063a03a4e66fa51a777f9c3921071f052f36a4e8b1667","target":"record","created_at":"2026-05-18T01:02:50Z","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":"609abb78374a8a2718256ea18f7bea9b94390a2e8da21d43f8cfbc4ccb8b99b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-10T09:30:23Z","title_canon_sha256":"101bf2f3bf3ca9f016f994fb9e5e911af857fbbc30aecb7701f07141d472eb6a"},"schema_version":"1.0","source":{"id":"1610.02820","kind":"arxiv","version":1}},"canonical_sha256":"dac4d9401ca9a567159245607ae4564da6b170f9cca1fd8e48f03aa276c7d44e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac4d9401ca9a567159245607ae4564da6b170f9cca1fd8e48f03aa276c7d44e","first_computed_at":"2026-05-18T01:02:50.629579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.629579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nSeGHXKy9rZB0NLCciMQDUOZk9uAnbNUzLlk1qGgUAwgD9P9PcUFs9qStg1YWTrsKTjNFPeUaG/IvCT9X4SLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.630049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79ef2ef09586fac1c74063a03a4e66fa51a777f9c3921071f052f36a4e8b1667","sha256:ccacbc28127d5f87b0e9bac9921549d613cae47dcf75d0293a110bd640e4b230"],"state_sha256":"1547d20093f61b1326be4ad4d00eed94541d97a8f03caeb5e6e2ca1e53ba7e05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHVQYLuZjKkbJUZ9vvIcNmGH+AGoT4oQOEmmfMB7vZ4QrHW+FUcAzCAfEPtbVc8uKlHLh17useRlNxjyKGW5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:25:14.943056Z","bundle_sha256":"3abdf6d999b1acf7dc036195f5a372e016fe107a9b00fc37962962fea6447e08"}}