{"as_of":"2026-08-15T16:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2768d9dfa9858c9a6b9c207d46451a452bf172e7ced58342197342d4105ea9c1","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-15T06:32:42.880941+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-09T21:46:18.932110Z","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:3c9a4b66252732daf32880e22556de0b7ffda01b362da58d975886d855ef475e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:422f7e84ca4ce8373eebd44be4899d6f8c6fc3a602c0464d6bc6152a06918196","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:357850ffd4a9c35df76546c77820c7c0d636076f6b5e4ae93d8ff87d7e300c33","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:934c8051fdd56468a1ac6e279eb2909b27c5d93d460519d018c81ccfc6d96902","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:5187be90305321f76974071334f060ecb6cb1456b220bad8e1caa71adedc2f89","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:67d1a0d12b85b3761c83b11d3db15b688d6d00b87224bcff87809ab070192046","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:48a17b3116f72acf618a561ab1538c477663668154497bbce1d6b602328d6370","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:8d5f8db694ed9e80f98581dba7c88cdd4d932e621ae6c374f8f2f2a2e600f2a4","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:46e5c76d5133cf0a6e9a22cf6ab9d512f0f821a62ea7f3293043b157103e19e2","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:2f63eb41c775ba1fb0394982053821a527f2661d5bba2ea46000cbae16d5e175","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:35c7cd21b818e96b3d93d52de8143e6bb43f05e97d129e70f9abc624cf1196cc","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-08-14T21:10:28.204503Z","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-09T21:46:18.932110Z","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:7a2f20992eaefa1f511efe63232d7fc2addf63fa4cd69a897f2100dbf6e9be9b","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-09T21:46:18.932110Z","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:7a08179a6699b2e2cb303c719dab4e6b5e27bb405a7e068943be84d900485222","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-09T21:46:18.932110Z","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:e8167d31117d2275957c77e1510cc07c5f76c5777226d576a4172aa9a62a13e5","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:c9dd3937c22d6b81c5f833d2eed9b47ad3aedde015199ec18252319fc5bc2d13","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:e5e3f95be437a2a582b95a6f92abe6c5b05c4d2a50fd28037bd58cb2f75b5eee","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:48bdf394fbbeaccd0b6e2f1e56192149f1e3585cfb40c4e60d1866e59e3d114a","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:db78b7fbc70b339ba8a721b7ac31321a6592495f450d95b28b2c5788cbc586b0","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:c3bdb46c7afa9adfb3fd52ef9f3f3b08183405682e38400d31690ee44927344e","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:54d45e9928a59da2369902efa5f77d881d31ea4ef15d036ec41003fea097722f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:45376d0efab75e6a2bf2cf5e36d77fef8da2375c5cf895bc7f7d29a8488bab89","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:6411bb6c704ce2f8bb5754649b02d44a0a8711e75b5ad2ac7d76aa8b3a51147d","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:49534a365aec83c009e29edebbd7d7a5632c39308ec63d674c5454963e9f35cc","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:649ed832439969707886d42c4801882f8164d6089e4ee7677201148a8b117902","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:8ab95afbef141b5b841cfc1161253c7422892997191304effe5dbe12ef8bcb99","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:eefab45a54ee59d4efcbd831f138ab5b3f73a63100fba8434a81a3cdc20278cf","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:fa958eb7e7ceae25971654ece5d887b9be7867ec6febfadae050d5f1a1d597e6","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:616bcde28d2ae80098d57d14c418b5d4077dcb8540b631a8b2db59d50f2f1a1b","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:1b4e65348dc255fc513aa6763ed29fb72175d4f0acb33b65962e199aa6fc2868","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:f22c15647e48e5499a086af9a188dbd340cd8f20502cfab48e6e6f564f91ac17","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-09T21:46:18.932110Z","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:e131e40871bfb904927aab091f110d713fc064a0be6ab8c59ef24e4b8c196e2c","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:0605dcbfafbb18d0ad6cca317f1dc8f92111ee7141354d84c947092bb4ebfe04","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:e101e00bfad4ba51acd41f96f043041ad89647b2484c5fdf8c1d983071ed9167","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:080309adb3ae4b6017a7fc76ea9b4afc6dac5677720d21e4da895b2e9a959610","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:eb6fd93617b146cd13513e40bd9139f2820b3dd86fcd6cf720982f287c897239","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:5f3b6708911609ef0e891724e1dc6f5a18da60923b39678f4ab628052ae6516b","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:b678f83aba1aa8862d63c293c5d7c1371e868b2547dd05bee0d6cbf3bf5d0645","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-09T21:46:18.932110Z","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:c0958d5c34a900efd72d4099a9a207d2e25a8d807b3d0e75c2ea70c0ea4b3192","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:fd788f019e5e38948e9c24fe30172349d008ee6c1fcb6ced6ce5e80438ae84ff","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:34f10d0bf3c91b2bda5cf4ee3866669467d0e0bfa138f236efb19fdd1ef106cb","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:5eee52b6e086158562c1840c53dd3fe7915520479c2f87210d95aa6998977320","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:e82791f92bdef6b4d0b7cf411c416c4d00034e2eb2409bffc44fbdf3a404ffa7","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:2ccf961612a25f426e59e447ee2a79b13c6bcfd2de4ffc97a1b973fc0464109a","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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:1d047e55e579d788de52665b31f872247daa2af044ffc1b5f63f12b67795c845","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-09T21:46:18.932110Z","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:c73ded242f6cb45802ee1a5774a9b56d8e38960a1d1843c0a854397e5f3b9dce","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-09T21:46:18.932110Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2506.03692."}