{"as_of":"2026-08-16T11:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fde0124282561719cfb84677760e784bf265c348bae7ff9dfb5f1ffd430aaceb","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:34.478313Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"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.06210/citation-record","integrity":"/paper/1908.06210/integrity","json":"/paper/1908.06210/citation-record.json","paper":"/paper/1908.06210"},"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:02:35.387821Z","title":"On the adversarial robustness o f subspace learning,","venue":null,"work_id":"b9555a1a-0c8b-4c92-b3f5-cdd4f10cc2b8","year":2019},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.202910Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:0974c7f2778ce02bdbc60db13f7d0f62aa47655d0b2020aa58bb694080629258","observation_id":"82cd57b4-01db-44e2-8fe5-b3977fc43fc1","resolution":{"observed_at":"2026-08-14T13:02:35.393321Z","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:02:35.363987Z","title":"Structure d sparse representation with union of data-driven linear and multil inear subspaces model for compressive video sampling,","venue":null,"work_id":"32b2530c-7bd8-42ef-88ce-07894e355c2c","year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.250080Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:7493cc971a6eee39eb7f39480a9188c772187d6d2643a4f5bcedbaefd49ae0c5","observation_id":"4654992a-3355-4cce-b542-8d72c8961ea5","resolution":{"observed_at":"2026-08-14T13:02:35.374845Z","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:02:35.342706Z","title":"Subspace-based adaptive m ethod for estimating direction-of-arrival with luenberger observe r,","venue":null,"work_id":"be17e6a9-31fd-4c63-8068-73dc5f32be5d","year":2011},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.262728Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:67acc4b09cc1312a8b2ca12e2880e20ad4f15f31292d767b8f28de4e5f543761","observation_id":"f5ea69cd-b499-4358-bf46-5229a5883b4e","resolution":{"observed_at":"2026-08-14T13:02:35.349821Z","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:02:35.315147Z","title":"Online categor ical subspace learning for sketching big data with misses,","venue":null,"work_id":"0407e18c-cb8f-472b-9e68-d2ad3803ccc6","year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.275269Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:cee7096aa2f37baed5294a92d516d6e25919d63dcb1f9915e5c510ff6b0a253d","observation_id":"cebd7ecb-f944-497e-a1f6-72a33f94e122","resolution":{"observed_at":"2026-08-14T13:02:35.321332Z","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:02:35.296503Z","title":"An online algorithm for se parating sparse and low-dimensional signal sequences from their sum ,","venue":null,"work_id":"67d25ed5-f6a3-4034-9e9e-69e99a698381","year":2014},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.283152Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:849610db25ad7a62681082eae1e7312d35b8a1ca13c405cfee5fc1ebaa3e6562","observation_id":"c9388a38-a2ac-416f-90a0-a3bd7b92b499","resolution":{"observed_at":"2026-08-14T13:02:35.301378Z","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:02:35.257129Z","title":"Low-rank pl us sparse matrix decomposition for accelerated dynamic MRI with sepa ration of background and dynamic components,","venue":null,"work_id":"ab760201-e6d4-4ea1-8697-6487cc3a8662","year":2015},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.294096Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:e52df98c3b0e0d01eae10f781e18db955ec180b335ad1fd203311181aa2dfb8d","observation_id":"c7b4f34d-a136-4898-b36d-dbea95ededf8","resolution":{"observed_at":"2026-08-14T13:02:35.268067Z","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:02:35.220726Z","title":"Matrix factorizatio n techniques for recommender systems,","venue":null,"work_id":"383732a0-6146-4b00-9e15-c6f0537f2a0a","year":2009},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.302464Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:04c32258334d6f6b1e4124fae679da31486100b554a3c19bb3014910878b31a5","observation_id":"210b77a4-735e-4c7b-9efb-cb8a05704944","resolution":{"observed_at":"2026-08-14T13:02:35.231263Z","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:02:35.200394Z","title":"Dynamic anom alog- raphy: Tracking network anomalies via sparsity and low rank ,","venue":null,"work_id":"364725e6-c7d4-4cfa-b69e-8afc3a7a9b70","year":2012},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.308081Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:d7fad0e97cabeef9254db4455f1d64e2b0752c98a72d1d32887d8a027e7313bd","observation_id":"55ef856c-5761-4c93-9837-bb5c1744135d","resolution":{"observed_at":"2026-08-14T13:02:35.206243Z","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:02:35.175302Z","title":"Video denoising via online sparse and low- rank matrix decomposition,","venue":null,"work_id":"6d61afc7-3161-4359-a2f3-38371c728c79","year":2016},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.314325Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:1672d0e7616e011b25c15d4ad87a4bb4b5f8be1cc2ce22d770ff6bb12f21d768","observation_id":"f651f88c-ae29-425c-842e-d7cc74f1e210","resolution":{"observed_at":"2026-08-14T13:02:35.184185Z","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:02:35.153571Z","title":"Robust princi pal component analysis?","venue":null,"work_id":"fa4dd5f0-f4ad-4b9a-be23-f1dd3d881b7e","year":2011},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.320616Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:39b8b838c7cb0b2caa12fb9aec0eb65f48b5ec7005c4736485f6b13d01f12678","observation_id":"3a5129c8-6f42-4aed-83e4-fe7244226448","resolution":{"observed_at":"2026-08-14T13:02:35.159170Z","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:02:35.129692Z","title":"Robust matrix decomp osition with sparse corruptions,","venue":null,"work_id":"9144aed7-958f-4356-9a54-ab5f850e85d6","year":2011},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.326251Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:1926366ed2b9635a7b469768f23267cbeabd7b8bbc0aa64922ecedfb5e957e3a","observation_id":"55977c37-c2ba-4bde-ba7b-db57108de70d","resolution":{"observed_at":"2026-08-14T13:02:35.135880Z","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:02:35.096640Z","title":"Recursive ro bust PCA or recursive sparse recovery in large but structured noi se,","venue":null,"work_id":"72272822-84da-4a7f-ac33-d8e47483452a","year":2014},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.335014Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:05db20fede8e5431bf3f3b41440a91072525c7aee5ff69f7b4af44f42403328a","observation_id":"2acab2dc-60db-499f-9ec3-59ae60482838","resolution":{"observed_at":"2026-08-14T13:02:35.105404Z","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:02:35.073311Z","title":"Robust ma trix completion and corrupted columns,","venue":null,"work_id":"6e12cba9-af57-4e3b-9efd-ed74321e1b37","year":2011},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.339816Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:33b8b5d9ccd12133d44e197b8e07e1a84bf1d48420689e9edf9b4cb9cc2248dd","observation_id":"0b7f1c7a-a222-43e0-a9b4-91b769e3874a","resolution":{"observed_at":"2026-08-14T13:02:35.078976Z","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":"1707.08945","last_updated":"2018-04-10T16:22:47Z","snapshot_observed_at":"2026-08-14T20:44:49.961329Z","submitted_at":"2017-07-27T17:37:22Z","title":"Robust Physical-World Attacks on Deep Learning Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08945","snapshot_observed_at":"2026-08-14T13:02:34.345239Z","title":"Robust physical-world at tacks on deep learning models,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.345239Z"},"links":{"cited_paper":"/paper/1707.08945","citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:3b25daafd5b7f1fb0baf93dc6f166698832898cbd330fb915bd9ce222200d5ff","observation_id":"c7591962-906d-4f03-90a3-7fb221b197ae","resolution":{"observed_at":"2026-08-14T13:02:34.345239Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:35.053460Z","title":"Hidden voice commands,","venue":null,"work_id":"8ece2c70-4ac5-4a7e-b805-04ad11ef1cea","year":2016},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.352713Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:8542160ec6edbc4391cc4eb61412c7cb86fc1ef0757f864b6e54155502b04cb1","observation_id":"371b0273-2d50-4f5b-8b83-96f1bd8b9d5e","resolution":{"observed_at":"2026-08-14T13:02:35.060158Z","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:02:35.030385Z","title":"Adversarial attacks on medical machine learning,","venue":null,"work_id":"6088f2e3-faac-4a83-b40a-5ab19da77fc0","year":2019},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.358447Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:5ed33debc71a8864758c7345ea71de927268185db9680b44402d03065dcd39cb","observation_id":"b741b252-99a1-493c-82f5-1a607205416b","resolution":{"observed_at":"2026-08-14T13:02:35.038364Z","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":"1712.05526","last_updated":"2017-12-15T04:26:26Z","snapshot_observed_at":"2026-07-06T06:14:30.795326Z","submitted_at":"2017-12-15T04:26:26Z","title":"Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.05526","snapshot_observed_at":"2026-08-14T13:02:34.363223Z","title":"Targeted backd oor attacks on deep learning systems using data poisoning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.363223Z"},"links":{"cited_paper":"/paper/1712.05526","citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:524b1e799c83a0740326a6e4d85d53ab1d441c4bf32f2337bd3addfdbdf2b0da","observation_id":"fd157970-f261-4885-9688-8e2dbf8d7c3c","resolution":{"observed_at":"2026-08-14T13:02:34.363223Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:35.007604Z","title":null,"venue":null,"work_id":"a9f41fc4-e8a2-4cef-8d45-32092320c34f","year":2013},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.368707Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:8031331030ca19f3ded167c1492338d713925f71af4608e69d4418505435438c","observation_id":"fa8e9392-ab5a-48b5-bceb-f860fe94c40a","resolution":{"observed_at":"2026-08-14T13:02:35.014298Z","resolver_source":"raw_fallback","status":"unresolved"},"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:02:34.981507Z","title":"The geometry of algorithms with orthogonality constraints,","venue":null,"work_id":"ca1c7a27-1550-4d0a-b21b-0661b9896277","year":1998},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.374048Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:78d8b503aa63fe311c9ddc8fd33b77ece42606a91a13f30799f4df37885b6867","observation_id":"90662f66-beeb-464d-a290-bdbed77272ee","resolution":{"observed_at":"2026-08-14T13:02:34.987626Z","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:02:34.960684Z","title":"Almost invariant submanifolds for comp act group ac- tions,","venue":null,"work_id":"36463aec-a7f3-4afc-9357-3d07ee5c63d0","year":2000},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.379770Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:3dfd9e67158351ab97dc2fabfa832fe74b2c1c61f3d7a23a5fec5a1a95065aac","observation_id":"7569839a-724c-4266-8f46-8a967b136451","resolution":{"observed_at":"2026-08-14T13:02:34.966441Z","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:02:34.934364Z","title":"Optimal robustness in th e gap metric,","venue":null,"work_id":"bc205169-f5f1-4da5-a2e0-51ecb5c9480d","year":1990},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.384876Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:74818cb7414d51a62e7af71b167ae1402db47bee2f0d5c5b44ba8fb875012876","observation_id":"24d94bde-d93d-4bda-a9a5-c862de362336","resolution":{"observed_at":"2026-08-14T13:02:34.945235Z","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:02:34.902942Z","title":"Frequency domain uncertainty and the g raph topology,","venue":null,"work_id":"8057028b-4974-44e1-bd4a-77c772b9d391","year":1993},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.391962Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:0eaa7c9911ab7c46e57ee27f5e996703a8442594ab0913b3b4ceb80f6b8833d1","observation_id":"15e3ee25-848d-482c-8ea6-8e1a5c5c2fb7","resolution":{"observed_at":"2026-08-14T13:02:34.909687Z","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:02:34.874580Z","title":"Feedback stability under simult aneous gap metric uncertainties in plant and controller,","venue":null,"work_id":"eac196fa-581f-4c10-853d-a38ecc7ce1fb","year":1992},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.403435Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:16e0f62b271736e842f42f268b66b018e8f57d0e644639331c5bf5f7d6571562","observation_id":"553211f1-d8e1-4b71-a49c-631b8a4e165c","resolution":{"observed_at":"2026-08-14T13:02:34.883990Z","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:02:34.846496Z","title":"Manipulating machine learning: Poisoning attacks and cou ntermeasures for regression learning,","venue":null,"work_id":"644e0c9b-d6be-4da5-becb-a99e30ee45a7","year":2018},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.408870Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:a5fe7592d6bcd06d817ca3fbb363c96f141b39f9864c51a8023587769bbc00ef","observation_id":"6325630f-beeb-416a-a7ca-bea1c3b56e11","resolution":{"observed_at":"2026-08-14T13:02:34.853379Z","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":"1903.11220","last_updated":"2019-03-27T01:54:16Z","snapshot_observed_at":"2026-08-14T16:56:14.542997Z","submitted_at":"2019-03-27T01:54:16Z","title":"On the Adversarial Robustness of Multivariate Robust Estimation","version":1},"cited_work":{"arxiv_id":"1903.11220","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.11220","snapshot_observed_at":"2026-08-14T13:02:34.564896Z","title":"On the Adversarial Robustness of Multivariate Robust Estimation","venue":"stat.ML","work_id":"c8ad26b0-4918-40c9-9a2b-8bccc0134e75","year":2019},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.414442Z"},"links":{"cited_paper":"/paper/1903.11220","citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:5d8bcd01ec8e2adc5b9bab8b93bfffff56978428aaa70711c2729a576e07edc4","observation_id":"6961d8a2-9078-4cdd-bcdf-7be287892d7f","resolution":{"observed_at":"2026-08-14T13:02:34.571208Z","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:02:34.817038Z","title":"Adversarial principal component analysis,","venue":null,"work_id":"b69725c2-e6de-42cd-b2d3-99374abd3dc4","year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.421685Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:61c6762d8bc55c0390cdc68ccbf40ccc4cd3a65351ed4e9dcd8a8646a721b370","observation_id":"7787afa8-f572-4cec-8494-788eef798c0e","resolution":{"observed_at":"2026-08-14T13:02:34.826040Z","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:02:34.790010Z","title":"The role of princip al angles in subspace classification,","venue":null,"work_id":"0067c5a3-83bc-4991-9d8e-bd361b153bf5","year":1933},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.427348Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:c27c349e8ece7db3397d0e9091542dc6ebcdaa9728420e66f0ce06f1cdbdb2f0","observation_id":"e1bb8241-5858-4a19-a666-0fa357343fba","resolution":{"observed_at":"2026-08-14T13:02:34.797594Z","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:02:34.752694Z","title":"Robust detection with the gap metr ic,","venue":null,"work_id":"e80c67cc-7715-4192-8831-7a1b4415049b","year":1997},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.433158Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:e035b912c8b02d24e7c95e9ece482755ac2992ee0404258cbe59b7bc381cc324","observation_id":"09d4ce3e-a5df-46c0-97e4-ddc776e62cbc","resolution":{"observed_at":"2026-08-14T13:02:34.766143Z","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:02:34.728955Z","title":"On the largest prin cipal angle between random subspaces,","venue":null,"work_id":"3a0d1f31-7f39-4ff8-9df4-0a1e39be7d1a","year":2006},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.443054Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:aab15abc92bd15bc7b8d49041ff77f28c1907566083d9fb800994b8f3c25ab80","observation_id":"b581e294-d583-44b5-b1ce-8be23d997b85","resolution":{"observed_at":"2026-08-14T13:02:34.736996Z","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":"1711.08235","last_updated":"2019-03-05T14:55:49Z","snapshot_observed_at":"2026-08-14T20:11:07.738207Z","submitted_at":"2017-11-22T11:33:07Z","title":"A geometric note on subspace updates and orthogonal matrix decompositions under rank-one modifications","version":4},"cited_work":{"arxiv_id":"1711.08235","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.08235","snapshot_observed_at":"2026-08-14T13:02:34.529655Z","title":"A geometric note on subspace updates and orthogonal matrix decompositions under rank-one modifications","venue":"math.NA","work_id":"243fcffc-d3fd-41b8-a3ca-b5ef7e488c8f","year":2017},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.449849Z"},"links":{"cited_paper":"/paper/1711.08235","citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:4ee86ce38bc780b86276525573386b616da60c7f5e4125f135122df2272a47e9","observation_id":"624f616c-2730-499f-835c-f12efacc28c8","resolution":{"observed_at":"2026-08-14T13:02:34.538260Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:34.456144Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.456144Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:8d8f2055b9ede3cb9a8d31b2f2c05cf136e6ee62c9f30592890d664199b28960","observation_id":"f4a90d5d-874a-401b-a034-e19e90a7a168","resolution":{"observed_at":"2026-08-14T13:02:34.456144Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:34.688908Z","title":"The behavior of eigenvalues and singul ar values under perturbations of restricted rank,","venue":null,"work_id":"464b9b85-d1cf-4f4a-903b-5b61f4bd581b","year":1976},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.462925Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:0d60b805209c4126cee5deb75499ccd02f41f210559cd1cce4046b80e59d2db4","observation_id":"77989e91-b3f2-43bc-86e9-3fabb3d50191","resolution":{"observed_at":"2026-08-14T13:02:34.695262Z","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:02:34.668782Z","title":null,"venue":null,"work_id":"39020ca1-eef1-4204-8427-8dd037c5e4af","year":2005},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.470754Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:dae2a849d4470fe8d2bd927b08c32a61b162f21ef2793bb95bf0226617629760","observation_id":"d8b93ee6-36ba-4dce-bfa5-fac73bf6d5c0","resolution":{"observed_at":"2026-08-14T13:02:34.675033Z","resolver_source":"raw_fallback","status":"unresolved"},"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:02:34.646718Z","title":"Two data sets of near infrared spectra,","venue":null,"work_id":"eadef44d-fb3f-49ef-8032-588c6dc84e85","year":1997},"citing_paper":{"arxiv_id":"1908.06210","last_updated":"2019-08-17T00:20:42Z","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:34.478313Z"},"links":{"citing_paper":"/paper/1908.06210"},"observation_digest":"sha256:a8c6a8cc3581561a36db663c3cb4661c0aca20e2ca48ad25522d1de43cb4eed8","observation_id":"1dfa00ce-0f87-430d-8446-ea333d513ed4","resolution":{"observed_at":"2026-08-14T13:02:34.652008Z","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.06210","last_updated":"2019-08-17T00:20:42Z","latest_version":1,"primary_category":"eess.SP","snapshot_observed_at":"2026-08-16T04:36:35.096017Z","submitted_at":"2019-08-17T00:20:42Z","title":"On the Adversarial Robustness of Subspace Learning"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":34},"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 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:1908.06210."}