{"as_of":"2026-08-22T01:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48d23f6836b8b6d8ca4f62dcdef504532d58fc3ffabfe77873789cb963c4d268","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:34:04.215143Z","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-11T18:11:07.321898Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1110.0413","last_updated":"2011-10-03T16:49:45Z","snapshot_observed_at":"2026-08-21T00:46:15.769264Z","submitted_at":"2011-10-03T16:49:45Z","title":"Group Lasso with Overlaps: the Latent Group Lasso approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.0413","snapshot_observed_at":"2026-08-12T17:34:04.215143Z","title":"Jacob, and J.-P","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.12479","last_updated":"2025-08-01T13:13:42Z","snapshot_observed_at":"2026-08-15T12:06:46.103172Z","submitted_at":"2024-11-19T13:01:05Z","title":"Graph-based Square-Root Estimation for Sparse Linear Regression","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T17:34:04.215143Z"},"links":{"cited_paper":"/paper/1110.0413","citing_paper":"/paper/2411.12479"},"observation_digest":"sha256:3f5358e21571c9fe18a4fc1e9bd07b81818c5059e781624cd7154b8e62360c79","observation_id":"817b6551-b157-4b25-8aea-a1c9ac46a927","resolution":{"observed_at":"2026-08-12T17:34:04.215143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0413","last_updated":"2011-10-03T16:49:45Z","snapshot_observed_at":"2026-08-21T00:46:15.769264Z","submitted_at":"2011-10-03T16:49:45Z","title":"Group Lasso with Overlaps: the Latent Group Lasso approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.0413","snapshot_observed_at":"2026-08-11T20:33:48.220344Z","title":"Group lasso with overlaps: the latent group lasso approach","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.05726","last_updated":"2024-12-07T19:19:55Z","snapshot_observed_at":"2026-08-19T04:00:13.907814Z","submitted_at":"2024-12-07T19:19:55Z","title":"Proximal Iteration for Nonlinear Adaptive Lasso","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T20:33:48.220344Z"},"links":{"cited_paper":"/paper/1110.0413","citing_paper":"/paper/2412.05726"},"observation_digest":"sha256:acb29f9e784480de20028c5e13f7e63d491368623b8864c50eb7e53ec82f84d1","observation_id":"c32d27ea-063e-45f3-a440-6d49bbc63a5b","resolution":{"observed_at":"2026-08-11T20:33:48.220344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0413","last_updated":"2011-10-03T16:49:45Z","snapshot_observed_at":"2026-08-21T00:46:15.769264Z","submitted_at":"2011-10-03T16:49:45Z","title":"Group Lasso with Overlaps: the Latent Group Lasso approach","version":1},"cited_work":{"arxiv_id":"1110.0413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1110.0413","snapshot_observed_at":"2026-07-04T17:55:11.749019Z","title":"(2015), ‘Caret: classification and regression training’, Astrophysics Source Code Library pp","venue":null,"work_id":"e8c63fbf-5848-42d5-9cd8-39ea416a416b","year":2015},"citing_paper":{"arxiv_id":"2605.05093","last_updated":"2026-05-06T16:31:20Z","snapshot_observed_at":"2026-07-06T23:17:48.161262Z","submitted_at":"2026-05-06T16:31:20Z","title":"Proximal Projection for Doubly Sparse Regularized Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T16:27:33.788355Z"},"links":{"cited_paper":"/paper/1110.0413","citing_paper":"/paper/2605.05093"},"observation_digest":"sha256:a2a2714a73be7064958003bf796cbc703d8deda8247bc03056e854021d272a48","observation_id":"f5b358d4-0e16-49e0-b5fc-3f5c7c4f8cec","resolution":{"observed_at":"2026-07-04T17:55:11.749019Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1110.0413/citation-record","integrity":"/paper/1110.0413/integrity","json":"/paper/1110.0413/citation-record.json","paper":"/paper/1110.0413"},"outbound":[],"paper":{"arxiv_id":"1110.0413","last_updated":"2011-10-03T16:49:45Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-21T00:46:15.769264Z","submitted_at":"2011-10-03T16:49:45Z","title":"Group Lasso with Overlaps: the Latent Group Lasso approach"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1110.0413."}