{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KGAD5YYKVT7OCXAPHZGURGO5IP","short_pith_number":"pith:KGAD5YYK","canonical_record":{"source":{"id":"1609.00694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-02T18:39:37Z","cross_cats_sorted":[],"title_canon_sha256":"e44b04ed4621221da3923bca7913d321d18bf960a4f63356faf3c17684f94b10","abstract_canon_sha256":"c75d44bddfb2bba0c823aa30b69b27814732ad5e9de486de05bbfdd1dc276634"},"schema_version":"1.0"},"canonical_sha256":"51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358","source":{"kind":"arxiv","id":"1609.00694","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00694","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00694v4","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00694","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"KGAD5YYKVT7O","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KGAD5YYKVT7OCXAP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KGAD5YYK","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KGAD5YYKVT7OCXAPHZGURGO5IP","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00694","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-02T18:39:37Z","cross_cats_sorted":[],"title_canon_sha256":"e44b04ed4621221da3923bca7913d321d18bf960a4f63356faf3c17684f94b10","abstract_canon_sha256":"c75d44bddfb2bba0c823aa30b69b27814732ad5e9de486de05bbfdd1dc276634"},"schema_version":"1.0"},"canonical_sha256":"51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.382696Z","signature_b64":"jdSo9+FALOoNJhqvO8xEETkvz3IK7vdwhwIryIdfVLeBrHDtp4YSYpoqOl8Dif815qrnkh+W7uTCM8PSflhXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358","last_reissued_at":"2026-05-18T00:22:16.382086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.382086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00694","source_version":4,"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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySfUizn9/QCKa1whIS078BpStPT4A+oM98vx/N2ADXVZUbJlOX5xvI03BmOBRGv+U9OrTcl9jKfLbk0wHIJVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:14:13.302722Z"},"content_sha256":"7564b288ab6b0ee68e71cc146d7024412311426a0b7dff0b038ce3b63dcc5488","schema_version":"1.0","event_id":"sha256:7564b288ab6b0ee68e71cc146d7024412311426a0b7dff0b038ce3b63dcc5488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KGAD5YYKVT7OCXAPHZGURGO5IP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two computationally efficient polynomial-iteration infeasible interior-point algorithms 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":"2016-09-02T18:39:37Z","abstract_excerpt":"Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algorithms with good polynomial bound are not computationally efficient and algorithms demonstrated efficiency in computation do not have a good or any polynomial bound. Todd raised a question in 2002: \"Can we find a theoretically and practically efficient way to reoptimize?\" This paper is an effort to close the gap. We propose two arc-search infeasible interior-point algorithms with infeasible central path neighborhood "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00694","kind":"arxiv","version":4},"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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btcxCqmrXugEpLd31Ih833diIjVkM6ntFzTpWVQiJ/qeElmOtsy2kW/UIZzh2xZ2STJ91W7LSnq3OYgd8hfcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:14:13.303063Z"},"content_sha256":"fa0af8bdd9af1e684d9120809ce6678ce3baeeeda3c017a6e5a90d23d0b49775","schema_version":"1.0","event_id":"sha256:fa0af8bdd9af1e684d9120809ce6678ce3baeeeda3c017a6e5a90d23d0b49775"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/bundle.json","state_url":"https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/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:14:13Z","links":{"resolver":"https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP","bundle":"https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/bundle.json","state":"https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGAD5YYKVT7OCXAPHZGURGO5IP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KGAD5YYKVT7OCXAPHZGURGO5IP","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":"c75d44bddfb2bba0c823aa30b69b27814732ad5e9de486de05bbfdd1dc276634","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-02T18:39:37Z","title_canon_sha256":"e44b04ed4621221da3923bca7913d321d18bf960a4f63356faf3c17684f94b10"},"schema_version":"1.0","source":{"id":"1609.00694","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00694","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00694v4","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00694","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"KGAD5YYKVT7O","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KGAD5YYKVT7OCXAP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KGAD5YYK","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:fa0af8bdd9af1e684d9120809ce6678ce3baeeeda3c017a6e5a90d23d0b49775","target":"graph","created_at":"2026-05-18T00:22:16Z","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":"Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algorithms with good polynomial bound are not computationally efficient and algorithms demonstrated efficiency in computation do not have a good or any polynomial bound. Todd raised a question in 2002: \"Can we find a theoretically and practically efficient way to reoptimize?\" This paper is an effort to close the gap. We propose two arc-search infeasible interior-point algorithms with infeasible central path neighborhood ","authors_text":"Yaguang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-02T18:39:37Z","title":"Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00694","kind":"arxiv","version":4},"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:7564b288ab6b0ee68e71cc146d7024412311426a0b7dff0b038ce3b63dcc5488","target":"record","created_at":"2026-05-18T00:22:16Z","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":"c75d44bddfb2bba0c823aa30b69b27814732ad5e9de486de05bbfdd1dc276634","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-02T18:39:37Z","title_canon_sha256":"e44b04ed4621221da3923bca7913d321d18bf960a4f63356faf3c17684f94b10"},"schema_version":"1.0","source":{"id":"1609.00694","kind":"arxiv","version":4}},"canonical_sha256":"51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358","first_computed_at":"2026-05-18T00:22:16.382086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.382086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdSo9+FALOoNJhqvO8xEETkvz3IK7vdwhwIryIdfVLeBrHDtp4YSYpoqOl8Dif815qrnkh+W7uTCM8PSflhXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.382696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00694","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7564b288ab6b0ee68e71cc146d7024412311426a0b7dff0b038ce3b63dcc5488","sha256:fa0af8bdd9af1e684d9120809ce6678ce3baeeeda3c017a6e5a90d23d0b49775"],"state_sha256":"eb48c5ad7269c0e2beab9260944ea021b3ce1e8dabc38099e258b0718546fb76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hemKUBkiyg1QsPtg80InOmdWqM+xvM7g8uM7D3kVqjrX4Xc+FrTVQr3jmVZwW/Jwb1nchrg0P2qzQZkzBs8qBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:14:13.305051Z","bundle_sha256":"51631ee87c4d3d78beed174fdc6bc647dc9b8b2018c978ae7a75102e804ab8aa"}}