{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VTL7S6JS2BOLPOUAWEDJVA6D2A","short_pith_number":"pith:VTL7S6JS","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"},"canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","source":{"kind":"arxiv","id":"1406.4539","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4539","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4539v3","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4539","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"VTL7S6JS2BOL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VTL7S6JS2BOLPOUA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VTL7S6JS","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VTL7S6JS2BOLPOUAWEDJVA6D2A","target":"record","payload":{"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"},"canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","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"},"source_kind":"arxiv","source_id":"1406.4539","source_version":3,"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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shT4WM2Y1iORi4z7g68v83CUOaexbWoxWZME5lYzYNXrjtmZv8Up9B7SL3wsJbCy21v94hdgnC3Tnaz2b/O2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:58:19.407404Z"},"content_sha256":"ed0a723415f1f4719e2843ae30b8e144cddfc79d1af366f5488be22e6137f429","schema_version":"1.0","event_id":"sha256:ed0a723415f1f4719e2843ae30b8e144cddfc79d1af366f5488be22e6137f429"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VTL7S6JS2BOLPOUAWEDJVA6D2A","target":"graph","payload":{"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"},"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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeRoGZA23hTk+QfEeAbQUptes9ApQcK8GX5V7fEUZrNgDog4nQ5kqizRnyqLwpOOfgkNtwEkpEJ/neN1Zl1TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:58:19.407748Z"},"content_sha256":"25c197de353732de01461c703a310113252875c09771ae6ca2a2564ffa4644e7","schema_version":"1.0","event_id":"sha256:25c197de353732de01461c703a310113252875c09771ae6ca2a2564ffa4644e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/bundle.json","state_url":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/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-30T15:58:19Z","links":{"resolver":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A","bundle":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/bundle.json","state":"https://pith.science/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTL7S6JS2BOLPOUAWEDJVA6D2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VTL7S6JS2BOLPOUAWEDJVA6D2A","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":"72c7be06bd391f79635d94ef530171e1bb3faf01971918a5eeb08e4dd06e2835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-17T20:53:29Z","title_canon_sha256":"3a4edce24e42aaa1992d381204c07b9cf856cfd0d95b8de531276c79d4c27f4c"},"schema_version":"1.0","source":{"id":"1406.4539","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4539","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4539v3","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4539","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"VTL7S6JS2BOL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VTL7S6JS2BOLPOUA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VTL7S6JS","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:25c197de353732de01461c703a310113252875c09771ae6ca2a2564ffa4644e7","target":"graph","created_at":"2026-05-18T00:47:38Z","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":"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","authors_text":"Yaguang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-17T20:53:29Z","title":"Arc-Search Infeasible Interior-Point Algorithm for Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4539","kind":"arxiv","version":3},"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:ed0a723415f1f4719e2843ae30b8e144cddfc79d1af366f5488be22e6137f429","target":"record","created_at":"2026-05-18T00:47:38Z","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":"72c7be06bd391f79635d94ef530171e1bb3faf01971918a5eeb08e4dd06e2835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-17T20:53:29Z","title_canon_sha256":"3a4edce24e42aaa1992d381204c07b9cf856cfd0d95b8de531276c79d4c27f4c"},"schema_version":"1.0","source":{"id":"1406.4539","kind":"arxiv","version":3}},"canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acd7f97932d05cb7ba80b1069a83c3d014c79ea762e46d753c1039a3cecac9a0","first_computed_at":"2026-05-18T00:47:38.418688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:38.418688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FpQX1aW0OMzgXmS6j8M53rTW/khdjK4PLJHn/b6RxvlPEcjY3AaO902nnJ57xlRDMdzHzUe0scl5PhrYvsAJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:38.419247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4539","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0a723415f1f4719e2843ae30b8e144cddfc79d1af366f5488be22e6137f429","sha256:25c197de353732de01461c703a310113252875c09771ae6ca2a2564ffa4644e7"],"state_sha256":"7b4baa47a9dc064fa129061d8c58f23c23d49a075e82434efac3bdad20786c32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLmu1vikfhPCabx2YJwutXNkLMS5889ADYdSrUEsPos3uXekfPgsF/qub0ru5SJbbByb/kKvkFwO8NCYyZhjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:58:19.409621Z","bundle_sha256":"84907ef24a4e8bc46d7141dd3d08a71643ea03057684945c14d367c1d0210ca2"}}