{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5HKH7UMNKFUY56UK6GXLT54NCI","short_pith_number":"pith:5HKH7UMN","schema_version":"1.0","canonical_sha256":"e9d47fd18d51698efa8af1aeb9f78d123f7527fbd2bb4827254f263e78bbb58f","source":{"kind":"arxiv","id":"1705.01797","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.01797","created_at":"2026-05-17T23:53:52.326893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01797v4","created_at":"2026-05-17T23:53:52.326893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01797","created_at":"2026-05-17T23:53:52.326893+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HKH7UMNKFUY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HKH7UMNKFUY56UK","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HKH7UMN","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI","json":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI.json","graph_json":"https://pith.science/api/pith-number/5HKH7UMNKFUY56UK6GXLT54NCI/graph.json","events_json":"https://pith.science/api/pith-number/5HKH7UMNKFUY56UK6GXLT54NCI/events.json","paper":"https://pith.science/paper/5HKH7UMN"},"agent_actions":{"view_html":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI","download_json":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI.json","view_paper":"https://pith.science/paper/5HKH7UMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01797&json=true","fetch_graph":"https://pith.science/api/pith-number/5HKH7UMNKFUY56UK6GXLT54NCI/graph.json","fetch_events":"https://pith.science/api/pith-number/5HKH7UMNKFUY56UK6GXLT54NCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/action/storage_attestation","attest_author":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/action/author_attestation","sign_citation":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/action/citation_signature","submit_replication":"https://pith.science/pith/5HKH7UMNKFUY56UK6GXLT54NCI/action/replication_record"}},"created_at":"2026-05-17T23:53:52.326893+00:00","updated_at":"2026-05-17T23:53:52.326893+00:00"}