{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VTL7S6JS2BOLPOUAWEDJVA6D2A","short_pith_number":"pith:VTL7S6JS","schema_version":"1.0","canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","source":{"kind":"arxiv","id":"1406.4539","version":3},"attestation_state":"computed","paper":{"title":"Arc-Search Infeasible Interior-Point Algorithm for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yaguang Yang","submitted_at":"2014-06-17T20:53:29Z","abstract_excerpt":"Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra's algorithm. This paper proposes an alternative algorithm, arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by arc-search infeasible interior-point algorithm and Mehrotra's algorithm, that the proposed arc-search infeasible interior-point algorithm is a more efficient algorithm than Mehrotra's algori"},"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":"1406.4539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-17T20:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"3a4edce24e42aaa1992d381204c07b9cf856cfd0d95b8de531276c79d4c27f4c","abstract_canon_sha256":"72c7be06bd391f79635d94ef530171e1bb3faf01971918a5eeb08e4dd06e2835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:38.419247Z","signature_b64":"FpQX1aW0OMzgXmS6j8M53rTW/khdjK4PLJHn/b6RxvlPEcjY3AaO902nnJ57xlRDMdzHzUe0scl5PhrYvsAJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","last_reissued_at":"2026-05-18T00:47:38.418688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:38.418688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arc-Search Infeasible Interior-Point Algorithm for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yaguang Yang","submitted_at":"2014-06-17T20:53:29Z","abstract_excerpt":"Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra's algorithm. This paper proposes an alternative algorithm, arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by arc-search infeasible interior-point algorithm and Mehrotra's algorithm, that the proposed arc-search infeasible interior-point algorithm is a more efficient algorithm than Mehrotra's algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4539","kind":"arxiv","version":3},"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":"1406.4539","created_at":"2026-05-18T00:47:38.418763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4539v3","created_at":"2026-05-18T00:47:38.418763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4539","created_at":"2026-05-18T00:47:38.418763+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTL7S6JS2BOL","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTL7S6JS2BOLPOUA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTL7S6JS","created_at":"2026-05-18T12:28:54.890064+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/VTL7S6JS2BOLPOUAWEDJVA6D2A","json":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A.json","graph_json":"https://pith.science/api/pith-number/VTL7S6JS2BOLPOUAWEDJVA6D2A/graph.json","events_json":"https://pith.science/api/pith-number/VTL7S6JS2BOLPOUAWEDJVA6D2A/events.json","paper":"https://pith.science/paper/VTL7S6JS"},"agent_actions":{"view_html":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A","download_json":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A.json","view_paper":"https://pith.science/paper/VTL7S6JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4539&json=true","fetch_graph":"https://pith.science/api/pith-number/VTL7S6JS2BOLPOUAWEDJVA6D2A/graph.json","fetch_events":"https://pith.science/api/pith-number/VTL7S6JS2BOLPOUAWEDJVA6D2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/action/storage_attestation","attest_author":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/action/author_attestation","sign_citation":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/action/citation_signature","submit_replication":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/action/replication_record"}},"created_at":"2026-05-18T00:47:38.418763+00:00","updated_at":"2026-05-18T00:47:38.418763+00:00"}