{"as_of":"2026-08-14T07:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:668237bf4365bccfcdcb78e0a539a2c5bf462666f04d3bdd282e3964d96e7d3b","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:25:28.643420Z","state":"measured"},{"denominator":73,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":73,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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.08023/citation-record","integrity":"/paper/2412.08023/integrity","json":"/paper/2412.08023/citation-record.json","paper":"/paper/2412.08023"},"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-11T18:25:30.007010Z","title":null,"venue":null,"work_id":"5f7d9673-d553-4589-9bc5-44b3abfdede2","year":2008},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.286263Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:bc7885e16ded8135a4667d78d7f3cfad26e76b5b892218cccfbb6c235fe71e2b","observation_id":"0fb0eb7a-a448-414d-8a39-9ffd6bca3ac4","resolution":{"observed_at":"2026-08-11T18:25:30.012112Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.990815Z","title":null,"venue":null,"work_id":"e33f00cd-8f44-47b2-a443-7193d3b31717","year":null},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.291859Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:c684172f5db964c9f21ed3cbc0840028b161c5705440719a29d67f1dcde3b1a0","observation_id":"d94494d4-dfb7-43e7-8445-08149762c791","resolution":{"observed_at":"2026-08-11T18:25:29.995791Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.974739Z","title":null,"venue":null,"work_id":"07c8e24b-8900-4c92-b011-aa79a5bb3f01","year":2017},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.298358Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:64699409749dfb9902ac142b675d1fed8f1dcb7e5c7e1ae1fbde6d6e4baf4ecf","observation_id":"b3a67c61-0a69-4040-a617-bdf0196cda17","resolution":{"observed_at":"2026-08-11T18:25:29.980309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.958302Z","title":null,"venue":null,"work_id":"6c70805c-3758-469e-bc15-690d16486dc3","year":2020},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.304166Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:c3e4b74d3654e311ec1560e38e5c9e71205aaa0943e34cfa1c369441632b3a9a","observation_id":"2ab634c3-3eb2-4266-bb6d-c8e072eeda6a","resolution":{"observed_at":"2026-08-11T18:25:29.963559Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.942003Z","title":"John Wiley and Sons, New York (1983)","venue":null,"work_id":"97d678f8-f3e6-4d3b-8412-900106f71722","year":1983},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.309356Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:b4d1e5c6e5625aaa0720267d91d2e7ed5927687f390c65cfebd20cf35b8f67f7","observation_id":"4b968c26-f711-4e80-9e75-40e8434ae687","resolution":{"observed_at":"2026-08-11T18:25:29.947326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.924942Z","title":null,"venue":null,"work_id":"90431375-cdb4-4256-8588-8cd46049eaff","year":1995},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.314952Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:15fc55327b1db3ffb5c607ee34b6854859314808abc75b40e3b5f75855beb607","observation_id":"e2a6b377-aa66-4755-bee8-6bdf8ff84044","resolution":{"observed_at":"2026-08-11T18:25:29.930224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.908796Z","title":null,"venue":null,"work_id":"89ead24b-613c-4341-82ee-62306487207a","year":2017},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.320202Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:ccc2737c66d0f110560550b03f5b4b473dda31fe738d1da275e7077cb260b051","observation_id":"2e8c0ddb-82c8-4fe5-98fe-cd87d393beb5","resolution":{"observed_at":"2026-08-11T18:25:29.913714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.00875","last_updated":"2016-10-04T07:22:15Z","snapshot_observed_at":"2026-08-01T22:54:28.657426Z","submitted_at":"2016-10-04T07:22:15Z","title":"On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.00875","snapshot_observed_at":"2026-08-11T18:25:28.325930Z","title":"arXiv preprint arXiv:1610.00875 (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.325930Z"},"links":{"cited_paper":"/paper/1610.00875","citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:a2e17eb0babc9c41aa5456400d28d22a2c9773d778e268d5a07d7d28d8f8869d","observation_id":"460f735f-027c-4228-8dca-5b3d72ba25f5","resolution":{"observed_at":"2026-08-11T18:25:28.325930Z","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-11T18:25:29.893029Z","title":null,"venue":null,"work_id":"2015d12c-60ec-41bb-bf10-734950ee254b","year":2019},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.331201Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:3b3640ae1269ac4c5699fdbbaea40a7ae36f0085b293ea7276bfeb7a54923269","observation_id":"546be2e7-fa0e-407c-96da-099c00955ea7","resolution":{"observed_at":"2026-08-11T18:25:29.897705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.877128Z","title":null,"venue":null,"work_id":"1af4c3eb-22cc-47d2-8141-df6445956794","year":2017},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.336166Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:e7d3de1c8eeb86461eba02003286518bd062c27e2f0309233cc0c3645c286200","observation_id":"96b3cccc-0bd7-4848-be8e-70f1af600732","resolution":{"observed_at":"2026-08-11T18:25:29.881952Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.860784Z","title":"Springer Science & Business Media, New York (2007)","venue":null,"work_id":"2fac4fad-4d16-405d-87b8-5b853cfb2e83","year":2007},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.340951Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:c304c6aaef76059c0b76e4dc3eb617578201d9ac3a15fc231c6d032c4e88875c","observation_id":"8738a74d-da4c-48c6-b1e2-95ca895d9a43","resolution":{"observed_at":"2026-08-11T18:25:29.866017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.844427Z","title":"Neural Comput","venue":null,"work_id":"588aa478-f182-4e40-8859-1f716a3d04b4","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.345723Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:8df0d2c5dc115c30873223e708bb7099ba3017acf007aa1fc880202839fc430d","observation_id":"c7f20170-cdc2-4faf-9c18-aa16f430ff89","resolution":{"observed_at":"2026-08-11T18:25:29.849703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.829003Z","title":null,"venue":null,"work_id":"9ef1f550-23d9-4b5c-add8-259ff0d3c815","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.350195Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:cbbdb5c03dac64f8d4963dbe81721142a0dd041f9820cf7ee5ca4c40dd1aa816","observation_id":"a6ee2e50-52e7-445a-b8bf-7213e062f805","resolution":{"observed_at":"2026-08-11T18:25:29.833924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.813541Z","title":null,"venue":null,"work_id":"d96f86f9-e905-40ea-ad61-fc7da4e9ae8d","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.354737Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:7de99be11afe3e4b3f37dfd9969a11fdebe3e3c3123c6056bd9c89f0337bc2c1","observation_id":"f0af8f41-baf0-497d-872e-00f44dc99f30","resolution":{"observed_at":"2026-08-11T18:25:29.818571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.797440Z","title":null,"venue":null,"work_id":"3db715c4-cf77-4db6-9cee-343eea292c6e","year":2014},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.359127Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9cc536636f023ff357ad8129468fef3c21c84c165616b98940042c566d54cfbc","observation_id":"f9b42be9-dc2c-4d79-976c-082ab40c097a","resolution":{"observed_at":"2026-08-11T18:25:29.802227Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.781382Z","title":"Com- put","venue":null,"work_id":"96e72a72-4e52-4092-af88-f0e3be7f8ddf","year":2020},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.363528Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:dfc42edb217e287d44b6e420172a49e7dd882ec18e40cae8f7edf02658babb65","observation_id":"babd6b7e-2679-4150-b829-d67f61865a9d","resolution":{"observed_at":"2026-08-11T18:25:29.786603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.765286Z","title":null,"venue":null,"work_id":"fe00f8cb-f96e-4289-b557-54ef410d32f6","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.368055Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:82fe54a49d3481d51139b4bd099e0345fe20b9d1e31cd1f4c6ca0bdcb62537b9","observation_id":"d591c62f-b1b4-4c3a-9e64-295a441c7136","resolution":{"observed_at":"2026-08-11T18:25:29.770551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.748681Z","title":null,"venue":null,"work_id":"0cc356b3-a0d2-4f35-ac47-adbcc60f2cfb","year":2009},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.372548Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2ea57efe89c48640112a9ab3ca1121f8c551034c37d48bbecaf8f4457631c70b","observation_id":"7f2e2715-34cc-4692-98d2-8cbf5fb5ba13","resolution":{"observed_at":"2026-08-11T18:25:29.753688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.731748Z","title":null,"venue":null,"work_id":"128c7d0e-aab7-4ab9-bf11-30c70facef63","year":2009},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.376968Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:29eed14a4156a90e22068224322958f1542c7ca6e8d78d4bfe852ae2659f20f1","observation_id":"536314d1-3bdf-406a-af23-40ac48473064","resolution":{"observed_at":"2026-08-11T18:25:29.736923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.715906Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":"b445eb20-fd7f-4c80-9eed-87e82a64a7c8","year":2014},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.381834Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:4cd1e69700bbe7826692b7f9178fd5d13f20b3be396d2e2c61da6ca7af555b31","observation_id":"91286c60-51e5-49dc-a5be-44e4f9ac2229","resolution":{"observed_at":"2026-08-11T18:25:29.721305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.700148Z","title":null,"venue":null,"work_id":"d6f00c2b-5a9f-4393-8713-934767e4d77f","year":2011},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.386511Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:8e8029cc6bab3e5b3865bb234e97d06b4d52c71fe6db22fcd298572d37450df2","observation_id":"ba42cf86-073d-450b-9a0f-233dd9d26abe","resolution":{"observed_at":"2026-08-11T18:25:29.705137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.684286Z","title":"In: Discrete Geometry and Optimization, pp","venue":null,"work_id":"94701fd9-bc31-4398-b64c-70462f0f8430","year":2013},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.391203Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:6240fad2a55e9d84d24c35e3e5a9388a4cd43082461336aee7d677d831d7f5b8","observation_id":"c5b53ba7-0ef4-463f-bad5-c3fd67370fbb","resolution":{"observed_at":"2026-08-11T18:25:29.689173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.395945Z","title":"Neural Networks (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.395945Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:8eb96c69331fa3a31da30cf6d62c81f9bb2bdd3d6496890f9327186d2a11b086","observation_id":"1d535ce4-42a0-4423-87e5-f2bee4fb2a11","resolution":{"observed_at":"2026-08-11T18:25:28.395945Z","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-11T18:25:29.667768Z","title":null,"venue":null,"work_id":"4eac242e-f13f-44b0-9b2a-f1b94515547d","year":2012},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.401474Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:1f74884651dda2ab499bd82fd43fb2a22382c964ddec11dc2ff3df9ec58c9509","observation_id":"d0fe0faf-3501-4f9b-97fc-df8e5814d2a2","resolution":{"observed_at":"2026-08-11T18:25:29.672954Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.652404Z","title":null,"venue":null,"work_id":"61d9a3b3-885e-433e-89d3-8973f451d807","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.406847Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:cc1acc5a60cbfdd47509ce0824664d61806c1e7392b1cc9fee0ca8a4756f6360","observation_id":"6e903179-1b9c-425f-a8de-0fe8ba2621ad","resolution":{"observed_at":"2026-08-11T18:25:29.657311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.637299Z","title":null,"venue":null,"work_id":"30cedf2b-b5ae-45cd-8cbd-01686a2584f0","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.412258Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2430f16d0137a91fef21204db21587feb412164c95e8d4a02b3582974746dfee","observation_id":"6a005f58-acb1-4bcf-be3e-2b71c3fd301a","resolution":{"observed_at":"2026-08-11T18:25:29.642014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.621970Z","title":"IEEE Trans","venue":null,"work_id":"5625e866-e914-4e59-b009-65d2b7fa910c","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.417140Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:c59bb8efb3bf4cb587dae92bbbaf64e7a4156acb1e4fa9286f5d224db809b41c","observation_id":"7265693b-8569-47d2-974b-8081d523dd36","resolution":{"observed_at":"2026-08-11T18:25:29.626442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.606566Z","title":"IEEE Trans","venue":null,"work_id":"708987ff-e5fa-4522-b12c-2fcc74a41a3a","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.422282Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:8e3a18e47fd92e9814c9cf43f813a8a5a4b35d4e5cbf58f1148f31906fd396d4","observation_id":"9e904fe6-6fbc-4722-bafa-7784abfb6cb6","resolution":{"observed_at":"2026-08-11T18:25:29.611273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.590192Z","title":null,"venue":null,"work_id":"0ffe0d5e-4c31-4bd3-ae2d-065746c1d951","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.426869Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9e230264aacd87964d8ad00beb0b000f95e41281043a87bc27c3071ad7957c81","observation_id":"25003d9d-4f56-4928-ae6a-da0d729d2302","resolution":{"observed_at":"2026-08-11T18:25:29.595422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.574278Z","title":null,"venue":null,"work_id":"9ce9b4de-fa42-4459-8d40-afbd964c7940","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.431569Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:316007cb9efe070fa3f16b0c638e780d6558bc0621083a2804181966d79c6cd6","observation_id":"685c24c5-bb8d-48c0-8a89-da21939cc217","resolution":{"observed_at":"2026-08-11T18:25:29.579264Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.558638Z","title":"IEEE ASME Trans","venue":null,"work_id":"ad624be7-931a-4a30-8bc3-1032ceadf8b3","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.437379Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:fae45f38d23f899dcae7d9caa3222332c03964e048874d0df97d7b9f8998d57a","observation_id":"a08408a7-76f0-4779-ba65-cd52e42fe6b1","resolution":{"observed_at":"2026-08-11T18:25:29.563530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.542135Z","title":"IEEE Trans","venue":null,"work_id":"49a1a351-c5f0-497c-bcd6-ec97028d819f","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.442192Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:a5f69f851194360769cc8986a2d7b773501715a7cc423440dd43abc93677bf7a","observation_id":"6a3c3077-aded-4fd0-ba7b-6fe63ef6ff3e","resolution":{"observed_at":"2026-08-11T18:25:29.547269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.526187Z","title":null,"venue":null,"work_id":"5b6fcac7-0b35-4d14-b861-9b4601467d4b","year":2018},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.446779Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:a40dd54ede1356938589629e453c5371d88934f0c4aa01ebc4a7306716b06e58","observation_id":"4c21422e-f60e-4b63-ba02-147a71b163aa","resolution":{"observed_at":"2026-08-11T18:25:29.531143Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.510890Z","title":null,"venue":null,"work_id":"2b72773f-5165-43d6-a5d1-9e525d789eb2","year":2020},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.451539Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2a8cfdff7a9a94aa6c3e77c9de2e17d0de79b7b6a76c271cdbaeb2f24b3f5f48","observation_id":"252b7370-c298-4322-a155-019346154ab9","resolution":{"observed_at":"2026-08-11T18:25:29.515876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.494859Z","title":"IEEE Trans","venue":null,"work_id":"183690af-5f1a-47df-a989-1c1ac77db614","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.456342Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:c909bae1eec028f868caba5469309e51678dbbf862ca64a83d0560938c09b821","observation_id":"cbe1a22b-87d6-4fc8-8f88-5bc06894f1a8","resolution":{"observed_at":"2026-08-11T18:25:29.499999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.478902Z","title":"IEEE Trans","venue":null,"work_id":"52e733c6-2ed2-4e6d-b50e-869832cfd29f","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.461679Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:0db4068327c3fd3feedee0083fe8acf94676f753ed84cb23f4c6f66a85ebd192","observation_id":"183055c4-4d62-446c-8eb5-720674718725","resolution":{"observed_at":"2026-08-11T18:25:29.484162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.463182Z","title":null,"venue":null,"work_id":"b38046ba-77ed-4dc8-b67f-d9193c8c562a","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.466853Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:90de351d6767e0ce103cc76ce9f269f53e5d341c96cf661d9743e860cac4d367","observation_id":"0dc145d1-c82e-4a37-8490-516bd9aa3cc8","resolution":{"observed_at":"2026-08-11T18:25:29.468261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08719","last_updated":"2020-09-18T09:41:43Z","snapshot_observed_at":"2026-07-06T09:56:44.318762Z","submitted_at":"2020-09-18T09:41:43Z","title":"Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models","version":1},"cited_work":{"arxiv_id":"2009.08719","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.08719","snapshot_observed_at":"2026-08-11T18:25:28.706404Z","title":"Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models","venue":"math.OC","work_id":"966eea38-e96e-4491-b697-ee326156df18","year":2020},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.471954Z"},"links":{"cited_paper":"/paper/2009.08719","citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9db38b763d4032f501201b89480d8ceb053c6cc30f960ab2b990fbfc3a908d0e","observation_id":"a36ce4e2-38d7-4c16-b426-88d89970c3ee","resolution":{"observed_at":"2026-08-11T18:25:28.715240Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.448037Z","title":null,"venue":null,"work_id":"66963660-00d9-43b8-ad34-40134ddea07c","year":2012},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.477218Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2cfe53dc58d031d5e89fdcca5aa0035d3b6940d4a550f8ebe992578e14facc39","observation_id":"0e8f93c9-ef21-44af-93e4-043e1510c1ed","resolution":{"observed_at":"2026-08-11T18:25:29.452499Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.432065Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":"fdd921d1-b812-4ed6-8d95-ae1f9f7b8d82","year":2015},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.482364Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:23084e87692073e4ff92c144401b1c7a5112511b3556a6486d0a52dd952057af","observation_id":"6bd1d098-5c97-4578-98a3-100c1200d9f9","resolution":{"observed_at":"2026-08-11T18:25:29.436797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.417155Z","title":null,"venue":null,"work_id":"691c303a-7d9e-440b-b787-7e645ac387e0","year":1988},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.487182Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:f1975210147e431d00bb6efea175904767987b2bb89c05e8040491f6bc0d0cfd","observation_id":"19f6e426-260c-4169-b433-5e25195993c9","resolution":{"observed_at":"2026-08-11T18:25:29.421651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.401976Z","title":null,"venue":null,"work_id":"99e7b427-04a8-4812-971a-881165427dae","year":2005},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.491754Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:edfe7db84fff04649c6beb922803df7252907888957ed013ea3e86fe5e473ad2","observation_id":"30a3ff06-4ab1-4483-9532-4db0f7f833bc","resolution":{"observed_at":"2026-08-11T18:25:29.406543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.386374Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":"25e624a1-fe27-4576-8396-b6e4bb0f8766","year":2013},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.496444Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:fccb940822d5810fc83e29a7bd6cbd7edd1d0c1e3f4ce9b23fe5437f426054b3","observation_id":"3e3e7c7b-5e47-44cc-aaf0-45aa70eb1e1b","resolution":{"observed_at":"2026-08-11T18:25:29.391362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.370205Z","title":null,"venue":null,"work_id":"cfa1e43e-1b92-4c38-a7da-e3399ddef67f","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.501508Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9f43bcb65c832772af3dc7edaf8e508226a8f58b20cf137cd7fe3f1bedbc788e","observation_id":"2d1810b8-8fd9-444f-92d6-6ab109878215","resolution":{"observed_at":"2026-08-11T18:25:29.375244Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.353902Z","title":null,"venue":null,"work_id":"0273c910-c38d-4431-8500-6073554485b4","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.506190Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:779da0c0ce0d51da063f2636910b113b033cf3399f954b4939bf6f20c2684977","observation_id":"eec3cbe5-1d59-4f37-a425-67dd30d6b20d","resolution":{"observed_at":"2026-08-11T18:25:29.358818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.337544Z","title":"IEEE Trans","venue":null,"work_id":"4a35df56-44b7-449a-8624-12ed40dbb84a","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.510751Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:0c6eed18c3632ccf54e0d6459540c25347276da2052b28c1589be18ed3456d80","observation_id":"545de34b-ea96-4f4c-8473-ed29f70cb237","resolution":{"observed_at":"2026-08-11T18:25:29.342594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.321927Z","title":null,"venue":null,"work_id":"41634924-ccb7-4df9-98b5-c0b3910a03e9","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.515571Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:80fcb3dfe2e2323a141d1d463aaa6f655d5f475f27bdb47d00c14e1e2280058f","observation_id":"1d753d4b-4c73-43d5-9a1a-4fe4f3a58fd3","resolution":{"observed_at":"2026-08-11T18:25:29.326974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.305118Z","title":null,"venue":null,"work_id":"67ffdb28-6b19-4512-a0d8-1c1b80f511d0","year":2019},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.520758Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:1a844e2bf57a265712eb254eb995db812dc480157245576cb49db7775b29fc52","observation_id":"80789986-8148-4b0c-b5c4-0cd6bbf36805","resolution":{"observed_at":"2026-08-11T18:25:29.310836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.287191Z","title":"IEEE Trans","venue":null,"work_id":"695484ad-2d61-4e56-b765-a46c424968a7","year":2019},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.526169Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9f694ac5b48b409c7ee92d0570fab7dceefd304d41a785df0fe3eb30a5e3e1cb","observation_id":"fb5c490f-a354-45d3-a628-46d78ae997f2","resolution":{"observed_at":"2026-08-11T18:25:29.292630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.269355Z","title":null,"venue":null,"work_id":"6c6fccf6-f2ec-4c6f-aeb1-49218a72c92f","year":2006},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.531049Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:0b9544505f18941c84ac361cf28ead009274224650d8ebaa8ecc37f642d76c0e","observation_id":"3fa97f57-b16f-4ff7-b623-98fea50992d7","resolution":{"observed_at":"2026-08-11T18:25:29.274531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.252782Z","title":null,"venue":null,"work_id":"a265a437-14dc-4340-8466-6a46c3548f2c","year":1993},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.535379Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:b1007a056822f118ebe000d29d96ce105ebc0d6222bf1087e1832d96b7904f8a","observation_id":"69aa882d-7371-4b8f-be89-4167305e945f","resolution":{"observed_at":"2026-08-11T18:25:29.257817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.235973Z","title":null,"venue":null,"work_id":"91b7a090-ed96-413f-8969-caea75b4a2da","year":2019},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.540142Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:3a069e8c54c35f29f231af3363dcdc4690d05c310032365cc919de48f24eb157","observation_id":"7cb68f5c-1b4f-48da-b227-44f6ce440a7b","resolution":{"observed_at":"2026-08-11T18:25:29.241240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.219832Z","title":"IEEE Trans","venue":null,"work_id":"5ec818cd-c188-4753-ae2f-e1e3bfe0f257","year":2019},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.544430Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:1d2e936f4fa708f86c1d3591e1d766723ca338ef8633239703d80a76195bdee1","observation_id":"9c2e5d87-f2dc-4739-8b03-6f162aad7404","resolution":{"observed_at":"2026-08-11T18:25:29.224385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.202719Z","title":"in Mathemat- ical Programming at Oberwolfach, Math","venue":null,"work_id":"4df0966e-a580-4af9-878e-26ffacd657d1","year":1981},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.548678Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:e4bc12e30cd238a31181ec753da8977dd125669b481ac52c625a31fb7e23a977","observation_id":"de4b3068-de60-472b-943a-d130fede99da","resolution":{"observed_at":"2026-08-11T18:25:29.208839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.552793Z","title":"Princeton University Press, Princeton (1970)","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.552793Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2a77795423ddea8a11ff256e09282dfb13e8d5c1d1f981b01cbc5cd450d2c2c4","observation_id":"d634c9d9-91b8-41a6-8104-2277f343b657","resolution":{"observed_at":"2026-08-11T18:25:28.552793Z","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-11T18:25:29.176446Z","title":null,"venue":null,"work_id":"8729b64c-80f2-47aa-a975-62494210c5e5","year":1976},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.561239Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2337643cf88b08b03af02b1eed1fa1d366a49d5dca6c688a2988c088f142f417","observation_id":"7cc40614-86db-4297-bee0-16a05af0324e","resolution":{"observed_at":"2026-08-11T18:25:29.181414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.160420Z","title":null,"venue":null,"work_id":"1665e9f6-90e8-4130-babc-e1df623d2d8e","year":2009},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.565596Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:9888d01d63b927182a5b381c2a510ea86d79233618677523ecf549aed182569d","observation_id":"add658a1-2577-4018-8691-62399cc9448f","resolution":{"observed_at":"2026-08-11T18:25:29.165522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.145223Z","title":"John Wiley & Sons (2013)","venue":null,"work_id":"027859eb-8b45-4667-b54f-c8629366405e","year":2013},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.569605Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:ab3e21d1fae6659f00c5fa730ec9996cea632a70e01cedab913f706439049aae","observation_id":"ed04c851-a34a-4f2e-85a9-51e33b3c2767","resolution":{"observed_at":"2026-08-11T18:25:29.150004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.129655Z","title":null,"venue":null,"work_id":"9a1cb291-ed95-4cda-a35d-8c450519783c","year":2003},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.574432Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:d6613c15b8bb3c982b807b388fbb8b5ad6ca0b616cd2699350011cac17edfcc9","observation_id":"4997f64e-3666-4d9b-b6ae-8714e159b8dc","resolution":{"observed_at":"2026-08-11T18:25:29.134456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.113420Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":"6b4accce-585b-4063-9092-d88a620ca777","year":2014},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.579080Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:be885c999e74650741bfc8a9da2bd88875d9ae97a0b313639e09f872fe01b189","observation_id":"f1f9add3-36ec-409d-9a8c-20c99df93194","resolution":{"observed_at":"2026-08-11T18:25:29.118602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.096265Z","title":"Linear Alg","venue":null,"work_id":"1a6c8b60-8197-4c20-a087-917fe514c060","year":1992},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.583932Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:7601d3e712021d1a0876fd295a3a5466724d26bb5b48f1adc1dd2ebcda3dcc8f","observation_id":"52ed7f55-237b-4a33-a917-e5c7b06fc622","resolution":{"observed_at":"2026-08-11T18:25:29.101815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.079507Z","title":"INFORMS J","venue":null,"work_id":"24afaece-91bb-4862-a59f-31d9179b6cf0","year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.588879Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:d14dea91e9f5fb6a331b1951e9ac01be8f2e7d08e82600fbd021b7465889e47a","observation_id":"c9cf791b-27aa-4734-8482-458baebc311d","resolution":{"observed_at":"2026-08-11T18:25:29.084702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.062988Z","title":null,"venue":null,"work_id":"a226f480-72d7-4b8f-81fa-0413c100df5c","year":2024},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.593550Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:0ad0e3a9237b044a9d7e9252c2ae637c44626938a9194f4bc2bd751249521492","observation_id":"6c5180e6-9c29-43f9-b9b7-25afc3345c08","resolution":{"observed_at":"2026-08-11T18:25:29.068108Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.046084Z","title":"IEEE Trans","venue":null,"work_id":"435c4e76-e99c-412e-89e0-b472b6d4012a","year":2004},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.598272Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:ca07eb0247503dbb62c83d206226e2ab7b9f3b1a757d8d19a57c72deb834df0e","observation_id":"fbb55166-046f-445b-b7a4-e732d84cf94e","resolution":{"observed_at":"2026-08-11T18:25:29.051530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:29.028770Z","title":null,"venue":null,"work_id":"263376f1-0f6e-4b8d-954b-626a3e821dad","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.603480Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:5239859e8608810df911ca6aa54d7cdde558e41d629c93735c82eceeef25dd7f","observation_id":"4b54bf3c-f78d-46dd-9486-1f6fd58a951a","resolution":{"observed_at":"2026-08-11T18:25:29.033977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17369","last_updated":"2025-04-25T06:29:01Z","snapshot_observed_at":"2026-08-13T11:05:39.695117Z","submitted_at":"2023-06-30T02:13:45Z","title":"Adaptive sieving: A dimension reduction technique for sparse optimization problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17369","snapshot_observed_at":"2026-08-11T18:25:28.608487Z","title":"arXiv preprint arXiv:2306.17369 (2023) Support matrix machine: exploring sample sparsity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.608487Z"},"links":{"cited_paper":"/paper/2306.17369","citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:d53ba79e391fc4aca4f6e8cab1f6400eb9eb3257aa935aadb95f1a8d22a816ba","observation_id":"547ffc8c-a64d-4e4c-95c0-df198a21832e","resolution":{"observed_at":"2026-08-11T18:25:28.608487Z","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-11T18:25:29.009560Z","title":null,"venue":null,"work_id":"20bb4e74-6a09-41f6-bc9e-a501d767b6c8","year":2022},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.613870Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:ec96c037fc07564a193ad84cceb944f31f5d0d90423ca563a4208766d882aa85","observation_id":"66bedf0c-d2fd-45ef-96e6-aa5c5423e4de","resolution":{"observed_at":"2026-08-11T18:25:29.015058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.989888Z","title":null,"venue":null,"work_id":"f6ef2d46-2c07-42b4-8bde-c57853b94b9b","year":2010},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.618659Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:a2093e94e8f6db7ba57502bb4f0ca58329ff02afc3bbbf0e05a46296f7c13072","observation_id":"18a68757-66aa-45c2-9066-64a9dd7eee31","resolution":{"observed_at":"2026-08-11T18:25:28.995691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.970673Z","title":"IEEE Trans","venue":null,"work_id":"e39da677-1792-4fe3-aced-fe6e9eafa2f1","year":2018},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.623460Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:8bc8a33cff6721b7ef388511d3c63cf1cab5006ae9d95cb5621167e6785f3d81","observation_id":"3c73817b-de92-4690-9c77-d1e9a2cae2cd","resolution":{"observed_at":"2026-08-11T18:25:28.975970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.953501Z","title":"Pattern Recognit","venue":null,"work_id":"e944292b-66d4-487e-9903-94d4e3c67088","year":2018},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.628496Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2b9f048c5d5d07f0c0a70ec60193bb9b682ab9e81e4d26efc9bc1884b17aaf77","observation_id":"fb096834-0610-4066-be7f-2edfa47b4ce0","resolution":{"observed_at":"2026-08-11T18:25:28.958701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.936445Z","title":"Neurocomputing 275, 869–880 (2018)","venue":null,"work_id":"6eb4ab07-2aae-4e16-bbd6-9c33a9bb9707","year":2018},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.633430Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:4970ef274643d488f07c1e28462a17424120e1b23d1687c4c930835482e4de9b","observation_id":"528d1911-5ad5-48c1-a7b0-66eaa1b9d809","resolution":{"observed_at":"2026-08-11T18:25:28.941732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.918617Z","title":null,"venue":null,"work_id":"5f0092f2-e2c6-47bb-9d46-444dccac85cf","year":2017},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.638150Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:2c2b124e80f4086fd9ef1ecafa47a35a8c03f88be53dd2e705604e1579e838c3","observation_id":"97f32c65-a687-4eb6-a274-4bc208d89ba3","resolution":{"observed_at":"2026-08-11T18:25:28.923624Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:25:28.899383Z","title":"In: NIPS Workshop on Optimization in Machine Learning (OPT) (2015)","venue":null,"work_id":"c399052d-a7f8-44c9-8956-ecc27273eaca","year":2015},"citing_paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T18:25:28.643420Z"},"links":{"citing_paper":"/paper/2412.08023"},"observation_digest":"sha256:434ce691af0052ec2cb06d5c5170bef4a01519bc735ace7f4c4ab4a5601458df","observation_id":"868ecb78-2331-4a63-8dfa-cc16a4d7b431","resolution":{"observed_at":"2026-08-11T18:25:28.905564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.08023","last_updated":"2024-12-11T02:05:23Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T08:36:04.724032Z","submitted_at":"2024-12-11T02:05:23Z","title":"Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":73},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 0 inbound Pith citation observations for arXiv:2412.08023."}