{"as_of":"2026-08-14T06:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3227ded97494aa4772ec10ea4cdce9601f3b80dc72f62ba0c3fe67867e394fc","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:22:14.212403Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"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/2502.09502/citation-record","integrity":"/paper/2502.09502/integrity","json":"/paper/2502.09502/citation-record.json","paper":"/paper/2502.09502"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:22:14.304175Z","title":"We then conclude the proof using these observations","venue":null,"work_id":"9d562601-6b14-4cfd-b522-5c0b81b3ce10","year":2000},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.197900Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:46b6ee74330e144b530f05e813a29412c02ed7dec30061abcf3a5bad01a4b296","observation_id":"ef3c3066-6bec-4399-a9e3-65b3675cb9e7","resolution":{"observed_at":"2026-08-07T21:22:14.307045Z","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.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-07T21:22:14.187714Z","title":"and Yang, J","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-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.187714Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:2e0b797299c8607669e4dc5d182f9780f600b271a46e044239c2da1911a1f34b","observation_id":"d7a23477-f1d7-453f-b751-86af8d0fc6d0","resolution":{"observed_at":"2026-08-07T21:22:14.187714Z","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-07T21:22:14.311511Z","title":"Proofs This section contains all omitted proofs in the paper","venue":null,"work_id":"5a5b60d2-e66d-4422-9f8f-095107a05d4c","year":2024},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.194947Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:bbca6ad9c2393440aeb7ba6dc09bd28e455db0f767010450f3d61b682108c313","observation_id":"3cf5f81d-d19f-4e24-82af-6194e5017c7c","resolution":{"observed_at":"2026-08-07T21:22:14.314203Z","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-07T21:22:14.296659Z","title":"Proof of Theorem 3.6 Theorem 3.6.For anyβ∈R p, Algorithm 2 computes the exact value ofg(β), defined in(7), inO(p+plogk)","venue":null,"work_id":"39119d57-05d0-4ee0-b2ef-8c4e2eef90c2","year":2022},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.200877Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:59c40ffadf18155ef6e56c87988a334077c55edc0dcf0e1759cae8af10fd2d8e","observation_id":"62f9f686-3c43-4d4a-be05-21e851bcf446","resolution":{"observed_at":"2026-08-07T21:22:14.299432Z","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-07T21:22:14.287479Z","title":"For this experiment, we vary the feature dimension p∈ {1000,2000,4000,8000,16000}","venue":null,"work_id":"033060f3-2a31-441a-a053-3c87155bf79f","year":2000},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.203934Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:3ace7f66c1a0a45135508adb10b80ff5beed49484e08cb5d09c18ab30a80c3be","observation_id":"cd439c0a-7b8c-409d-951a-ccce2b6f5503","resolution":{"observed_at":"2026-08-07T21:22:14.290729Z","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-07T21:22:14.280043Z","title":null,"venue":null,"work_id":"aaa36f58-0e49-41b1-a97c-4abddedbd8c9","year":2023},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.206560Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:f6cde21cd3bdf1278378520da4d2b6e97f900ab97ca1dbe3b430cef609fae5b4","observation_id":"eed7176b-ff92-4775-ae39-0d6bc5b1e743","resolution":{"observed_at":"2026-08-07T21:22:14.283032Z","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-07T21:22:14.264315Z","title":null,"venue":null,"work_id":"983f6f9f-edfa-429a-91ef-140787f8339c","year":2024},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.212403Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:68d465291e0b1e0f4e4c7c778207d09a2b95e902de82292b2ba97226cd68d2c0","observation_id":"35e28892-91b9-4146-be4f-a82d5685fa3b","resolution":{"observed_at":"2026-08-07T21:22:14.266866Z","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-07T21:22:14.272628Z","title":null,"venue":null,"work_id":"bc264196-9371-44f0-9511-2918a6f57abb","year":2020},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":500,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.209825Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:55e9f9f835d11b6dcc8a5ffeaf037eba9c6710c989e1fd1b0bb2bffe30bca053","observation_id":"c194e955-003a-4f11-8688-78ff2e096148","resolution":{"observed_at":"2026-08-07T21:22:14.275238Z","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":{"arxiv_id":"2402.01061","last_updated":"2026-04-21T06:09:59Z","snapshot_observed_at":"2026-08-02T20:32:55.622547Z","submitted_at":"2024-02-01T23:19:48Z","title":"On the power of linear programming for K-means clustering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01061","snapshot_observed_at":"2026-08-07T21:22:14.173881Z","title":"On the power of linear programming for K-means clustering","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-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.173881Z"},"links":{"cited_paper":"/paper/2402.01061","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:7198b712bf8c440c0fbe50bbf7a41ebc1313669a9b53bc6eb8018e5c4586738c","observation_id":"407e394b-84b1-470f-a0ef-c52426093db1","resolution":{"observed_at":"2026-08-07T21:22:14.173881Z","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-07T21:22:14.318287Z","title":"Outlier detection in time series via mixed-integer conic quadratic optimization.SIAM Journal on Optimiza- tion, 31(3):1897–1925,","venue":null,"work_id":"14f04537-831f-457a-83bc-35e777d338f3","year":1925},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.177828Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:0422b3ba201de5ff46aa6e61cdde7358489e00c868f10fba44b47ab0ed0635e7","observation_id":"b12202df-f457-4c6c-af7b-b606368d00a5","resolution":{"observed_at":"2026-08-07T21:22:14.321271Z","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":"2307.05975","last_updated":"2023-07-12T07:44:13Z","snapshot_observed_at":"2026-08-13T10:57:42.701483Z","submitted_at":"2023-07-12T07:44:13Z","title":"Outlier detection in regression: conic quadratic formulations","version":1},"cited_work":{"arxiv_id":"2307.05975","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.05975","snapshot_observed_at":"2026-08-07T21:22:14.247469Z","title":"Outlier detection in regression: conic quadratic formulations","venue":"math.OC","work_id":"69754c0c-8187-4271-a050-118935788457","year":2023},"citing_paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.180725Z"},"links":{"cited_paper":"/paper/2307.05975","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:430f39760a4488c0ee8fffb03df11934d3b3ebfc3ee87ce983e54ee02c9be6f4","observation_id":"b8537b85-5ebb-49f4-9abc-d4b79a225e1c","resolution":{"observed_at":"2026-08-07T21:22:14.252641Z","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":"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-07T21:22:14.190739Z","title":"cuPDLP-C: A strengthened implementation of cuPDLP for linear programming by C language.arXiv:2312.14832,","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-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.190739Z"},"links":{"cited_paper":"/paper/2312.14832","citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:94cf6ae118d41b3c4727d0436347d16e65f5d6207be19bfbca91cb26ae6f240a","observation_id":"f1c29ad5-079a-4922-b8e7-2531b7de6f7e","resolution":{"observed_at":"2026-08-07T21:22:14.190739Z","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-08-12T23:17:56.607023Z","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-13T17:43:22.502890Z","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:8abb05e8b9e875656e5d3061aceb56804fa4652674710f5b1d66e1f3eb5e7c65","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"}}],"paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T17:43:22.502890Z","submitted_at":"2025-02-13T17:14:18Z","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":13},"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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2502.09502."}