{"as_of":"2026-08-14T16:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7879343bf776a89b286cbf3aaa182b61d7ec3183436a5bf65998f5ec15194571","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T13:47:10.271755Z","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-11T11:36:02.385175Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.05910","last_updated":"2017-12-16T06:42:06Z","snapshot_observed_at":"2026-08-13T02:36:28.108190Z","submitted_at":"2017-12-16T06:42:06Z","title":"An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems","version":1},"cited_work":{"arxiv_id":"1712.05910","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1712.05910","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Toh, K.C","venue":null,"work_id":"96687abe-2075-4e6d-8ba1-158c63ae1e36","year":2017},"citing_paper":{"arxiv_id":"2604.12694","last_updated":"2026-04-22T12:09:24Z","snapshot_observed_at":"2026-07-06T23:00:51.385974Z","submitted_at":"2026-04-14T13:05:06Z","title":"Adaptive Sparse Group Lasso Penalized Quantile Regression via Dual ADMM","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-10T13:47:10.271755Z"},"links":{"cited_paper":"/paper/1712.05910","citing_paper":"/paper/2604.12694"},"observation_digest":"sha256:70c9c32c089e6ece50c61db5a937899594dd5ff43754df34fd81245ae5bf080c","observation_id":"6a10976a-ec8c-4128-bfdf-37193c70a2d9","resolution":{"observed_at":"2026-05-11T11:36:02.393713Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/1712.05910/citation-record","integrity":"/paper/1712.05910/integrity","json":"/paper/1712.05910/citation-record.json","paper":"/paper/1712.05910"},"outbound":[],"paper":{"arxiv_id":"1712.05910","last_updated":"2017-12-16T06:42:06Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T02:36:28.108190Z","submitted_at":"2017-12-16T06:42:06Z","title":"An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1712.05910."}