{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NBBEWY7LXW3IH7JHA3N3O3XEC4","short_pith_number":"pith:NBBEWY7L","schema_version":"1.0","canonical_sha256":"68424b63ebbdb683fd2706dbb76ee4171e77a20ee6492a5958d1e4b3b3ac63fc","source":{"kind":"arxiv","id":"1901.06714","version":2},"attestation_state":"computed","paper":{"title":"Parametric Convex Quadratic Relaxation of the Quadratic Knapsac Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniela Cristina Lubke, Fei Wang, Henry Wolkowicz, Marcia Fampa","submitted_at":"2019-01-20T19:06:34Z","abstract_excerpt":"We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the perturbation is then linearized by a standard approach that lifts the problem to the matrix space. We present a primal-dual interior point method to optimize the perturbation of the quadratic function, in a search for the tightest upper bound for the \\QKPp. We prove that the same perturbation approa"},"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":"1901.06714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-20T19:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"9b9a592809d04217b9cd7bc10798b9542f11ae84ff401c404019b20230a24680","abstract_canon_sha256":"5df43f6abe30df9c2c287f7c3913732906e57411b484878c634b01ddedc0efd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:50.084527Z","signature_b64":"ZXyae4OmoaYcQK+GNl1fhqqvWrnGoBrkKAP/2h/dX0RNaCWm68WvHd9nYmc4fQh1vumd4KDh9YBeQJxGM6w8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68424b63ebbdb683fd2706dbb76ee4171e77a20ee6492a5958d1e4b3b3ac63fc","last_reissued_at":"2026-05-17T23:43:50.083976Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:50.083976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametric Convex Quadratic Relaxation of the Quadratic Knapsac Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniela Cristina Lubke, Fei Wang, Henry Wolkowicz, Marcia Fampa","submitted_at":"2019-01-20T19:06:34Z","abstract_excerpt":"We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the perturbation is then linearized by a standard approach that lifts the problem to the matrix space. We present a primal-dual interior point method to optimize the perturbation of the quadratic function, in a search for the tightest upper bound for the \\QKPp. We prove that the same perturbation approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06714","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.06714","created_at":"2026-05-17T23:43:50.084066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06714v2","created_at":"2026-05-17T23:43:50.084066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06714","created_at":"2026-05-17T23:43:50.084066+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBBEWY7LXW3I","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBBEWY7LXW3IH7JH","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBBEWY7L","created_at":"2026-05-18T12:33:24.271573+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/NBBEWY7LXW3IH7JHA3N3O3XEC4","json":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4.json","graph_json":"https://pith.science/api/pith-number/NBBEWY7LXW3IH7JHA3N3O3XEC4/graph.json","events_json":"https://pith.science/api/pith-number/NBBEWY7LXW3IH7JHA3N3O3XEC4/events.json","paper":"https://pith.science/paper/NBBEWY7L"},"agent_actions":{"view_html":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4","download_json":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4.json","view_paper":"https://pith.science/paper/NBBEWY7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06714&json=true","fetch_graph":"https://pith.science/api/pith-number/NBBEWY7LXW3IH7JHA3N3O3XEC4/graph.json","fetch_events":"https://pith.science/api/pith-number/NBBEWY7LXW3IH7JHA3N3O3XEC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4/action/storage_attestation","attest_author":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4/action/author_attestation","sign_citation":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4/action/citation_signature","submit_replication":"https://pith.science/pith/NBBEWY7LXW3IH7JHA3N3O3XEC4/action/replication_record"}},"created_at":"2026-05-17T23:43:50.084066+00:00","updated_at":"2026-05-17T23:43:50.084066+00:00"}