{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AWMWMEVSSCPMVCPDOAQPHUP5RF","short_pith_number":"pith:AWMWMEVS","schema_version":"1.0","canonical_sha256":"05996612b2909eca89e37020f3d1fd896c6edbe583127f080dbe465cf44a9300","source":{"kind":"arxiv","id":"1803.05167","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.05167","created_at":"2026-05-18T00:21:01.931370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05167v1","created_at":"2026-05-18T00:21:01.931370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05167","created_at":"2026-05-18T00:21:01.931370+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWMWMEVSSCPM","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWMWMEVSSCPMVCPD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWMWMEVS","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF","json":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF.json","graph_json":"https://pith.science/api/pith-number/AWMWMEVSSCPMVCPDOAQPHUP5RF/graph.json","events_json":"https://pith.science/api/pith-number/AWMWMEVSSCPMVCPDOAQPHUP5RF/events.json","paper":"https://pith.science/paper/AWMWMEVS"},"agent_actions":{"view_html":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF","download_json":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF.json","view_paper":"https://pith.science/paper/AWMWMEVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05167&json=true","fetch_graph":"https://pith.science/api/pith-number/AWMWMEVSSCPMVCPDOAQPHUP5RF/graph.json","fetch_events":"https://pith.science/api/pith-number/AWMWMEVSSCPMVCPDOAQPHUP5RF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/action/storage_attestation","attest_author":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/action/author_attestation","sign_citation":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/action/citation_signature","submit_replication":"https://pith.science/pith/AWMWMEVSSCPMVCPDOAQPHUP5RF/action/replication_record"}},"created_at":"2026-05-18T00:21:01.931370+00:00","updated_at":"2026-05-18T00:21:01.931370+00:00"}