{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3YFFVBHJD3B7N4LW7X5HW4NA3U","short_pith_number":"pith:3YFFVBHJ","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"},"canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","source":{"kind":"arxiv","id":"1808.01266","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01266","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01266v3","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01266","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"3YFFVBHJD3B7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YFFVBHJD3B7N4LW","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YFFVBHJ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3YFFVBHJD3B7N4LW7X5HW4NA3U","target":"record","payload":{"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"},"canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","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"},"source_kind":"arxiv","source_id":"1808.01266","source_version":3,"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:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuSVuxKAYVquby3EoewUMP2UIFECKok6LPoypoWv7PwmvTEzQWp+RLGsEL0qIE7oT7mO3+FBJy9wn9WpUfbpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:58:11.639968Z"},"content_sha256":"19416131044942ba6fcb45a0f95bbfb4e9020e9ad201ae5933fac5023c152abb","schema_version":"1.0","event_id":"sha256:19416131044942ba6fcb45a0f95bbfb4e9020e9ad201ae5933fac5023c152abb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3YFFVBHJD3B7N4LW7X5HW4NA3U","target":"graph","payload":{"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"},"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:55:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3OQG1n0a/LgjCKld+H6yqE3FuwI7Qhwg5dyiFYI2XUNPmqsPVpz8z7HdTUoaMQJNsaRWikZ47e+wsuWWg/6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:58:11.640301Z"},"content_sha256":"b4f0f86b72a21d1c103a8ecf144c053e939d4743f14f116e7a1d4d72c97283c6","schema_version":"1.0","event_id":"sha256:b4f0f86b72a21d1c103a8ecf144c053e939d4743f14f116e7a1d4d72c97283c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/bundle.json","state_url":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/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-28T14:58:11Z","links":{"resolver":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U","bundle":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/bundle.json","state":"https://pith.science/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YFFVBHJD3B7N4LW7X5HW4NA3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3YFFVBHJD3B7N4LW7X5HW4NA3U","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":"3ca44f65e177b8e7f86b1cfa727e1dbbda34dd19deae477f276146b78550c24a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-03T17:28:08Z","title_canon_sha256":"d757e82852bac605684152de41460c0946d979873f4c5e8ec492ed3e13a30b66"},"schema_version":"1.0","source":{"id":"1808.01266","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01266","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01266v3","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01266","created_at":"2026-05-17T23:55:07Z"},{"alias_kind":"pith_short_12","alias_value":"3YFFVBHJD3B7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YFFVBHJD3B7N4LW","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YFFVBHJ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:b4f0f86b72a21d1c103a8ecf144c053e939d4743f14f116e7a1d4d72c97283c6","target":"graph","created_at":"2026-05-17T23:55:07Z","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":"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","authors_text":"Moslem Zamani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-03T17:28:08Z","title":"A new dual for quadratic programming and its applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01266","kind":"arxiv","version":3},"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:19416131044942ba6fcb45a0f95bbfb4e9020e9ad201ae5933fac5023c152abb","target":"record","created_at":"2026-05-17T23:55:07Z","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":"3ca44f65e177b8e7f86b1cfa727e1dbbda34dd19deae477f276146b78550c24a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-03T17:28:08Z","title_canon_sha256":"d757e82852bac605684152de41460c0946d979873f4c5e8ec492ed3e13a30b66"},"schema_version":"1.0","source":{"id":"1808.01266","kind":"arxiv","version":3}},"canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0a5a84e91ec3f6f176fdfa7b71a0dd3015bf0644e7590ccb5eef4ab077afe1","first_computed_at":"2026-05-17T23:55:07.527525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:07.527525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ZrwlAxeQxi+r7IuNGuclFYAYb/czzzM8MDBxwmt9Xv6jeH7Q2gKqfWUpPa0WbplsU9MGBrVkiWmuhWReoOhCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:07.528086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01266","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19416131044942ba6fcb45a0f95bbfb4e9020e9ad201ae5933fac5023c152abb","sha256:b4f0f86b72a21d1c103a8ecf144c053e939d4743f14f116e7a1d4d72c97283c6"],"state_sha256":"2602b99ffb29930c6c016a80f89e3371fb98e53b358e7659da7d451b39dce214"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq/e4AL20B8PEYaiFoZ2kR37wWgI/3IViAI9fS7cx8w4FubkJOrA0jm250ixArbJyvn65DvKj0S3rGfxpCR8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:58:11.642159Z","bundle_sha256":"d517050893d666977da406a17c4e82e79e4552527dba650a0a428d45c8a450a5"}}