{"as_of":"2026-08-08T22:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a44d315540f05e6b3359738902706bcb1fcdd3329f12ebec6bcd17c0dc0d9ac9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:22:14.184426Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T07:41:14.800183Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-07T21:22:14.184426Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on GPU.arXiv:2407.15049,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-07T21:12:17.963828Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.184426Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:a943bac136550a5870aaa8b77273028f750eb2595b3ebb099af6d0539c95d72b","observation_id":"f811efa1-c070-4e38-aa33-8aa2c38749bb","resolution":{"observed_at":"2026-08-07T21:22:14.184426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-07T15:21:17.327500Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15775","last_updated":"2025-05-21T17:27:04Z","snapshot_observed_at":"2026-08-07T15:09:42.579569Z","submitted_at":"2025-05-21T17:27:04Z","title":"New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:21:17.327500Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2505.15775"},"observation_digest":"sha256:4b5be3bcde11fde2b393b82b46ed5b64fe73b5979a7e4e30ac6e19a3128ea2e0","observation_id":"0c0ee4e9-dde7-4587-899e-03584ab4876d","resolution":{"observed_at":"2026-08-07T15:21:17.327500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-07T11:33:15.012887Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02174","last_updated":"2025-06-02T19:00:36Z","snapshot_observed_at":"2026-08-08T20:28:23.094815Z","submitted_at":"2025-06-02T19:00:36Z","title":"An Overview of GPU-based First-Order Methods for Linear Programming and Extensions","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:15.012887Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2506.02174"},"observation_digest":"sha256:9a8d87e5c69279d5f09d6a6f6692eac617faf65115b93b063a61983af28b0669","observation_id":"456b9082-aad5-4de7-9512-45501dbbcffc","resolution":{"observed_at":"2026-08-07T11:33:15.012887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-07T06:11:01.339301Z","title":"arXiv preprint arXiv:2407.15049 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06258","last_updated":"2025-06-06T17:37:35Z","snapshot_observed_at":"2026-08-08T09:43:09.475297Z","submitted_at":"2025-06-06T17:37:35Z","title":"PDHCG: A Scalable First-Order Method for Large-Scale Competitive Market Equilibrium Computation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.339301Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2506.06258"},"observation_digest":"sha256:a8bff5631c8632715b8cab9a42fcfd4c1e67d894d5d39af162d8cf0da3d59197","observation_id":"e47abcb8-b693-4c2b-9ef6-5e355357693a","resolution":{"observed_at":"2026-08-07T06:11:01.339301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":"2407.15049","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on gpu","venue":null,"work_id":"29221972-5052-4c83-9a1e-76abc9f1fa92","year":2024},"citing_paper":{"arxiv_id":"2602.02394","last_updated":"2026-04-13T12:55:51Z","snapshot_observed_at":"2026-07-06T22:44:09.804048Z","submitted_at":"2026-02-02T17:56:01Z","title":"On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T08:12:27.427842Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2602.02394"},"observation_digest":"sha256:82ff6e2710d968605c5b52d48fb8d5325d3fcab11d9e4c21df165e0af0c97840","observation_id":"6d0b24b6-5426-4258-9cd0-5bc5dc5edc5c","resolution":{"observed_at":"2026-05-16T08:12:35.407833Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-02T21:08:32.497021Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on gpu.arXiv preprint arXiv:2407.15049, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21722","last_updated":"2026-05-24T04:32:04Z","snapshot_observed_at":"2026-08-05T21:41:07.687048Z","submitted_at":"2026-02-25T09:28:46Z","title":"Solving Imperfect-Recall Games via Sum-of-Squares Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T21:08:32.497021Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2602.21722"},"observation_digest":"sha256:363d18ebcc00bbe0aee258855e5a26666617eccb8f73f235f298fc7247d7cf08","observation_id":"cc69c770-5f39-4f59-8443-62ec9fa50af3","resolution":{"observed_at":"2026-08-02T21:08:32.497021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":"2407.15049","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on gpu","venue":null,"work_id":"29221972-5052-4c83-9a1e-76abc9f1fa92","year":2024},"citing_paper":{"arxiv_id":"2605.17883","last_updated":"2026-05-18T05:43:50Z","snapshot_observed_at":"2026-08-02T07:04:38.434409Z","submitted_at":"2026-05-18T05:43:50Z","title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T09:44:32.144900Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2605.17883"},"observation_digest":"sha256:0ad74df5d90530ba3cafa07f96244ef6dbfa33074adbd938bfa6bcd141385b75","observation_id":"dbfa680c-7de1-480d-9c01-46bc798b1c2a","resolution":{"observed_at":"2026-05-20T09:48:11.657321Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":"2407.15049","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on gpu","venue":null,"work_id":"29221972-5052-4c83-9a1e-76abc9f1fa92","year":2024},"citing_paper":{"arxiv_id":"2605.22188","last_updated":"2026-05-21T08:56:15Z","snapshot_observed_at":"2026-07-06T23:32:35.159280Z","submitted_at":"2026-05-21T08:56:15Z","title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-22T07:39:49.501156Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2605.22188"},"observation_digest":"sha256:ffdc8a3e08d42ce54390ef4390ef88868d9e798f56381ebc281acb36c8bd530c","observation_id":"4fe43ecd-55ad-4c9c-92d6-53c1442a24bd","resolution":{"observed_at":"2026-05-22T07:41:14.803983Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-07-12T03:57:46.650349Z","title":"https://doi.org/10.48550/arXiv.2407.15049, http://arxiv.org/abs/2407.15049, arXiv:2407.15049 [math.OC]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03232","last_updated":"2026-07-03T11:41:42Z","snapshot_observed_at":"2026-08-07T10:16:49.298815Z","submitted_at":"2026-07-03T11:41:42Z","title":"Fast SDP certification of neural networks : towards large multi-class datasets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-12T03:57:46.650349Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2607.03232"},"observation_digest":"sha256:adc778fcc10cfe34bcae7a11c5ab7cc501817bc7314f89acd9a32ace664958a0","observation_id":"bb602ff0-de61-4e2a-9520-aefe23c0ca96","resolution":{"observed_at":"2026-07-12T03:57:46.650349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-08-01T16:39:59.839181Z","title":"Accelerating low-rank factorization-based semidefinite programming algorithms on GPU.arXiv preprint arXiv:2407.15049, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17933","last_updated":"2026-07-20T13:31:19Z","snapshot_observed_at":"2026-08-07T07:01:32.625429Z","submitted_at":"2026-07-20T13:31:19Z","title":"A Curvature-Aware Rank-Adaptive Distributed Augmented-Lagrangian Solver for Large-Scale SDPs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T16:39:59.839181Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2607.17933"},"observation_digest":"sha256:9d01b5e329b00da03fba7b0dd3011a06d9740c23d3cd830fbd8ca55168e75dfd","observation_id":"7d8d1cc8-b9e0-4c8d-9627-b445d1119515","resolution":{"observed_at":"2026-08-01T16:39:59.839181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15049","snapshot_observed_at":"2026-07-31T10:25:01.537996Z","title":"Accelerating","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28353","last_updated":"2026-07-30T15:22:31Z","snapshot_observed_at":"2026-08-06T15:30:47.379707Z","submitted_at":"2026-07-30T15:22:31Z","title":"Input-to-state Stable Approximate Nonlinear Model Predictive Control with Realtime Feasibility","version":1},"reference_index":198,"source":"arxiv_source","source_observed_at":"2026-07-31T10:25:01.537996Z"},"links":{"cited_paper":"/paper/2407.15049","citing_paper":"/paper/2607.28353"},"observation_digest":"sha256:db62c560c0bf9608e364750a5cd3bb644ad970b076fd2f46a7cfa97dc4587928","observation_id":"d164b320-7e46-4e17-8d8f-f50ab235dcc0","resolution":{"observed_at":"2026-07-31T10:25:01.537996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.15049/citation-record","integrity":"/paper/2407.15049/integrity","json":"/paper/2407.15049/citation-record.json","paper":"/paper/2407.15049"},"outbound":[],"paper":{"arxiv_id":"2407.15049","last_updated":"2024-08-24T03:01:20Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T18:49:38.316515Z","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2407.15049."}