{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IXBXPOOJXTLBZWLYTLHFIKFOCZ","short_pith_number":"pith:IXBXPOOJ","canonical_record":{"source":{"id":"1812.10160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-25T19:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"e1e9d1e3a44af9c271a3641e73d50f11effe80a045d5f998f3d5e49a7276408e","abstract_canon_sha256":"f131c98e90726e61c9753e130088fcbe076eb981f6ec01954aa84e7b88a28fd3"},"schema_version":"1.0"},"canonical_sha256":"45c377b9c9bcd61cd9789ace5428ae16473cc29ebef01b1bd08a8d1c20cda66b","source":{"kind":"arxiv","id":"1812.10160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10160","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10160v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10160","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"IXBXPOOJXTLB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IXBXPOOJXTLBZWLY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IXBXPOOJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IXBXPOOJXTLBZWLYTLHFIKFOCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-25T19:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"e1e9d1e3a44af9c271a3641e73d50f11effe80a045d5f998f3d5e49a7276408e","abstract_canon_sha256":"f131c98e90726e61c9753e130088fcbe076eb981f6ec01954aa84e7b88a28fd3"},"schema_version":"1.0"},"canonical_sha256":"45c377b9c9bcd61cd9789ace5428ae16473cc29ebef01b1bd08a8d1c20cda66b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.925728Z","signature_b64":"iLYUj8GgOPlDlvNdPg0/EIH2afB7g5wQTJabFJ1rCXFOjiyc9ZSslNeFMFMTqW6l6CHIl7iQHuSoMywjO+/2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45c377b9c9bcd61cd9789ace5428ae16473cc29ebef01b1bd08a8d1c20cda66b","last_reissued_at":"2026-05-17T23:57:24.925040Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.925040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10160","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbYXtj+Thk+XkLw/wgTTEdq9hv7UZHTJm6WRz4He+1Oi3egHvJEXJFAc6nZESTUDfAoCwmLMNZfcBV8jGL2uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:25:38.408903Z"},"content_sha256":"706871304e399ec08f9989e523c2a50ae1621c480fe70f0d428888830dd79db6","schema_version":"1.0","event_id":"sha256:706871304e399ec08f9989e523c2a50ae1621c480fe70f0d428888830dd79db6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IXBXPOOJXTLBZWLYTLHFIKFOCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The convex hull of a quadratic constraint over a polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asteroide Santana, Santanu S. Dey","submitted_at":"2018-12-25T19:37:26Z","abstract_excerpt":"A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global optimality is a well-known NP-hard problem and a traditional approach is to use convex relaxations and branch-and-bound algorithms. This paper makes a contribution in this direction by showing that the exact convex hull of a general quadratic equation intersected with any bounded polyhedron is second-order cone representable. We present a simple constructive proof of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10160","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-17T23:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdgTsU9QvDtv3U80qeImdm9C2nZ1BF8wl/8iYJE5wH6HBamofAdNn+nqjVYfKEDTuhaqm7/DtpFVGm4ppV3zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:25:38.409686Z"},"content_sha256":"bfeadb1bc859f08cca5f6812ebe251a9afd82e1afb41f399830e125eb4aa03e5","schema_version":"1.0","event_id":"sha256:bfeadb1bc859f08cca5f6812ebe251a9afd82e1afb41f399830e125eb4aa03e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/bundle.json","state_url":"https://pith.science/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/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-05T20:25:38Z","links":{"resolver":"https://pith.science/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ","bundle":"https://pith.science/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/bundle.json","state":"https://pith.science/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXBXPOOJXTLBZWLYTLHFIKFOCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IXBXPOOJXTLBZWLYTLHFIKFOCZ","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":"f131c98e90726e61c9753e130088fcbe076eb981f6ec01954aa84e7b88a28fd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-25T19:37:26Z","title_canon_sha256":"e1e9d1e3a44af9c271a3641e73d50f11effe80a045d5f998f3d5e49a7276408e"},"schema_version":"1.0","source":{"id":"1812.10160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10160","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10160v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10160","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"IXBXPOOJXTLB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IXBXPOOJXTLBZWLY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IXBXPOOJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:bfeadb1bc859f08cca5f6812ebe251a9afd82e1afb41f399830e125eb4aa03e5","target":"graph","created_at":"2026-05-17T23:57:24Z","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":"A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global optimality is a well-known NP-hard problem and a traditional approach is to use convex relaxations and branch-and-bound algorithms. This paper makes a contribution in this direction by showing that the exact convex hull of a general quadratic equation intersected with any bounded polyhedron is second-order cone representable. We present a simple constructive proof of","authors_text":"Asteroide Santana, Santanu S. Dey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-25T19:37:26Z","title":"The convex hull of a quadratic constraint over a polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10160","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:706871304e399ec08f9989e523c2a50ae1621c480fe70f0d428888830dd79db6","target":"record","created_at":"2026-05-17T23:57:24Z","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":"f131c98e90726e61c9753e130088fcbe076eb981f6ec01954aa84e7b88a28fd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-25T19:37:26Z","title_canon_sha256":"e1e9d1e3a44af9c271a3641e73d50f11effe80a045d5f998f3d5e49a7276408e"},"schema_version":"1.0","source":{"id":"1812.10160","kind":"arxiv","version":1}},"canonical_sha256":"45c377b9c9bcd61cd9789ace5428ae16473cc29ebef01b1bd08a8d1c20cda66b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45c377b9c9bcd61cd9789ace5428ae16473cc29ebef01b1bd08a8d1c20cda66b","first_computed_at":"2026-05-17T23:57:24.925040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:24.925040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iLYUj8GgOPlDlvNdPg0/EIH2afB7g5wQTJabFJ1rCXFOjiyc9ZSslNeFMFMTqW6l6CHIl7iQHuSoMywjO+/2DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:24.925728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:706871304e399ec08f9989e523c2a50ae1621c480fe70f0d428888830dd79db6","sha256:bfeadb1bc859f08cca5f6812ebe251a9afd82e1afb41f399830e125eb4aa03e5"],"state_sha256":"8056a80a36ae0c0dd4843658beeae9597a5c5538996fc7298c635d420d8ab593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySovE0Tq5VF1ALSKkxP9ircdi2IB55yt05WFkQWUn80P3E1F+f56piZkuCJMEGi5+zxXrtajvQlJA9DYAoP5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:25:38.417411Z","bundle_sha256":"64ad155432fb6474cf5193d8cfdcdd723281d8f06ca28d8c85f5f6f4f1aa63d6"}}