{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AWMWMEVSSCPMVCPDOAQPHUP5RF","short_pith_number":"pith:AWMWMEVS","canonical_record":{"source":{"id":"1803.05167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T08:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"38c4540f5993bc0a76602ab2055b58a12f03842424b0632cc9391693f6e3d69f","abstract_canon_sha256":"40b719e14eee62aefe19ca34cb34933339cc7f4286a65eb071bd5912cc1b5b38"},"schema_version":"1.0"},"canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","source":{"kind":"arxiv","id":"1803.05167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05167","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05167v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05167","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"AWMWMEVSSCPM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWMWMEVSSCPMVCPD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWMWMEVS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AWMWMEVSSCPMVCPDOAQPHUP5RF","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T08:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"38c4540f5993bc0a76602ab2055b58a12f03842424b0632cc9391693f6e3d69f","abstract_canon_sha256":"40b719e14eee62aefe19ca34cb34933339cc7f4286a65eb071bd5912cc1b5b38"},"schema_version":"1.0"},"canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.933672Z","signature_b64":"F91m8gYn6F20golits+UdqMA4VOMgK4f/BJXCO4yimEvOkFjrP7lny4rI7+G/0eKstYaYA33UsgQnKNUX3fHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","last_reissued_at":"2026-05-18T00:21:01.931294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.931294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05167","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-18T00:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98o1ZPyNGm0YL4pcB4kn04qCLIbht1J1kKEM5N5kt4hrKBH4eoqKi583lL9bq4RKsj9puK8GVg3NuWQirhUBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:04:25.356832Z"},"content_sha256":"3f9385a7c15cd361d9d5f87502127816b916a75afbe9ee1baa0e764aef3543e9","schema_version":"1.0","event_id":"sha256:3f9385a7c15cd361d9d5f87502127816b916a75afbe9ee1baa0e764aef3543e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AWMWMEVSSCPMVCPDOAQPHUP5RF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generalization of the steepest-edge rule and its number of simplex iterations for a nondegenerate LP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara","submitted_at":"2018-03-14T08:57:09Z","abstract_excerpt":"In this paper, we propose a $p$-norm rule, which is a generalization of the steepest-edge rule, as a pivoting rule for the simplex method. For a nondegenerate linear programming problem, we show upper bounds for the number of iterations of the simplex method with the steepest-edge and $p$-norm rules. One of the upper bounds is given by a function of the number of variables, that of constraints, and the minimum and maximum positive elements in all basic feasible solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05167","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-18T00:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8c35aPyBOrMzEYMPvlwvee9cbv49ETooe0kb/szsh0vnQVVq8yKCVNmSNZkv/w55fLTL3zVUespo4tqvl4kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:04:25.357196Z"},"content_sha256":"2efdddc923f42e3f2c7e01fb269c5948a8947e566f8c0b7a6e34a488f956d4ed","schema_version":"1.0","event_id":"sha256:2efdddc923f42e3f2c7e01fb269c5948a8947e566f8c0b7a6e34a488f956d4ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/bundle.json","state_url":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/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-25T22:04:25Z","links":{"resolver":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF","bundle":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/bundle.json","state":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AWMWMEVSSCPMVCPDOAQPHUP5RF","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":"40b719e14eee62aefe19ca34cb34933339cc7f4286a65eb071bd5912cc1b5b38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T08:57:09Z","title_canon_sha256":"38c4540f5993bc0a76602ab2055b58a12f03842424b0632cc9391693f6e3d69f"},"schema_version":"1.0","source":{"id":"1803.05167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05167","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05167v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05167","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"AWMWMEVSSCPM","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWMWMEVSSCPMVCPD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWMWMEVS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:2efdddc923f42e3f2c7e01fb269c5948a8947e566f8c0b7a6e34a488f956d4ed","target":"graph","created_at":"2026-05-18T00:21:01Z","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":"In this paper, we propose a $p$-norm rule, which is a generalization of the steepest-edge rule, as a pivoting rule for the simplex method. For a nondegenerate linear programming problem, we show upper bounds for the number of iterations of the simplex method with the steepest-edge and $p$-norm rules. One of the upper bounds is given by a function of the number of variables, that of constraints, and the minimum and maximum positive elements in all basic feasible solutions.","authors_text":"Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T08:57:09Z","title":"A generalization of the steepest-edge rule and its number of simplex iterations for a nondegenerate LP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05167","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:3f9385a7c15cd361d9d5f87502127816b916a75afbe9ee1baa0e764aef3543e9","target":"record","created_at":"2026-05-18T00:21:01Z","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":"40b719e14eee62aefe19ca34cb34933339cc7f4286a65eb071bd5912cc1b5b38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-14T08:57:09Z","title_canon_sha256":"38c4540f5993bc0a76602ab2055b58a12f03842424b0632cc9391693f6e3d69f"},"schema_version":"1.0","source":{"id":"1803.05167","kind":"arxiv","version":1}},"canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","first_computed_at":"2026-05-18T00:21:01.931294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:01.931294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F91m8gYn6F20golits+UdqMA4VOMgK4f/BJXCO4yimEvOkFjrP7lny4rI7+G/0eKstYaYA33UsgQnKNUX3fHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:01.933672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f9385a7c15cd361d9d5f87502127816b916a75afbe9ee1baa0e764aef3543e9","sha256:2efdddc923f42e3f2c7e01fb269c5948a8947e566f8c0b7a6e34a488f956d4ed"],"state_sha256":"d2e192033f3dcd716eaf8a010b5b274bfcf9007758b00943486ce4258982fdaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pS5ion57eCf36LTVqT9IvkrzDovVuQjaSDMruXe20j+vi6WHxJxmKqst+QvoyxSP491so4an04IKEKCbQcLBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:04:25.359344Z","bundle_sha256":"1325b949ad3f3d182f3dc260d73ffdc978594d4041a4f05f8f5d1b997f7f423e"}}