{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KTA2OPMXKGKJR4TNAGEKGRKUC6","short_pith_number":"pith:KTA2OPMX","schema_version":"1.0","canonical_sha256":"54c1a73d97519498f26d0188a3455417b90d7d4c7481906bb68e29d0c71cb849","source":{"kind":"arxiv","id":"1803.04378","version":1},"attestation_state":"computed","paper":{"title":"Effective Implementation of GPU-based Revised Simplex algorithm applying new memory management and cycle avoidance strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Arash Raeisi Gahrouei, Mehdi Ghatee","submitted_at":"2018-03-12T17:11:31Z","abstract_excerpt":"Graphics Processing Units (GPUs) with high computational capabilities used as modern parallel platforms to deal with complex computational problems. We use this platform to solve large-scale linear programing problems by revised simplex algorithm. To implement this algorithm, we propose some new memory management strategies. In addition, to avoid cycling because of degeneracy conditions, we use a tabu rule for entering variable selection in the revised simplex algorithm. To evaluate this algorithm, we consider two sets of benchmark problems and compare the speedup factors for these problems. T"},"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.04378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-12T17:11:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5a195e26ebc7d2c1a178effcc5f7ad5ca91750eab6b1fb890277371010d443a9","abstract_canon_sha256":"86174d16efd2951c439a1aceac9852ef6b7a065f990212730be3e6024420f19f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.123951Z","signature_b64":"CiYkhqbxCAxGrSmC7IxNT1EuVzAD+RqWZVcJpKZBmPTUN3G37V3sK6hdPX0/jAP6iESOZlekIZ9z3tqrLyuvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c1a73d97519498f26d0188a3455417b90d7d4c7481906bb68e29d0c71cb849","last_reissued_at":"2026-05-18T00:21:19.123439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.123439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Implementation of GPU-based Revised Simplex algorithm applying new memory management and cycle avoidance strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Arash Raeisi Gahrouei, Mehdi Ghatee","submitted_at":"2018-03-12T17:11:31Z","abstract_excerpt":"Graphics Processing Units (GPUs) with high computational capabilities used as modern parallel platforms to deal with complex computational problems. We use this platform to solve large-scale linear programing problems by revised simplex algorithm. To implement this algorithm, we propose some new memory management strategies. In addition, to avoid cycling because of degeneracy conditions, we use a tabu rule for entering variable selection in the revised simplex algorithm. To evaluate this algorithm, we consider two sets of benchmark problems and compare the speedup factors for these problems. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04378","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.04378","created_at":"2026-05-18T00:21:19.123503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04378v1","created_at":"2026-05-18T00:21:19.123503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04378","created_at":"2026-05-18T00:21:19.123503+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTA2OPMXKGKJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTA2OPMXKGKJR4TN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTA2OPMX","created_at":"2026-05-18T12:32:33.847187+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/KTA2OPMXKGKJR4TNAGEKGRKUC6","json":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6.json","graph_json":"https://pith.science/api/pith-number/KTA2OPMXKGKJR4TNAGEKGRKUC6/graph.json","events_json":"https://pith.science/api/pith-number/KTA2OPMXKGKJR4TNAGEKGRKUC6/events.json","paper":"https://pith.science/paper/KTA2OPMX"},"agent_actions":{"view_html":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6","download_json":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6.json","view_paper":"https://pith.science/paper/KTA2OPMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04378&json=true","fetch_graph":"https://pith.science/api/pith-number/KTA2OPMXKGKJR4TNAGEKGRKUC6/graph.json","fetch_events":"https://pith.science/api/pith-number/KTA2OPMXKGKJR4TNAGEKGRKUC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6/action/storage_attestation","attest_author":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6/action/author_attestation","sign_citation":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6/action/citation_signature","submit_replication":"https://pith.science/pith/KTA2OPMXKGKJR4TNAGEKGRKUC6/action/replication_record"}},"created_at":"2026-05-18T00:21:19.123503+00:00","updated_at":"2026-05-18T00:21:19.123503+00:00"}