{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:64CFONGM6PCV6JWCAFIE4AYOHD","short_pith_number":"pith:64CFONGM","canonical_record":{"source":{"id":"2303.06761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-12T21:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"73ec217a7da0aa78e0952a12067fd07593a0c5f094ecf270d6cdc37dc19b4ab6","abstract_canon_sha256":"28e0127c1f0a3f9b10f27c4b3a95208e7d30d268ee903c7c945289fc6d2bfc6a"},"schema_version":"1.0"},"canonical_sha256":"f7045734ccf3c55f26c201504e030e38f6e4da72b421f0945e8c8b4cfcdf7074","source":{"kind":"arxiv","id":"2303.06761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06761","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06761v1","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06761","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"64CFONGM6PCV","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"64CFONGM6PCV6JWC","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"64CFONGM","created_at":"2026-07-05T05:50:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:64CFONGM6PCV6JWCAFIE4AYOHD","target":"record","payload":{"canonical_record":{"source":{"id":"2303.06761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-12T21:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"73ec217a7da0aa78e0952a12067fd07593a0c5f094ecf270d6cdc37dc19b4ab6","abstract_canon_sha256":"28e0127c1f0a3f9b10f27c4b3a95208e7d30d268ee903c7c945289fc6d2bfc6a"},"schema_version":"1.0"},"canonical_sha256":"f7045734ccf3c55f26c201504e030e38f6e4da72b421f0945e8c8b4cfcdf7074","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:22.940555Z","signature_b64":"T8e2Q8e2VOm47iQCdTJLHtyMM6fVk1OAFtnXQo1sl9MffqDbovQHkPPigVyTyanHzqmZ3AAjlfvR5z+T7TorBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7045734ccf3c55f26c201504e030e38f6e4da72b421f0945e8c8b4cfcdf7074","last_reissued_at":"2026-07-05T05:50:22.940128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:22.940128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.06761","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-07-05T05:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGdOU7xaKE8W95IANDfUZieDgwvo92gvGae33AB8rnVXRotmEBMhCelVOLXQ2Q+OwRiy27a4cvlIkG/60m1WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:40:08.248757Z"},"content_sha256":"4d4e861aa46313b303c9860522d91b9748ab4ca8b3cca39718223e5ce1a7dc79","schema_version":"1.0","event_id":"sha256:4d4e861aa46313b303c9860522d91b9748ab4ca8b3cca39718223e5ce1a7dc79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:64CFONGM6PCV6JWCAFIE4AYOHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Exact and Inexact RLT and SDP-RLT Relaxations of Quadratic Programs with Box Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"E. Alper Y{\\i}ld{\\i}r{\\i}m, Yuzhou Qiu","submitted_at":"2023-03-12T21:54:03Z","abstract_excerpt":"Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard problem that frequently arises in various applications. We focus on two convex relaxations, namely the RLT (Reformulation-Linearization Technique) relaxation and the SDP-RLT relaxation obtained by adding semidefinite constraints to the RLT relaxation. Both relaxations yield lower bounds on the optimal value of a quadratic program with box constraints. We present complete algebraic descriptions of the set of instances"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06761","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.06761/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ov0VyfxCJkIYo+/3G66d78Vxit24cwQj5BYvMBoPRM8P7skj4Qy36cCTzGM070IgeTVHZRdicou8+PZ8/1YkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:40:08.249131Z"},"content_sha256":"2faef2ddc741c1c5fe6a1c01203f30a6579a7ecbd6e04296c0d2d9b8622fcc77","schema_version":"1.0","event_id":"sha256:2faef2ddc741c1c5fe6a1c01203f30a6579a7ecbd6e04296c0d2d9b8622fcc77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64CFONGM6PCV6JWCAFIE4AYOHD/bundle.json","state_url":"https://pith.science/pith/64CFONGM6PCV6JWCAFIE4AYOHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64CFONGM6PCV6JWCAFIE4AYOHD/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-07-07T09:40:08Z","links":{"resolver":"https://pith.science/pith/64CFONGM6PCV6JWCAFIE4AYOHD","bundle":"https://pith.science/pith/64CFONGM6PCV6JWCAFIE4AYOHD/bundle.json","state":"https://pith.science/pith/64CFONGM6PCV6JWCAFIE4AYOHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64CFONGM6PCV6JWCAFIE4AYOHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:64CFONGM6PCV6JWCAFIE4AYOHD","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":"28e0127c1f0a3f9b10f27c4b3a95208e7d30d268ee903c7c945289fc6d2bfc6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-12T21:54:03Z","title_canon_sha256":"73ec217a7da0aa78e0952a12067fd07593a0c5f094ecf270d6cdc37dc19b4ab6"},"schema_version":"1.0","source":{"id":"2303.06761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06761","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06761v1","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06761","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"64CFONGM6PCV","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"64CFONGM6PCV6JWC","created_at":"2026-07-05T05:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"64CFONGM","created_at":"2026-07-05T05:50:22Z"}],"graph_snapshots":[{"event_id":"sha256:2faef2ddc741c1c5fe6a1c01203f30a6579a7ecbd6e04296c0d2d9b8622fcc77","target":"graph","created_at":"2026-07-05T05:50:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.06761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard problem that frequently arises in various applications. We focus on two convex relaxations, namely the RLT (Reformulation-Linearization Technique) relaxation and the SDP-RLT relaxation obtained by adding semidefinite constraints to the RLT relaxation. Both relaxations yield lower bounds on the optimal value of a quadratic program with box constraints. We present complete algebraic descriptions of the set of instances","authors_text":"E. Alper Y{\\i}ld{\\i}r{\\i}m, Yuzhou Qiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-12T21:54:03Z","title":"On Exact and Inexact RLT and SDP-RLT Relaxations of Quadratic Programs with Box Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06761","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:4d4e861aa46313b303c9860522d91b9748ab4ca8b3cca39718223e5ce1a7dc79","target":"record","created_at":"2026-07-05T05:50:22Z","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":"28e0127c1f0a3f9b10f27c4b3a95208e7d30d268ee903c7c945289fc6d2bfc6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-12T21:54:03Z","title_canon_sha256":"73ec217a7da0aa78e0952a12067fd07593a0c5f094ecf270d6cdc37dc19b4ab6"},"schema_version":"1.0","source":{"id":"2303.06761","kind":"arxiv","version":1}},"canonical_sha256":"f7045734ccf3c55f26c201504e030e38f6e4da72b421f0945e8c8b4cfcdf7074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7045734ccf3c55f26c201504e030e38f6e4da72b421f0945e8c8b4cfcdf7074","first_computed_at":"2026-07-05T05:50:22.940128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:50:22.940128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8e2Q8e2VOm47iQCdTJLHtyMM6fVk1OAFtnXQo1sl9MffqDbovQHkPPigVyTyanHzqmZ3AAjlfvR5z+T7TorBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:50:22.940555Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.06761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d4e861aa46313b303c9860522d91b9748ab4ca8b3cca39718223e5ce1a7dc79","sha256:2faef2ddc741c1c5fe6a1c01203f30a6579a7ecbd6e04296c0d2d9b8622fcc77"],"state_sha256":"8909820e23f999935336815c47dc7236fdfa5f29ae6a0a3f05cbb34b511abb00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pt+Gl8iHNKouSifV0oZAOUOAs/i9jNdJbbZvpBtZM+6ZfCfcEqQ+oU0WzlqLL3hf4GdBP6E6rX367Ik9KNkxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:40:08.250986Z","bundle_sha256":"5ef6e96e911972911e251f9c76d327f77f8192a6ef4365c56d5061f6c2a3cae0"}}