{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3YFFVBHJD3B7N4LW7X5HW4NA3U","short_pith_number":"pith:3YFFVBHJ","schema_version":"1.0","canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","source":{"kind":"arxiv","id":"1808.01266","version":3},"attestation_state":"computed","paper":{"title":"A new dual for quadratic programming and its applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Moslem Zamani","submitted_at":"2018-08-03T17:28:08Z","abstract_excerpt":"The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a modified version by restricting the feasible set. This leads to a new bound for quadratic programs. We demonstrate that the dual of the bound is a semi-definite relaxation of quadratic programs. In addition, we probe the relationship between this bound and the well-known bounds. In the second part, thanks to the new bound, we propose a branch and cut algori"},"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":"1808.01266","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-03T17:28:08Z","cross_cats_sorted":[],"title_canon_sha256":"d757e82852bac605684152de41460c0946d979873f4c5e8ec492ed3e13a30b66","abstract_canon_sha256":"3ca44f65e177b8e7f86b1cfa727e1dbbda34dd19deae477f276146b78550c24a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:07.528086Z","signature_b64":"6ZrwlAxeQxi+r7IuNGuclFYAYb/czzzM8MDBxwmt9Xv6jeH7Q2gKqfWUpPa0WbplsU9MGBrVkiWmuhWReoOhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","last_reissued_at":"2026-05-17T23:55:07.527525Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:07.527525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new dual for quadratic programming and its applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Moslem Zamani","submitted_at":"2018-08-03T17:28:08Z","abstract_excerpt":"The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a modified version by restricting the feasible set. This leads to a new bound for quadratic programs. We demonstrate that the dual of the bound is a semi-definite relaxation of quadratic programs. In addition, we probe the relationship between this bound and the well-known bounds. In the second part, thanks to the new bound, we propose a branch and cut algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01266","kind":"arxiv","version":3},"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":"1808.01266","created_at":"2026-05-17T23:55:07.527605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01266v3","created_at":"2026-05-17T23:55:07.527605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01266","created_at":"2026-05-17T23:55:07.527605+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YFFVBHJD3B7","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YFFVBHJD3B7N4LW","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YFFVBHJ","created_at":"2026-05-18T12:32:05.422762+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/3YFFVBHJD3B7N4LW7X5HW4NA3U","json":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U.json","graph_json":"https://pith.science/api/pith-number/3YFFVBHJD3B7N4LW7X5HW4NA3U/graph.json","events_json":"https://pith.science/api/pith-number/3YFFVBHJD3B7N4LW7X5HW4NA3U/events.json","paper":"https://pith.science/paper/3YFFVBHJ"},"agent_actions":{"view_html":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U","download_json":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U.json","view_paper":"https://pith.science/paper/3YFFVBHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01266&json=true","fetch_graph":"https://pith.science/api/pith-number/3YFFVBHJD3B7N4LW7X5HW4NA3U/graph.json","fetch_events":"https://pith.science/api/pith-number/3YFFVBHJD3B7N4LW7X5HW4NA3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/action/storage_attestation","attest_author":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/action/author_attestation","sign_citation":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/action/citation_signature","submit_replication":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/action/replication_record"}},"created_at":"2026-05-17T23:55:07.527605+00:00","updated_at":"2026-05-17T23:55:07.527605+00:00"}