{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PSEYSTRVW4XQCALC373GK22REG","short_pith_number":"pith:PSEYSTRV","canonical_record":{"source":{"id":"1411.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"ae0e5290b4de590910e2d02f7d48caa9226775e2ad02d021db63eca6dc0168dd","abstract_canon_sha256":"69c5014811d46155e59301b25d4a6e8af826ea76de207878eaa7cdb12b5caf6b"},"schema_version":"1.0"},"canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","source":{"kind":"arxiv","id":"1411.2129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2129","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2129v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2129","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"PSEYSTRVW4XQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PSEYSTRVW4XQCALC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PSEYSTRV","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PSEYSTRVW4XQCALC373GK22REG","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"ae0e5290b4de590910e2d02f7d48caa9226775e2ad02d021db63eca6dc0168dd","abstract_canon_sha256":"69c5014811d46155e59301b25d4a6e8af826ea76de207878eaa7cdb12b5caf6b"},"schema_version":"1.0"},"canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.548709Z","signature_b64":"aFnq4/QjQFdJPI5lVzuRf0IQR+2KEsYjSYqRllJwI891LSUR+FEMop+XgJDsbcLKPk5PzC2yKX4W4qjT8OXRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","last_reissued_at":"2026-05-18T02:38:08.548073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.548073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2129","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-18T02:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MR2yJj1/piWWmzJ6wA3+n2GXY3Z9FQPP+fcnFV2AbGKk+y+IdUwjjhIqI/yKXpyenLBnhbSTeFwu43TXPrj/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:09:45.303805Z"},"content_sha256":"ba79e33b2344d2b1228d00c26b0350081d4e9eedbdc08d0b04c616c0c83e37a0","schema_version":"1.0","event_id":"sha256:ba79e33b2344d2b1228d00c26b0350081d4e9eedbdc08d0b04c616c0c83e37a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PSEYSTRVW4XQCALC373GK22REG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interior-point algorithms for convex optimization based on primal-dual metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Tor Myklebust","submitted_at":"2014-11-08T15:37:48Z","abstract_excerpt":"We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms we analyse are so-called short-step algorithms and they match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming problems with given self-scaled barriers. Our results apply to any self-concordant barrier for any convex cone. We also prove that certain specializations of our algorithms to hyperbolic cone programming problems (which lie strictly between symmetric co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2129","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-18T02:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzj13F/lXFZOMVfK6mv/VWfKy46+YLh9eQHSuL/EgDhwjHf12F6KS9I0hyCjCIWIv2+OuySr0nyDmhRIIM7sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:09:45.304144Z"},"content_sha256":"d7e1f2cc5c3b9e8a4fa0619c822efeb247a469b9733a30434edd22617ecd6914","schema_version":"1.0","event_id":"sha256:d7e1f2cc5c3b9e8a4fa0619c822efeb247a469b9733a30434edd22617ecd6914"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/bundle.json","state_url":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSEYSTRVW4XQCALC373GK22REG/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-23T15:09:45Z","links":{"resolver":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG","bundle":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/bundle.json","state":"https://pith.science/pith/PSEYSTRVW4XQCALC373GK22REG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSEYSTRVW4XQCALC373GK22REG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PSEYSTRVW4XQCALC373GK22REG","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":"69c5014811d46155e59301b25d4a6e8af826ea76de207878eaa7cdb12b5caf6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","title_canon_sha256":"ae0e5290b4de590910e2d02f7d48caa9226775e2ad02d021db63eca6dc0168dd"},"schema_version":"1.0","source":{"id":"1411.2129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2129","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2129v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2129","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"PSEYSTRVW4XQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PSEYSTRVW4XQCALC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PSEYSTRV","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d7e1f2cc5c3b9e8a4fa0619c822efeb247a469b9733a30434edd22617ecd6914","target":"graph","created_at":"2026-05-18T02:38:08Z","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":"We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms we analyse are so-called short-step algorithms and they match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming problems with given self-scaled barriers. Our results apply to any self-concordant barrier for any convex cone. We also prove that certain specializations of our algorithms to hyperbolic cone programming problems (which lie strictly between symmetric co","authors_text":"Levent Tun\\c{c}el, Tor Myklebust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","title":"Interior-point algorithms for convex optimization based on primal-dual metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2129","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:ba79e33b2344d2b1228d00c26b0350081d4e9eedbdc08d0b04c616c0c83e37a0","target":"record","created_at":"2026-05-18T02:38:08Z","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":"69c5014811d46155e59301b25d4a6e8af826ea76de207878eaa7cdb12b5caf6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-08T15:37:48Z","title_canon_sha256":"ae0e5290b4de590910e2d02f7d48caa9226775e2ad02d021db63eca6dc0168dd"},"schema_version":"1.0","source":{"id":"1411.2129","kind":"arxiv","version":1}},"canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c89894e35b72f010162dff6656b5121bb21567d0556c389b2903f64939a200a","first_computed_at":"2026-05-18T02:38:08.548073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:08.548073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aFnq4/QjQFdJPI5lVzuRf0IQR+2KEsYjSYqRllJwI891LSUR+FEMop+XgJDsbcLKPk5PzC2yKX4W4qjT8OXRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:08.548709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba79e33b2344d2b1228d00c26b0350081d4e9eedbdc08d0b04c616c0c83e37a0","sha256:d7e1f2cc5c3b9e8a4fa0619c822efeb247a469b9733a30434edd22617ecd6914"],"state_sha256":"0f1a56da024fe5228ba6d627803c63b231c5c49b2cbc62174dd91208d483f7b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gEVYGF8Ns0FGZViA7kkmmE7iZtVJfc1zLOtWMzGohNW/7vCAiWywMsY9EoAzaYOXSjV6zO41X/3rk11SdrxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:09:45.306146Z","bundle_sha256":"38dcd6eda1aaf6a5ee19c0a30df37e9c1a341d1f96b0b9e75c605c36c339a6d1"}}