{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EMDFIXXJJEBG2KNRLALDFYIVY6","short_pith_number":"pith:EMDFIXXJ","canonical_record":{"source":{"id":"1507.05708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-21T04:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"88a6f063e953ea13e7aff8e70e74e35d3245f07cd452c4f146dbc6a20646e389","abstract_canon_sha256":"504c9fee24e4cb59c6fee2987e85feea1301b100c03a890f7f2b538ebcaef0c7"},"schema_version":"1.0"},"canonical_sha256":"2306545ee949026d29b1581632e115c783531949e7aa94eb3e9ac97a34dd9e42","source":{"kind":"arxiv","id":"1507.05708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05708","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05708v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05708","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"EMDFIXXJJEBG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMDFIXXJJEBG2KNR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMDFIXXJ","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EMDFIXXJJEBG2KNRLALDFYIVY6","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-21T04:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"88a6f063e953ea13e7aff8e70e74e35d3245f07cd452c4f146dbc6a20646e389","abstract_canon_sha256":"504c9fee24e4cb59c6fee2987e85feea1301b100c03a890f7f2b538ebcaef0c7"},"schema_version":"1.0"},"canonical_sha256":"2306545ee949026d29b1581632e115c783531949e7aa94eb3e9ac97a34dd9e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.168492Z","signature_b64":"zBMsf2GIQcyCFIyUBDfvtr9xDF0RvsY5Pi+L2Jh83Ygiw4g26QjShsY+Tlp/R6rHPY4ZlP4sWoHP+rSbTK2UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2306545ee949026d29b1581632e115c783531949e7aa94eb3e9ac97a34dd9e42","last_reissued_at":"2026-05-18T00:38:40.167852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.167852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05708","source_version":1,"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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNTMcn598KG82USCZ/7fPQmnp9w1GEmHB6VfbynVWqWfil8xBqWgbWy2objoh/4lpag+Z3O8UqFC8x4ozxiXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:04.931284Z"},"content_sha256":"5eece2a29c1b089f6f7a1c8728ba50a9faf678d910729695e27489c11970c06c","schema_version":"1.0","event_id":"sha256:5eece2a29c1b089f6f7a1c8728ba50a9faf678d910729695e27489c11970c06c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EMDFIXXJJEBG2KNRLALDFYIVY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight MIQP Reformulations for Semi-Continuous Quadratic Programming: Lift-and-Convexification Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Baiyi Wu, Duan Li, Xiaojin Zheng, Xiaoling Sun","submitted_at":"2015-07-21T04:52:09Z","abstract_excerpt":"We consider in this paper a class of semi-continuous quadratic programming problems which arises in many real-world applications such as production planning, portfolio selection and subset selection in regression. We propose a lift-and-convexification approach to derive an equivalent reformulation of the original problem. This lift-and-convexification approach lifts the quadratic term involving $x$ only in the original objective function $f(x,y)$ to a quadratic function of both $x$ and $y$ and convexifies this equivalent objective function. While the continuous relaxation of our new reformulat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05708","kind":"arxiv","version":1},"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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgLOb76JDYVx8DZxL4x3l+UcnoAZEtnwvABYkQ/fGBRYfyCp/ZsJ3cSlaixIfDlf4Z6tRPjVKe9Yk10+8TwCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:04.931647Z"},"content_sha256":"27255809da45441591fc006b746afcb8a0db7a065c1812cc6c4bdb2e4490781c","schema_version":"1.0","event_id":"sha256:27255809da45441591fc006b746afcb8a0db7a065c1812cc6c4bdb2e4490781c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/bundle.json","state_url":"https://pith.science/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/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-02T22:55:04Z","links":{"resolver":"https://pith.science/pith/EMDFIXXJJEBG2KNRLALDFYIVY6","bundle":"https://pith.science/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/bundle.json","state":"https://pith.science/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMDFIXXJJEBG2KNRLALDFYIVY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EMDFIXXJJEBG2KNRLALDFYIVY6","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":"504c9fee24e4cb59c6fee2987e85feea1301b100c03a890f7f2b538ebcaef0c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-21T04:52:09Z","title_canon_sha256":"88a6f063e953ea13e7aff8e70e74e35d3245f07cd452c4f146dbc6a20646e389"},"schema_version":"1.0","source":{"id":"1507.05708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05708","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05708v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05708","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"EMDFIXXJJEBG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMDFIXXJJEBG2KNR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMDFIXXJ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:27255809da45441591fc006b746afcb8a0db7a065c1812cc6c4bdb2e4490781c","target":"graph","created_at":"2026-05-18T00:38:40Z","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 consider in this paper a class of semi-continuous quadratic programming problems which arises in many real-world applications such as production planning, portfolio selection and subset selection in regression. We propose a lift-and-convexification approach to derive an equivalent reformulation of the original problem. This lift-and-convexification approach lifts the quadratic term involving $x$ only in the original objective function $f(x,y)$ to a quadratic function of both $x$ and $y$ and convexifies this equivalent objective function. While the continuous relaxation of our new reformulat","authors_text":"Baiyi Wu, Duan Li, Xiaojin Zheng, Xiaoling Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-21T04:52:09Z","title":"Tight MIQP Reformulations for Semi-Continuous Quadratic Programming: Lift-and-Convexification Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05708","kind":"arxiv","version":1},"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:5eece2a29c1b089f6f7a1c8728ba50a9faf678d910729695e27489c11970c06c","target":"record","created_at":"2026-05-18T00:38:40Z","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":"504c9fee24e4cb59c6fee2987e85feea1301b100c03a890f7f2b538ebcaef0c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-21T04:52:09Z","title_canon_sha256":"88a6f063e953ea13e7aff8e70e74e35d3245f07cd452c4f146dbc6a20646e389"},"schema_version":"1.0","source":{"id":"1507.05708","kind":"arxiv","version":1}},"canonical_sha256":"2306545ee949026d29b1581632e115c783531949e7aa94eb3e9ac97a34dd9e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2306545ee949026d29b1581632e115c783531949e7aa94eb3e9ac97a34dd9e42","first_computed_at":"2026-05-18T00:38:40.167852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.167852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBMsf2GIQcyCFIyUBDfvtr9xDF0RvsY5Pi+L2Jh83Ygiw4g26QjShsY+Tlp/R6rHPY4ZlP4sWoHP+rSbTK2UAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.168492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eece2a29c1b089f6f7a1c8728ba50a9faf678d910729695e27489c11970c06c","sha256:27255809da45441591fc006b746afcb8a0db7a065c1812cc6c4bdb2e4490781c"],"state_sha256":"84cf1fe32a337ee0a8e1eb6c6ff12bb07c03cb8dcf3ad28dd385012707990dfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58lU+kRd3W0n1L1HEpuk01b/PXQlqMnLpipt2TagCH/A/0FmSiZ+nJx3QXph6KPsblGecltSo6qxOA52CG5yCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:55:04.933722Z","bundle_sha256":"05c837314f839c81305ab13325f628c81ccfefe410af9c8ccf15198554dbecad"}}