{"as_of":"2026-08-08T12:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5664d95efe6c57386bd4ed8ce88db3051cf1877abd7921296724e5089d2dfbdf","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:46:47.240452Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2505.23949/citation-record","integrity":"/paper/2505.23949/integrity","json":"/paper/2505.23949/citation-record.json","paper":"/paper/2505.23949"},"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-07T12:46:52.080509Z","title":"URL https://huggingface.co/docs/transformers/perplexity","venue":null,"work_id":"2f60d594-c232-4c82-9ff1-b5fb80821ef8","year":2022},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.778608Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:ad4d9a2c3411bed7e7bbfa0cc7cbf5082a82c1b17d5857eda9c3b8663f826671","observation_id":"e1f0e729-223f-4bee-8858-ce512183436f","resolution":{"observed_at":"2026-08-07T12:46:52.164092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T12:46:42.812910Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.812910Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:bef5f6512e99fb1e9956c6736f134ddaee2a9c9cba4bb3177ffc0d18411aa0b3","observation_id":"db6fd0df-5211-41b5-8823-5c3d79ef54df","resolution":{"observed_at":"2026-08-07T12:46:42.812910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04744","last_updated":"2024-02-07T10:55:59Z","snapshot_observed_at":"2026-08-07T10:39:20.795187Z","submitted_at":"2024-02-07T10:55:59Z","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04744","snapshot_observed_at":"2026-08-07T12:46:42.859488Z","title":"Progressive gradient flow for robust n: M sparsity training in transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.859488Z"},"links":{"cited_paper":"/paper/2402.04744","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:c19c1ec1d4168a088cc31f4e4c8356e9a3c09b27335f3985ada861bd6d39709b","observation_id":"02d71e93-905a-4b71-974c-470125c9f663","resolution":{"observed_at":"2026-08-07T12:46:42.859488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10738","last_updated":"2019-07-24T21:37:16Z","snapshot_observed_at":"2026-08-05T08:00:03.179363Z","submitted_at":"2019-07-24T21:37:16Z","title":"Careful Selection of Knowledge to solve Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10738","snapshot_observed_at":"2026-08-07T12:46:42.907393Z","title":"Careful selection of knowledge to solve open book question answering","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.907393Z"},"links":{"cited_paper":"/paper/1907.10738","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:030a8541a7a77d41279b0bd2a7ec5638e297f46d1e165c1d09232e26be09756e","observation_id":"e6bd628b-c225-450c-a3f3-7c4bd75b14b7","resolution":{"observed_at":"2026-08-07T12:46:42.907393Z","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-07T12:46:51.906703Z","title":"Iterative bregman projections for regularized transportation problems","venue":null,"work_id":"1eb8a3c7-11c0-4a4a-8af1-f49c6d78ba69","year":2015},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:42.953048Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:941326e76d7b3da6cddc83bc6f7c226473cdadb2e4532f61f1bc6e391734bc45","observation_id":"f03f9715-ffd1-49bc-8139-080463acaf2f","resolution":{"observed_at":"2026-08-07T12:46:51.984563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.14623","last_updated":"2023-02-28T15:03:18Z","snapshot_observed_at":"2026-08-07T21:24:18.883326Z","submitted_at":"2023-02-28T15:03:18Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2302.14623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.14623","snapshot_observed_at":"2026-08-07T12:46:48.152319Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","venue":"cs.LG","work_id":"644878b5-19ab-42aa-b0df-7ea15e6b6273","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.006169Z"},"links":{"cited_paper":"/paper/2302.14623","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:5b3307ba9f8891151777419555610c0ace0cd53f99b06527a2fef960d238e9c4","observation_id":"a9651dbc-92c8-4822-912f-e78517e79537","resolution":{"observed_at":"2026-08-07T12:46:48.209452Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.096431Z","title":"Piqa: Reasoning about physical commonsense in natural language","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.096431Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:dc82b0cf71c1c4f0c8b5f3faa4ece45886bf465cbf18e44049e200d1024e3a9b","observation_id":"f6adcfc5-07ee-4559-a8bf-78450911aa3e","resolution":{"observed_at":"2026-08-07T12:46:43.096431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.185022Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.185022Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:4284533527f5f0d8497ae9e721829c4c3ae27374df2a1f16974cb40acb79ccfc","observation_id":"48563408-e2af-4e86-b260-5f8b976f2ea0","resolution":{"observed_at":"2026-08-07T12:46:43.185022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.285559Z","title":"The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.285559Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:c9f0aab27bbe72b994179174cb3c3b5029f95f580cb0789d6779eb8179b47b14","observation_id":"a71963ff-b7d5-40de-9195-1b26730d92b6","resolution":{"observed_at":"2026-08-07T12:46:43.285559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.368381Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.368381Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:772c753940ed9039d600450b05dc7186a6f9a75272760fec1a4d762f25bb8b3b","observation_id":"a554a8e5-56d6-47c0-a7c1-b9ac123bb1dd","resolution":{"observed_at":"2026-08-07T12:46:43.368381Z","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-07T12:46:51.743516Z","title":"Venom: A vectorized n: M format for unleashing the power of sparse tensor cores","venue":null,"work_id":"18581d98-105a-4e37-abea-f3cd37c20107","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.410251Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:a6fb2e0865bf6b944f55922b332c48cb167822a30cf6c012be131adbd743d78f","observation_id":"612d9439-67b0-4c3e-804e-7eaea0007cef","resolution":{"observed_at":"2026-08-07T12:46:51.800995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.470878Z","title":"End-to-end autonomous driving: Challenges and frontiers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.470878Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:e9c70a89953f5d38cbac18c86ede91e10dd0bbaa5992522b30fe73f6423b6890","observation_id":"c95a7367-1d0a-469c-8c2b-a143c7ade818","resolution":{"observed_at":"2026-08-07T12:46:43.470878Z","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-07T12:46:51.596578Z","title":"A survey on deep neural network pruning: Taxonomy, comparison, analysis, and recommendations","venue":null,"work_id":"2d169cb1-1d6d-4284-8b6f-dee095a5e4ff","year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.534474Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:ebf3521c27044076b899185305d1a80d00aefc8a68bf4949d0651f4ae0310227","observation_id":"a5d4588c-9805-42b2-9e7a-d0eeda82057a","resolution":{"observed_at":"2026-08-07T12:46:51.684719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-07T12:46:43.625661Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.625661Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:adaaff6110e176f2b8febe65174ee559634a9c405046bec5c779655dc867e588","observation_id":"e9d70a9f-d26f-42aa-9045-eb1163b7924a","resolution":{"observed_at":"2026-08-07T12:46:43.625661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-07T12:46:43.691384Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.691384Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:0c505df9c4902ccd4b81946ea18ee4cbe8aa3087cf431e01a6b24a3cc5ba4f54","observation_id":"e91fc62c-6534-4e0e-98ee-a8039a87ccf5","resolution":{"observed_at":"2026-08-07T12:46:43.691384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:43.761492Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.761492Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:e40bcdfd0809bcb109f191314268cdcc5bd3695d53095aff8d9ff03874041ba5","observation_id":"5cc5f60e-dd80-4983-8457-74b9caae3aee","resolution":{"observed_at":"2026-08-07T12:46:43.761492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03078","last_updated":"2023-06-05T17:53:28Z","snapshot_observed_at":"2026-08-07T09:56:21.569200Z","submitted_at":"2023-06-05T17:53:28Z","title":"SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03078","snapshot_observed_at":"2026-08-07T12:46:43.839969Z","title":"Spqr: A sparse-quantized representation for near-lossless llm weight compression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.839969Z"},"links":{"cited_paper":"/paper/2306.03078","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:3c71bb91e3050eb8da164f273fb786bc7b395534350f288e0f3777637f218556","observation_id":"bec69b01-c218-4d63-be8e-3144c812a94b","resolution":{"observed_at":"2026-08-07T12:46:43.839969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T12:46:43.933912Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.933912Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:2585abbbd75a02bfe3d0f11630df834af438eb17275a4f33cbca103e0cfeb5f2","observation_id":"e5bd4ce3-5950-408a-99c4-d4f056f40fee","resolution":{"observed_at":"2026-08-07T12:46:43.933912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.029408Z","title":"An algorithm for restricted least squares regression","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.029408Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:19ed424d2db843f395a5b82f89ca34b6c6214adc539cdadcc93f2e428baf216a","observation_id":"ebb61e49-2fdc-42f6-b1c8-07ec465e8b28","resolution":{"observed_at":"2026-08-07T12:46:44.029408Z","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-07T12:46:51.451028Z","title":"Efficient n: M sparse dnn training using algorithm, architecture, and dataflow co-design","venue":null,"work_id":"9fd6c34e-1ab9-46ae-a976-7f60379f1708","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.097043Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:1ceed7f999e753a706c6e303bba19282f2d36d42d36373ce7b98ef1d22c61230","observation_id":"866b21a9-759e-4362-b102-2b0812570de3","resolution":{"observed_at":"2026-08-07T12:46:51.519150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.177100Z","title":"Sparsegpt: Massive language models can be accurately pruned in one-shot","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.177100Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:52866c66521b3c4f5905b50d39cd0f16e47ed2195a77d1bbddc70a80436dbe04","observation_id":"0c32e2dd-39d0-4a26-80ae-9762599cd6bd","resolution":{"observed_at":"2026-08-07T12:46:44.177100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.272650Z","title":"A framework for few-shot language model evaluation, 12 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.272650Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:f2d59c380776014a6fb628aefe5aafffe7b61747bc77e7514ab0bc29eb71088b","observation_id":"41e852dc-4260-4466-a8c1-b8dccb2fa200","resolution":{"observed_at":"2026-08-07T12:46:44.272650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.353892Z","title":"Knowledge distillation: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.353892Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:574eb9dbce176f87365e7aed5fcb6c76ae2edc1434a06ed33355084fa8f41c2a","observation_id":"8c1bb971-0e93-4560-b3b7-a28429c551be","resolution":{"observed_at":"2026-08-07T12:46:44.353892Z","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-07T12:46:51.302189Z","title":"Gurobi Optimizer Reference Manual , 2022","venue":null,"work_id":"09518af6-819e-4bbe-acd5-da89cd1fdbdd","year":2022},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.449859Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:5ee9d19c818b2b8cdf3dcde50c8ae98ec8c5a5ebfa030fa0242c8ec0b5245508","observation_id":"ccefec65-aebe-4c78-8ccb-6eaba0401c49","resolution":{"observed_at":"2026-08-07T12:46:51.350805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.538892Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.538892Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:f0809524f2fbbf1c0d05d8e3d45c4e11f1957f2777f8920c200296b8dd59d7ec","observation_id":"34ae7980-b392-4401-a22b-b5a8b767efbe","resolution":{"observed_at":"2026-08-07T12:46:44.538892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:44.590828Z","title":"Second order derivatives for network pruning: Optimal brain surgeon","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.590828Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:73c49df564e4b7972f8450b9d3812090a9ec77e61690f7ca7b04445afa124a82","observation_id":"ad146490-024c-474b-b676-5a6578ba2650","resolution":{"observed_at":"2026-08-07T12:46:44.590828Z","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":"10.1109/iccv.2017.155","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:47.333667Z","title":null,"venue":null,"work_id":"02fae66d-2161-44d0-93e8-e7df1baf4dde","year":2017},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.655192Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:ae18868fb87b00aed0c5cf5d9078fce327023eda07bd1060e4f37bd9023e6c61","observation_id":"7a0ccd4d-27b5-4ee2-a028-e8eb2ff2357d","resolution":{"observed_at":"2026-08-07T12:46:47.379392Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01847","last_updated":"2024-10-27T14:40:08Z","snapshot_observed_at":"2026-08-07T14:26:42.001446Z","submitted_at":"2024-04-02T11:12:42Z","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01847","snapshot_observed_at":"2026-08-07T12:46:44.714941Z","title":"Accelerating transformer pre-training with 2: 4 sparsity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.714941Z"},"links":{"cited_paper":"/paper/2404.01847","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:8c530fef410643f84f1c8ccf296453984c9cc7876927a60b67221634f945164f","observation_id":"0ceaeec2-1bed-4570-95c7-cc9478a32d68","resolution":{"observed_at":"2026-08-07T12:46:44.714941Z","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-07T12:46:51.113626Z","title":"Elsa: Exploiting layer-wise n: m sparsity for vision transformer acceleration","venue":null,"work_id":"bee357b1-d9dc-45ba-be33-f3c186eba482","year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.781020Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:5ec384c3bc7787aa5e92d0dc0fe78190e1312fc9f03b46de65da839e5a943a60","observation_id":"46d8d1f0-d5a4-43d6-856d-995c96b9ad9e","resolution":{"observed_at":"2026-08-07T12:46:51.166869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:50.928346Z","title":"Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks","venue":null,"work_id":"4c7046ab-153e-4ceb-9093-8a67f18560cf","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.851033Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:d6b402504ff12f6b7ae3c80cdb0820770ebedbc071c199fd24d96cd23d154e28","observation_id":"dd0ee617-9d04-49da-93d0-8c1343d4fed4","resolution":{"observed_at":"2026-08-07T12:46:51.029678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:50.765453Z","title":"Accurate post training quantization with small calibration sets","venue":null,"work_id":"3acab4f4-48fc-47fa-be19-1016d4cf7850","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:44.934526Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:a92b35da21748868b06b13935f9b0d2419db6e263066c8348bfb1f09d8e58808","observation_id":"e10be430-0765-4f02-b679-4d7428cd94e9","resolution":{"observed_at":"2026-08-07T12:46:50.842658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:50.577164Z","title":"Efficient gpu kernels for n: M-sparse weights in deep learning","venue":null,"work_id":"6a469b29-0524-4e8b-a632-94f3eb3b82fd","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.006872Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:9b28a355f4ec4d105514d9300af2a6325546c7e3cdb1edccf65534b999a9992a","observation_id":"350444bb-375c-4c8e-94ba-4677a58bbc39","resolution":{"observed_at":"2026-08-07T12:46:50.670755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00978","last_updated":"2026-04-25T06:58:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-01T17:59:10Z","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00978","snapshot_observed_at":"2026-08-07T12:46:45.076540Z","title":"Awq: Activation-aware weight quantization for llm compression and acceleration","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.076540Z"},"links":{"cited_paper":"/paper/2306.00978","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:b4f718214fc9a116988bf121211e2165872aad1307bc50e091573e0ce8899fb1","observation_id":"1618e5c5-1cda-4f39-92d9-d30296cb4144","resolution":{"observed_at":"2026-08-07T12:46:45.076540Z","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-07T12:46:50.425286Z","title":"Tb-stc: Transposable block-wise n: M structured sparse tensor core","venue":null,"work_id":"e72a2714-d0c7-4a38-a03a-e0110426758c","year":2025},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.148811Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:b28fd1977bd5da18963c64cf4b474307c2888d2cb9903c9f62dcea001c437ea2","observation_id":"2ed6ea2a-5491-453e-bd3e-07ddea94b3e5","resolution":{"observed_at":"2026-08-07T12:46:50.524132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12180","last_updated":"2024-06-07T16:51:52Z","snapshot_observed_at":"2026-08-04T22:51:37.414194Z","submitted_at":"2023-11-20T20:50:49Z","title":"cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Julia","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12180","snapshot_observed_at":"2026-08-07T12:46:45.233414Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.233414Z"},"links":{"cited_paper":"/paper/2311.12180","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:f0f7f0c419000cd5e32ef5d10dc965681ff7a1c7e696b43450d937fd8883c8bc","observation_id":"35dc61ae-7218-4f22-ab10-2d8667b8564c","resolution":{"observed_at":"2026-08-07T12:46:45.233414Z","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-07T12:46:50.268583Z","title":"Step: learning n: M structured sparsity masks from scratch with precondition","venue":null,"work_id":"f35fa36a-9b7c-4b0d-ab02-0dc88dda87cb","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.310825Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:a6a5f84a84b6a08176f36c4c5bf44f846efbe0436f4a73b8300a6d1d293486fc","observation_id":"b557936a-4f0a-4448-b1fc-9e13bc1d81cd","resolution":{"observed_at":"2026-08-07T12:46:50.333329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01253","last_updated":"2025-03-04T08:59:26Z","snapshot_observed_at":"2026-08-07T17:34:36.283288Z","submitted_at":"2025-03-03T07:29:46Z","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU","version":2},"cited_work":{"arxiv_id":"2503.01253","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.01253","snapshot_observed_at":"2026-08-07T12:46:47.904211Z","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU","venue":"cs.DC","work_id":"a5f7e11a-f046-4ba7-8fa7-1a25e60f4c54","year":2025},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.377901Z"},"links":{"cited_paper":"/paper/2503.01253","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:e90429c767863c9a870a701e99988a2c3998b8a3bcb00d65eee56e7b0de16b9f","observation_id":"976b74cf-9585-4876-94e4-e4dc744cbd38","resolution":{"observed_at":"2026-08-07T12:46:47.950556Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:50.087099Z","title":"Determining optimal channel partition for 2: 4 fine grained structured sparsity","venue":null,"work_id":"1783b504-45f4-477b-b19f-822524b83f49","year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.448109Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:0aa254019de1f66bf14b7fbdbf3810ed18b0c6bcbb44e58346f8b4b998fac103","observation_id":"da8f57ea-6399-4965-bcbe-effad6ab3cf7","resolution":{"observed_at":"2026-08-07T12:46:50.177328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11738","last_updated":"2021-10-22T12:16:08Z","snapshot_observed_at":"2026-07-06T12:00:39.539050Z","submitted_at":"2021-10-22T12:16:08Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","version":1},"cited_work":{"arxiv_id":"2110.11738","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.11738","snapshot_observed_at":"2026-08-07T12:46:47.794236Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","venue":"math.OC","work_id":"291f5a08-baa1-4d32-9136-a7bff324210f","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.514535Z"},"links":{"cited_paper":"/paper/2110.11738","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:3fd895bd9e0121175a5109315081346d61d41f5aa169cb2456e37a808d1c32b1","observation_id":"5d774289-cd90-4c6b-836e-316870bd10b6","resolution":{"observed_at":"2026-08-07T12:46:47.839135Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5812.10758","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:47.678336Z","title":"The penn treebank: Annotating predicate argument structure","venue":null,"work_id":"22124778-d367-4735-b4bd-6cd862390355","year":1994},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.564019Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:407d20425c0c72a26c4fee7ab5f225347a43d4989fc8b18595d95aa6cd0d2f75","observation_id":"bb0aff04-6f42-452e-9996-a60be29c3e7a","resolution":{"observed_at":"2026-08-07T12:46:47.731602Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07831","last_updated":"2025-09-08T14:34:07Z","snapshot_observed_at":"2026-08-02T13:38:10.575206Z","submitted_at":"2024-06-12T02:57:41Z","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07831","snapshot_observed_at":"2026-08-07T12:46:45.664416Z","title":"Alps: Improved optimization for highly sparse one-shot pruning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.664416Z"},"links":{"cited_paper":"/paper/2406.07831","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:8c089f716ff60f4b56b894b2ef1ee298323e8920819fa9a9ae9e9d857b3dbaf4","observation_id":"7cf6acc1-50d5-41c6-8c1c-8dec0d2ee065","resolution":{"observed_at":"2026-08-07T12:46:45.664416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12983","last_updated":"2024-03-02T19:38:10Z","snapshot_observed_at":"2026-07-06T17:47:13.814205Z","submitted_at":"2024-03-02T19:38:10Z","title":"OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2403.12983","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.12983","snapshot_observed_at":"2026-08-07T12:46:47.508276Z","title":"OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization","venue":"cs.CV","work_id":"4a0d2fcd-b328-47d1-ae59-b78d54148e64","year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.781970Z"},"links":{"cited_paper":"/paper/2403.12983","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:cf17a9a4c1b243e09a4b3eede8890d3f4f53ef3f7b3b5a3d8950fa8f1485f3a4","observation_id":"bcd0d025-805d-4571-bd7a-5a6cf94f3b7b","resolution":{"observed_at":"2026-08-07T12:46:47.552786Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:45.873601Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.873601Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:6a13ad0eafaf61be949e77254a1dff4c3408e8670aea3bb13bad28874783cf90","observation_id":"f1c35d6d-b232-4689-8ce2-7ba4c7804a63","resolution":{"observed_at":"2026-08-07T12:46:45.873601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08378","last_updated":"2021-04-16T21:27:32Z","snapshot_observed_at":"2026-08-04T11:24:11.301809Z","submitted_at":"2021-04-16T21:27:32Z","title":"Accelerating Sparse Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08378","snapshot_observed_at":"2026-08-07T12:46:45.968848Z","title":"Accelerating sparse deep neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.968848Z"},"links":{"cited_paper":"/paper/2104.08378","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:c1ac30e9040cce1f9c3d5f1f80d8736bde8bd9ad9584c2a5b2eb9cb40c6aeb31","observation_id":"474a2f02-cac8-40a5-92b7-e2b064a86632","resolution":{"observed_at":"2026-08-07T12:46:45.968848Z","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-07T12:46:49.926670Z","title":"Nvidia a100 tensor core gpu architecture","venue":null,"work_id":"9706a67e-0c94-476c-8d13-77963cf8c76e","year":2020},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.062359Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:07395a0d2414a50c4f98b75195995a05694748a884d932812641a672e833824e","observation_id":"cedb292f-93ff-44e8-b68e-660cc2701f5f","resolution":{"observed_at":"2026-08-07T12:46:50.001892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:49.774487Z","title":"Accelerating condensed interior-point methods on simd/gpu architectures","venue":null,"work_id":"338fc7ed-bdc7-4e24-b3a2-16b737c3f921","year":2024},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.149196Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:fa1111d9060bc76aa9d3d32341ee8d283e863fde169a335cac4c996758f2c78f","observation_id":"21a36ac4-7335-4925-8bed-28d568c80446","resolution":{"observed_at":"2026-08-07T12:46:49.845249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:46.232871Z","title":"Automatic differentiation in pytorch","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.232871Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:0e149fa47935ceb282e2804d92b92ce6519754bb6c49529599f047d1c514cacf","observation_id":"7ed03a03-579c-4b25-be53-3be1bcf42114","resolution":{"observed_at":"2026-08-07T12:46:46.232871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.03061","last_updated":"2020-10-06T22:23:00Z","snapshot_observed_at":"2026-08-06T21:09:57.354976Z","submitted_at":"2020-10-06T22:23:00Z","title":"A Survey on Recognizing Textual Entailment as an NLP Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.03061","snapshot_observed_at":"2026-08-07T12:46:46.286331Z","title":"A survey on recognizing textual entailment as an nlp evaluation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.286331Z"},"links":{"cited_paper":"/paper/2010.03061","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:31ebf8a9c4030a1a88e028d4059d194b4c5f5513fd2b9f3057b9aef740eaa009","observation_id":"94ef6fc4-0456-401c-9bdf-f5f9cfb09e03","resolution":{"observed_at":"2026-08-07T12:46:46.286331Z","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-07T12:46:49.599734Z","title":"Channel permutations for n: m sparsity","venue":null,"work_id":"d85f8e12-7699-410a-9411-70e69dff9722","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.361605Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:d6eb2476d3bafd1e0b83e51bff5848e0714a14e7a76ad675ba69370c0f203cd4","observation_id":"d3727452-e6e6-4e34-8e3a-0df2e9437c73","resolution":{"observed_at":"2026-08-07T12:46:49.659994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:46.421436Z","title":"Robust speech recognition via large-scale weak supervision","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.421436Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:ce9fe436ff2654fdd7752740a877fbbb13122e2b6f36c8cf9bb5f749d2636439","observation_id":"631e4852-e3e4-4a94-9515-13a1c2fdcad6","resolution":{"observed_at":"2026-08-07T12:46:46.421436Z","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-07T12:46:49.405715Z","title":null,"venue":null,"work_id":"933e8b0c-d181-4b2c-a246-2dff8f00fa10","year":2020},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.452939Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:c75ee1d6c2091d639597c6dd2449294069d9738092b0e796ed4049dc0a386146","observation_id":"5d0d03a3-e076-4f63-a971-de11a0f0d5e2","resolution":{"observed_at":"2026-08-07T12:46:49.495040Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:46.501816Z","title":"Winogrande: An adversarial winograd schema challenge at scale","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.501816Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:6cad6dc3022ef101cba1b695cb2054a6f72fa21444a8c2b134402838bf8b3f34","observation_id":"0f899900-2fb2-4aa1-8e3e-3f3fa0a992d7","resolution":{"observed_at":"2026-08-07T12:46:46.501816Z","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-07T12:46:49.238382Z","title":"Combinatorial optimization: polyhedra and efficiency, volume 24","venue":null,"work_id":"802b7861-a9ed-4c90-8243-6cc05c36f76f","year":2003},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.571020Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:2a5f0519db48f803cc4ba92d1f3f35a1f2263a9aa0909425c01b6cccd0865bb0","observation_id":"54938bf5-8007-41e7-a70d-55a2ea6af930","resolution":{"observed_at":"2026-08-07T12:46:49.327369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-07-06T15:44:42.776459Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-07T12:46:46.649552Z","title":"A simple and effective pruning approach for large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.649552Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:bcaea162e66c78260a7a80dd317f3175f74c731a28fa17189aed1ee9ffceb231","observation_id":"eadf387a-624b-4ea1-81c2-9c0a79e4f7cc","resolution":{"observed_at":"2026-08-07T12:46:46.649552Z","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-07T12:46:49.077021Z","title":"Dominosearch: Find layer-wise fine-grained n: M sparse schemes from dense neural networks","venue":null,"work_id":"c0bd9e8d-56d1-4bc1-83c9-04ba874395b5","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.704093Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:bc78027cda8f86642bb2b0cd6a5a4967d0f78dba4c38937cfc37e4d88bbffddc","observation_id":"4f9bef89-66d2-45c0-af76-578a6e95566e","resolution":{"observed_at":"2026-08-07T12:46:49.161055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:48.880034Z","title":"Manifold regularized dynamic network pruning","venue":null,"work_id":"de2dcdd1-95d8-435a-a572-8d47d7d4efd7","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.775771Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:e3d846f38473f9c059d2d38e300263bfa5cdf643a848de83a46a3ca2b9e4ff8c","observation_id":"9d71f289-9990-4f06-bcd0-e7e2ab475f48","resolution":{"observed_at":"2026-08-07T12:46:48.976297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:48.728759Z","title":"Optimal transport: old and new, volume 338","venue":null,"work_id":"2f7ef9e1-7a0e-4edd-9f09-0c844213f13b","year":2008},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.842930Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:6f2521eb87bf5db6c99474dd7e43fd6f3cc896de0e1df37fb77313962168bf14","observation_id":"83b8b7c9-5e7f-479d-a4c5-ff635677cee7","resolution":{"observed_at":"2026-08-07T12:46:48.807436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:46:46.910676Z","title":"Learning structured sparsity in deep neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.910676Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:eb0e7e70be4adcd3314b96faac104d31bc79898fd7cf36000980c1a726001278","observation_id":"b94c9c1f-39e6-4838-b14a-288052c423d3","resolution":{"observed_at":"2026-08-07T12:46:46.910676Z","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-07T12:46:48.589441Z","title":"Sustainable ai: Environmental implications, challenges and opportunities","venue":null,"work_id":"52e85b33-6f93-414a-a18d-07ca8dcc12c4","year":2022},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:46.966644Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:338ab139ec7c3e4476e6d72468eaac760cee419625567fd7c7c007a025369c89","observation_id":"886369b4-f666-4131-9d79-5dc575772d54","resolution":{"observed_at":"2026-08-07T12:46:48.645502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-07T12:46:47.036380Z","title":"Hellaswag: Can a machine really finish your sentence? arXiv preprint arXiv:1905.07830, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:47.036380Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:a7027e82be7d4c5082aa87bdb539d36c2cfc79cb0b641bb3f2b280da2d828641","observation_id":"b3b9b980-907f-4d67-b9a8-61e595cbddbe","resolution":{"observed_at":"2026-08-07T12:46:47.036380Z","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-07T12:46:48.442248Z","title":"Bi-directional masks for efficient n: M sparse training","venue":null,"work_id":"8f4c95d6-2360-4953-ac86-eb4620568db0","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:47.113084Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:9e2daa525dbd9302942bf30ee4aa1276e8b815c78d38fa5a5b854e8ebf460318","observation_id":"855cb346-29fb-439e-8814-f67f8e1f482d","resolution":{"observed_at":"2026-08-07T12:46:48.493426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04010","last_updated":"2021-04-18T10:18:00Z","snapshot_observed_at":"2026-08-04T18:04:45.224844Z","submitted_at":"2021-02-08T05:55:47Z","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04010","snapshot_observed_at":"2026-08-07T12:46:47.171415Z","title":"Learning n: m fine-grained structured sparse neural networks from scratch","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:47.171415Z"},"links":{"cited_paper":"/paper/2102.04010","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:0f6eb8f7266e440b0b8e12a9cc2bde8c44fe0cfe7954603f7288f4c26575fcee","observation_id":"fe987263-940b-4fa5-962d-91ebb5ad712a","resolution":{"observed_at":"2026-08-07T12:46:47.171415Z","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-07T12:46:48.307820Z","title":"Sparse tensor core: Algorithm and hardware co-design for vector-wise sparse neural networks on modern gpus","venue":null,"work_id":"ad6ee56d-027b-4765-b400-2e432d51e3ab","year":2019},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:47.240452Z"},"links":{"citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:496e254a21e8445ebf0a75dab2c1ea38af1caa8008a3e57a5d349795cb00209c","observation_id":"d81de07e-0fe4-4a8b-a9f1-9147babd3184","resolution":{"observed_at":"2026-08-07T12:46:48.361558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":34,"verified_exact":5,"verified_fuzzy":23},"total_outbound_references":63},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2505.23949."}