{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KJHIGLVEG6RLJA3XA6BA5N2I6G","short_pith_number":"pith:KJHIGLVE","canonical_record":{"source":{"id":"1706.05795","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T05:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"6973b2beb3d5d7b6dc520f9bb33edefaa21a9a965889976526957064d3c4ec33","abstract_canon_sha256":"308f08e90b6893b66704ba7f137ac70319642ec0b0095cc63bc9f50036ebb799"},"schema_version":"1.0"},"canonical_sha256":"524e832ea437a2b4837707820eb748f1933aca7c68c4299a688dda86bedc5d54","source":{"kind":"arxiv","id":"1706.05795","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05795","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05795v4","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05795","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"KJHIGLVEG6RL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJHIGLVEG6RLJA3X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJHIGLVE","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KJHIGLVEG6RLJA3XA6BA5N2I6G","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05795","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T05:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"6973b2beb3d5d7b6dc520f9bb33edefaa21a9a965889976526957064d3c4ec33","abstract_canon_sha256":"308f08e90b6893b66704ba7f137ac70319642ec0b0095cc63bc9f50036ebb799"},"schema_version":"1.0"},"canonical_sha256":"524e832ea437a2b4837707820eb748f1933aca7c68c4299a688dda86bedc5d54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.115034Z","signature_b64":"952evDVBWmJeZjR5/lviOSI52y/OtaeGoUTw87IMBK+DswzdcP49n8yJt2Bk+bhfLu2bR/g17z4EeL+bpYvDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"524e832ea437a2b4837707820eb748f1933aca7c68c4299a688dda86bedc5d54","last_reissued_at":"2026-05-18T00:01:39.114574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.114574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05795","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:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmaQqtLTszfb9iF4iqREobfxlneNUh/IaMiEvaBroI0lclQFDabyZnVFMSxh6g3Kxp7uVlVRMdmGDS4PWpy1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:51:47.707028Z"},"content_sha256":"da39a002948ade848712565c2b78440530132575cabfc42030c5bd1ca169e834","schema_version":"1.0","event_id":"sha256:da39a002948ade848712565c2b78440530132575cabfc42030c5bd1ca169e834"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KJHIGLVEG6RLJA3XA6BA5N2I6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Andres Gomez","submitted_at":"2017-06-19T05:59:47Z","abstract_excerpt":"We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be solved by polynomial interior point algorithms for conic quadratic optimization. However, interior point algorithms are not well-suited for branch-and-bound algorithms for the discrete counterparts of these problems due to the lack of effective warm starts necessary for the efficient solution of convex relaxations repeatedly at the nodes of the search tree.\n  In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05795","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:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wol1Sd2KIFuPOjLBqnb/HPnQY4f/xWxWoT0qWoKPfs0LyjsdX3GpGVL2nLBYqBVZnJUp9pkXkfBdVpP9w1WtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:51:47.707383Z"},"content_sha256":"066655823d4f5636d37a3f25bec31df2cd1e077e02cbe53233ef2a4cb58e6e11","schema_version":"1.0","event_id":"sha256:066655823d4f5636d37a3f25bec31df2cd1e077e02cbe53233ef2a4cb58e6e11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/bundle.json","state_url":"https://pith.science/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/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-01T07:51:47Z","links":{"resolver":"https://pith.science/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G","bundle":"https://pith.science/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/bundle.json","state":"https://pith.science/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJHIGLVEG6RLJA3XA6BA5N2I6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KJHIGLVEG6RLJA3XA6BA5N2I6G","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":"308f08e90b6893b66704ba7f137ac70319642ec0b0095cc63bc9f50036ebb799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T05:59:47Z","title_canon_sha256":"6973b2beb3d5d7b6dc520f9bb33edefaa21a9a965889976526957064d3c4ec33"},"schema_version":"1.0","source":{"id":"1706.05795","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05795","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05795v4","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05795","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"KJHIGLVEG6RL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJHIGLVEG6RLJA3X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJHIGLVE","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:066655823d4f5636d37a3f25bec31df2cd1e077e02cbe53233ef2a4cb58e6e11","target":"graph","created_at":"2026-05-18T00:01:39Z","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 consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be solved by polynomial interior point algorithms for conic quadratic optimization. However, interior point algorithms are not well-suited for branch-and-bound algorithms for the discrete counterparts of these problems due to the lack of effective warm starts necessary for the efficient solution of convex relaxations repeatedly at the nodes of the search tree.\n  In","authors_text":"Alper Atamturk, Andres Gomez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T05:59:47Z","title":"Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05795","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:da39a002948ade848712565c2b78440530132575cabfc42030c5bd1ca169e834","target":"record","created_at":"2026-05-18T00:01:39Z","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":"308f08e90b6893b66704ba7f137ac70319642ec0b0095cc63bc9f50036ebb799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T05:59:47Z","title_canon_sha256":"6973b2beb3d5d7b6dc520f9bb33edefaa21a9a965889976526957064d3c4ec33"},"schema_version":"1.0","source":{"id":"1706.05795","kind":"arxiv","version":4}},"canonical_sha256":"524e832ea437a2b4837707820eb748f1933aca7c68c4299a688dda86bedc5d54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"524e832ea437a2b4837707820eb748f1933aca7c68c4299a688dda86bedc5d54","first_computed_at":"2026-05-18T00:01:39.114574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.114574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"952evDVBWmJeZjR5/lviOSI52y/OtaeGoUTw87IMBK+DswzdcP49n8yJt2Bk+bhfLu2bR/g17z4EeL+bpYvDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.115034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05795","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da39a002948ade848712565c2b78440530132575cabfc42030c5bd1ca169e834","sha256:066655823d4f5636d37a3f25bec31df2cd1e077e02cbe53233ef2a4cb58e6e11"],"state_sha256":"518740c4d2c518aa4a007ab4333c73f48b5564e05e776b792f39ce23f2e3ae0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRAYg+cJsLDx8IM5spXl2GHvZnjzUVFwAYULdgR3lVcZ9lABu/1nRMNCfkIJGNgIMEepYJ44dR9Qd5DjlfwaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:51:47.709436Z","bundle_sha256":"8640b76e8c9e8ea04d073a71890983256543e49ea987520e81445386f24439ea"}}