{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K2A2ANQR23MDBKMB7PVSOLLA62","short_pith_number":"pith:K2A2ANQR","canonical_record":{"source":{"id":"1208.5960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-29T16:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"5dd7cc73c03cf220140698aeb27ad21575e33e8487263acac10afa8d380b9fbc","abstract_canon_sha256":"ed692af4dfa3dd53fb3b1c0b5feca11580e84f677fcb5816872703663f208a22"},"schema_version":"1.0"},"canonical_sha256":"5681a03611d6d830a981fbeb272d60f69f1da5090435c3635ce1dfe8cb63cdff","source":{"kind":"arxiv","id":"1208.5960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5960","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5960v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5960","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"K2A2ANQR23MD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K2A2ANQR23MDBKMB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K2A2ANQR","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K2A2ANQR23MDBKMB7PVSOLLA62","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-29T16:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"5dd7cc73c03cf220140698aeb27ad21575e33e8487263acac10afa8d380b9fbc","abstract_canon_sha256":"ed692af4dfa3dd53fb3b1c0b5feca11580e84f677fcb5816872703663f208a22"},"schema_version":"1.0"},"canonical_sha256":"5681a03611d6d830a981fbeb272d60f69f1da5090435c3635ce1dfe8cb63cdff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:48.217826Z","signature_b64":"WfFxNdjwk5qiGk1ckkPnphVZJiDDoLgoECGt4c5eS5eRSuqnxzMWWWRrYl/ifysi4QHwJa2fdHurh/jXtONyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5681a03611d6d830a981fbeb272d60f69f1da5090435c3635ce1dfe8cb63cdff","last_reissued_at":"2026-05-18T03:46:48.217112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:48.217112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5960","source_version":1,"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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbuRqSM5PLlCbsgV/mgCkZoFYm5p3ISYC5zRfnZq5bV9Ic3kSsmk1UCCr+HF2mjovul5Okrij2Dqa9uQh/OPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:31:05.452532Z"},"content_sha256":"82c5d700d783c08612f4a5454140b93118b4a0f5f10ad8018720e2dc4e0d623a","schema_version":"1.0","event_id":"sha256:82c5d700d783c08612f4a5454140b93118b4a0f5f10ad8018720e2dc4e0d623a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K2A2ANQR23MDBKMB7PVSOLLA62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jacek Gondzio","submitted_at":"2012-08-29T16:23:06Z","abstract_excerpt":"In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields a short-step algorithm and a symmetric one induced by the use of the infinity norm which yields a (practical) long-step algorithm. Both algorithms allow for the Newton equation system to be solved inexactly. For both algorithms we will provide conditions for the level of error acceptable in the Newton equation and establish the worst-case complexity results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5960","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"},"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-18T03:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ji9KqknbA7ZiSh6C8slPKXzCemRsLlDwBKIKUYaUCHf3M6+FYy5jIYV/oPohdJsXTm8oRmFMlJXYzanIhK+xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:31:05.452884Z"},"content_sha256":"6eea272ad912684c533469d39b5120991b1ac288596dbf5d73e22a73a684b872","schema_version":"1.0","event_id":"sha256:6eea272ad912684c533469d39b5120991b1ac288596dbf5d73e22a73a684b872"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2A2ANQR23MDBKMB7PVSOLLA62/bundle.json","state_url":"https://pith.science/pith/K2A2ANQR23MDBKMB7PVSOLLA62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2A2ANQR23MDBKMB7PVSOLLA62/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-07T18:31:05Z","links":{"resolver":"https://pith.science/pith/K2A2ANQR23MDBKMB7PVSOLLA62","bundle":"https://pith.science/pith/K2A2ANQR23MDBKMB7PVSOLLA62/bundle.json","state":"https://pith.science/pith/K2A2ANQR23MDBKMB7PVSOLLA62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2A2ANQR23MDBKMB7PVSOLLA62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K2A2ANQR23MDBKMB7PVSOLLA62","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":"ed692af4dfa3dd53fb3b1c0b5feca11580e84f677fcb5816872703663f208a22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-29T16:23:06Z","title_canon_sha256":"5dd7cc73c03cf220140698aeb27ad21575e33e8487263acac10afa8d380b9fbc"},"schema_version":"1.0","source":{"id":"1208.5960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5960","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5960v1","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5960","created_at":"2026-05-18T03:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"K2A2ANQR23MD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K2A2ANQR23MDBKMB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K2A2ANQR","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:6eea272ad912684c533469d39b5120991b1ac288596dbf5d73e22a73a684b872","target":"graph","created_at":"2026-05-18T03:46:48Z","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":"In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields a short-step algorithm and a symmetric one induced by the use of the infinity norm which yields a (practical) long-step algorithm. Both algorithms allow for the Newton equation system to be solved inexactly. For both algorithms we will provide conditions for the level of error acceptable in the Newton equation and establish the worst-case complexity results.","authors_text":"Jacek Gondzio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-29T16:23:06Z","title":"Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5960","kind":"arxiv","version":1},"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:82c5d700d783c08612f4a5454140b93118b4a0f5f10ad8018720e2dc4e0d623a","target":"record","created_at":"2026-05-18T03:46:48Z","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":"ed692af4dfa3dd53fb3b1c0b5feca11580e84f677fcb5816872703663f208a22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-08-29T16:23:06Z","title_canon_sha256":"5dd7cc73c03cf220140698aeb27ad21575e33e8487263acac10afa8d380b9fbc"},"schema_version":"1.0","source":{"id":"1208.5960","kind":"arxiv","version":1}},"canonical_sha256":"5681a03611d6d830a981fbeb272d60f69f1da5090435c3635ce1dfe8cb63cdff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5681a03611d6d830a981fbeb272d60f69f1da5090435c3635ce1dfe8cb63cdff","first_computed_at":"2026-05-18T03:46:48.217112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:48.217112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WfFxNdjwk5qiGk1ckkPnphVZJiDDoLgoECGt4c5eS5eRSuqnxzMWWWRrYl/ifysi4QHwJa2fdHurh/jXtONyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:48.217826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82c5d700d783c08612f4a5454140b93118b4a0f5f10ad8018720e2dc4e0d623a","sha256:6eea272ad912684c533469d39b5120991b1ac288596dbf5d73e22a73a684b872"],"state_sha256":"7d265e7e5b29d2b81acda17760f5808f5127a0759f4a6d3d59b061a7f57c9ce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqI1c/OjDDrYFfsXxaZ5Wj+t5/Gpz17prYMk88za2HB5X4vu3bgTpq398t3+SPoxgDn2bU5AT+fzoKHqeq65Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:31:05.455223Z","bundle_sha256":"3cc6a3e8ea88b7c1d64b8f50d5af66a10d9d11a74225140d07ffd1274de9e54c"}}