{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2JC23MZBDXRENYKDFCV4LDNNFN","short_pith_number":"pith:2JC23MZB","canonical_record":{"source":{"id":"1503.08349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"c779d898a9d90d10edd1e0dc4d260ba5997ac60fc57ebf7a4ce15ce17b62bfd3","abstract_canon_sha256":"e32b8689905dd7720adbb768e9423cb8aafd06735f87bde59f68440d96f77cec"},"schema_version":"1.0"},"canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","source":{"kind":"arxiv","id":"1503.08349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08349","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08349v2","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08349","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"2JC23MZBDXRE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JC23MZBDXRENYKD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JC23MZB","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2JC23MZBDXRENYKDFCV4LDNNFN","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"c779d898a9d90d10edd1e0dc4d260ba5997ac60fc57ebf7a4ce15ce17b62bfd3","abstract_canon_sha256":"e32b8689905dd7720adbb768e9423cb8aafd06735f87bde59f68440d96f77cec"},"schema_version":"1.0"},"canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:42.221033Z","signature_b64":"k3IKLDAnOvDxS5uEaEPUy/h34ocYM3N2hWZhZcR4i2ejBfPejKP5O708NzpD/oJjQCLU2L0AsJiwkAgMrJhACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","last_reissued_at":"2026-05-18T00:04:42.220442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:42.220442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08349","source_version":2,"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:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu15HoWJb/yCZ80Gj8N5EjFixRpczTjaOFkeiwJeQk9zlqOseEn8DgYs6K7iGz++g6IHoLs3W2iNPvZhVItiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:14.756109Z"},"content_sha256":"75c20ecaafadb2a06efbfdfa00b6f9f1b141ca302c25633c39eeb15f442e17c4","schema_version":"1.0","event_id":"sha256:75c20ecaafadb2a06efbfdfa00b6f9f1b141ca302c25633c39eeb15f442e17c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2JC23MZBDXRENYKDFCV4LDNNFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal and dual active-set methods for convex quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Forsgren, Elizabeth Wong, Philip E. Gill","submitted_at":"2015-03-28T21:04:20Z","abstract_excerpt":"Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respect to the equality constraints associated with the optimality conditions of the primal-dual form. The primal method maintains feasibility of the primal inequalities while driving the infeasibilities of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08349","kind":"arxiv","version":2},"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:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fY1M64NPU/83TRQiHFr8QspF8JoEWEUQd2UNyYuC7N6wWwOD02cgJJwW3IlVKWRcdj0kHHaxRzIgDajORmDWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:14.756470Z"},"content_sha256":"26e4b6c632e5c6f243a8033c115cb0ba1d686e87050b8f195712f9baed919444","schema_version":"1.0","event_id":"sha256:26e4b6c632e5c6f243a8033c115cb0ba1d686e87050b8f195712f9baed919444"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/bundle.json","state_url":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JC23MZBDXRENYKDFCV4LDNNFN/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-20T02:41:14Z","links":{"resolver":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN","bundle":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/bundle.json","state":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JC23MZBDXRENYKDFCV4LDNNFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2JC23MZBDXRENYKDFCV4LDNNFN","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":"e32b8689905dd7720adbb768e9423cb8aafd06735f87bde59f68440d96f77cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","title_canon_sha256":"c779d898a9d90d10edd1e0dc4d260ba5997ac60fc57ebf7a4ce15ce17b62bfd3"},"schema_version":"1.0","source":{"id":"1503.08349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08349","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08349v2","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08349","created_at":"2026-05-18T00:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"2JC23MZBDXRE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JC23MZBDXRENYKD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JC23MZB","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:26e4b6c632e5c6f243a8033c115cb0ba1d686e87050b8f195712f9baed919444","target":"graph","created_at":"2026-05-18T00:04:42Z","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":"Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respect to the equality constraints associated with the optimality conditions of the primal-dual form. The primal method maintains feasibility of the primal inequalities while driving the infeasibilities of t","authors_text":"Anders Forsgren, Elizabeth Wong, Philip E. Gill","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","title":"Primal and dual active-set methods for convex quadratic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08349","kind":"arxiv","version":2},"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:75c20ecaafadb2a06efbfdfa00b6f9f1b141ca302c25633c39eeb15f442e17c4","target":"record","created_at":"2026-05-18T00:04:42Z","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":"e32b8689905dd7720adbb768e9423cb8aafd06735f87bde59f68440d96f77cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","title_canon_sha256":"c779d898a9d90d10edd1e0dc4d260ba5997ac60fc57ebf7a4ce15ce17b62bfd3"},"schema_version":"1.0","source":{"id":"1503.08349","kind":"arxiv","version":2}},"canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","first_computed_at":"2026-05-18T00:04:42.220442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:42.220442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k3IKLDAnOvDxS5uEaEPUy/h34ocYM3N2hWZhZcR4i2ejBfPejKP5O708NzpD/oJjQCLU2L0AsJiwkAgMrJhACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:42.221033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75c20ecaafadb2a06efbfdfa00b6f9f1b141ca302c25633c39eeb15f442e17c4","sha256:26e4b6c632e5c6f243a8033c115cb0ba1d686e87050b8f195712f9baed919444"],"state_sha256":"0e260f5063cb17a0c9741e8b1c7d7fcb23d0f508a1c14e595a922868ea6aa4b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8jVBv5skmRvxZ9KBhJ7jlNehBS4oGj4rticRF2f3ncRufhPT0Gm4pmqjY6n17VugIic47BNfI0cni8Ve3GhqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:41:14.758497Z","bundle_sha256":"6dbcac41bd40b7a7d57a31e3c1e3efd894317979831a3f5529ac9f685a3d266b"}}