{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KOEMEJUAFK6GIITD2T6VNTHDTD","short_pith_number":"pith:KOEMEJUA","canonical_record":{"source":{"id":"1511.02423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"b57b865e4aaea7e912f952c97f33094352bafe24165b5578065d1f3d2d8cbc82","abstract_canon_sha256":"bfa273e91e6eeb711f70346e2ec6dae72415417b8377a8c0f8ddf5a00186d6a2"},"schema_version":"1.0"},"canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","source":{"kind":"arxiv","id":"1511.02423","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02423","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02423v3","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02423","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"KOEMEJUAFK6G","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOEMEJUAFK6GIITD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOEMEJUA","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KOEMEJUAFK6GIITD2T6VNTHDTD","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"b57b865e4aaea7e912f952c97f33094352bafe24165b5578065d1f3d2d8cbc82","abstract_canon_sha256":"bfa273e91e6eeb711f70346e2ec6dae72415417b8377a8c0f8ddf5a00186d6a2"},"schema_version":"1.0"},"canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.266456Z","signature_b64":"oLOkIclxe3CJZiNME7sQ6U/GUg6haNabVhkY0iQYsvfKrjUeKbPWDRI5n3XsYkIyrSXIZWfk/sHlsjNJqPmGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","last_reissued_at":"2026-05-18T00:10:48.265798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.265798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02423","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-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPeHdxvq3fvhLvhzSBTmMEwydcp5i+P7yMBt2E4LlxVfWhuEMQ7UAckGqtSCXTOcvLzycotWJkgqDWz3LOboDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:32:23.141517Z"},"content_sha256":"412a0e0c1360746a3a1de7671eb081522e9c0233dab27aca4df21037cc3941bf","schema_version":"1.0","event_id":"sha256:412a0e0c1360746a3a1de7671eb081522e9c0233dab27aca4df21037cc3941bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KOEMEJUAFK6GIITD2T6VNTHDTD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Vera, Luis F. Zuluaga, Wei Xia","submitted_at":"2015-11-08T01:17:37Z","abstract_excerpt":"Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we reformulate QPs as a mixed-integer linear problem (MILP). This is done via the reformulation of QP as a linear complementary problem, and the use of binary variables and big-M constraints, to model the complementary constraints. To obtain such reformulation, we show how to impose bounds on the dual variables without eliminating all the (globally) optimal primal solutions; using some fundamental results on the solution of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02423","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-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTim8CyRY8dbwOt8qlUDjq4Ous65qMhyDVz3qN5aZyFkPNZT+37HWCAADIZR6kpqb6TfAZJHBAthossiew4MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:32:23.142197Z"},"content_sha256":"fded98c412d8a3323aa047fa58c6b4b8c8fb16efab377c0bf1ca499d830147cf","schema_version":"1.0","event_id":"sha256:fded98c412d8a3323aa047fa58c6b4b8c8fb16efab377c0bf1ca499d830147cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/bundle.json","state_url":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/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-05-31T06:32:23Z","links":{"resolver":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD","bundle":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/bundle.json","state":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KOEMEJUAFK6GIITD2T6VNTHDTD","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":"bfa273e91e6eeb711f70346e2ec6dae72415417b8377a8c0f8ddf5a00186d6a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","title_canon_sha256":"b57b865e4aaea7e912f952c97f33094352bafe24165b5578065d1f3d2d8cbc82"},"schema_version":"1.0","source":{"id":"1511.02423","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02423","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02423v3","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02423","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"KOEMEJUAFK6G","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOEMEJUAFK6GIITD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOEMEJUA","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:fded98c412d8a3323aa047fa58c6b4b8c8fb16efab377c0bf1ca499d830147cf","target":"graph","created_at":"2026-05-18T00:10:48Z","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":"Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we reformulate QPs as a mixed-integer linear problem (MILP). This is done via the reformulation of QP as a linear complementary problem, and the use of binary variables and big-M constraints, to model the complementary constraints. To obtain such reformulation, we show how to impose bounds on the dual variables without eliminating all the (globally) optimal primal solutions; using some fundamental results on the solution of","authors_text":"Juan Vera, Luis F. Zuluaga, Wei Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","title":"Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02423","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:412a0e0c1360746a3a1de7671eb081522e9c0233dab27aca4df21037cc3941bf","target":"record","created_at":"2026-05-18T00:10:48Z","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":"bfa273e91e6eeb711f70346e2ec6dae72415417b8377a8c0f8ddf5a00186d6a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","title_canon_sha256":"b57b865e4aaea7e912f952c97f33094352bafe24165b5578065d1f3d2d8cbc82"},"schema_version":"1.0","source":{"id":"1511.02423","kind":"arxiv","version":3}},"canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","first_computed_at":"2026-05-18T00:10:48.265798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.265798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oLOkIclxe3CJZiNME7sQ6U/GUg6haNabVhkY0iQYsvfKrjUeKbPWDRI5n3XsYkIyrSXIZWfk/sHlsjNJqPmGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.266456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02423","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:412a0e0c1360746a3a1de7671eb081522e9c0233dab27aca4df21037cc3941bf","sha256:fded98c412d8a3323aa047fa58c6b4b8c8fb16efab377c0bf1ca499d830147cf"],"state_sha256":"b3e9b2156d21fccc8fbef0d70c74656d850d699162055fc7074087031b4fb927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3skITuerCLIlEpvElWujOOTbBVzLkQfxvtXkvOXOUY7C5DU4o+N4JfH0Dt1Z9NibYMbKuDW98/nDQS8fsS15CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:32:23.145141Z","bundle_sha256":"f9fd82d9e74f2a63ff74a046d86ccb3b17badc098a724ffcee0298447c37b123"}}