{"as_of":"2026-08-08T20:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2f61e5805145e1cc9d3cb5c890bb392ad9552d7d29ddc74d1faa3b7bf3f0116","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/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-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":1,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.197900Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:214bb83da5c124acc1a96f73a821537f352c9bf3825a30997e8e8dd9bf7cb6dd","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-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":"2311.07710","last_updated":"2025-07-14T18:29:02Z","snapshot_observed_at":"2026-07-06T16:47:01.374736Z","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-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":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:ed53fa946d8d28a8667614b58246f055f0ed96ac380e0f061b92d87df3e4bb65","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-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":7,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.194947Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:bc10aaee5a3c1f1ad6f6d280f334ca35d5103292a935bde5222493c28d2c8577","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-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":9,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.200877Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:751578b82f73cea985a0eb85724fce8bfb7093f1204a91720a3d185b398bf728","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-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":10,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.203934Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:f8da006ec3a7f3e26e80215253a2ec5e4bed79ce91bd0014be6f170c2f9d7f69","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-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":11,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.206560Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:12cc5cbf613f8b01d8320923fbc4ed2d14a53b71a7edc6d7cf64ee357e2642a2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-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":13,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.212403Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:e142c24bed095f21c2ce53808535d92b1581ddb5dfbddb9c0007ad49a5d97711","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-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-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":500,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.209825Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:eaf39bdc21e0cd272aa33dbc3275c113b1c692d8b7e985036a04b21f7f23002c","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-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":"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-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":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:fd225465be3d4b70327429fe7f2789b7b943d6e7e36e4ce6674e2c12205534c9","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-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":2020,"source":"pdf_text","source_observed_at":"2026-08-07T21:22:14.177828Z"},"links":{"citing_paper":"/paper/2502.09502"},"observation_digest":"sha256:31c9985e97f2f332215604b4512e9b9c269958a0ad6d25f974374e45c09c685c","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-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":"2307.05975","last_updated":"2023-07-12T07:44:13Z","snapshot_observed_at":"2026-07-06T15:53:07.429379Z","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-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":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:8a4770e0e54a02a51dc7ca79325f9903b2ee098e6f42695b528000edbcb5e670","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-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":"2312.14832","last_updated":"2024-01-07T06:52:56Z","snapshot_observed_at":"2026-08-06T20:32:08.575521Z","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-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":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:1b21a26f7b9da56b500a447232e9f033931dda8244a15ef9d3374b952e99db36","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-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"}}],"paper":{"arxiv_id":"2502.09502","last_updated":"2025-06-11T17:23:10Z","latest_version":3,"primary_category":"cs.LG","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"},"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-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 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2502.09502."}