{"as_of":"2026-08-16T13:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95e2bfd3d083664fa619254f100299d8e798dc27a941daa63400aaf2f1dfb1d9","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:10:34.364702Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.06065/citation-record","integrity":"/paper/1908.06065/integrity","json":"/paper/1908.06065/citation-record.json","paper":"/paper/1908.06065"},"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-14T13:10:34.570079Z","title":"K-svd: An algorithm for designing overcomplete dictionaries for sparse representation","venue":null,"work_id":"91f8aa6a-0826-4e28-b2e0-8043ae2de98b","year":2006},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.306961Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:e46b29afba7b0e999690e555fbdf231b9984153680b26b5318f7a3d02ed75b08","observation_id":"67a66225-0be3-4dab-86d8-561749b6f897","resolution":{"observed_at":"2026-08-14T13:10:34.573911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.560382Z","title":"Exact matrix completion via convex optimization","venue":null,"work_id":"775a9234-d719-4208-89fc-1bb20571deba","year":2009},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.311354Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:d5826d98a3f27f3779a50b99e1694092aea975a3e69fc5cad6a2d41552ebc5ac","observation_id":"9555bd1a-b745-4037-9f0c-b8dd6cbb5862","resolution":{"observed_at":"2026-08-14T13:10:34.563842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.549837Z","title":"The convex geometry of linear inverse problems","venue":null,"work_id":"c59ca594-5e64-4b21-b535-a03ba3e85658","year":2012},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.315492Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:4bbd5916d507c9bfe598bc9956a896e1ba80164d3bbd2c13d29d09d305a5ffa6","observation_id":"48a4bdf5-06af-4119-9c3b-b60f9abb13f0","resolution":{"observed_at":"2026-08-14T13:10:34.553873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.539261Z","title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","venue":null,"work_id":"0a016797-c664-475d-991f-33b94fd3f834","year":2006},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.319229Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:26e4fd786d946b11086ccb11506b93eb8a3f42d98ce980655c613126f4ddae0d","observation_id":"4c7117c0-6668-477e-91bc-a08f88476369","resolution":{"observed_at":"2026-08-14T13:10:34.543094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.528876Z","title":"Stable signal recovery from incomplete and inaccurate measurements","venue":null,"work_id":"cc3e1f2d-a5c6-4c73-92c4-56768e9f8f96","year":2006},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.323432Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:6b93541d4c2b78c18aca3a1a573172b6d9703d661f5b02c57acb00c69bcd5dcf","observation_id":"49e97fa7-8fd6-4ae6-a0a1-4fd77096f406","resolution":{"observed_at":"2026-08-14T13:10:34.532639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.517666Z","title":"An introduction to compressive sampling [a sensing/sampling paradigm that goes against the common knowledge in data acquisition]","venue":null,"work_id":"2305e0dd-0000-428c-afc4-fc5a44f80463","year":2008},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.327086Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:c4cad46c507e8cc353a0d0c39246894299b13dc8fc2c104c0be99ea6e53db354","observation_id":"d6b2a1e6-27f1-4700-b031-5c14b3fba13d","resolution":{"observed_at":"2026-08-14T13:10:34.521546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.504567Z","title":"Compressed sensing","venue":null,"work_id":"6f031b8e-1815-4e33-975b-17f02da5215c","year":2006},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.331300Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:190861f5a0d9c36591e7db325817c8344df6571c1ed6e6e4a59589cc35734437","observation_id":"03624b5c-1133-4b64-92af-5afa514bee84","resolution":{"observed_at":"2026-08-14T13:10:34.509043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.493558Z","title":"Image denoising via sparse and redundant representations over learned dictionaries","venue":null,"work_id":"25b557f2-7072-41c2-8a8f-750e9cc87cac","year":2006},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.334816Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:849cbcc4bfd5b898de13c0c219449176d7111260ebf96aa7d15cd7e1f7bbb0b4","observation_id":"71b6aeed-41e0-4119-9e9a-f1097e70200c","resolution":{"observed_at":"2026-08-14T13:10:34.497516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.482209Z","title":"Non-negative matrix factorization with sparseness constraints","venue":null,"work_id":"4f30cbc8-0e0f-49c3-96a3-83c486d2f654","year":2004},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.338403Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:f9a74ad1ae8f776de14e9c6577795629bc770459a6f117a113a9f6fe117685fb","observation_id":"b22c193b-3958-4ba8-8b1e-97614ca68fed","resolution":{"observed_at":"2026-08-14T13:10:34.485926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.471249Z","title":"Learning the parts of objects by non-negative matrix factorization","venue":null,"work_id":"00a224bf-70f6-438e-9db7-62755b62dfac","year":1999},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.341937Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:920417d2c857353e9e600a86e03ba7fa788d87f1aa4d6aceca1835533ee907fb","observation_id":"8a46e8fa-db50-4bcb-9356-bc76e0ecf819","resolution":{"observed_at":"2026-08-14T13:10:34.475177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.456936Z","title":"Algorithms for non-negative matrix factorization","venue":null,"work_id":"e02afe14-4002-4120-9e52-a856e584d824","year":2001},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.345628Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:d37f04a1ed04520e0ab1bbd91962a25135c5add1b5edff70b6b687cf96febb19","observation_id":"6c1344f7-fffa-4211-95e1-d1445660759c","resolution":{"observed_at":"2026-08-14T13:10:34.462171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.445836Z","title":"Mairal, F","venue":null,"work_id":"2a7216a9-c47a-4c6d-a5d3-a3b50f09bd28","year":2010},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.349305Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:920d6b5e894431833dedd78864fe2d2a25ec6072c148db3e1fc801080bad69cb","observation_id":"875267e3-2af7-40e6-aeb9-6974b0ab3bd1","resolution":{"observed_at":"2026-08-14T13:10:34.449712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.433140Z","title":"Principles of mathematical analysis , volume 3","venue":null,"work_id":"e5b7fac5-9363-4b09-8c0a-20e1229cbac6","year":1964},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.352960Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:81e7209bfb18cac1444cce4064f998849c00df15bd22d097edcb3cf35e9e8974","observation_id":"2a185483-8281-4f23-8c5d-f8a15b3bea68","resolution":{"observed_at":"2026-08-14T13:10:34.437326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.419884Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","venue":null,"work_id":"2f6ad502-2bd9-4dc5-aad7-521c4138cccb","year":2010},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.356761Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:e31b3745f5eb7673a23e209a8552875fd95a46a02fc4bd91a0477660a0d84333","observation_id":"4b35a914-2c0e-47fc-8584-9696c06c9dd4","resolution":{"observed_at":"2026-08-14T13:10:34.424728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08828","last_updated":"2020-07-07T21:58:03Z","snapshot_observed_at":"2026-08-01T20:11:01.710320Z","submitted_at":"2019-10-19T19:34:00Z","title":"Dictionary Learning with Almost Sure Error Constraints","version":3},"cited_work":{"arxiv_id":"1910.08828","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.08828","snapshot_observed_at":"2026-08-14T13:10:34.393815Z","title":"Dictionary Learning with Almost Sure Error Constraints","venue":"cs.LG","work_id":"5f2860cb-a111-4ca1-8922-92b54d403109","year":2019},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.360566Z"},"links":{"cited_paper":"/paper/1910.08828","citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:4b5d4e87505db9bcb45fb5940b17c4873e55e0b75f622d7c57a5d488e3e4f945","observation_id":"b189bffd-ef17-4be3-bbed-f52144dc3a3d","resolution":{"observed_at":"2026-08-14T13:10:34.400433Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:10:34.408463Z","title":"Tosic and P","venue":null,"work_id":"6064aeb4-8a92-478c-8f56-2a7b6cd7294f","year":2011},"citing_paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T13:10:34.364702Z"},"links":{"citing_paper":"/paper/1908.06065"},"observation_digest":"sha256:a00cf41268becdde671e4dfeda95ffb789f938953357759fc512201004e2b89b","observation_id":"b9f66e02-1607-4857-8d21-1928cb3fe01b","resolution":{"observed_at":"2026-08-14T13:10:34.412351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06065","last_updated":"2020-01-08T19:48:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T12:54:35.115760Z","submitted_at":"2019-08-16T17:25:15Z","title":"On Convex Duality in Linear Inverse Problems"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":15},"total_outbound_references":16},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:1908.06065."}