{"as_of":"2026-08-08T23:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74c9126f52926dd1151851a61014b55f2af5c67b8cd7014d2a3d9896d105d286","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:39:40.093913Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"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/2510.14812/citation-record","integrity":"/paper/2510.14812/integrity","json":"/paper/2510.14812/citation-record.json","paper":"/paper/2510.14812"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:39:35.097117Z","title":"What is the state of neural network pruning? Proceedings of machine learning and systems, 2: 0 129--146, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.097117Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:60631c164f36622db698a36da9bb3fa13db090b97ddd49d5958201fe905f5f9b","observation_id":"7581c343-19e8-4a51-837e-4555b19dfba7","resolution":{"observed_at":"2026-08-04T09:39:35.097117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02549","last_updated":"2022-05-31T07:25:52Z","snapshot_observed_at":"2026-08-08T11:05:51.265936Z","submitted_at":"2022-03-04T19:54:31Z","title":"Structured Pruning is All You Need for Pruning CNNs at Initialization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02549","snapshot_observed_at":"2026-08-04T09:39:35.255343Z","title":"Structured pruning is all you need for pruning cnns at initialization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.255343Z"},"links":{"cited_paper":"/paper/2203.02549","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:e9469125a16c37dcfd254e3030f4fa3fb70d6b42817088bea969c2a1f4cda61d","observation_id":"b19f082e-05b3-438a-88fd-dfd1f996f740","resolution":{"observed_at":"2026-08-04T09:39:35.255343Z","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-04T09:39:35.437541Z","title":"Trends in the dollar training cost of machine learning systems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.437541Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:9e53d24565b21dc186c5772375f4d1610e37563f7ee9e25b71725b6a5a33eabd","observation_id":"7662c570-425d-4d30-9fe0-db1841ae86a5","resolution":{"observed_at":"2026-08-04T09:39:35.437541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14966","last_updated":"2021-01-05T07:29:16Z","snapshot_observed_at":"2026-07-06T10:28:37.759799Z","submitted_at":"2020-12-29T22:51:29Z","title":"Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.14966","snapshot_observed_at":"2026-08-04T09:39:35.617171Z","title":"Kaleidoscope: An efficient, learnable representation for all structured linear maps","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.617171Z"},"links":{"cited_paper":"/paper/2012.14966","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:bd580c587b9aaceb6339f48d3762db0875235b07b4081dc3db337b68a7ad97e7","observation_id":"81a4a234-8cab-403b-bb8e-b5e7b7eae5f0","resolution":{"observed_at":"2026-08-04T09:39:35.617171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.00029","last_updated":"2022-05-11T03:59:56Z","snapshot_observed_at":"2026-08-02T22:27:42.517397Z","submitted_at":"2021-11-30T19:00:03Z","title":"Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.00029","snapshot_observed_at":"2026-08-04T09:39:35.797730Z","title":"Pixelated butterfly: Simple and efficient sparse training for neural network models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.797730Z"},"links":{"cited_paper":"/paper/2112.00029","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:29efc85ef91cafa8c71158cdb34ed59b7b96ed73373cf8aa8b8dfc184dabd5a6","observation_id":"6891cbf4-c90b-4085-af71-9ca8d77e35e6","resolution":{"observed_at":"2026-08-04T09:39:35.797730Z","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-04T09:39:35.984560Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:35.984560Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:1df51f23559aed17a1c25b087d443e0b9592950e158b91e045159537e162611b","observation_id":"de182e47-c5ed-4688-8e22-a7d3b6580c9a","resolution":{"observed_at":"2026-08-04T09:39:35.984560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-04T09:39:36.106130Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.106130Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:77a9b6c80ef08520cfb4c3638bad60cb8ac85a50b0b9b7b3bafcb318eb5d9771","observation_id":"a80e4d75-8eb8-49ff-8aa0-c0f0f7e0f546","resolution":{"observed_at":"2026-08-04T09:39:36.106130Z","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-04T09:39:36.239404Z","title":"Rigging the lottery: Making all tickets winners","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.239404Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:bfe916245846e33ce7d3e69e173f1a7d2f4a559a295bcb90907522462fc4a30f","observation_id":"66dcc101-c726-41b1-a802-1e6bfc4ba995","resolution":{"observed_at":"2026-08-04T09:39:36.239404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-05T23:54:27.386622Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-04T09:39:36.395225Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.395225Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:88485f7bae1605b24c6f1ee28e7a331bf0f0ff042fd4008a08ca8b2c47bc0964","observation_id":"a43bd86a-4c64-44b3-b1d6-02f56c8dbac3","resolution":{"observed_at":"2026-08-04T09:39:36.395225Z","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-04T09:39:36.494363Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.494363Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:bd88b23ca9d0e2a0f2ec8b6b21ee9cf5b13a27dfbdd926ee50a8d3331c27e493","observation_id":"54333b8d-50bf-4568-9e5c-209d2a2d75ea","resolution":{"observed_at":"2026-08-04T09:39:36.494363Z","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-04T09:39:36.629307Z","title":"Accelerated sparse neural training: A provable and efficient method to find n: m transposable masks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.629307Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:9fd7694f9f04b6fda8a912d9b28fcf3ca24f3cd12e55a6ea49aa2fbca43d293d","observation_id":"1fc5419b-64c2-4594-91d5-aafccecff400","resolution":{"observed_at":"2026-08-04T09:39:36.629307Z","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-04T09:39:36.720194Z","title":"Training your sparse neural network better with any mask","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.720194Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:0d3758f1e6864127aaa39a10a5d11d94ee973d3d9c17f5be9c7d32d0d14cab36","observation_id":"535e8174-dac2-4050-b6b6-9b9a56b7fd3c","resolution":{"observed_at":"2026-08-04T09:39:36.720194Z","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-04T09:39:36.893757Z","title":"Exposing and exploiting fine-grained block structures for fast and accurate sparse training","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:36.893757Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:4507ec869d3626fccfeedb6ca7868c7b8f146025efcb6d081a433d483da82c79","observation_id":"8ff90fa7-8ce1-44bb-b061-0270a957ddcb","resolution":{"observed_at":"2026-08-04T09:39:36.893757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02299","last_updated":"2024-02-21T23:31:49Z","snapshot_observed_at":"2026-08-03T12:05:13.333642Z","submitted_at":"2023-05-03T17:48:55Z","title":"Dynamic Sparse Training with Structured Sparsity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02299","snapshot_observed_at":"2026-08-04T09:39:37.022959Z","title":"Dynamic sparse training with structured sparsity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.022959Z"},"links":{"cited_paper":"/paper/2305.02299","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:bf28124398440afef9a6068da109a137301ad383208aa08b3063a26aff7978c7","observation_id":"793d3538-7bc2-47a3-9ea2-345dc87693cc","resolution":{"observed_at":"2026-08-04T09:39:37.022959Z","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-04T09:39:37.181536Z","title":"Towards optimal structured cnn pruning via generative adversarial learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.181536Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:9cc75cac46f08bd0ce66301dd0ad64bd1bc1409e235c002010a5fa65f6bbcb0c","observation_id":"00a73331-c6c0-467a-8e93-d91377e5e9ce","resolution":{"observed_at":"2026-08-04T09:39:37.181536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11626","last_updated":"2019-06-27T13:31:30Z","snapshot_observed_at":"2026-08-02T11:51:02.442023Z","submitted_at":"2019-06-27T13:31:30Z","title":"On improving deep learning generalization with adaptive sparse connectivity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.11626","snapshot_observed_at":"2026-08-04T09:39:37.264745Z","title":"On improving deep learning generalization with adaptive sparse connectivity","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.264745Z"},"links":{"cited_paper":"/paper/1906.11626","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:263b2b75c981acdb02a1bb1e9f12b4d2e61894ba7317ddb7dd2aeacbb258b584","observation_id":"d50a98fe-6a5a-4923-9eb2-5c83cf24d92f","resolution":{"observed_at":"2026-08-04T09:39:37.264745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10912","last_updated":"2024-10-14T03:35:11Z","snapshot_observed_at":"2026-07-06T19:33:21.541657Z","submitted_at":"2024-10-14T03:35:11Z","title":"AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10912","snapshot_observed_at":"2026-08-04T09:39:37.354724Z","title":"Alphapruning: Using heavy-tailed self regularization theory for improved layer-wise pruning of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.354724Z"},"links":{"cited_paper":"/paper/2410.10912","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:af164f5f1b7a45ad89e2ba1745e0e239c9dedaecadd99850bc85288942ffece5","observation_id":"faa66efb-bc89-48e6-b6a9-b11e97515fa3","resolution":{"observed_at":"2026-08-04T09:39:37.354724Z","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-04T09:39:37.442621Z","title":"Ai beats humans for the first time in physical skill game","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.442621Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:aeab63e3a3f849408adf683034a3c5002b86020673903f6ef9bb67e9e8200414","observation_id":"c5415b76-2666-4108-a0a6-098142752a07","resolution":{"observed_at":"2026-08-04T09:39:37.442621Z","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-04T09:39:37.507895Z","title":"Autoshufflenet: Learning permutation matrices via an exact lipschitz continuous penalty in deep convolutional neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.507895Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:9e0b80e00440f1c87bbc8033f9bef228510b420025635a04f634053ffdc5dd18","observation_id":"4af2f12d-17ce-4d81-8410-67393bf2edc7","resolution":{"observed_at":"2026-08-04T09:39:37.507895Z","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-04T09:39:37.607873Z","title":"Building a large annotated corpus of english: The penn treebank","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.607873Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:11a593852c1d9b088744acbeac6048c1cff56150a4e41660762353fdc2765895","observation_id":"ccc2dcee-066a-4f59-ac68-fedf327ae439","resolution":{"observed_at":"2026-08-04T09:39:37.607873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-04T09:39:37.673840Z","title":"Pointer sentinel mixture models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.673840Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:7f90e28c5824c398a6a040c067bb2443b5835ce71c6b4699a4fe075095c24f8c","observation_id":"f566814e-e5ed-4e80-89f7-28f6dcfdd237","resolution":{"observed_at":"2026-08-04T09:39:37.673840Z","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-04T09:39:37.774742Z","title":"Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.774742Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:6411662cf063fc9b0d186b6e25f4b61033927641e798d97857a3ad170142135e","observation_id":"7194f98f-42b2-4592-a5ed-688c3d0c8b5b","resolution":{"observed_at":"2026-08-04T09:39:37.774742Z","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-04T09:39:37.949518Z","title":"Variational dropout sparsifies deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:37.949518Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:962df9b8cc58fa648687ed710aac5b198dd4b3c4725a1a1688c9dc4f15ea1514","observation_id":"756fd5e7-e6a6-45d5-ad36-d94e1f9fd839","resolution":{"observed_at":"2026-08-04T09:39:37.949518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.06440","last_updated":"2017-06-08T19:53:26Z","snapshot_observed_at":"2026-08-07T07:29:29.524604Z","submitted_at":"2016-11-19T22:48:30Z","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.06440","snapshot_observed_at":"2026-08-04T09:39:38.083410Z","title":"Pruning convolutional neural networks for resource efficient inference","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.083410Z"},"links":{"cited_paper":"/paper/1611.06440","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:091c5249ff7e4c7990b3a86e0c1c92e71a050f6e4f6f223bee47b18b152b6af4","observation_id":"45465bdb-19e5-4854-9554-78a7d7ac7aa4","resolution":{"observed_at":"2026-08-04T09:39:38.083410Z","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-04T09:39:38.183445Z","title":"On the number of linear regions of deep neural networks","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.183445Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:ada948633ddef79c7fd5253ec1c02dff6b42be4fc0ab2d0dddeeaeb48a44b907","observation_id":"8359f002-58d5-4fe4-b244-7dc06f439326","resolution":{"observed_at":"2026-08-04T09:39:38.183445Z","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-04T09:39:38.324836Z","title":"Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.324836Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:667a221954d4253bc9b2e49aa7e36467c92487d0dcd9e9a66292b2f68f382ced","observation_id":"ce16ec90-74e2-4ece-809b-a701f1d34adf","resolution":{"observed_at":"2026-08-04T09:39:38.324836Z","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-04T09:39:38.380474Z","title":"Cusparse library","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.380474Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:7cc4c65e8836c25a35889c7b38f37cf6f243c8d6afd68c62745cfe666f5e18b0","observation_id":"bb3c69a6-7bf5-4583-8151-ae9232fef8a5","resolution":{"observed_at":"2026-08-04T09:39:38.380474Z","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-04T09:39:38.555036Z","title":"Channel permutations for n: m sparsity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.555036Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:859ca99af0e34370d40c0719ed84b4f81529e40fb36eb5a5497d0289703a05b9","observation_id":"01eb8ae9-8293-4734-8947-127e935c485b","resolution":{"observed_at":"2026-08-04T09:39:38.555036Z","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-04T09:39:38.708848Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.708848Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:5a8c6bf9bc12b44335f33ad73577f4518fffdf5a27483c8e9a670398add77d5f","observation_id":"9b4206da-b49d-4c64-b4b7-eac833cb42f9","resolution":{"observed_at":"2026-08-04T09:39:38.708848Z","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-04T09:39:38.854250Z","title":"Game-playing deepmind ai can beat top humans at chess, go and poker","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.854250Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:5f8199c83876b013e258ff9c115fe53e38c22c1204bcea852afc22f988375a9d","observation_id":"7b9ec310-2273-4d5d-bd4c-78067f4cdbc1","resolution":{"observed_at":"2026-08-04T09:39:38.854250Z","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-04T09:39:38.987559Z","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:38.987559Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:2daa6294ae5f78a0cc03f7475a3f0379440169ef71d1eeaa953f28efa4f9561a","observation_id":"1d3b11c0-68e8-412a-956e-72fb6f98b2d6","resolution":{"observed_at":"2026-08-04T09:39:38.987559Z","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-04T09:39:39.150413Z","title":"Mlp-mixer: An all-mlp architecture for vision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.150413Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:412fd111e77b8b9549b3c9b9c44e835261ab229cce080ae16e9218cc5b2b8747","observation_id":"536cb013-267d-4d95-8d60-3bee51bde72e","resolution":{"observed_at":"2026-08-04T09:39:39.150413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11449","last_updated":"2025-06-13T04:01:34Z","snapshot_observed_at":"2026-08-07T22:08:27.189281Z","submitted_at":"2025-06-13T04:01:34Z","title":"Dynamic Sparse Training of Diagonally Sparse Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.11449","snapshot_observed_at":"2026-08-04T09:39:39.275110Z","title":"Dynamic sparse training of diagonally sparse networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.275110Z"},"links":{"cited_paper":"/paper/2506.11449","citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:f63309d4b8489a9c7fc391c2cc1fc874d375487b2044dae7ea4db96fc1fa362b","observation_id":"03673a12-845b-497e-8a52-82f07014e9df","resolution":{"observed_at":"2026-08-04T09:39:39.275110Z","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-04T09:39:39.391440Z","title":"Mest: Accurate and fast memory-economic sparse training framework on the edge","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.391440Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:7dfc64bd9ad64ea79233b38f585f1be1aec044f14baaadd1e636e7223ce61179","observation_id":"57ad4933-077a-4a00-bb42-e54251624848","resolution":{"observed_at":"2026-08-04T09:39:39.391440Z","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-04T09:39:39.517965Z","title":"Universal structural patterns in sparse recurrent neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.517965Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:85830bf5707a871d33a1d72610e666ece973eaadf3fb62d8c2aacce44af81d54","observation_id":"37715f22-03cd-46a9-a830-65eeb850cf2c","resolution":{"observed_at":"2026-08-04T09:39:39.517965Z","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-04T09:39:39.612275Z","title":"Epitopological learning and cannistraci-hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.612275Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:80a305377313a4b20c45d4381d98c51ade182c73bcb6c4b33f2fb328dc0200ff","observation_id":"4a5989dd-e688-442a-b078-eedaa494c885","resolution":{"observed_at":"2026-08-04T09:39:39.612275Z","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-04T09:39:39.673044Z","title":"Brain-inspired sparse training enables transformers and llms to perform as fully connected","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.673044Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:8ae8e1c82b713d37a5c1682ab1e0030e8828148cd1569ba4dc4fe42106e5fbb8","observation_id":"b888641f-67f9-492f-becd-23164f72074d","resolution":{"observed_at":"2026-08-04T09:39:39.673044Z","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-04T09:39:39.798511Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.798511Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:fd6c76da61b5b957eca00e7c7b3439489f0400683353cba0d709b7b7c422da09","observation_id":"2994ebc9-076e-4fd3-b8be-709541a4fe7d","resolution":{"observed_at":"2026-08-04T09:39:39.798511Z","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-04T09:39:39.896839Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:39.896839Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:871fafc080b99d1c88c3d4402ba4a46cd51ae5e7b6045a9a01c82da3377b9ffe","observation_id":"f04adbf7-408f-48a3-9179-e46f347f3078","resolution":{"observed_at":"2026-08-04T09:39:39.896839Z","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-04T09:39:40.008102Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:40.008102Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:0a2ef7889574a37b6ddb0ed81d80d96987d8efd8152fd5ac26d585f01815f08a","observation_id":"91d62394-f3f3-48ff-a333-2843f04a716e","resolution":{"observed_at":"2026-08-04T09:39:40.008102Z","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-04T09:39:40.093913Z","title":"winning tickets,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T09:39:40.093913Z"},"links":{"citing_paper":"/paper/2510.14812"},"observation_digest":"sha256:baab836747a6cde84586bad63544ab2f0078a87970e463fe80184872be65f55c","observation_id":"309a6859-dcd1-47c5-99bf-4430ad43c4f7","resolution":{"observed_at":"2026-08-04T09:39:40.093913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.14812","last_updated":"2026-07-21T01:15:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T13:33:42.479383Z","submitted_at":"2025-10-16T15:48:17Z","title":"SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2510.14812."}