{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O3CVQFZNJBERWDYCUQHCLX2LMN","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":"86b2456be5dd4c597a30b283ef7bed14c67598e1250c996d5fc204137ecd0b2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T08:26:06Z","title_canon_sha256":"361f246576b58c8d945a0370a2a1e88effb3461b45bff01b6cf0ff37183c4d53"},"schema_version":"1.0","source":{"id":"2506.03692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03692","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03692v1","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03692","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_12","alias_value":"O3CVQFZNJBER","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_16","alias_value":"O3CVQFZNJBERWDYC","created_at":"2026-07-05T11:15:50Z"},{"alias_kind":"pith_short_8","alias_value":"O3CVQFZN","created_at":"2026-07-05T11:15:50Z"}],"graph_snapshots":[{"event_id":"sha256:8f9ba08ff372178d3bd687f5de33eff5e32ca2cf374b9fdef3917b07515713fb","target":"graph","created_at":"2026-07-05T11:15:50Z","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/2506.03692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we concentrate on a particular category of quadratically constrained quadratic programming (QCQP): nonconvex QCQP with one equality constraint. This type of QCQP problem optimizes a quadratic objective under a fixed second-order cost and has various engineering applications. It often serves as a subproblem in an iterative algorithm framework. However, the development of a high-quality and efficient solution remains an open problem in the existing literature. Traditionally, the Semidefinite Relaxation (SDR) technique is applied for an optimal solution with a prohibitively high or","authors_text":"Licheng Zhao, Rui Zhou, Wenqiang Pu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03692","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:cc41b329c07cdacde3ece6813d40d6cff83b18f1ed8b18cacfa1e158ac6fbc50","target":"record","created_at":"2026-07-05T11:15:50Z","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":"86b2456be5dd4c597a30b283ef7bed14c67598e1250c996d5fc204137ecd0b2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T08:26:06Z","title_canon_sha256":"361f246576b58c8d945a0370a2a1e88effb3461b45bff01b6cf0ff37183c4d53"},"schema_version":"1.0","source":{"id":"2506.03692","kind":"arxiv","version":1}},"canonical_sha256":"76c558172d48491b0f02a40e25df4b6373ba7586341d71ed053b8e8180699ebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76c558172d48491b0f02a40e25df4b6373ba7586341d71ed053b8e8180699ebf","first_computed_at":"2026-07-05T11:15:50.108658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:50.108658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBxHVQzmCrdbkgxqWP7RsIDmh1sCBLdX9+NqLWixgY9Y92EZtervJQkRqZPPGVDU0YDcDov6HFsLw2iOb18BBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:50.109196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc41b329c07cdacde3ece6813d40d6cff83b18f1ed8b18cacfa1e158ac6fbc50","sha256:8f9ba08ff372178d3bd687f5de33eff5e32ca2cf374b9fdef3917b07515713fb"],"state_sha256":"0bda6c025c8a508dd650bcca59a1ceb3605e3be7be1fe8ddab622788ba10bb3e"}