{"as_of":"2026-08-08T07:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdf8abf5490edb8dcee4e87c3e763b3e7cdf8b1d71ed42cf7c82f1e426cfaad4","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:04:14.638305Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.03692/citation-record","integrity":"/paper/2506.03692/integrity","json":"/paper/2506.03692/citation-record.json","paper":"/paper/2506.03692"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.539912Z","title":"Eigenvalues and the max-cut prob- lem,","venue":null,"work_id":"7f3e25f1-6c4c-4bb7-b813-bc1de6aab1e6","year":1990},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.422327Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:d96aeffca74c4bd6fedf5b8fe4ca25d98bb8392db77135e80aea5c4d0c026f30","observation_id":"2944853f-bf69-4167-a396-32fa00b742ac","resolution":{"observed_at":"2026-08-07T11:04:15.544310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.523935Z","title":"Quadratic knapsack problems,","venue":null,"work_id":"23fb5da4-853f-4206-bd87-3d5ec1a2bed9","year":1980},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.428135Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:8086f6cce917072bb1615fa3fd69c1831b10a18e2096fd9978a46a2778b1dd5c","observation_id":"1b4c4faa-368e-4793-b204-a18be5aaa334","resolution":{"observed_at":"2026-08-07T11:04:15.530955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.509937Z","title":"Trans- mit beamforming for physical-layer multicasting,","venue":null,"work_id":"90092feb-80f4-47d2-be94-032c2b412a37","year":2006},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.434184Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:8297120c37cad1c396fe5656e24ad9f774a4e83bfdb613205e485b313f0ee309","observation_id":"30045abd-bebb-421a-962b-63186d9b0025","resolution":{"observed_at":"2026-08-07T11:04:15.514098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.497835Z","title":"Far-field multicast beamforming for uniform linear antenna arrays,","venue":null,"work_id":"746061a3-19e5-4c0a-ac66-4b68779225af","year":2007},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.438338Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:9a257a2a38e5c462c17d99e3ea22f88872353ab10f6ec5fd560ec672735d2957","observation_id":"d63265a4-d391-46c1-b521-bf5253720fd8","resolution":{"observed_at":"2026-08-07T11:04:15.501662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.483202Z","title":"Convex optimization-based beamforming,","venue":null,"work_id":"187b23a0-1186-4683-8427-97dad56b126c","year":2010},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.443691Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:59802f52a78699b004c1eefb0d8aa8cb342d1453990af2a715e60a2756f1e8bd","observation_id":"92fbfd01-01f5-41b1-8f8f-629419d35b87","resolution":{"observed_at":"2026-08-07T11:04:15.488111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.466484Z","title":"Code design to optimize radar detection performance under ac- curacy and similarity constraints,","venue":null,"work_id":"96f80edc-3760-4ab6-8a55-4624bcbb5a1f","year":2008},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.449833Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:bc45276e1e6215f334af4cbcb99e97e06d3ad3fc9b73644523922cd3475bfca8","observation_id":"eb41f2d1-8046-4bf1-8da3-379cf7674fce","resolution":{"observed_at":"2026-08-07T11:04:15.472075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.452315Z","title":null,"venue":null,"work_id":"16a452d4-b777-4fa9-9558-4cc233f0412f","year":2002},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.454677Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:8e0e50ae53b656bd05b221f1c877f1fc018d409f3e4f7a3fbb15f7eefe03411e","observation_id":"11a52f3b-bd56-4356-b676-97acdae76c13","resolution":{"observed_at":"2026-08-07T11:04:15.457311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.437525Z","title":"Relations between two sets of variates","venue":null,"work_id":"e585cb52-02a8-4a38-94b0-53f2c2479b30","year":1936},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.460702Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:f0b310f4a041f8be16a99dae3b25de9af4d04c261d82438a756b20586b9604a5","observation_id":"6ecb5210-4568-47ac-9f8b-2abe9b2b4666","resolution":{"observed_at":"2026-08-07T11:04:15.442793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.421855Z","title":"Generalizations of the trust region problem,","venue":null,"work_id":"0d12dfbd-205e-4c34-9271-42b6cae79146","year":1993},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.465185Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:da5a9f26353558eb16adbc4e6fdafbdbfbf6d6c36ffc71b21695399fb0eff706","observation_id":"55a5cfa0-293c-44c0-9852-a093e80e3164","resolution":{"observed_at":"2026-08-07T11:04:15.426544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.406550Z","title":"Majorization-minimization algorithms in signal processing, communications, and machine learning,","venue":null,"work_id":"b068194c-f54a-46bc-9c4f-ce8392854449","year":2016},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.472747Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:744c4e78004b04de71a848fa94c8fbbcc002f6d6cb25568136005cdae0ea9e78","observation_id":"4c12cdcb-f5d1-4cf6-89bb-d1c6dfa8af6d","resolution":{"observed_at":"2026-08-07T11:04:15.410975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.476990Z","title":"Nonlinear programming,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.476990Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:83ff9bc5d2af5e3ccb2ed0a58ed1a7d9ca51a7d7dc91faac09f6fd45ff4902fb","observation_id":"61081402-530f-4eae-84a6-92a0ded9017e","resolution":{"observed_at":"2026-08-07T11:04:14.476990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07870","last_updated":"2017-05-16T18:59:21Z","snapshot_observed_at":"2026-07-06T05:34:49.629032Z","submitted_at":"2017-03-22T21:57:35Z","title":"General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.07870","snapshot_observed_at":"2026-08-07T11:04:14.481306Z","title":"General heuristics for nonconvex quadrat- ically constrained quadratic programming,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.481306Z"},"links":{"cited_paper":"/paper/1703.07870","citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:6460aa34bd59d6137c1a3af150941d21259aa18b7150e4905a315c1a69720b68","observation_id":"02e3b2e0-f380-4673-a89c-819c043bf999","resolution":{"observed_at":"2026-08-07T11:04:14.481306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.485878Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.485878Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:f771b7f2d3822eb704a809dbdced5bb3dd84ba1526f6c443935dc9ca5bff3b48","observation_id":"c6733d25-443b-4480-9ed4-6aef4aceaefd","resolution":{"observed_at":"2026-08-07T11:04:14.485878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.374665Z","title":"Relaxations and randomized methods for nonconvex QCQPs,","venue":null,"work_id":"5e137892-5104-4d44-8923-fb93265763c5","year":2003},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.490949Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:45677637549af9af978eb091ba987843856f110049773ba9f023076225852ebe","observation_id":"93cc5d98-e985-4ce1-930e-68c75e99c0fb","resolution":{"observed_at":"2026-08-07T11:04:15.380904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.352817Z","title":"Quadratic programming is in NP,","venue":null,"work_id":"8f4a7f3c-36dc-4695-811f-bf8242a50c1b","year":1990},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.495079Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:54ee8e98d66396a6fa5b435d6bed1f582f26eb49a225bfc7473df503322562cc","observation_id":"cf222489-7e09-4411-8220-8ac4784040dd","resolution":{"observed_at":"2026-08-07T11:04:15.358055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.332571Z","title":"Feasible point pursuit and successive approximation of non-convex QCQPs,","venue":null,"work_id":"e4af824c-2e94-4987-9109-131b5a8acd52","year":2014},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.499928Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:fc75e253869e625b5acbd8ad9bbf364c7518717411ec95a57dcc76de17ec4634","observation_id":"cae717d7-d970-4380-aef1-7bd25ca3bf01","resolution":{"observed_at":"2026-08-07T11:04:15.339415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.317688Z","title":"First-order methods for fast feasibility pursuit of non-convex QCQPs,","venue":null,"work_id":"21c9aee0-3bcc-4b7d-9844-c5f51849b98e","year":2017},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.504321Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:95ae22297461c5232105a5c9967ff8dfcb54b983ba83c3f59cc1d2a602c5076b","observation_id":"2c12ee12-1993-4d50-a39d-704a037f612b","resolution":{"observed_at":"2026-08-07T11:04:15.321895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.302951Z","title":"A relax- ation method for nonconvex quadratically constrained quadratic programs,","venue":null,"work_id":"f3cc8c8a-06e4-4daa-966b-7189b63f8b31","year":1995},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.508135Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:8849321fdbbd2ddd48dd1943b98e4d60f7d17127abc2ba5f502e9217d11c1be2","observation_id":"d53a3f25-d539-4960-b571-cf11021b4f29","resolution":{"observed_at":"2026-08-07T11:04:15.307827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.291254Z","title":"Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relax- ations,","venue":null,"work_id":"03e1d4db-b4a5-4068-b249-b9cecad038e2","year":2003},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.511930Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:9936cf734f0725d2e89c72d6d32c1b35e37cdaff0fae5cb509e81ea9c96ed557","observation_id":"fa96edf8-c606-402c-a2f2-b28c66d38dbc","resolution":{"observed_at":"2026-08-07T11:04:15.295086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.277246Z","title":"Semidefinite relaxation of quadratic optimization problems,","venue":null,"work_id":"e48a01b2-55c1-4825-94b1-ff45725bd09c","year":2010},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.517028Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:940634062373ef277be8df61bc4d06ab82721ef117a40b479ba2f7add2f2b51a","observation_id":"bfae0cbd-46f0-4fdb-bb27-57cbdc689b8c","resolution":{"observed_at":"2026-08-07T11:04:15.282985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.263390Z","title":"Interior-point algorithms for semidefinite pro- gramming problems derived from the KYP lemma,","venue":null,"work_id":"ece7bb46-5d2b-44d7-b184-e4e388074e7f","year":2005},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.522594Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:bbcabcabae76b9927d993d42b4f157a19815591bd70259edc6521897975058ea","observation_id":"056067a1-cbb6-4f5d-9262-051f3a52ffbb","resolution":{"observed_at":"2026-08-07T11:04:15.267517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.251963Z","title":"Semidefinite programming,","venue":null,"work_id":"28764b9f-c95b-4799-be95-0a7aa5afb47a","year":1996},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.526704Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:83d17f708f797ea445e3fa4d0fc46889f608c5c4750d7c2c0180b5cbdda4b6e1","observation_id":"da644344-b63b-4076-8ee6-9419eceab53a","resolution":{"observed_at":"2026-08-07T11:04:15.256087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.231560Z","title":"Optimal estimation of sensor biases for asynchronous multi-sensor data fusion,","venue":null,"work_id":"6753fafa-e6e1-49f0-96b2-72c242f725b1","year":2018},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.531355Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:c3fb38f3deb9486906b453dde1b062dc3ee03767f7a7b678bdd12bf0a49c8975","observation_id":"62660d68-4e8d-456b-9d09-edd4e79cf3de","resolution":{"observed_at":"2026-08-07T11:04:15.238855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.207305Z","title":"Rank-constrained separable semidefinite programming with applications to optimal beam- forming,","venue":null,"work_id":"4e64f62f-8188-43b2-a3e0-802d0fed73da","year":2009},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.535452Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:1b916ecf70f702564b7d0012c327662141c0566c6c5f7a28337b559c518fe924","observation_id":"3aa2ac51-38c6-47c6-9c18-148f1cd3f1f3","resolution":{"observed_at":"2026-08-07T11:04:15.213884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.189473Z","title":"Consensus-ADMM for gen- eral quadratically constrained quadratic programming,","venue":null,"work_id":"4026ec4c-f664-4682-86bf-06b2fb4213c1","year":2016},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.539793Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:684acb4dc04192bc0bf0d90a793ae073834a19dae64bdc62bbc689eda2ffbb6d","observation_id":"53c36be6-ff6b-420a-92f7-ad1d92654478","resolution":{"observed_at":"2026-08-07T11:04:15.196182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.168880Z","title":"Fast approximation algo- rithms for a class of non-convex QCQP problems using first- order methods,","venue":null,"work_id":"119582a8-9788-4d5e-a766-d588125dde06","year":2017},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.544505Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:51996a276ba3a9536deb903db311f174b01d4650ccf4158fba5d57553a1b0267","observation_id":"5c715357-814f-492a-9e6a-67e6ac112a62","resolution":{"observed_at":"2026-08-07T11:04:15.177205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.151155Z","title":"Gander,On the linear least squares problem with a quadratic constraint","venue":null,"work_id":"5571a58e-7946-4437-888a-4e3500b3cd57","year":1978},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.549475Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:178e339d3a298436da02321e28d2b0fb7cbf9904c2429857d0a3a705426ce1d5","observation_id":"f3153459-d501-4954-82fc-953f854f10d7","resolution":{"observed_at":"2026-08-07T11:04:15.156779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.133512Z","title":"Quadratically constrained least squares and quadratic problems,","venue":null,"work_id":"58126bc2-0b75-4430-b601-a3d77546a7d3","year":1991},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.554247Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:e67b497af83e943608de7b9b4c92043b56e70b0eade40a02e25d9d99175283ff","observation_id":"8938db9b-bf8c-4677-88ab-c23d2c7fd747","resolution":{"observed_at":"2026-08-07T11:04:15.140091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.114066Z","title":"Hidden convexity in some nonconvex quadratically constrained quadratic programming,","venue":null,"work_id":"ca83fa8d-f41b-47c9-9a24-04c16ddea651","year":1996},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.558262Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:35056e1d72b18db3d9d6ec4087458a5c58020585f20fbe03d976e9b95dc3d04f","observation_id":"d90bdeef-de34-4ecf-8d2e-a4b1bbb79add","resolution":{"observed_at":"2026-08-07T11:04:15.120880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.562489Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.562489Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:ebe130159af020f228fd43a739dd1b4e849f9d448e8d4de36eee0579d49a1b07","observation_id":"3397825c-76fd-47e5-9b34-fb208bce2db7","resolution":{"observed_at":"2026-08-07T11:04:14.562489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.083122Z","title":"A review of trust region algorithms for optimiza- tion,","venue":null,"work_id":"6f8849c1-c7fc-47de-a9a4-4c9d26434cfd","year":2000},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.567090Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:30c67171f4cd438d184871082c7b4248674340309071d0033eecd92c7085e8f6","observation_id":"2eda681f-444a-4f3d-ba78-be1fcdc27d8a","resolution":{"observed_at":"2026-08-07T11:04:15.090852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.066503Z","title":"Recent advances in trust region algorithms,","venue":null,"work_id":"17295294-48dc-4477-9c22-7e3b998f5bf7","year":2015},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.571656Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:d182a8f0e1a73ade55df0eb988e2a7b5b1e5eee9dbea329c3ada1ddf56cae17f","observation_id":"b1459b27-e4e2-42c6-b423-9cb6920a87af","resolution":{"observed_at":"2026-08-07T11:04:15.071381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.049926Z","title":"Duality and solutions for quadratic programming over single non- homogeneous quadratic constraint,","venue":null,"work_id":"b0c77bbe-21e4-46d0-97a2-4a2e5084ad23","year":2012},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.576047Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:882c0b8e1333431f3f2d865363c53aca475f42cdbb5976272023109f11b4f5a9","observation_id":"89eb5f59-2732-4c55-ac61-547e481d60a7","resolution":{"observed_at":"2026-08-07T11:04:15.054841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.034310Z","title":"Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint,","venue":null,"work_id":"76f4e19b-85dd-4e8b-946d-cc3f29281df8","year":2019},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.582585Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:fc89455a0c1e19920708c4c31b9d68c8ebda17a065753d97cd1fa2a422e24290","observation_id":"0ce931dc-1ad1-4f05-868d-8f824619700d","resolution":{"observed_at":"2026-08-07T11:04:15.039115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:15.013651Z","title":"On local non-global minimizers of quadratic optimization problem with a single quadratic constraint,","venue":null,"work_id":"d0d0307f-5a28-4e28-85c2-32c99c219b97","year":2020},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.588181Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:a8810aad548cb67030960ef91eba32c8b3fa2300aa43c27cc62bf615b6047316","observation_id":"f946840e-59a2-4e2a-8bc6-e68a830e8883","resolution":{"observed_at":"2026-08-07T11:04:15.019374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.992069Z","title":"On local minimizers of nonconvex homogeneous quadratically constrained quadratic optimization with at most two constraints,","venue":null,"work_id":"aa926e52-d63f-425e-872e-f712d63ce00d","year":2023},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.592229Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:05eb9877f188717b90f8923457c96f7549ef26e1c34814f25d1ac9db50fa5c08","observation_id":"85c0c1c9-15a8-4414-bc68-371007d6fe6d","resolution":{"observed_at":"2026-08-07T11:04:14.997715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.597420Z","title":"Nocedal and S","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.597420Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:a9ec5543dd5f9d3bfd3b6c0f99d7c15389a366974402757eb758f818393e5e37","observation_id":"1cd0fa15-02a5-411b-83e9-f06ab7fa62e4","resolution":{"observed_at":"2026-08-07T11:04:14.597420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.965165Z","title":null,"venue":null,"work_id":"4c6fbbb5-a740-4138-99ea-c4424533990c","year":1998},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.601869Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:9c4d9cb2e629ac2649303fd58aadee72aa4e0f9920dffab468f4c07bfc454ce3","observation_id":"1fde5efe-b6b2-4d15-9208-29c9e95f5061","resolution":{"observed_at":"2026-08-07T11:04:14.970867Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.945733Z","title":"An algorithm for general- ized matrix eigenvalue problems,","venue":null,"work_id":"8e7fee70-888e-44e9-933f-4164e5031385","year":1973},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.606501Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:2c25913f7428dde7001ee114277231a298d612c18269483454b652cdc9b258d0","observation_id":"45d5516d-6e3e-430d-acbb-c7e702910df2","resolution":{"observed_at":"2026-08-07T11:04:14.952017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.929724Z","title":"Mean-reverting portfolio with budget constraint,","venue":null,"work_id":"9c2d5e5f-c25a-4bb0-92fa-cf1f7a82cd33","year":2018},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.611239Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:393922d6a08b8ac7ac18121d11875a4ca15d8a28c827d9c2efd7ff37cbfec6c9","observation_id":"38a0bee2-9d3f-459f-8ac0-9fa8b3899d70","resolution":{"observed_at":"2026-08-07T11:04:14.936323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.911972Z","title":"Alternating minimization algorithms for hybrid precoding in millimeter wave MIMO systems,","venue":null,"work_id":"53c1083b-d098-4c46-a34d-e366e2482d92","year":2016},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.616359Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:24cd5ebd96d45a06b30f1a2a9bcda9c84ac4f7cb65fd5fda2b26331af15c1e42","observation_id":"3dbee420-7a1d-43c5-bc8b-977657dc242c","resolution":{"observed_at":"2026-08-07T11:04:14.916806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.889677Z","title":"Joint target and transmitter localization with aoa and dtd using passive sensors,","venue":null,"work_id":"fc9d831b-fbcc-4cf7-a001-8aff74add94c","year":2024},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.621531Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:47389ef8fdd1cf3d2bac4121730320d20140c35051f505483d014a16a959f0cc","observation_id":"39a90ccf-3697-40ac-8b68-5d7225b2d0f4","resolution":{"observed_at":"2026-08-07T11:04:14.897958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.869162Z","title":"Absil, R","venue":null,"work_id":"37a20bad-60e2-4e1c-80d1-ce14cf64d775","year":2009},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.626313Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:70620faf96a19cf74adcbcf83b1d1b5f06857ea51bdd63f2902dfc765b79df76","observation_id":"8e37c9b1-f9f7-4e26-9bd2-5381861fa9a6","resolution":{"observed_at":"2026-08-07T11:04:14.877211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.633002Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.633002Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:8c42bee6f281b1e0582f576c93f5085c48786b573f0ac82b79815dc60f5da6d5","observation_id":"ccab9a84-e331-4cbd-be4c-e2df0f0ac6f3","resolution":{"observed_at":"2026-08-07T11:04:14.633002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:04:14.699812Z","title":"Diag (d1)0 0Diag (d 2) # ST A,3· ST A,2ST A,1 =TΛ 0TT A1 =S A,1","venue":null,"work_id":"5a9d990f-e457-4a14-ae2e-b95d9b56c570","year":2009},"citing_paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:14.638305Z"},"links":{"citing_paper":"/paper/2506.03692"},"observation_digest":"sha256:ab4bd03186170c2b3f6cfc7b41a27b82995587034f0c01492690a7af01b5a6c4","observation_id":"219355c5-06b0-497c-b8c5-b083070a1caf","resolution":{"observed_at":"2026-08-07T11:04:14.706509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03692","last_updated":"2025-06-04T08:26:06Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T10:55:04.500628Z","submitted_at":"2025-06-04T08:26:06Z","title":"An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":45},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2506.03692."}