{"as_of":"2026-08-15T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd9431232ca6f3457f421a19206ecee27fbc71b6012e6e0f2cd79f5a6007b475","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:43:13.356121Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T06:06:40.551371Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0903.1468","last_updated":"2009-03-09T00:54:46Z","snapshot_observed_at":"2026-08-15T05:53:23.577346Z","submitted_at":"2009-03-09T00:54:46Z","title":"Taking Advantage of Sparsity in Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0903.1468","snapshot_observed_at":"2026-08-14T11:43:13.356121Z","title":"Taking advantage of sparsity in multi-task learning.arXiv preprint arXiv:0903.1468, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.08616","last_updated":"2021-01-30T21:58:16Z","snapshot_observed_at":"2026-08-15T08:43:22.088591Z","submitted_at":"2019-08-22T23:00:28Z","title":"Quadratic Surface Support Vector Machine with L1 Norm Regularization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:43:13.356121Z"},"links":{"cited_paper":"/paper/0903.1468","citing_paper":"/paper/1908.08616"},"observation_digest":"sha256:693ab114ba4cf9acc035f74dfba7eb1b94516ed64a7418e39e314866a0a890b2","observation_id":"15e9ebf7-bebd-433f-b94d-2e4125db6663","resolution":{"observed_at":"2026-08-14T11:43:13.356121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0903.1468","last_updated":"2009-03-09T00:54:46Z","snapshot_observed_at":"2026-08-15T05:53:23.577346Z","submitted_at":"2009-03-09T00:54:46Z","title":"Taking Advantage of Sparsity in Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"0903.1468","doi":null,"metadata_source":"pith","pith_arxiv_id":"0903.1468","snapshot_observed_at":"2026-07-02T06:06:40.551371Z","title":"Taking Advantage of Sparsity in Multi-Task Learning","venue":"stat.ML","work_id":"bc3cebdb-a46c-46e1-b9b9-1776d39895b6","year":2009},"citing_paper":{"arxiv_id":"2607.00995","last_updated":"2026-07-01T14:31:36Z","snapshot_observed_at":"2026-07-07T00:06:35.457630Z","submitted_at":"2026-07-01T14:31:36Z","title":"Deep Multitask Learning for Mixed-Type Outcomes with Shared Sparsity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-02T06:04:54.352506Z"},"links":{"cited_paper":"/paper/0903.1468","citing_paper":"/paper/2607.00995"},"observation_digest":"sha256:355ad6a10f304e06e833ffda1450f5bd8d4c267e79b2248de114892bb78d4130","observation_id":"a902a534-0872-4ec2-bfb6-b000e000cc67","resolution":{"observed_at":"2026-07-02T06:06:40.552743Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0903.1468/citation-record","integrity":"/paper/0903.1468/integrity","json":"/paper/0903.1468/citation-record.json","paper":"/paper/0903.1468"},"outbound":[],"paper":{"arxiv_id":"0903.1468","last_updated":"2009-03-09T00:54:46Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-15T05:53:23.577346Z","submitted_at":"2009-03-09T00:54:46Z","title":"Taking Advantage of Sparsity in Multi-Task Learning"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0903.1468."}