{"as_of":"2026-08-12T13:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c635f49c0397df916d34671f8d2c4c6058dfe1fc6adac43a56ac5747ca875d09","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:19:22.849116Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.16819/citation-record","integrity":"/paper/2412.16819/integrity","json":"/paper/2412.16819/citation-record.json","paper":"/paper/2412.16819"},"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-11T10:19:23.662462Z","title":"Machine learning: Trends, perspec- tives, and prospects,","venue":null,"work_id":"b64a38ad-4e0e-449d-8c69-31af473588b8","year":2015},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.580299Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:6fadfbcb9e55762a1d4f3b09083664910392e816eb7ab822befd24e5f9898a02","observation_id":"0c4352e8-8554-4cce-89ac-9d4d67f04768","resolution":{"observed_at":"2026-08-11T10:19:23.667030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.647200Z","title":"A comprehensive review of dimensionality reduction techniques for feature selection and feature extraction,","venue":null,"work_id":"a268da19-04ec-4b72-99b9-36b2ade86514","year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.586681Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:4d13ed64d7c5e23db97417bc229c9c3a7c3968bff5ba3a035e9aa64cc8e5eb17","observation_id":"710bb891-9165-44af-a28c-3416bc6d225f","resolution":{"observed_at":"2026-08-11T10:19:23.652558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.632066Z","title":"Feature selection in image anal- ysis: a survey,","venue":null,"work_id":"acecd397-0acf-4e67-83c9-ec121990776b","year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.592142Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:1ca98870059185f25fa7fa7595e37c93b0214a5e5edccbd7e4807777657bf939","observation_id":"2ad57875-446f-4b18-a187-dfe9f11dff81","resolution":{"observed_at":"2026-08-11T10:19:23.636791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.597690Z","title":"Unsupervised feature selection via nonnegative spectral analysis and redundancy control,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.597690Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:26ad6f8df090f4698849f1da57453bf38c126956cfb40bbe3570c6738e58156a","observation_id":"1b4a00d8-6fd1-49d9-a498-3c76bdee459b","resolution":{"observed_at":"2026-08-11T10:19:22.597690Z","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-11T10:19:23.607721Z","title":"Bi-level spectral feature selection,","venue":null,"work_id":"ac813fdc-bb4f-4fba-b8f8-69fe37d6a7c0","year":2025},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.603009Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:a3a13a85f9db63ccf2acdec9d82e05fac92adc10441b7c37127984e276f90977","observation_id":"53ab8b9f-4673-4563-9161-76ed90219ec0","resolution":{"observed_at":"2026-08-11T10:19:23.612390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.592321Z","title":"Supervised, unsupervised, and semi-supervised feature selection: A review on gene selection,","venue":null,"work_id":"72ec73d6-9846-4d09-97db-44aaa9f31229","year":2016},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.608160Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:13b52b025160a7b5b78e68cde8535f5952c5f2f8e99c9b607f02144922561183","observation_id":"b2c27034-28ae-4831-811a-6258e8e6ddd4","resolution":{"observed_at":"2026-08-11T10:19:23.597284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.576402Z","title":"Unsupervised feature selection algorithm for multiclass cancer classification of gene expression RNA-Seq data,","venue":null,"work_id":"4744456a-2c8b-4a9c-ade1-3ca5a92b0f4f","year":1916},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.613950Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:02eaebcdb13ff6068a6b573a1ec4842bb2cc2c3d24cb1d85699113b62b30b619","observation_id":"09a8ce4d-cb71-44bf-85dd-178334a6dc98","resolution":{"observed_at":"2026-08-11T10:19:23.581419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.562580Z","title":"A review of machine learning methods of feature selection and classification for autism spectrum disorder,","venue":null,"work_id":"924793fa-8788-4de9-927b-7cd87a44dcbc","year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.618747Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:8a48697c20797b60201ad41e2f1f25e819878fd87fed22f6aed8614bef10a234","observation_id":"d9538276-054a-4892-8640-8ac7e9e31a8f","resolution":{"observed_at":"2026-08-11T10:19:23.567073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.547438Z","title":"Feature selection in machine learning: A new perspective,","venue":null,"work_id":"4f880381-c3ba-42a6-a0e6-b6461b9e57ee","year":2018},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.624108Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:e1b2487d27763b0585497e60cb0c0c360894971c1a8856379a155510ea7f95f7","observation_id":"df57e691-98e8-453e-9229-ffe3abfcbc31","resolution":{"observed_at":"2026-08-11T10:19:23.552581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.532709Z","title":"Feature selection for unsupervised learning,","venue":null,"work_id":"e290dec5-c100-41ae-af8e-4e6b35a25f26","year":2004},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.629724Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:2bdbc4ff37fe031088f08eccb3b86a689455a6a0ac55f5d97d9ddbdcf9c90f0d","observation_id":"49fff592-11f2-4804-9997-061d5977a717","resolution":{"observed_at":"2026-08-11T10:19:23.537896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.518033Z","title":"Unsupervised feature learning with emergent data-driven prototypicality,","venue":null,"work_id":"a08e2975-3648-4acf-b63d-259ad4548c11","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.635464Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:dbac62190643b838db2db9a271adabed6524e1bff226d57b66fdb277178b26dc","observation_id":"9ee61838-e3ff-41a6-bdd7-be21784a81f6","resolution":{"observed_at":"2026-08-11T10:19:23.523014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.639939Z","title":"A review of unsupervised feature selection methods,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.639939Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:20d4c0ae899923ce192b9698d7bdbc86e61f28f9ea14226bad4d481c8c21249b","observation_id":"66d8c7bb-9ea8-4f4e-89e1-77470a61eadd","resolution":{"observed_at":"2026-08-11T10:19:22.639939Z","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-11T10:19:23.493081Z","title":"Unsupervised discriminative feature selection via contrastive graph learning,","venue":null,"work_id":"04926fbc-f9f7-457a-965a-aaac998cf26b","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.644885Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:418f97c4e2159c1a84d04b9646ab690e39ab96361ff12e7931688460cdc1a72e","observation_id":"08133515-5818-42d3-922d-ec8891ed5554","resolution":{"observed_at":"2026-08-11T10:19:23.498022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.477712Z","title":"Unsupervised adaptive feature selection with binary hashing,","venue":null,"work_id":"b37f6988-286c-4e31-a0dc-d0e6c7a23005","year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.650132Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:3bea44afab36f754f98fefa2bb1024a754875be1e145289e11c09fa98104b072","observation_id":"9bdea0f0-58e0-45df-94f2-16d7013870bf","resolution":{"observed_at":"2026-08-11T10:19:23.482229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.461627Z","title":"Feature selection: A data perspective,","venue":null,"work_id":"ddb3a853-271a-40fd-b9e6-f835c259c360","year":2017},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.655915Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:5b8f01f8bab232a3644cca57d07246a4c8dafea830c01f28dc09b4237e43a386","observation_id":"dd42d7b6-4fbb-4175-896a-054120d0e3e9","resolution":{"observed_at":"2026-08-11T10:19:23.467129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.446022Z","title":"Laplacian score for feature selection,","venue":null,"work_id":"c02d87ea-8e08-4bd8-95c3-590401ad4c7d","year":2005},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.661109Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:e0adef544f2ee65b20edf6a117b72f502e28e1032d2fd6d417c09bc505e878f7","observation_id":"63c24002-a062-4058-bd23-58dcecdfa349","resolution":{"observed_at":"2026-08-11T10:19:23.451774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.428991Z","title":"Unsupervised feature selection for multi- cluster data,","venue":null,"work_id":"3289c3f9-4a31-4192-8ed6-58d6cd3e43aa","year":2010},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.666145Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:5d5b28c4419f57b3981204caecb29e40a9b3b67bc4e24bac528d98220c319c29","observation_id":"32da9a2e-d169-4687-8178-ceba55572e69","resolution":{"observed_at":"2026-08-11T10:19:23.434411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.411352Z","title":"ℓ2,1-norm regularized discriminative feature selection for unsupervised learning,","venue":null,"work_id":"2aa59b02-eddd-42f3-9603-f45f3e52061e","year":2011},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.671377Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:c3b1d011796c8d336c8e2ae638f0aad417cc7dfcac1f90bab66cee09a805d087","observation_id":"dc29bad4-a52c-42de-9422-424e427cfabd","resolution":{"observed_at":"2026-08-11T10:19:23.416194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.396222Z","title":"Unsupervised feature selection with structured graph optimization,","venue":null,"work_id":"211223ad-93b0-4b12-8df0-196415be3223","year":2016},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.675887Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:99bc6a7b8f0b43c62294bf8315b65ae2842a01f1b91ab02efef723e046c2c541","observation_id":"d1d1a16d-2117-4924-81fb-59957ca56f04","resolution":{"observed_at":"2026-08-11T10:19:23.401395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.380755Z","title":"Robust neighborhood em- bedding for unsupervised feature selection,","venue":null,"work_id":"c53cf0e3-35ac-4ce1-9b97-3de78c989cf1","year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.681266Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:1746ee9409275ec2763dc28dd5a2146bf96e3ad50d3ea99a808aac894c38f1b3","observation_id":"8377eeab-4e60-4ac9-9a76-9ae7f21fd4c7","resolution":{"observed_at":"2026-08-11T10:19:23.385822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.366285Z","title":"Precise feature selection via non- convex regularized graph embedding and self-representation for unsuper- vised learning,","venue":null,"work_id":"b8dec3ce-53fc-44c3-a27b-2c481e7fa85d","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.686549Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:2a2e51bc09b3b843d742dd30c8db1910e359d665c4d8b20536b2df2f4eb9ab0d","observation_id":"810680d3-fc04-4c03-b04e-80fb2a731103","resolution":{"observed_at":"2026-08-11T10:19:23.370726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.691208Z","title":"Principal component analysis,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.691208Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:14a9624b273c2b0232d8c0b2e6c9da4ccdd7d3e9fd750c222bfc6274ad85d413","observation_id":"f1e0c94d-9242-46de-a900-283718293949","resolution":{"observed_at":"2026-08-11T10:19:22.691208Z","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-11T10:19:23.341908Z","title":"A selective overview of sparse principal component analysis,","venue":null,"work_id":"75a5e798-5e03-4560-8b6e-055c86fbe0df","year":2018},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.696044Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:bbcd676e57d9f6e29bb337026247add87f475f131ece4fe446c0c044105439ae","observation_id":"61acaec7-422f-43d9-a1f7-2ea2200b53a1","resolution":{"observed_at":"2026-08-11T10:19:23.347402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.327214Z","title":"Sparse PCA via ℓ2,p-norm regularization for unsupervised feature selection,","venue":null,"work_id":"ab422028-7047-453e-8774-ddbbfe04f69b","year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.701303Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:4397189151f124e90b2eec9df2a37219dfa3c1386ccb9b267e45e06b1e4f6910","observation_id":"0ef73b88-7a57-47a4-a9da-53548d74cdb3","resolution":{"observed_at":"2026-08-11T10:19:23.332010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.311846Z","title":"A comprehensive survey on regularization strategies in machine learning,","venue":null,"work_id":"04199867-4957-45e9-8931-d81bba5e8167","year":2022},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.705887Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:9628fa7d7f1c929756863a7efd8a8d71bf1a5741b34efacad42022d0253e99c5","observation_id":"6a626651-0a0d-4a2d-aae8-9cd409ae505b","resolution":{"observed_at":"2026-08-11T10:19:23.316609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.710725Z","title":"Learning feature-sparse principal subspace,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.710725Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:2bdd6f21a500f289b84855a583c87a3cff86152ab890aab4b5c508a8d328ad4d","observation_id":"6b5c1e60-84da-4346-a1a1-7b1108f1c9c5","resolution":{"observed_at":"2026-08-11T10:19:22.710725Z","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-11T10:19:23.283227Z","title":"Struc- tured sparsity optimization with non-convex surrogates of ℓ2,0-norm: A unified algorithmic framework,","venue":null,"work_id":"b4ba1eba-0fbd-4a82-8d21-d2cba2702abd","year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.716002Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:663e13239cdccc969289723d989121b450c11e287fd92e6203bec07aceec077a","observation_id":"6ec741db-7341-4ef7-8551-cb8f7baa6bce","resolution":{"observed_at":"2026-08-11T10:19:23.288227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.06202","last_updated":"2023-09-12T13:10:06Z","snapshot_observed_at":"2026-07-06T16:17:26.924098Z","submitted_at":"2023-09-12T13:10:06Z","title":"Fast Sparse PCA via Positive Semidefinite Projection for Unsupervised Feature Selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.06202","snapshot_observed_at":"2026-08-11T10:19:22.721108Z","title":"Fast sparse PCA via positive semidefinite projection for unsupervised feature selection,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.721108Z"},"links":{"cited_paper":"/paper/2309.06202","citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:b013da787e491ef81805193c2cd5d4dbf709aa2caac831b4f61bd6cd0fa45dff","observation_id":"00b908f0-4f37-42bb-8d96-57a6862a15a3","resolution":{"observed_at":"2026-08-11T10:19:22.721108Z","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-11T10:19:23.267131Z","title":"Prin- cipal component analysis with fuzzy elastic net for feature selection,","venue":null,"work_id":"728303e6-ff3b-4eae-b93f-0f57367b6f7f","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.727493Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:6d44b5ae624bfbdca9954a9bcd615fcce151455722a5d55184ab45fdce5acdd4","observation_id":"965faeaa-7a5f-42be-b075-135d22fb673b","resolution":{"observed_at":"2026-08-11T10:19:23.271859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.251551Z","title":"Group sparse optimization via ℓp,q regularization,","venue":null,"work_id":"63542f4b-03cf-4982-b3d5-af908e365309","year":2017},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.732534Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:c49062df65e46f57ddc073953f30a1a4e034821d8810e25ee23339d69d08a27a","observation_id":"aa77b850-1f9a-4c82-bd11-354b120f9d86","resolution":{"observed_at":"2026-08-11T10:19:23.256406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.235829Z","title":"Double sparse- representation feature selection algorithm for classification,","venue":null,"work_id":"2a49141d-c20d-4f01-be42-55330d3091f1","year":2017},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.737526Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:296bf004e053fd59967898cb3f939ef698dc9b066e59227b8c751442f3819dbb","observation_id":"dbd39699-3e42-4637-9edd-6c64a2f15dd2","resolution":{"observed_at":"2026-08-11T10:19:23.240768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.220397Z","title":"Identifying disease sensitive and quantitative trait-relevant biomarkers from multidimensional heterogeneous imaging genetics data via sparse multimodal multitask learning,","venue":null,"work_id":"0a8c3746-d24a-47b3-97c2-cb143521be38","year":2012},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.742937Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:08e15a043bd5bb1c2a3d2065b49ce0cc313b86d6b7e22e3c29d6db419f7a9623","observation_id":"79ef546e-1e76-4efe-adc4-f49822f4d664","resolution":{"observed_at":"2026-08-11T10:19:23.225779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.203407Z","title":"Multi-view clustering and feature learning via structured sparsity,","venue":null,"work_id":"5423d9a5-1911-49ad-8343-df0092dcbd6a","year":2013},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.747562Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:9f00f467b4c51cf3ec2e721d4d3e220ad7f688df8e1ee77ec214fd9d94ee8c8a","observation_id":"cc47b976-ed09-4bbc-970e-894725305276","resolution":{"observed_at":"2026-08-11T10:19:23.208319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.186448Z","title":"Double sparsity: Learning sparse dictionaries for sparse signal approximation,","venue":null,"work_id":"1e5a756c-d1c7-4978-b8c1-16d454ae0765","year":2010},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.752018Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:b110dac1e217ebbb5b7f75f281f941d84719f8a59e34a5e1742c97790f6cf3e4","observation_id":"8340a057-dbcf-4e2b-bf4f-228aa48beede","resolution":{"observed_at":"2026-08-11T10:19:23.192434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.171210Z","title":"Double-sparsity recovery for adc- distorted compressive sensing,","venue":null,"work_id":"b5b2b1a4-b1fb-4fd3-8ceb-f443c8512b24","year":2022},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.756607Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:bfe7b4c88e1180dddf1e58b04699af7ec9654a49fdaf77b83ed7faaeaabace49","observation_id":"82c25713-11a5-4892-a436-df8926ecc0d6","resolution":{"observed_at":"2026-08-11T10:19:23.175769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.154849Z","title":"DSTPCA: Double-sparse constrained tensor principal component analysis method for feature selection,","venue":null,"work_id":"53dd944c-ec3d-479e-b857-6b976572bb57","year":2021},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.761496Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:71a1d33a866f3dc63793f9be241b186b7dcd9555a95e2653d094eb43397345c1","observation_id":"56fbe1eb-670e-4ce8-b0df-4a13b57fb2e1","resolution":{"observed_at":"2026-08-11T10:19:23.160619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.136722Z","title":"Micro-doppler effects removed sparse aperture isar imaging via low-rank and double sparsity constrained ADMM and linearized ADMM,","venue":null,"work_id":"db4b3242-98a9-4063-8b78-61280c5c65a6","year":2021},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.766880Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:c77c666d56ce53a1b9b37791875f472a651827d1df423361ad0f73c727720d0b","observation_id":"f053447b-7e1d-43a5-89a5-8bc19fe2a3d9","resolution":{"observed_at":"2026-08-11T10:19:23.143053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.120316Z","title":"Clustering-guided sparse structural learning for unsupervised feature selection,","venue":null,"work_id":"08129e36-3888-462e-abe6-de6306f7ff37","year":2014},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.772431Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:1444ff6c090d06397e286b0944e65e98d0d6d1bcf3f5c2266eb3525511b26ec0","observation_id":"f6b20777-2300-4304-a7e6-a5042abf72df","resolution":{"observed_at":"2026-08-11T10:19:23.125990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.105750Z","title":"Non-convex optimization for machine learning,","venue":null,"work_id":"7b8fc972-124c-4c3b-8cb3-425d24fa4813","year":2017},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.777784Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:f15b2c7987a4dc13988e0db828b7daec46132d1c6c74533c80a3bbcea801870c","observation_id":"37c43568-eea0-4bb3-813d-233de5d69bf2","resolution":{"observed_at":"2026-08-11T10:19:23.110377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.089644Z","title":"Sparse SVM for sufficient data reduction,","venue":null,"work_id":"dcaa1195-ea83-45ee-a323-48e8f51a9ebf","year":2022},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.782202Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:a6387696cd1e763f8a4522085c21eb493d0eb48a4505b7f133717def062b3d0e","observation_id":"668d80f3-1b82-4b6d-a0fe-e0b3b068003c","resolution":{"observed_at":"2026-08-11T10:19:23.094796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.073355Z","title":"A new insight on augmented lagrangian method with applications in machine learning,","venue":null,"work_id":"91747105-9aef-4eac-a37e-e677538f462e","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.787385Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:4efc1a8aa494d7703436e8a941446edeac9d7d4b1344e34b5c8a4fb944edeaae","observation_id":"ab5c8316-ed6b-41f1-8ab9-010d2aa5f958","resolution":{"observed_at":"2026-08-11T10:19:23.078369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.793172Z","title":"Absil, R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.793172Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:5b0605e8f73cd23fd918dc688635ffd42364343404cd0bf29d4732a0a2b4b765","observation_id":"9d2d52bc-1267-4c8c-a929-d1bb36fd7800","resolution":{"observed_at":"2026-08-11T10:19:22.793172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14394","last_updated":"2024-07-05T08:00:11Z","snapshot_observed_at":"2026-08-01T16:14:18.979668Z","submitted_at":"2023-06-26T03:10:09Z","title":"Revisiting $L_q(0\\leq q<1)$ Norm Regularized Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14394","snapshot_observed_at":"2026-08-11T10:19:22.798954Z","title":"Revisiting Lq(0 ≤ q <1) norm regularized optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.798954Z"},"links":{"cited_paper":"/paper/2306.14394","citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:4c931b5939d9401c61d70dd0b5b4a26b1b0d5d764d023068754a42ada0da5564","observation_id":"b20948af-2dd6-44bc-b658-14c758774ff6","resolution":{"observed_at":"2026-08-11T10:19:22.798954Z","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-11T10:19:23.045499Z","title":"Beck, First-order Methods in Optimization","venue":null,"work_id":"10151a6c-e9b0-40bd-9825-a6e4c23f1147","year":2017},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.804949Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:03387058846aa9ca5e2fa17964b5f1699e319433723f5acf9d07a98d0daabe60","observation_id":"9cb9a424-b9c8-4e19-bb4b-43aa29cc9474","resolution":{"observed_at":"2026-08-11T10:19:23.051451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.029433Z","title":"L1/2 regularization: A thresholding representation theory and a fast solver,","venue":null,"work_id":"3f47810b-15a6-4e6b-b277-971c33fe602b","year":2012},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.809823Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:2d20a1f79c914d9a469d19e603dc20bad1877123a3ccee69188c8b3bd6488316","observation_id":"d42a86ea-d481-4e93-ad73-955eb179be28","resolution":{"observed_at":"2026-08-11T10:19:23.034626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:23.010813Z","title":"Fast image deconvolution using closed- form thresholding formulas of Lq (q = 1 2 , 2 3 ) regularization,","venue":null,"work_id":"6f70464b-e4f1-4e0e-80da-83ef648ae3d1","year":2013},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.814421Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:93563b6d31fd280ad03e860f3e22cc87876f2686301eea8099525e039bdd4d73","observation_id":"f4cee5cf-bf52-482f-b7c4-6e836653b526","resolution":{"observed_at":"2026-08-11T10:19:23.018320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.993385Z","title":"Efficient and robust sparse linear discriminant analysis for data classification,","venue":null,"work_id":"1adf098f-c527-4968-9982-70a5692da2b2","year":2025},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.818976Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:07525eb29006ace06169c21b45b8d3c251820bdb136bbf8752c08eb110ef554b","observation_id":"b538eb8a-cbd4-4705-b08d-82c90014eb3a","resolution":{"observed_at":"2026-08-11T10:19:22.999258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.824123Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.824123Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:bf62af1586bca25ccfcdd8062d84b47b7343ed00a8e43a70d9511732b4c94972","observation_id":"311569b2-f3b1-437d-a4f7-4eaff2b2186d","resolution":{"observed_at":"2026-08-11T10:19:22.824123Z","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-11T10:19:22.962059Z","title":"Learning feature sparse principal subspace,","venue":null,"work_id":"657adfa5-134f-4928-b1a9-a1670c5f3f16","year":2020},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.828795Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:1455e80de18301aa900a0aaa84464759212022d5da83a226b39670d3b823054e","observation_id":"1f9f083b-7c0e-4d88-b3d7-4dbaf5f60791","resolution":{"observed_at":"2026-08-11T10:19:22.967518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16985","last_updated":"2025-07-03T13:34:01Z","snapshot_observed_at":"2026-08-02T20:44:03.110722Z","submitted_at":"2024-07-24T04:04:56Z","title":"Orientation-Aware Sparse Tensor PCA for Efficient Unsupervised Feature Selection","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16985","snapshot_observed_at":"2026-08-11T10:19:22.835420Z","title":"Sparse tensor PCA via tensor decomposition for unsupervised feature selection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.835420Z"},"links":{"cited_paper":"/paper/2407.16985","citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:eb749b12d6bfb4f10919a7e80351bb67eccd1bc517e61d6759d5ddada000ed5f","observation_id":"7cc46734-1b49-4e54-845d-d158dad97714","resolution":{"observed_at":"2026-08-11T10:19:22.835420Z","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-11T10:19:22.944240Z","title":"Subspace Newton method for sparse group ℓ0 optimization problem,","venue":null,"work_id":"8dcf53f0-c77f-45d6-9323-62fa8e820dbb","year":2024},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.842484Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:dc198278719a83f352ccdc0aa9c36051a7cd621d985284abc462abe9557ac453","observation_id":"c389d387-7d97-4916-ae36-be7d86bc541d","resolution":{"observed_at":"2026-08-11T10:19:22.951090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T10:19:22.849116Z","title":"Physics-inspired com- pressive sensing: Beyond deep unrolling,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T10:19:22.849116Z"},"links":{"citing_paper":"/paper/2412.16819"},"observation_digest":"sha256:afb852c7f8f3dee753b0a29d8b306f5d97fbba7b3cb05ce0e7967efb410ede9d","observation_id":"53044df1-42ed-45ed-9946-a77d73f35253","resolution":{"observed_at":"2026-08-11T10:19:22.849116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.16819","last_updated":"2025-08-14T01:54:33Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T10:13:11.067501Z","submitted_at":"2024-12-22T01:43:58Z","title":"Bi-Sparse Unsupervised Feature Selection"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":52},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2412.16819."}