{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5HKH7UMNKFUY56UK6GXLT54NCI","short_pith_number":"pith:5HKH7UMN","canonical_record":{"source":{"id":"1705.01797","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T11:31:59Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"98d21500b240d9cedce6559f1075dbb91d164831149e66c3d8b8c0a305ddafaf","abstract_canon_sha256":"a954607d897ca245f6aa5ff12d585f7e617e708c5f01ef5ec3b16f4441c6ed8e"},"schema_version":"1.0"},"canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","source":{"kind":"arxiv","id":"1705.01797","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01797","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01797v4","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01797","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"5HKH7UMNKFUY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HKH7UMNKFUY56UK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HKH7UMN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5HKH7UMNKFUY56UK6GXLT54NCI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01797","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T11:31:59Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"98d21500b240d9cedce6559f1075dbb91d164831149e66c3d8b8c0a305ddafaf","abstract_canon_sha256":"a954607d897ca245f6aa5ff12d585f7e617e708c5f01ef5ec3b16f4441c6ed8e"},"schema_version":"1.0"},"canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:52.327529Z","signature_b64":"sfXdAunToVSnBoMv84Kd0QX+BHt7VqoGQEhYBJLNH4eHCdR0iriFm7QBYsXOti7XLk1VT+ydifdreGcSM9mBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","last_reissued_at":"2026-05-17T23:53:52.326763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:52.326763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01797","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-17T23:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQyukMPkFfFMzDe4d3whY04oIOn75wPze2nP7UIB07XFJAuo9ukbiHpRIUKdnXn1hVm5HDdE8tL8AS0qAFWLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:34:16.740443Z"},"content_sha256":"2c1b3dc69b22c44714b8d3d948fb3154b1122d4a280530b16127a836c4069ba8","schema_version":"1.0","event_id":"sha256:2c1b3dc69b22c44714b8d3d948fb3154b1122d4a280530b16127a836c4069ba8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5HKH7UMNKFUY56UK6GXLT54NCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Daniela di Serafino, Gerardo Toraldo, Jesse Barlow, Marco Viola","submitted_at":"2017-05-04T11:31:59Z","abstract_excerpt":"We propose a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrained convex quadratic programming [J.J. Mor\\'e and G. Toraldo, SIAM J. Optim. 1, 1991], our approach alternates between two phases until convergence: an identification phase, which performs gradient projection iterations until either a candidate active set is identified or no reasonable progress is made, and an unconstrained minimization phase, which reduces the objective function in a suitable space defined by the id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01797","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-17T23:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b86kla9qjaM7qWNHIy2EjLCA3YlWgUSZJwCmqmiCOhDGffRIJFsz+Fjfo1rT5IdnRwnru5B4/tApN8aLchdRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:34:16.740795Z"},"content_sha256":"0aa2786c0e8013a5ae3308cd66f3f86f73141f114a3072666f57b184724f1073","schema_version":"1.0","event_id":"sha256:0aa2786c0e8013a5ae3308cd66f3f86f73141f114a3072666f57b184724f1073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/bundle.json","state_url":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HKH7UMNKFUY56UK6GXLT54NCI/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-23T08:34:16Z","links":{"resolver":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI","bundle":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/bundle.json","state":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HKH7UMNKFUY56UK6GXLT54NCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5HKH7UMNKFUY56UK6GXLT54NCI","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":"a954607d897ca245f6aa5ff12d585f7e617e708c5f01ef5ec3b16f4441c6ed8e","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T11:31:59Z","title_canon_sha256":"98d21500b240d9cedce6559f1075dbb91d164831149e66c3d8b8c0a305ddafaf"},"schema_version":"1.0","source":{"id":"1705.01797","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01797","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01797v4","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01797","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"5HKH7UMNKFUY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HKH7UMNKFUY56UK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HKH7UMN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0aa2786c0e8013a5ae3308cd66f3f86f73141f114a3072666f57b184724f1073","target":"graph","created_at":"2026-05-17T23:53:52Z","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 a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrained convex quadratic programming [J.J. Mor\\'e and G. Toraldo, SIAM J. Optim. 1, 1991], our approach alternates between two phases until convergence: an identification phase, which performs gradient projection iterations until either a candidate active set is identified or no reasonable progress is made, and an unconstrained minimization phase, which reduces the objective function in a suitable space defined by the id","authors_text":"Daniela di Serafino, Gerardo Toraldo, Jesse Barlow, Marco Viola","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T11:31:59Z","title":"A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01797","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:2c1b3dc69b22c44714b8d3d948fb3154b1122d4a280530b16127a836c4069ba8","target":"record","created_at":"2026-05-17T23:53:52Z","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":"a954607d897ca245f6aa5ff12d585f7e617e708c5f01ef5ec3b16f4441c6ed8e","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T11:31:59Z","title_canon_sha256":"98d21500b240d9cedce6559f1075dbb91d164831149e66c3d8b8c0a305ddafaf"},"schema_version":"1.0","source":{"id":"1705.01797","kind":"arxiv","version":4}},"canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","first_computed_at":"2026-05-17T23:53:52.326763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:52.326763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfXdAunToVSnBoMv84Kd0QX+BHt7VqoGQEhYBJLNH4eHCdR0iriFm7QBYsXOti7XLk1VT+ydifdreGcSM9mBBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:52.327529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01797","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c1b3dc69b22c44714b8d3d948fb3154b1122d4a280530b16127a836c4069ba8","sha256:0aa2786c0e8013a5ae3308cd66f3f86f73141f114a3072666f57b184724f1073"],"state_sha256":"8365e1b2e950c15556bf2e842fe74caedebe2f6ea02f240a6b733ca52df5714b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iI/mShl1MGvU0sbJ6cvzh4Ek4S2RfwhF8YlpV6a4f28wKql3x3+zEGGEKkEz91xAMmlnP7XZ4TfiVnGehBG4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:34:16.742799Z","bundle_sha256":"5ce5e04e57694220fcccb477571e4caff1b0bcbaf366746c65107d126029c194"}}