{"as_of":"2026-08-14T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a99613b0e8126a6318f1df12aacb7b43ef26d0c085c33251724d9b4512d1bb4f","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:30:59.622918Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2608.09159/citation-record","integrity":"/paper/2608.09159/integrity","json":"/paper/2608.09159/citation-record.json","paper":"/paper/2608.09159"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02614432","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"Haeberly, and Michael L","venue":"Mathematical Programming","work_id":"e9c02fac-133e-4122-ab66-b3ec4b13d02b","year":1997},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.375564Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:672166b944d837a4656436d314f86d93796d92f45c79ccf98c8f440c09f31f32","observation_id":"62cac50b-4186-4f7e-b023-84df5f683586","resolution":{"observed_at":"2026-08-11T22:31:00.254750Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:57.414879Z","title":"Practical large-scale linear programming using primal-dual hybrid gradient.Advances in Neural Information Processing Systems, 34:20243–20257, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.414879Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:5416e75d40267abcec067e820d9eb9bb4aa477692abcf4e18c8292daf6613c0f","observation_id":"47464cf3-aa35-466d-a491-2494c8bdbe1d","resolution":{"observed_at":"2026-08-11T22:30:57.414879Z","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":"10.1007/s101079900086","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:31:00.096866Z","title":"Bauschke, Jonathan M","venue":null,"work_id":"acaa4eee-9a1b-4995-9bc6-3db313ca35db","year":1999},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.475236Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:3c1fb16f70ab42f73195e98b5e02f1afc9012af9ef5f5b87a7f192a481c7ec86","observation_id":"1007cb98-bb83-430f-91ad-8b467e59300b","resolution":{"observed_at":"2026-08-11T22:31:00.135106Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.483128Z","title":"A scaled gradient projection method for constrained image deblurring.Inverse Problems, 25(1):015002, 2009","venue":null,"work_id":"aa65bc63-baf7-4559-9c92-1c828b59b77a","year":2009},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.515053Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:c0af36617b18a4d6c0271f403a9a4a17890b78d3a34a0e355bb04d2c0523cf98","observation_id":"9c42d6e0-3c9f-4415-a8f8-53a618fbd29a","resolution":{"observed_at":"2026-08-11T22:31:06.507225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.417851Z","title":"A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40:120–145, 2011","venue":null,"work_id":"a7da71fd-658b-4e62-bad4-91341dec5baa","year":2011},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.575345Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:d0bf2a75d31b1ebfbaec6400a15d424c1ba605ecc3c35cb6e505ec9da4ba26be","observation_id":"f512dbc5-2927-4323-8822-286eb4cbeb9d","resolution":{"observed_at":"2026-08-11T22:31:06.453475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.321735Z","title":"On the ergodic convergence rates of a first-order primal-dual algorithm","venue":null,"work_id":"31b3881b-8378-4b3c-bef0-bfd65ac4c3f0","year":2016},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.624739Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:f3b86d7770d8239b765ae1c017a4b3de980fc7a665a9e62e5388b7613b00550d","observation_id":"7441d762-2d05-48bf-92d7-6eaab5da34a2","resolution":{"observed_at":"2026-08-11T22:31:06.364746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.214968Z","title":"LIBSVM: a library for support vector machines.ACM Transactions on Intelligent Systems and Technology (TIST), 2(3):1–27, 2011","venue":null,"work_id":"78e60ad3-9c9f-430b-b7ce-70bd24c4901c","year":2011},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.674739Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:354c87d8581d5755ff42da98bf6a9fc6ebf6e383afd4a4c3fdee667795a9bb26","observation_id":"b1e084f0-0570-4316-8ecc-264d30e36e17","resolution":{"observed_at":"2026-08-11T22:31:06.264746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.29197","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:31:03.334879Z","title":"Chari and Behçet Açıkme¸ se","venue":null,"work_id":"1bab92f4-308b-4639-954b-2c4aad5d2861","year":2026},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.713067Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:b34c9b0069fe427e725f6a0d824c6afc74bb671226a8dedb24ed3cf899993924","observation_id":"05003818-f112-46eb-927f-fd8379ba8a2b","resolution":{"observed_at":"2026-08-11T22:31:03.393204Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.02470","last_updated":"2025-07-03T09:28:29Z","snapshot_observed_at":"2026-08-09T21:22:25.054784Z","submitted_at":"2025-07-03T09:28:29Z","title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.02470","snapshot_observed_at":"2026-08-11T22:30:57.755226Z","title":"Hpr-qp: A dual halpern peaceman-rachford method for solving large-scale convex composite quadratic programming.arXiv preprint arXiv:2507.02470, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.755226Z"},"links":{"cited_paper":"/paper/2507.02470","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:9bba1cd63a0e63a02a2c22193190fc094ad402a3b27285bc56068e386b61e44a","observation_id":"1fa4ac21-c0a3-4182-a534-f6a9e2f6e24a","resolution":{"observed_at":"2026-08-11T22:30:57.755226Z","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-11T22:30:57.805341Z","title":"CuClarabel: GPU acceleration for a conic optimization solver.arXiv preprint arXiv:2412.19027, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.805341Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:28e01ceac0153a322ab4423ad11f44d3dafc451f4ca2132b3705ce589f542b23","observation_id":"eacdb3d3-9495-46e7-b2a1-e33fb3d3081b","resolution":{"observed_at":"2026-08-11T22:30:57.805341Z","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":"10.1007/s10107-006-0072-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:30:59.974808Z","title":"Invariance and efficiency of convex representations.Mathematical Programming, 111(1–2):113–140, 2008","venue":null,"work_id":"746fa22f-b73c-4fca-aba1-05ccb0e16d42","year":2008},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.844845Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:6b3298fe0f622c9efe91f0cad40f02201ca93176e5b596e3a84a07e2bf9522f7","observation_id":"c88e7680-b84b-4829-acfa-32e35dba68cb","resolution":{"observed_at":"2026-08-11T22:31:00.024824Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.111955Z","title":"Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming.Numerische Mathematik, 100(1):21–47, 2005","venue":null,"work_id":"1bc60525-0753-499d-a738-20476a29386b","year":2005},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.895652Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:63d327ff4501a7b1f69fd4fb0584cbe73395269cd695c18478f3681f45e7afb4","observation_id":"1e1e67d1-d2b5-4490-bdfc-7c3d5ede9381","resolution":{"observed_at":"2026-08-11T22:31:06.135031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:06.086365Z","title":"The university of florida sparse matrix collection.ACM Transactions on Mathematical Software (TOMS), 38(1):1–25, 2011","venue":null,"work_id":"84934817-6bad-401c-b410-9fe8543d39dc","year":2011},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.946251Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:90ff254399c31caecccacdd32dc352f303c40a2c726ee8e40437cc43451633d8","observation_id":"1b857730-1c98-4b06-83cf-fd88dfbb5f93","resolution":{"observed_at":"2026-08-11T22:31:06.092801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.972518Z","title":"An enhanced alternating direction method of multipliers-based interior point method for linear and conic optimization.INFORMS Journal on Computing, 37(2):338–359, 2025","venue":null,"work_id":"55adec71-a908-479e-8d66-5bda94e66d5b","year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:57.984839Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:ebb0bf65891bc92f1b4ceda2285a35f15b276e62bff206a028ea700da0a543cb","observation_id":"8b51a4e3-0bf0-4839-b5f1-7c4a9f5f9f4c","resolution":{"observed_at":"2026-08-11T22:31:05.994807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.953048Z","title":"A strict complementarity approach to error bound and sensitivity of solution of conic programs.Optimization Letters, 17(7):1551–1574, 2023","venue":null,"work_id":"b278e521-b58a-4724-bc76-bd93fccd2785","year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.044820Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:73f46ac68bb25046235a762b7f6dbf3ba3984a74044c4ffde2325c46a4e62c37","observation_id":"f2a43090-a2da-4769-ac89-d5e730492e19","resolution":{"observed_at":"2026-08-11T22:31:05.958869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:58.094739Z","title":"Consensus of subjective probabilities: The pari-mutuel method.The Annals of Mathematical Statistics, 30(1):165–168, 1959","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.094739Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:a326a87006987fbfff3ebf2853420803c9c39c864cc5d10f126cc82d288e968b","observation_id":"0220961a-7e70-46da-bcb4-7112c3a53ab6","resolution":{"observed_at":"2026-08-11T22:30:58.094739Z","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-11T22:31:05.881611Z","title":"Oxford Mathematical Monographs","venue":null,"work_id":"eb0f8da3-2da6-4913-89fe-7571a5e98588","year":1994},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.155023Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:c9b3c4b2755042a88195cb74c3518384617e695d001a40615ef9d3fb924a11cb","observation_id":"e6ee6151-3945-43bc-8711-422ef83381d9","resolution":{"observed_at":"2026-08-11T22:31:05.907300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.03041","last_updated":"2023-04-24T10:04:54Z","snapshot_observed_at":"2026-08-14T04:49:46.635596Z","submitted_at":"2022-06-07T06:32:28Z","title":"Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.03041","snapshot_observed_at":"2026-08-11T22:30:58.214736Z","title":"Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.214736Z"},"links":{"cited_paper":"/paper/2206.03041","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:8288c843192a7e5b01a939a1d7b6c82569e203142b92d3eed2ef72614106549b","observation_id":"e7741bb2-a422-4e7f-bb8d-ea79b1d45266","resolution":{"observed_at":"2026-08-11T22:30:58.214736Z","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-11T22:31:05.851838Z","title":"QPLIB: a library of quadratic programming instances","venue":null,"work_id":"640a0ecb-c0d2-490f-91ab-fe37af01f8c7","year":2019},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.264766Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:6ca069b08cb95f08009221932806b76446ec8c20d0ef3770b0c72b9705ffddf6","observation_id":"3b3f318a-79cc-4383-bca8-4d9bcf83657c","resolution":{"observed_at":"2026-08-11T22:31:05.859130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.2344","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:31:02.433164Z","title":"Infinite-dimensional fisher markets and tractable fair division.Operations Research, 71(2):688–707, 2023","venue":null,"work_id":"7cc6431a-dbd4-4167-befb-85a4323ddcb2","year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.324734Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:521310bd4cbf57f14374a00b38e1d639c2054a24f1aeac44e2613796bb0d6907","observation_id":"8629b91a-51d7-43d4-83df-780938585a78","resolution":{"observed_at":"2026-08-11T22:31:02.534745Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:58.345196Z","title":"Cardinal optimizer (copt) user guide.arXiv preprint arXiv:2208.14314, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.345196Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:0396b3b68f314f9b4f923ba1ca5f57428ef0d13e21d33566f66ff703ce143c61","observation_id":"5ed05cf9-b91b-40dc-ab82-046f44316b70","resolution":{"observed_at":"2026-08-11T22:30:58.345196Z","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-11T22:31:05.801446Z","title":"Goldman and Albert W","venue":null,"work_id":"01250465-6e6c-4f80-bafc-b617427b8c62","year":1956},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.394823Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:6bd758777ab5354e7b1c0474b240a9ef786bd12405aca21ed11937b2b24dd881","observation_id":"cb9e1e67-0f71-42d5-874d-a22f6a4eaa89","resolution":{"observed_at":"2026-08-11T22:31:05.835802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12762","last_updated":"2024-05-21T13:15:19Z","snapshot_observed_at":"2026-08-13T00:02:59.948350Z","submitted_at":"2024-05-21T13:15:19Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-11T22:30:58.454803Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.454803Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:5072f413f5c72d05739fdf1eb20f671e9e75d854a3ada829c8e3714a5f10b584","observation_id":"a958cbe6-8ec8-4091-953b-6f4c74799b09","resolution":{"observed_at":"2026-08-11T22:30:58.454803Z","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-11T22:31:05.761090Z","title":"https://www.gurobi.com","venue":null,"work_id":"54237054-fd66-4c47-8fc1-961e9a936752","year":2024},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.504747Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:87d218373febff6b94d895ad2a032cf1bbefb580536cc61a1b062afa48256742","observation_id":"0b5c30e4-deee-471e-b6b8-b653cafd0dad","resolution":{"observed_at":"2026-08-11T22:31:05.778033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.703885Z","title":"A restarted primal-dual hybrid conjugate gradient method for large-scale quadratic programming.INFORMS Journal on Computing, 2025","venue":null,"work_id":"751e9669-f6fc-4739-a9fd-f2a5f8b41c2f","year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.564856Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:de5a0d78ea309ef31345fc40fb56edadce622e3d94321d7d828413999feb4825","observation_id":"32804f97-dd4a-4c23-bdb3-ecc0742148c2","resolution":{"observed_at":"2026-08-11T22:31:05.718103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"cited_work":{"arxiv_id":"2607.08035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.08035","snapshot_observed_at":"2026-08-11T22:31:01.765227Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","venue":"math.OC","work_id":"58a54b25-e316-4d8d-9a2f-9869ece97114","year":2026},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.614810Z"},"links":{"cited_paper":"/paper/2607.08035","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:a7db451923e867e31febd922ad81fa4ea701b69861c6f0adb9475dee14ecbe0c","observation_id":"e1e1952d-c15c-4613-adf7-9c23fd996471","resolution":{"observed_at":"2026-08-11T22:31:01.815215Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20142","last_updated":"2026-05-16T13:28:55Z","snapshot_observed_at":"2026-08-06T23:54:41.467488Z","submitted_at":"2025-03-26T01:16:42Z","title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.20142","snapshot_observed_at":"2026-08-11T22:30:58.655270Z","title":"Local linear convergence of the alternating direction method of multipliers for semidefinite programming under strict complementarity.arXiv preprint arXiv:2503.20142, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.655270Z"},"links":{"cited_paper":"/paper/2503.20142","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:d4cd8bd2b2650961af8787960df927cdf9d7c49667dbf54b720636f48418a38d","observation_id":"6a7dc0e7-df27-470e-9b66-6efe8f9ec320","resolution":{"observed_at":"2026-08-11T22:30:58.655270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07628","last_updated":"2026-05-08T11:07:18Z","snapshot_observed_at":"2026-08-12T15:53:56.575104Z","submitted_at":"2026-01-12T15:09:35Z","title":"D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07628","snapshot_observed_at":"2026-08-11T22:30:58.706219Z","title":"D-PDLP: Scaling PDLP to distributed multi-GPU systems.arXiv preprint arXiv:2601.07628, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.706219Z"},"links":{"cited_paper":"/paper/2601.07628","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:e2bb349bb0d9ded822e2bfeebb4890b1ee114901a6de50dd3c80a196d756dc18","observation_id":"d40de3da-296b-4eb3-997a-ae301658a2b9","resolution":{"observed_at":"2026-08-11T22:30:58.706219Z","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-11T22:31:05.649412Z","title":"An ADMM-based interior-point method for large-scale linear programming.Optimization Methods and Software, 36(2-3):389–424, 2021","venue":null,"work_id":"3e6f78ce-741b-4b5f-a5ef-34d0c72fdfd5","year":2021},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.744978Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:18b8c4908389c879ed9b74f836e80f902692f81af1b5c20b329d2d191e788064","observation_id":"fab2331b-b9e4-44b3-838d-7e99fa8e390c","resolution":{"observed_at":"2026-08-11T22:31:05.664687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:58.788249Z","title":"A practical GPU-enhanced matrix-free primal-dual method for large-scale conic programs.arXiv preprint arXiv:2505.00311, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.788249Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:b75ab988bf13c7645ec557a7d6cd6f2b04e567393a95cf5daf793e24aa4bd0a0","observation_id":"b5c5f4e7-bdcf-4aba-97f9-65b2dcc3abaa","resolution":{"observed_at":"2026-08-11T22:30:58.788249Z","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-11T22:30:58.814940Z","title":"Lindstrom, Bruno F","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.814940Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:2610ec69318a812ce63e6c95e8a1a457021a9d9d94a3c705e3551d18c58acf75","observation_id":"b5e2a0f3-e13c-4a91-a195-4062a9f56dbd","resolution":{"observed_at":"2026-08-11T22:30:58.814940Z","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":"2606.16552","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:31:01.277028Z","title":"Restarted reflected halpern acceleration for augmented primal- dual methods.arXiv preprint arXiv:2606.16552, 2026","venue":null,"work_id":"2a5ec5e2-eea0-4288-8a0d-dba260317337","year":2026},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.840729Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:59e134deeba3a4b8826e36f65c229db83a1550cb3df34d5bf501a0f2f7b76e5c","observation_id":"5ae27186-6ab0-4acf-913f-c14dcca14b8c","resolution":{"observed_at":"2026-08-11T22:31:01.300015Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11228-018-0494-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:30:59.764822Z","title":"Computation of graphical derivatives of normal cone maps to a class of conic constraint sets.Set-Valued and Variational Analysis, 27(3):783–806, 2019","venue":null,"work_id":"92d7be8f-08f8-4f95-bd2f-20305bc23a27","year":2019},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.847810Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:35ee9ecdf6479ea4926dc4fa315d7137e35c6bcf14a22b4c4030de8558d153f1","observation_id":"1fb7812b-be8e-41a6-a86a-4b029228b1aa","resolution":{"observed_at":"2026-08-11T22:30:59.795919Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.608530Z","title":"Applications of second-order cone programming.Linear Algebra and its Applications, 284(1-3):193–228, 1998","venue":null,"work_id":"29845118-5948-4748-a9fe-71e9ab7eecc5","year":1998},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.881158Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:3ece9fc79efd3247bc4a5f587de8f1956e97da503e4479b13381c280283182c9","observation_id":"55cb64d7-0fb8-4174-8569-bdab375ab4eb","resolution":{"observed_at":"2026-08-11T22:31:05.621751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12180","last_updated":"2024-06-07T16:51:52Z","snapshot_observed_at":"2026-08-13T22:15:18.275057Z","submitted_at":"2023-11-20T20:50:49Z","title":"cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Julia","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12180","snapshot_observed_at":"2026-08-11T22:30:58.898931Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.898931Z"},"links":{"cited_paper":"/paper/2311.12180","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:d449ff8634e7d18131e6a9b7c314a04be7b1927376fb0444961e3e7bc49b27c5","observation_id":"28f5ee09-80f2-4985-9a9f-3fa3c50c8a79","resolution":{"observed_at":"2026-08-11T22:30:58.898931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07710","last_updated":"2025-07-14T18:29:02Z","snapshot_observed_at":"2026-08-13T05:26:06.860222Z","submitted_at":"2023-11-13T19:50:03Z","title":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-08-11T22:30:58.934961Z","title":"A practical and optimal first-order method for large-scale convex quadratic programming.arXiv preprint arXiv:2311.07710, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.934961Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:c063476e98c9099f214c409d72158501a55905949d984b3d15a7fa76f4116758","observation_id":"c7453bd6-cee2-4290-ba97-e363bae5fd2f","resolution":{"observed_at":"2026-08-11T22:30:58.934961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16144","last_updated":"2024-09-09T21:15:27Z","snapshot_observed_at":"2026-08-12T23:16:48.405946Z","submitted_at":"2024-07-23T03:06:56Z","title":"Restarted Halpern PDHG for Linear Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16144","snapshot_observed_at":"2026-08-11T22:30:58.974751Z","title":"Restarted halpern pdhg for linear programming.arXiv preprint arXiv:2407.16144, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.974751Z"},"links":{"cited_paper":"/paper/2407.16144","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:fff975009a560bcec6faba68e57df56d419a51486bf2a9a5ca0205d668e20e1a","observation_id":"fbe0132d-620c-41a7-9d79-36d24d28e175","resolution":{"observed_at":"2026-08-11T22:30:58.974751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14832","last_updated":"2024-01-07T06:52:56Z","snapshot_observed_at":"2026-08-13T04:55:07.778551Z","submitted_at":"2023-12-22T17:07:50Z","title":"cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14832","snapshot_observed_at":"2026-08-11T22:30:58.987296Z","title":"cuPDLP-C: A strengthened implementation of cuPDLP for linear programming by c language","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.987296Z"},"links":{"cited_paper":"/paper/2312.14832","citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:0e2cc62254be9f9e1c9a0159ab2b2fa0a4bee515ad153c3af6bb588c111e0713","observation_id":"19ae9951-d8e2-4053-be4e-b9a069fe04e4","resolution":{"observed_at":"2026-08-11T22:30:58.987296Z","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-11T22:30:58.993696Z","title":"cupdlpx: A further enhanced gpu-based first-order solver for linear programming.arXiv preprint arXiv:2507.14051, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:58.993696Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:b3bfc73e865b1eedc575f8077bc17eb2683bc169ae05e09f7f999e0bc586f61a","observation_id":"27eb0a0d-af14-4f69-a0a4-5daa982d11b8","resolution":{"observed_at":"2026-08-11T22:30:58.993696Z","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-11T22:30:59.017626Z","title":"Portfolio selection*.The Journal of Finance, 7(1):77–91, 1952","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.017626Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:8fefd3024bb7ca7387fcd5169ef1a359e56289048e41b0635821845ed8820dac","observation_id":"12efe88e-928f-4bd2-a3a7-558e4233d6bf","resolution":{"observed_at":"2026-08-11T22:30:59.017626Z","resolver_source":null,"status":"malformed_identifier"},"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-11T22:31:05.545350Z","title":"A repository of convex quadratic programming problems.Optimization Methods and Software, 11(1-4):671–681, 1999","venue":null,"work_id":"6f8a33f9-3854-4e0b-9ddb-0ed1599c3374","year":1999},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.025026Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:54b9599d76dcd02ae94220906eb1dddcf3786f47cc0495d90508276c297d8a0e","observation_id":"ab7a5564-e051-4728-b550-45c5ff07d756","resolution":{"observed_at":"2026-08-11T22:31:05.555651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.394732Z","title":"Mayne, James B","venue":null,"work_id":"1008c49c-2d1c-43e9-81bc-40d3fb5032ea","year":2000},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.048037Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:992c7788ae6f50b0110c0a3148a137bf9445a6b155dd824f4974fad8202c1d0e","observation_id":"22c71037-2afb-44ff-8135-cc2971d33620","resolution":{"observed_at":"2026-08-11T22:31:05.414888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.230390Z","title":"Decision tree for optimization software","venue":null,"work_id":"fbd9a587-a4b0-4cf3-b3f9-108de89d6b81","year":2021},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.085183Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:7448d0d5a22872557bc2efcfc7ab4820c34502f280e270d6b5b56927b2f08b8b","observation_id":"11ce36d1-24ef-431b-b324-cafa6352ee22","resolution":{"observed_at":"2026-08-11T22:31:05.284689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:05.094750Z","title":"Benchmark of second-order cone programming solvers","venue":null,"work_id":"1f6713f7-e01a-4cb3-9575-7859124f7331","year":2024},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.124891Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:0f6a08e1a6a784d37f657fd313b2050c3ad837f29887c27971409632e3226fbc","observation_id":"3209820b-9cf7-4d6e-a23e-3364eb8d24c2","resolution":{"observed_at":"2026-08-11T22:31:05.134749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:04.944916Z","title":"https://docs.mosek.com","venue":null,"work_id":"0d11e166-ade3-43b8-b602-5f4781d15c41","year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.164825Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:a3e3653370629e51d13737e003dcd968a1b220f63a516c738bcee13df1351d57","observation_id":"b6059c9e-087c-4426-94f4-214119ec3856","resolution":{"observed_at":"2026-08-11T22:31:04.994747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:04.791654Z","title":"https://github.com/ NVIDIA/cuopt","venue":null,"work_id":"83743337-88b9-4915-a99c-d8bc81bc6d46","year":2025},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.200052Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:01177b5b13978cdbed778334c784b064c014af1804cf103e4968652d0997ea91","observation_id":"585884a0-3090-446b-944b-0b62ae92c9ea","resolution":{"observed_at":"2026-08-11T22:31:04.826731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:59.213309Z","title":"SCS: Splitting conic solver, version 3.2.4","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.213309Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:8a3b5b61cc0d1721ec23516587b5d15d363bfaf14b01db76d799e90b1acee638","observation_id":"eaee8b53-4299-4b84-bb2a-0df5295c5c35","resolution":{"observed_at":"2026-08-11T22:30:59.213309Z","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-11T22:31:04.604868Z","title":"Conic optimization via operator splitting and homogeneous self-dual embedding.Journal of Optimization Theory and Applications, 169:1042–1068, 2016","venue":null,"work_id":"0e246ef5-cf95-48cc-92dd-728c8ce29f89","year":2016},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.254919Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:4d3dbcbf54d20d167b89358b40257407e37c76a487348e39b98e067ab6a4e258","observation_id":"f21e0c01-6f78-4f24-ba6c-d86d8247218e","resolution":{"observed_at":"2026-08-11T22:31:04.643071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:04.479474Z","title":"Diagonal preconditioning for first order primal-dual algorithms in convex optimization","venue":null,"work_id":"1d778504-f871-4b70-ae29-0e7d8e38c4e4","year":2011},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.306834Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:b8c769e717bf13f4ddd67451d645323377daef65d7560dffbd2a0933e9591e36","observation_id":"1f550627-ff1f-4f0a-8143-a6aafcd2f121","resolution":{"observed_at":"2026-08-11T22:31:04.512735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:04.335838Z","title":"Robinson","venue":null,"work_id":"6498bd9d-a61a-4742-9a01-82a826ed100d","year":1981},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.344889Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:42633be444b120e2774827ebb597a404e556f8a9c8a5604c0240f63159419d9d","observation_id":"6bca7730-1052-44cf-82c6-e63fc064d627","resolution":{"observed_at":"2026-08-11T22:31:04.377995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:30:59.377373Z","title":"A scaling algorithm to equilibrate both rows and columns norms in matrices","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.377373Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:77e2c0523697fc4d80acf4b69a4656acdb1afc4fb5e9c5cfc9d59a018f111a0d","observation_id":"e554d18a-d72a-4445-851c-6093258133e8","resolution":{"observed_at":"2026-08-11T22:30:59.377373Z","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-11T22:31:04.178628Z","title":"Osqp: An operator splitting solver for quadratic programs.Mathematical Programming Computation, 12(4):637–672, 2020","venue":null,"work_id":"e3d65161-94dc-41b5-aa51-19e40519ab49","year":2020},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.424022Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:eae858492b84807753c584f9aa667bfad53bd76a3825a38e785a1fe4e76dce9d","observation_id":"6f211ad6-22ec-4ef1-978c-1c0fdb9d94f2","resolution":{"observed_at":"2026-08-11T22:31:04.196239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:04.107981Z","title":"Regression shrinkage and selection via the lasso.Journal of the Royal Statistical Society: Series B (Methodological), 58(1):267–288, 1996","venue":null,"work_id":"7d59543f-bd60-418a-a357-1843a411a38e","year":1996},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.447867Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:e15f2db108badd6df8b35388bf198c762e120becb4337b8c032727003f2b77f4","observation_id":"a4a011fe-8c42-4066-a3ad-b446a9bd4496","resolution":{"observed_at":"2026-08-11T22:31:04.129659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:03.995641Z","title":"The second directional derivative off along this segment is ⟨d, Qd⟩, and hence ⟨d, Qd⟩= 0","venue":null,"work_id":"0b412b05-abe0-4d17-8e61-9307d2122ef1","year":null},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.494744Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:b3d5d5a028f96067ebe8050a66207a229abc0c947e7b1f7951fcfa9c2e1eb1b4","observation_id":"759fb0d3-e0d6-4158-8909-6de166254d2a","resolution":{"observed_at":"2026-08-11T22:31:04.034731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:03.854891Z","title":"Letd=x ⋆ 2 −x ⋆","venue":null,"work_id":"a55b2e9a-efc6-47be-a2f2-3069b60c2604","year":null},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.535920Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:5069da5f18580159b561d2303e73f63b28fe2f9dfc34585b7f4359c4475f2a37","observation_id":"fd23bc55-9752-4ac8-870e-7d867018a100","resolution":{"observed_at":"2026-08-11T22:31:03.894826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:03.764750Z","title":null,"venue":null,"work_id":"5044a6e8-634c-4be9-a3de-d9a8c65e406d","year":null},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.554748Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:3b384c35cf0a86eb4944db3c42240c9313cd0ab48d1c70d696c5d340c502611e","observation_id":"ce074c71-7276-4f6a-8b87-ce4737538c1d","resolution":{"observed_at":"2026-08-11T22:31:03.784524Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:03.629231Z","title":"Together with complementarity at x⋆ 1, this proves complementarity at x⋆","venue":null,"work_id":"74fe3c92-7146-46dd-93bc-40bc276cb861","year":null},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.584742Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:4c5701d4634bdee9ff7677080e6fdc26bbf74948024953fcbed239729973088f","observation_id":"b90b21fe-07b3-481e-9f49-ef8fcb9eaa59","resolution":{"observed_at":"2026-08-11T22:31:03.653552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T22:31:03.478748Z","title":"ms −2ξ −2ξ m t #","venue":null,"work_id":"fb0fb407-6f6c-4286-be0e-af275d72c848","year":null},"citing_paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:59.622918Z"},"links":{"citing_paper":"/paper/2608.09159"},"observation_digest":"sha256:62443ff68550cc91533b9a730f45bf8b01deb7f80973bebb7647502bb7d134f6","observation_id":"c279d620-c4b2-4453-ac3b-d9967fd63589","resolution":{"observed_at":"2026-08-11T22:31:03.525938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09159","last_updated":"2026-08-10T06:16:20Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T02:28:55.611045Z","submitted_at":"2026-08-10T06:16:20Z","title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":8,"verified_fuzzy":30},"total_outbound_references":58},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.09159."}