{"as_of":"2026-08-08T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f88d85a1b54de0bd70abc8851fe3ac5424ed15d6552c88db2e897afcb6d774bb","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:28:43.141680Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-08-07T05:20:58.563241Z","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-08-07T05:20:58.652684Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"cited_work":{"arxiv_id":"2509.10033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.10033","snapshot_observed_at":"2026-08-07T05:20:58.652684Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","venue":"cs.LG","work_id":"cbc525b5-6044-4416-9ccf-00e02fc98464","year":2025},"citing_paper":{"arxiv_id":"2506.09086","last_updated":"2025-07-15T07:17:16Z","snapshot_observed_at":"2026-08-07T05:04:43.162434Z","submitted_at":"2025-06-10T08:45:15Z","title":"York's Cavity Formalism and Quantum Modified Thermodynamics of (2+1)D Black Holes","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:58.563241Z"},"links":{"cited_paper":"/paper/2509.10033","citing_paper":"/paper/2506.09086"},"observation_digest":"sha256:1b751d61f92f9ecb51b3cbdb63605023c005a759a3f59e113e8a4a7d740ed45d","observation_id":"723e719c-4152-44dc-ba8a-d3a9cfd6daa7","resolution":{"observed_at":"2026-08-07T05:20:58.660162Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2509.10033/citation-record","integrity":"/paper/2509.10033/integrity","json":"/paper/2509.10033/citation-record.json","paper":"/paper/2509.10033"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:38.608660Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:38.608660Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:fb58514199c8e22d36cb890c57745b3ca1325d9f28ef254c079edb8497b9db72","observation_id":"93f72653-479a-46e8-868a-df21bc4477db","resolution":{"observed_at":"2026-08-04T18:28:38.608660Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:38.658754Z","title":"Sparse coding with anomaly detection","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:38.658754Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:2d33238e89ae57216f07d2c9a00636d90c0b145e611d98a1a143a3246bac8086","observation_id":"85219bf6-4376-4e6a-ba6e-514e51abf29e","resolution":{"observed_at":"2026-08-04T18:28:38.658754Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:38.698204Z","title":"K-svd: An algorithm for designing overcomplete dictionaries for sparse representation","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:38.698204Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:737d93a5c7de242f60a020100d31d82e070d028952e6e33df271481a5209118c","observation_id":"09040c49-b84d-4a21-9edb-3d588503a681","resolution":{"observed_at":"2026-08-04T18:28:38.698204Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:38.815131Z","title":"Robust kronecker component analysis","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:38.815131Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:2f4739eb656f128d77c40507c2dd095134636f626f06d2128c1731519629c58b","observation_id":"ab0cb0f4-b7c4-44ea-8e3d-677ff318bb32","resolution":{"observed_at":"2026-08-04T18:28:38.815131Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:38.953698Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:38.953698Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:f97115516b7f7d44cce78f7e120ac835d7e25883e5453fab3a276122c3fb2632","observation_id":"7215a30a-d996-49d1-ba9d-93dec517364b","resolution":{"observed_at":"2026-08-04T18:28:38.953698Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.030740Z","title":"Traffic flow on a freeway network","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.030740Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:0483a8ae17509ed92e10d01d356d6a31ae70c53b6666385f9613646e8d0de916","observation_id":"6a56ebd8-0965-4f0c-86f0-5f09020dd217","resolution":{"observed_at":"2026-08-04T18:28:39.030740Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.152601Z","title":"Distributed op- timization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.152601Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:6844e470c49be27b87b8f4b2bb943efe7b50a8d6de20eb8e94cd52c75fe2e72e","observation_id":"5377d5e5-4ff9-4418-b912-0c2b772c31cd","resolution":{"observed_at":"2026-08-04T18:28:39.152601Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.240626Z","title":"On the mathematical foundations of learning","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.240626Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:d972cc62465b8ecc8f478a03847cce73489795f603ce57e33d5c357179ce4c96","observation_id":"4730623b-3f74-4189-812d-63a2809d93bc","resolution":{"observed_at":"2026-08-04T18:28:39.240626Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.318192Z","title":"Sparsity analysis using a mixed approach with greedy and ls algorithms on channel estimation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.318192Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:fd2b7ef5d12edb06c678b3666f86835ed229266295907fdb855bd17cbcb5438e","observation_id":"57905d4d-6b73-4c74-8c69-66ae45ae1c2b","resolution":{"observed_at":"2026-08-04T18:28:39.318192Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.405512Z","title":"Learning graphs from data: A signal representation perspective","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.405512Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:0b44f80aa92c5cf5ce337718d8630494e00d12a23d0164ea08ce6df501efd4ce","observation_id":"926e4792-d889-4de5-a356-54ad766d6898","resolution":{"observed_at":"2026-08-04T18:28:39.405512Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.511240Z","title":"Reality mining: sensing complex social systems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.511240Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:4d9850b1fdd2b52104e4eb98c06fd9e2114b1c2968cad59404353795640d3c89","observation_id":"f832750c-a682-4d35-8f4f-f6a1dcdb54ef","resolution":{"observed_at":"2026-08-04T18:28:39.511240Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.635174Z","title":"Image denoising via sparse and redundant representations over learned dictionaries","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.635174Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:504ce710af9f234707cce4df317a76b631804ddaeb2e0a1c28a3b299cb93fb63","observation_id":"94572f20-3299-4327-a737-8640dd8cb60f","resolution":{"observed_at":"2026-08-04T18:28:39.635174Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.725324Z","title":"Method of optimal directions for frame design","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.725324Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:5c9fb0aafec9e0377b9d90b8318dcc196a01532205eedb5c8c6be15c09ddb39e","observation_id":"c9fb82ed-2412-465c-8c42-aa18369fa2e1","resolution":{"observed_at":"2026-08-04T18:28:39.725324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.09214","last_updated":"2022-09-07T19:57:50Z","snapshot_observed_at":"2026-07-06T12:19:47.730180Z","submitted_at":"2021-12-16T21:46:23Z","title":"Sparse Coding with Multi-Layer Decoders using Variance Regularization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.09214","snapshot_observed_at":"2026-08-04T18:28:39.838139Z","title":"Sparse coding with multi-layer decoders using variance regularization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.838139Z"},"links":{"cited_paper":"/paper/2112.09214","citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:9a66697fc00246f7adcc2aa6c059e487271768ae75204608e97a3ce8964296cc","observation_id":"0955e34a-4398-4bd9-80ba-ae2ed2e64a9a","resolution":{"observed_at":"2026-08-04T18:28:39.838139Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:39.953181Z","title":"2d sparse signal recovery via 2d orthogonal match- ing pursuit","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:39.953181Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:1b78aa550976bf1f1c1a830b79424e87665af1a79b835e46378a9c6b481fc238","observation_id":"7a275251-bda6-40d7-b85a-4ce6a09dadbe","resolution":{"observed_at":"2026-08-04T18:28:39.953181Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.038291Z","title":"Sparse decomposition of two dimensional signals","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.038291Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:fb22888595226321f291b8d8d9f930f90652a73129aa676b6b2169260ca97db5","observation_id":"1bf78bd4-7df4-431a-ad8e-5dbe3229f49d","resolution":{"observed_at":"2026-08-04T18:28:40.038291Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.155127Z","title":"A low-rank tensor dictionary learning method for hyper- spectral image denoising","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.155127Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:067eb176c9a85cc8affcba4179b02512a5469ae33925c008226b93fd202ddaa4","observation_id":"e9ee2b94-b4ca-42a1-bce9-7ef89f1db856","resolution":{"observed_at":"2026-08-04T18:28:40.155127Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.246122Z","title":"Sample complexity of dictionary learning and other matrix factorizations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.246122Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:e7ba9b2ef41c1bec4939c99d3634e5e08305f990aef15fb32a41ede8928f2546","observation_id":"fe636752-4e79-476d-a4b9-9e9b49d8d190","resolution":{"observed_at":"2026-08-04T18:28:40.246122Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.370844Z","title":"Separable dictionary learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.370844Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:1400750923b7bf6115c469974fc4781a21f2638d2c57ffce30b5c2aee6b0cc66","observation_id":"fb4e77df-9828-487a-a79e-84513fbd3a67","resolution":{"observed_at":"2026-08-04T18:28:40.370844Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.442539Z","title":"Bayesian compressive sensing","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.442539Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:e324fbcac0dcb11c6b12f627efd32342e88e17f943462e3475fca30bf31b3700","observation_id":"ac84debd-84bc-4bee-b99e-60e638a3dbaa","resolution":{"observed_at":"2026-08-04T18:28:40.442539Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.517995Z","title":"Dictionary learning with low- rank coding coefficients for tensor completion","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.517995Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:a58d253c93b6383410935b24cbeb220d5acaea2a16a8194d8f5c27bf3b8eecc6","observation_id":"a2c5a5a2-c68e-4d64-a3de-88b36577e0e4","resolution":{"observed_at":"2026-08-04T18:28:40.517995Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.616485Z","title":"Sparse signal recovery via tree search matching pursuit","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.616485Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:a6bf4c46fd1e8a9a19ed683f1efcf7ce2fae7e9dcdc398d7997c556183cd3b6b","observation_id":"1263ba33-4cb6-41b3-8b2c-1346f757c283","resolution":{"observed_at":"2026-08-04T18:28:40.616485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.5055","last_updated":"2013-10-18T13:42:57Z","snapshot_observed_at":"2026-07-06T02:15:55.338460Z","submitted_at":"2010-09-26T03:42:27Z","title":"The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.5055","snapshot_observed_at":"2026-08-04T18:28:40.729989Z","title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.729989Z"},"links":{"cited_paper":"/paper/1009.5055","citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:5689579a389402fd6a1a6f541cbcd6b345c668fd63b28ba2505af1f4a4080d24","observation_id":"c026091d-8168-4ebd-8ac2-e93fd9480e75","resolution":{"observed_at":"2026-08-04T18:28:40.729989Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.802581Z","title":"Gist: Graph inference for structured time series","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.802581Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:3beeebb5f585a328f2b8a0abe48ae97aed74df418ae859418593de341b5b10aa","observation_id":"5ad39f9c-4c07-4391-84cc-17945dbf44ba","resolution":{"observed_at":"2026-08-04T18:28:40.802581Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.890048Z","title":"A review of sparse recovery algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.890048Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:1ad8a8e1098b1920770f513b8938b4ea8379783702f0bd834107ef1e0071b791","observation_id":"9e494b4c-73bb-4c0c-be9e-26d310ea7427","resolution":{"observed_at":"2026-08-04T18:28:40.890048Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:40.971479Z","title":"Multi-dictionary tensor decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:40.971479Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:d91252d13a04eb78a3f55ff9cbc80989e0588dbc43e015fd36f473844a2e24b0","observation_id":"61069042-7fd7-4c27-9818-290cad943277","resolution":{"observed_at":"2026-08-04T18:28:40.971479Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.060206Z","title":"Temporal graph signal decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.060206Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:322f973a92ee058df4ee267d1d8249153e0efa0b3bd8691d92e11721fdebbe5b","observation_id":"07724a0b-57b8-44a5-9e1f-ee5c29c90845","resolution":{"observed_at":"2026-08-04T18:28:41.060206Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.171068Z","title":"Or- thogonal matching pursuit: Recursive function approximation with applications to wavelet de- composition","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.171068Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:4782c75503b34e2e309c3c0fde79d85a999fe9cea13911f6a2a14fd63de175a4","observation_id":"eaad38cb-33b1-4393-b913-d5d1ab93961f","resolution":{"observed_at":"2026-08-04T18:28:41.171068Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.250252Z","title":"Jointly using low-rank and sparsity priors for sparse inverse synthetic aperture radar imaging","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.250252Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:02aaa53cf1fb28347e888aeee595906dbf4c014dffa4c42ba06b94c628cd1fb0","observation_id":"27e65d64-0c1b-4721-b01c-0945739f0c91","resolution":{"observed_at":"2026-08-04T18:28:41.250252Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.383831Z","title":"Dynamic texture recognition via orthogonal tensor dictio- nary learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.383831Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:f2f35df1b5c5919253ea23a54fe00e29a7afd411612ad9048576db97d9305688","observation_id":"2749c959-eda2-42bd-8a23-4c557c512d44","resolution":{"observed_at":"2026-08-04T18:28:41.383831Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.463299Z","title":"Recommendation on live-streaming plat- forms: Dynamic availability and repeat consumption","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.463299Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:f1cbe2db3e713854cdc73ac0ed5f809597fbe5e3f43cd940d14b58908b768c59","observation_id":"6381091b-cd4e-40a9-a816-f7d38dad0774","resolution":{"observed_at":"2026-08-04T18:28:41.463299Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.555330Z","title":"Dictionaries for sparse representation modeling","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.555330Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:1e6c760ae29f9027936252d61b61e1771372db7e31f10b8cabd6e8df76aafa27","observation_id":"7463e729-e2b6-469c-8959-2034db005938","resolution":{"observed_at":"2026-08-04T18:28:41.555330Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.633235Z","title":"Sandryhaila and J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.633235Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:edc7ac36501c844a1001cfe53436b59640a836d4e5caf0eb3bce46e9081ff582","observation_id":"a3699d18-4718-42e2-9989-a80098c2fbfc","resolution":{"observed_at":"2026-08-04T18:28:41.633235Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.758895Z","title":"New dictio- nary learning methods for two-dimensional signals","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.758895Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:20e04ad51f99186eb95b6421709b74612c295f99e162850ad269e2c43f5608fe","observation_id":"cdba6105-9a1b-4c0a-93f2-fcd4f6ec5717","resolution":{"observed_at":"2026-08-04T18:28:41.758895Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.852472Z","title":"Understanding Machine Learning: From Theory to Algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.852472Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:869bac4f250411088f7f55e2a841abbe7c7253170c3ddc3ee6fb32a3a9e8e776","observation_id":"3f14dd6a-74f4-4174-9911-f8e0d716e46b","resolution":{"observed_at":"2026-08-04T18:28:41.852472Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:41.967347Z","title":"The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:41.967347Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:a91e2bcc32bba3c51cbb4d275a64f7ce4d0eaed14225a0aca1ce1d7d0c9d6b10","observation_id":"6183d035-ef14-4681-bc4e-85fbb17de7c5","resolution":{"observed_at":"2026-08-04T18:28:41.967347Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.024522Z","title":"Crowdsourced air traffic data from the opensky network 2019–2020","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.024522Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:63cced3131f16c9e2d91789700528e8fd8d0abb56c50c3e990102dfd48d0c83f","observation_id":"da499dff-63d3-4335-98b0-30ff27cadf66","resolution":{"observed_at":"2026-08-04T18:28:42.024522Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.104412Z","title":"Adversarial robustness of supervised sparse coding","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.104412Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:13f1bb60935bc8a613ce2de260923759f8cc5639b33147142c30a36fe1cffbec","observation_id":"9f750930-2bb3-45ac-a400-aed3b8462dae","resolution":{"observed_at":"2026-08-04T18:28:42.104412Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.194623Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.194623Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:a03e8234297dd77657fb41bbad91850392e35d54a5be776dc3236d5b264089c8","observation_id":"5aef72a9-74e9-4ae5-ba0e-9be1fe7f9920","resolution":{"observed_at":"2026-08-04T18:28:42.194623Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.268541Z","title":"Tenneti and P","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.268541Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:6d0c99750d9b55758fd4374bed37af61dad4c3b28ca2315d92286b62f81100fe","observation_id":"403b75f1-2f2d-4d6e-8507-42fde507c71c","resolution":{"observed_at":"2026-08-04T18:28:42.268541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03496","last_updated":"2023-01-09T16:36:43Z","snapshot_observed_at":"2026-08-07T06:56:34.708387Z","submitted_at":"2023-01-09T16:36:43Z","title":"Time-Varying Graph Mode Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03496","snapshot_observed_at":"2026-08-04T18:28:42.376384Z","title":"Time-varying graph mode decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.376384Z"},"links":{"cited_paper":"/paper/2301.03496","citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:6443b0df965321c3235cf808be068d042d1c97e69ba2a852ea0478926e4fd8c3","observation_id":"c8d1e7f2-c5f3-46dc-9603-76ec87c29262","resolution":{"observed_at":"2026-08-04T18:28:42.376384Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.447279Z","title":"Bruckstein","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.447279Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:c5cee42b40b825d2b7f8d2afd2e6cd5672e292a515af7563b09e0c0c73b19b34","observation_id":"d2e5c52b-b10d-4acf-86ed-11d07548460f","resolution":{"observed_at":"2026-08-04T18:28:42.447279Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.530055Z","title":"Generalized orthogonal matching pursuit","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.530055Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:bdb3e060090cbde9773e5114cb42c1711c4f213a96dceadd6d56382ff3b9015d","observation_id":"4d5d2172-987d-48bc-88dc-92ab22b754cb","resolution":{"observed_at":"2026-08-04T18:28:42.530055Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.681862Z","title":"Robust face recogni- tion via sparse representation","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.681862Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:320bd388b9e8abb3ceeb2936f0970b3357b65e01db81700ca3ef0c2b4803ce4d","observation_id":"6e953072-b3c0-49fb-9eec-8e737253167c","resolution":{"observed_at":"2026-08-04T18:28:42.681862Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.759671Z","title":"Joint-2d-sl0 algorithm for joint sparse matrix reconstruction","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.759671Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:c6c4ba72018a1953138b5936bce68498705b8ca162197cca7e11cad42951995b","observation_id":"eb76b810-a005-4914-914f-b1a20f6a14f2","resolution":{"observed_at":"2026-08-04T18:28:42.759671Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.852840Z","title":"Improved separable dic- tionary learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.852840Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:b5b77ebeb529d6e4634ffa7c559b2305f88abd7ddc11ac45c88918fe2c280160","observation_id":"418d6e98-2749-46ee-a763-07d9b7a74982","resolution":{"observed_at":"2026-08-04T18:28:42.852840Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.900858Z","title":"Analytic separable dictionary learning based on oblique manifold","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.900858Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:cfbb41ad29cfbecb16885abfa60109cb14f984994093d6e9db39298c16ba5cd8","observation_id":"f255bd56-0c52-469e-890a-036a93151566","resolution":{"observed_at":"2026-08-04T18:28:42.900858Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:42.990675Z","title":"A survey of sparse repre- sentation: algorithms and applications","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:42.990675Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:9b4efebbb9f9d429ac456b6f5576ed8ac2f39ecc3e415d82d0ccc43b6dd3efc1","observation_id":"9ab4991d-8e93-46cc-be41-d97da6d64370","resolution":{"observed_at":"2026-08-04T18:28:42.990675Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:43.141680Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T18:28:43.141680Z"},"links":{"citing_paper":"/paper/2509.10033"},"observation_digest":"sha256:b154e68c901a1180c458612df8bfa6ad1612d7e1c88acbdbff101b56435f4064","observation_id":"389b5f2a-26a5-4361-b4f9-6d1714fe1262","resolution":{"observed_at":"2026-08-04T18:28:43.141680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10033","last_updated":"2026-07-15T05:19:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T08:12:16.105798Z","submitted_at":"2025-09-12T07:53:33Z","title":"Multi-Dictionary Learning for Low Rank Sparse Coding"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"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 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2509.10033."}