{"as_of":"2026-08-16T17:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74a752f89ce368067493e49ed874a9513a86cad14c0f60c06b2d290f8143851c","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:02:39.609788Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"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.07878/citation-record","integrity":"/paper/1908.07878/integrity","json":"/paper/1908.07878/citation-record.json","paper":"/paper/1908.07878"},"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-14T12:02:40.176330Z","title":"Label consistent K-SVD: Learning a discriminative diction ary for recognition ,","venue":null,"work_id":"df5ca63e-68c9-4bbd-8964-0146c45be066","year":2013},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.453083Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:4e5546cf9994657d616990923dfdd3893bd06950887a6a3f1529b41f1f53fe32","observation_id":"9182aa48-163a-419e-ba39-0d4df3959460","resolution":{"observed_at":"2026-08-14T12:02:40.180193Z","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-14T12:02:40.165291Z","title":"Sparse Codes Auto -Extractor for Classification: A Joint Embedding and Dictionary Learning Frame work for Representation,","venue":null,"work_id":"fb52cc37-f59c-47b5-818f-53f8b5bd0da2","year":2016},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.457561Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:26f6f0ba50fb646e481b609e11f90a75d180c285818cbe6e5ae3e1fda76d29dd","observation_id":"4effda1f-19ca-4b20-bf86-053b68b166cd","resolution":{"observed_at":"2026-08-14T12:02:40.169288Z","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-14T12:02:40.154175Z","title":"K -SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation,","venue":null,"work_id":"9c0cdbba-81b6-465e-8172-fcf9a0a42994","year":2006},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.461157Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:ffc427c1f588c798442a89840bc6f3814bfd9cff78cf703c6f0e7e8bda61a2c0","observation_id":"94cb55df-180b-44bc-b2e2-945a3cb5b47a","resolution":{"observed_at":"2026-08-14T12:02:40.158163Z","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-14T12:02:40.144330Z","title":"Robust Face Recognition via Sparse Representation,","venue":null,"work_id":"2c4a7504-6334-48e7-a698-e408b419c554","year":2009},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.464671Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:b511f8f46f57ef6651c9d68d85f58a7cf33fcbaf322a38d5c5bc153c76722eee","observation_id":"2b3311e1-1ee9-4414-a28b-9ae16186eb9b","resolution":{"observed_at":"2026-08-14T12:02:40.147818Z","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-14T12:02:40.134279Z","title":"A Locality-Constrained and Label Embedding Dictionary Learning Algorithm for Image Classification,","venue":null,"work_id":"48a4c2c9-f473-4f47-8b9b-1783b54ab2fc","year":2017},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.468474Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:b37036c4ac87da8b47ea5508cf4e84f2e4e778acea7b878395981eca736fe3cf","observation_id":"a6abdca1-e6f2-4818-b007-76fc01a88d2b","resolution":{"observed_at":"2026-08-14T12:02:40.137838Z","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-14T12:02:40.123746Z","title":"Discriminative K -SVD for Dictionary Learning in Face Recognition,","venue":null,"work_id":"f02f1328-3b81-42b9-bdea-75496b937ea8","year":2010},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.473014Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:df5bb9859271869a0c70d3c4d2310589b84ee024b708a1c68080e69efc828447","observation_id":"aca56e28-2999-4202-87d7-80a3b1275d81","resolution":{"observed_at":"2026-08-14T12:02:40.127482Z","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-14T12:02:40.113663Z","title":"Sparse Representation based Fisher Discrimination Dictionary Learn ing for Image Classification,","venue":null,"work_id":"e4a659fb-bcd7-410e-83dd-d75a7d98c70a","year":2014},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.476771Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:6a6bdc20454187adec740cfabe591261e41dfcb79d2c640d13e812a6d2e30457","observation_id":"de10b83d-ae31-4662-9147-52de7930a412","resolution":{"observed_at":"2026-08-14T12:02:40.117095Z","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-14T12:02:40.103665Z","title":"Classification and Clustering via dictionary learning with structured incoherence and shared features,","venue":null,"work_id":"2c3cf8e7-81fd-4a32-9f34-be87d43f8d72","year":2010},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.479980Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:90819308232441df4860403bc2307e1fc278a7ec3355065ed24c65be445ffdbe","observation_id":"e059093e-68c6-4a8c-8c3f-bc8c6e22114e","resolution":{"observed_at":"2026-08-14T12:02:40.107650Z","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-14T12:02:40.093409Z","title":"Projective dictionary pair learning for pattern classification,","venue":null,"work_id":"f6f6e8b5-3de0-488c-adf6-b3bf4443fad3","year":2014},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.483234Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:4f2436e9d57fd9300aa808d8520d9999a02120b9151153e0aa9b9493d6f38c80","observation_id":"107b708a-9db4-4cad-8929-7444b0e51eec","resolution":{"observed_at":"2026-08-14T12:02:40.097137Z","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-14T12:02:40.080726Z","title":"Structured Latent Label Consistent Dictionary Learning for Salient Machine Faults Representation based Robust Classification ,","venue":null,"work_id":"68cd9fe1-5df7-4d82-ac9e-cc26ecaa53c7","year":2017},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.486660Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:5414725f435fbe39b57b1f6db7cb42222f3f5ed9599efb2e68e069e25995d50f","observation_id":"421f42bb-8d92-4d4c-bf4e-80fb24e21046","resolution":{"observed_at":"2026-08-14T12:02:40.085078Z","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-14T12:02:40.069761Z","title":"Jointly learning structured analysis discriminative dictionary and analysis multiclass classifier","venue":null,"work_id":"b9a0f857-962d-410d-804b-a917e937bbd0","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.490154Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:d204484f7bf655aa713ff4fd7244f37797d26f0ed425acd836c4249c56e095dc","observation_id":"58730257-5c13-47da-bc06-16045f5bb273","resolution":{"observed_at":"2026-08-14T12:02:40.073459Z","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-14T12:02:40.058869Z","title":"Joint label consistent dictionary learning and adaptive label prediction for semi-supervised machine fault classification,","venue":null,"work_id":"b95d733c-cd66-48d2-a3d1-d86341f60366","year":2016},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.493412Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:cca23adbb1e3ab6a121d2012955dfe915859e7be84cd3036cbe04f7ede46610f","observation_id":"8aa676fb-0c99-4ec0-b7b7-72ee5a2ed560","resolution":{"observed_at":"2026-08-14T12:02:40.062679Z","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-14T12:02:40.047716Z","title":"Sparse Dictionary -Based Representation and Recognition of Action Attributes,","venue":null,"work_id":"e525f826-0ccf-48ad-bccb-fbf21118284d","year":2011},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.496814Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:aa4dd976ba8c0ccdafd337b07b4a1965dc2d24805ccbd654a29574ffb859ffb8","observation_id":"dcd6cb8d-b790-44cd-892b-80f19ea4f932","resolution":{"observed_at":"2026-08-14T12:02:40.052235Z","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-14T12:02:40.036822Z","title":"Image denoising via sparse and redu ndant representations over learned dictionaries,","venue":null,"work_id":"161466cf-e5f6-4ff8-b32d-2c97ba49d089","year":2006},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.500316Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:3c0d2e36989c4a27ba197064182c181938bdee3a3545b86816957de78c35939e","observation_id":"771ce23e-6316-4e70-bf1d-0aa66ee0948b","resolution":{"observed_at":"2026-08-14T12:02:40.040685Z","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-14T12:02:40.025644Z","title":"Dictionaries for sparse representation modeling,","venue":null,"work_id":"feaa78da-18a3-43f6-a75a-dd229cfd313e","year":2010},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.503622Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:0bf39e1222bb17c76ddf5ce68b05d0ab723eb87b90b8f01e45a91bf693f2a510","observation_id":"a5fe011a-33e0-4eed-ac06-046e44f21af0","resolution":{"observed_at":"2026-08-14T12:02:40.029993Z","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-14T12:02:40.014938Z","title":"Fast low -rank shared dictionary learning for image classification,","venue":null,"work_id":"4aa4ab3a-83b2-431f-8f0b-efb71ba359bd","year":2017},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.507121Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:23af4aa1251e53668bbeb6f655736ede82f77a74abf6eae4d3297797bdfcd9e8","observation_id":"94823a4f-0fc2-4df9-a7c4-06c9be4667ab","resolution":{"observed_at":"2026-08-14T12:02:40.019187Z","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-14T12:02:40.004053Z","title":"Discriminative Sparse Flexible Manifold Embedding with Novel Graph for Robust Visual Representation and Label Propagation,","venue":null,"work_id":"3b45ded3-6988-4fb5-ad1f-5aea437be3de","year":2017},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.510267Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:bf5662df4154dca90fe2fdf8b16641ad7859c5956673bc61c085065998428c1a","observation_id":"7927675b-6626-40fe-b3bb-2a98aa947d50","resolution":{"observed_at":"2026-08-14T12:02:40.007811Z","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-14T12:02:39.993498Z","title":"Robust Spar se Linear Discriminant Analysis,","venue":null,"work_id":"a9c6ec9a-ff52-4c7a-943e-dd07f1208634","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.513673Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:4c24e65053e6b2314a35088cc074d51a0ab7a215413478930e04ddb58c53443c","observation_id":"fee7bd6b-d93a-4ac6-9097-f4039116f978","resolution":{"observed_at":"2026-08-14T12:02:39.997439Z","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-14T12:02:39.982504Z","title":"Submodular Dictionary Learning for Sparse Coding,","venue":null,"work_id":"d0bd8e23-c68c-4b61-922c-92fc0467b951","year":2012},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.517234Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:bc592e5291941391cc2184f3927516fda3c6607b1677f14257a3421af724700a","observation_id":"9c454b0b-134b-47f4-9f9f-2310d10547a5","resolution":{"observed_at":"2026-08-14T12:02:39.986769Z","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-14T12:02:39.971546Z","title":"Block-relaxation algorithms in statistics,","venue":null,"work_id":"63b91b31-e696-4bb4-b1bf-8f50364d870b","year":1994},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.520757Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:b68eddf49b3472cf51d2faf91b69b5e4442a037a1bd6e3822c52902057b57c08","observation_id":"e25e6890-4164-462d-8710-af386192fd06","resolution":{"observed_at":"2026-08-14T12:02:39.975526Z","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-14T12:02:39.960892Z","title":"Minimization of a non -separable objective function su bject to disjoint constraints,","venue":null,"work_id":"460f1da6-f59c-42c0-b27d-0a21d43b4253","year":1976},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.524575Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:ca7bbd430af552e8db09f44b627ec3d58ca84110a82966f5fafd75573b71e2be","observation_id":"b9ac0292-315a-4d4b-a203-bc5efd969368","resolution":{"observed_at":"2026-08-14T12:02:39.965136Z","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-14T12:02:39.950610Z","title":"Biconvex sets and optimization with biconvex functions: a survey and extensions,","venue":null,"work_id":"0b291bdc-d4af-4019-a6a9-1c35bee684a3","year":2007},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.528023Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:2d71a6a8db0ef1b02f2b58f9d75f0bbd8bd451b68e503592f41dd8dc5bc996cd","observation_id":"405f2d52-da31-4161-a49e-0b727f2b9c53","resolution":{"observed_at":"2026-08-14T12:02:39.954218Z","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-14T12:02:39.938851Z","title":"Document clustering using locality preserving indexing,","venue":null,"work_id":"63c4f0f5-2072-4012-8a1c-827b0c27feab","year":2005},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.531810Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:d69e4769a91969154592016767a1f5107e845d070ded79bae0334444abb78994","observation_id":"d8ad125b-e486-4da3-bf4e-f6135262d422","resolution":{"observed_at":"2026-08-14T12:02:39.943787Z","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-14T12:02:39.928269Z","title":"Laplacian score for feature selection,","venue":null,"work_id":"ee419281-f8ca-4f1d-ac0d-1f16d340f82f","year":2005},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.535293Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:0fdcc50c8bcb0742043c1f85589d05e240747eb601ff9741cd46bdb9664bac3e","observation_id":"e1fb98ee-371a-4e6c-bb9e-66465f53f36d","resolution":{"observed_at":"2026-08-14T12:02:39.932286Z","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-14T12:02:39.918221Z","title":"Parameterisation of a stochastic model for human face identification,","venue":null,"work_id":"0cebb96a-40be-4a7d-9072-5c41e92b5328","year":1994},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.538696Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:6dd83652c1087f08e4b861ab351dd64ed934755ffd37dea7d3d2ecb8ed8cebc7","observation_id":"2edfe83f-14ba-482f-beec-e9acef0fbc97","resolution":{"observed_at":"2026-08-14T12:02:39.921917Z","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-14T12:02:39.908410Z","title":"From Few to Many: Illumination cone Models for Face Recognication under Variable Lighting and Pose,","venue":null,"work_id":"54267abe-5f9b-4118-a6fa-6bd2f4114ee7","year":2001},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.541789Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:43b7c4541f6840513837696fc40754a68fe9d989a33c5b0ed5f4b82064785766","observation_id":"c935090e-a96a-4b9b-b585-80e96adb2e47","resolution":{"observed_at":"2026-08-14T12:02:39.912099Z","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-14T12:02:39.897720Z","title":"Characterizing virtual eigensign atures for general purpose face recognition,","venue":null,"work_id":"75ebfa44-50fa-42fd-a95f-0f52bd902873","year":1998},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.545249Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:cb058d026110abad4ddae12eaced47e5b98cf70b946a5c30e79774fdb3420d4b","observation_id":"c765a3f3-a97d-4fde-8e29-8bacd11e4140","resolution":{"observed_at":"2026-08-14T12:02:39.901648Z","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-14T12:02:39.887968Z","title":"The AR face database,","venue":null,"work_id":"be4811bd-01b7-4ade-8cbd-9b361e6b9feb","year":1998},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.548699Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:7db64256b041a77d9ae09151944037e2e4e993a29459e44d4de1003a3a605511","observation_id":"c674d658-62e4-4acb-a5a2-0234f8fa4ede","resolution":{"observed_at":"2026-08-14T12:02:39.891565Z","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-14T12:02:39.877346Z","title":"The CMU pose, illumination, and expression (PIE) database,","venue":null,"work_id":"da1f9772-236e-45dc-a999-f0f911cc3ed0","year":2002},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.552060Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:166e60cb1ee2b44567bcc1076e6e6f38ada0f2a87f5ce9bedb5189473a2c42f2","observation_id":"1e7e0046-fe57-45b9-96d2-7d08e219b3ba","resolution":{"observed_at":"2026-08-14T12:02:39.881259Z","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-14T12:02:39.866045Z","title":"Analyzing appearance and contour based methods f or object categorization,","venue":null,"work_id":"fd71d303-e122-4f5b-b274-fea469d28678","year":2003},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.555306Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:e3b00af9bebcdf5e901237fc55528c9c00b22ba47baf2ce83bb3af2cd49a97df","observation_id":"83124c44-70e0-4a75-8042-134b38c4677a","resolution":{"observed_at":"2026-08-14T12:02:39.870018Z","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-14T12:02:39.856076Z","title":"Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories,","venue":null,"work_id":"e0c9ff17-027c-43b5-af6d-9390da68f648","year":2006},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.558843Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:259f14d1e63bb8732d6f9c57e9c775655e029cca6c37c68ea50734c8d94b7ebc","observation_id":"bfcd4314-2886-4c97-b70f-5099f3926f67","resolution":{"observed_at":"2026-08-14T12:02:39.859719Z","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-14T12:02:39.845175Z","title":"A dictionary learning approach for classification separating the particularity and the commonality,","venue":null,"work_id":"054f9a8d-2cb1-43c2-b8c4-514ba518352b","year":2012},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.562516Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:be3906e5d5c9e630989254913b76ccf4bc5e5a530bc28157b9b900872da3d88e","observation_id":"f6518970-ca3d-401e-a7d3-90e9566df923","resolution":{"observed_at":"2026-08-14T12:02:39.849091Z","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-14T12:02:39.835650Z","title":"Introduction to Statistical Pattern Recognition ,","venue":null,"work_id":"70fbc009-7346-4b0c-b074-da56062111c1","year":2002},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.566791Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:eb3d45cd2ec4fffb5e07491a3e5d075562c7c1344b81271d49db3f8ac9624aa4","observation_id":"17f36374-5462-4044-bcbd-f72ff66a0c7b","resolution":{"observed_at":"2026-08-14T12:02:39.839297Z","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-14T12:02:39.825670Z","title":"Uncertainty principles and ideal atomic decomposition","venue":null,"work_id":"b69149e2-477b-45bd-8ff3-2381d9a926a9","year":2001},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.570502Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:7a8b78445c1cf5b6575f63dfaf30561bf4fcdcc365462bdbb3f8aff104fff64e","observation_id":"f39a7eb3-3fe5-4155-bfed-7b652cb4d720","resolution":{"observed_at":"2026-08-14T12:02:39.829318Z","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-14T12:02:39.814699Z","title":"Reconstructible Nonlinear Dimensionality Reduction via Joint Dictionary Learning,","venue":null,"work_id":"5f61d970-475a-4756-bee2-a5614c293e44","year":2019},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.574038Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:8a8ff03adf245527c56395dc4a3e0f2d1e0e8bb6a47e9c07760bbf896df8c259","observation_id":"a9d53098-99f8-41ab-a8ba-afb9507670ba","resolution":{"observed_at":"2026-08-14T12:02:39.818387Z","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-14T12:02:39.804341Z","title":"Robust Locality-Constrained Label Consistent KSVD by Joint Sparse Embedding,","venue":null,"work_id":"4d558a0a-4198-401e-9114-652f563d2538","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.577646Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:b11253178570aa4baf7fff3ba5666e5f0a7ba3f75e1e36d702435259f6074990","observation_id":"fe7b68f4-bb58-43c7-bdc9-176bb063cf0d","resolution":{"observed_at":"2026-08-14T12:02:39.807979Z","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-14T12:02:39.794419Z","title":"Comp onent-based Face Recognition with 3D Morphable Models,","venue":null,"work_id":"a9af954c-583a-4786-b72d-7e4929f387b7","year":2004},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.581207Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:b9468944d442d831b4e06b5c22d8711324b86bd0c5e9817e9e4ddbfe0255664e","observation_id":"8132e950-89e0-42a6-9d52-0e502f43e63e","resolution":{"observed_at":"2026-08-14T12:02:39.797988Z","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-14T12:02:39.782624Z","title":"Discriminative Robust Deep Dictionary Learning for Hyperspectra l Image Classification,","venue":null,"work_id":"14df143f-74d4-4e1e-9e7f-523e82ee537c","year":2017},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.584465Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:3cd707d5556d23201c00c953c6b068f014e34a5c654c664cdb797d3804eb2b42","observation_id":"76f61670-f0de-4109-a69b-b6e432e3cd5d","resolution":{"observed_at":"2026-08-14T12:02:39.786535Z","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-14T12:02:39.770456Z","title":"Contextual Online Dictionary Learning for Hyperspectral Image Classification,","venue":null,"work_id":"de541dde-b829-4137-9e36-3eb79c47cd01","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.587721Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:ea6f593291c1d9318c9221b4555dbe4b671a675cf918cd09c9219edaf5728243","observation_id":"013365dc-e559-41fc-8a71-9b225c545aac","resolution":{"observed_at":"2026-08-14T12:02:39.775141Z","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-14T12:02:39.758841Z","title":"Imagenet classification with deep convolutional neural networks,","venue":null,"work_id":"55e31708-6716-46bd-8076-5a582166c66c","year":2012},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.590966Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:df3527cab805c1263a7b7ee1be9b6211dddc3489a3de27d3d18dbceb5450635b","observation_id":"43d80300-b538-4b21-a77c-30c56597f997","resolution":{"observed_at":"2026-08-14T12:02:39.763056Z","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-14T12:02:39.748336Z","title":"Robust Projective Low-Rank and Sparse Representation by Robust Dictionary Learning,","venue":null,"work_id":"b1a5bc80-ddae-450e-bbc0-14c9563622ce","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.594520Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:fe84d6f56c61c20a338c58dc5d2a68a7214d0a05b829f43b1b5b1175f3436587","observation_id":"17fc4c4c-b324-4a81-9243-e6c7a9c2e75d","resolution":{"observed_at":"2026-08-14T12:02:39.752025Z","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-14T12:02:39.737107Z","title":"Self -Expressive Dictionary Learning for Dynamic 3D Reconstruction,","venue":null,"work_id":"7cd194c8-0005-45a5-b601-b0ab4845e61d","year":2018},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.598329Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:35d645a80342b0f1c7a8a6012d45440e6293ffc3cde05373eb15f24c5628ea5b","observation_id":"d6d008ff-9e2b-47a3-b2ea-6d5e0259e4ba","resolution":{"observed_at":"2026-08-14T12:02:39.741523Z","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-14T12:02:39.725392Z","title":"Joint Subspace Recovery and Enhanced Locality Driven Robust Flexible Discriminative Dictionary Learning,","venue":null,"work_id":"fd318fff-435b-4da8-8f4e-482bc0f21932","year":2019},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.602116Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:6fe57689ace6bd6f0dabb7a6c223350bbdfe2aa5b3bff07be2f06adfbbdfe830","observation_id":"08db3f07-e713-4b60-8c25-f61c44d9be7a","resolution":{"observed_at":"2026-08-14T12:02:39.729541Z","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-14T12:02:39.708665Z","title":"Scalable Block- Diagonal Locality -Constrained Projective Dictionary Learning,","venue":null,"work_id":"2735004b-111c-45c9-92b9-867d6fd702eb","year":2019},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.605731Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:5d21b604ce1eb79ae3ea5d7cdc0e81d2065af26b235fd392033f4b7f87fcad29","observation_id":"ba749099-4779-45a2-bfb5-f799491bb48c","resolution":{"observed_at":"2026-08-14T12:02:39.716071Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:02:39.609788Z","title":"Discriminative Fisher Embedding Dictionary Learning Algorithm for Object Recognition,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:02:39.609788Z"},"links":{"citing_paper":"/paper/1908.07878"},"observation_digest":"sha256:33c506debffa827c3724084a3f040e70a37f94ad65a7bc33400a5912070e6121","observation_id":"64df585d-3fd0-44a6-8346-b9d889faf430","resolution":{"observed_at":"2026-08-14T12:02:39.609788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.07878","last_updated":"2019-08-21T13:59:00Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T14:23:38.847474Z","submitted_at":"2019-08-21T13:59:00Z","title":"Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":45},"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 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:1908.07878."}