{"as_of":"2026-08-19T03:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c8c26a0020fc62a81523c4e1531b087576787fceb8612568853f28df234ce11","coverage":[{"denominator":168,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:11:27.166202Z","state":"measured"},{"denominator":102,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":102,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:10:53.203470Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:11:03.194661Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.12441","snapshot_observed_at":"2026-08-09T18:10:53.203470Z","title":"Numerical pruning for efficient autoregressive models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00688","last_updated":"2025-02-02T06:19:59Z","snapshot_observed_at":"2026-08-15T13:03:01.988904Z","submitted_at":"2025-02-02T06:19:59Z","title":"High-Order Matching for One-Step Shortcut Diffusion Models","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T18:10:53.203470Z"},"links":{"cited_paper":"/paper/2412.12441","citing_paper":"/paper/2502.00688"},"observation_digest":"sha256:8aa0df2737c7babf7db555fe453402fe0b24e3891693324c51b96ceafab91519","observation_id":"788d3fa3-001e-4dba-b718-7b1c1ed03a10","resolution":{"observed_at":"2026-08-09T18:10:53.203470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"cited_work":{"arxiv_id":"2412.12441","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.12441","snapshot_observed_at":"2026-08-07T15:11:03.194661Z","title":"Numerical Pruning for Efficient Autoregressive Models","venue":"cs.LG","work_id":"5a8b954d-00b1-471c-a860-e147b544e454","year":2024},"citing_paper":{"arxiv_id":"2505.16284","last_updated":"2025-05-22T06:26:28Z","snapshot_observed_at":"2026-08-15T08:26:08.362157Z","submitted_at":"2025-05-22T06:26:28Z","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:11:01.891088Z"},"links":{"cited_paper":"/paper/2412.12441","citing_paper":"/paper/2505.16284"},"observation_digest":"sha256:cdff67f1bfbf54892f75cb3dfa03c7772a702aacd0467838f144a73f66bec831","observation_id":"2ab26d5d-2cb1-4703-8da2-06c387b504c4","resolution":{"observed_at":"2026-08-07T15:11:03.228296Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.12441/citation-record","integrity":"/paper/2412.12441/integrity","json":"/paper/2412.12441/citation-record.json","paper":"/paper/2412.12441"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:11:26.793267Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.793267Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:99cd9ef5ec03e5817c2331f9eebccd4c7709631d1c20cac18d9631165c3a86c6","observation_id":"1c23f162-dc2b-402f-87ba-36070731d438","resolution":{"observed_at":"2026-08-11T14:11:26.793267Z","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-11T14:11:26.797900Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.797900Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:f5f9c193a947c4870f846db369b52c9fd57d0feac7e9b19468bf4fe18afcfa38","observation_id":"9867d48b-c5af-4d32-9978-a760d6412e54","resolution":{"observed_at":"2026-08-11T14:11:26.797900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","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-11T14:11:26.802189Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.802189Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:321e49d30ecc4620862d341f15483fd9758c691a149f484363c68a139b216d92","observation_id":"f7c1f08e-4822-4e2e-b138-9eac169e15da","resolution":{"observed_at":"2026-08-11T14:11:26.802189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14227","last_updated":"2022-11-25T16:40:49Z","snapshot_observed_at":"2026-08-18T22:43:13.096935Z","submitted_at":"2022-11-25T16:40:49Z","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","version":1},"cited_work":{"arxiv_id":"2211.14227","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.14227","snapshot_observed_at":"2026-08-11T14:11:29.094772Z","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","venue":"cs.LG","work_id":"a49bc1e5-64d9-40c6-b691-04b2b5cba43c","year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.806393Z"},"links":{"cited_paper":"/paper/2211.14227","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:8cd16ecad673155ce255614c2e3177328b4620749b0cf4b2054ed6ab1624a47e","observation_id":"d441e4ee-9e1d-4605-b450-4fdbc32f4000","resolution":{"observed_at":"2026-08-11T14:11:29.099178Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:11:26.810544Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.810544Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:003206cd35f0680af47e95ec5202f5ef8c9f77a3ea9040343b4bcb453ca9ebdb","observation_id":"49dbb188-5b05-4540-95db-9c4bc837f5c1","resolution":{"observed_at":"2026-08-11T14:11:26.810544Z","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-11T14:11:26.814673Z","title":"A.; and Wainwright, M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.814673Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:a956740c8d0a58002993c2dbdf4d5b0707b6807485dc3281e1b2e3e88f0703a6","observation_id":"7c8c9773-de10-4c8c-883e-21969a75b7e0","resolution":{"observed_at":"2026-08-11T14:11:26.814673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11983","last_updated":"2023-12-19T09:23:48Z","snapshot_observed_at":"2026-08-18T02:42:04.375596Z","submitted_at":"2023-12-19T09:23:48Z","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11983","snapshot_observed_at":"2026-08-11T14:11:26.819377Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.819377Z"},"links":{"cited_paper":"/paper/2312.11983","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:372057528796e222efa760d443aa7f138ff9c6deab8bdc3829d7b79bbeb8809d","observation_id":"7d1058f3-af77-41d9-85c9-33629ac93b02","resolution":{"observed_at":"2026-08-11T14:11:26.819377Z","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-11T14:11:26.823429Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.823429Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:e62cfffdf45444edc5e2eeba7fe602885cdea49161931c47b1d1a3f0ab2a74c1","observation_id":"21cc0c12-1b5a-46ba-b0b5-0af1392f9d5f","resolution":{"observed_at":"2026-08-11T14:11:26.823429Z","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-11T14:11:26.827396Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.827396Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:1fbfc8050c454abfb70a757eade223464f65963de27398eafa241da806ca3b8c","observation_id":"ce97fc70-0199-4b3d-a3ea-76b397085eaa","resolution":{"observed_at":"2026-08-11T14:11:26.827396Z","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-11T14:11:26.830903Z","title":"S.; Hu, W.; Li, Z.; Salakhutdinov, R","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.830903Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:1e20dd6f9bc089bdfc9b2851e57fbf620a968470e19c607b26d5bd95844ee67c","observation_id":"e35ddc68-18e1-4c8f-b730-70cca16e0432","resolution":{"observed_at":"2026-08-11T14:11:26.830903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15024","last_updated":"2024-02-09T17:59:40Z","snapshot_observed_at":"2026-08-16T14:24:10.346445Z","submitted_at":"2024-01-26T17:35:45Z","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15024","snapshot_observed_at":"2026-08-11T14:11:26.834482Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.834482Z"},"links":{"cited_paper":"/paper/2401.15024","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:eeb5758f9eb7fb103df9554a568a8a01d3e147ee5316fc5b42609036736f2d2e","observation_id":"58de5e41-59a0-4600-a5d5-6ceac5e1ad53","resolution":{"observed_at":"2026-08-11T14:11:26.834482Z","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-11T14:11:26.838775Z","title":"L.; Bousquet, O.; and Mendelson, S","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.838775Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:e25d990767184545f3a8d7cc6366d3e15d4733ae2de33044c93998a26f09cc5e","observation_id":"46f5240d-fd02-4318-8667-6169f1971cc8","resolution":{"observed_at":"2026-08-11T14:11:26.838775Z","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-11T14:11:26.842410Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.842410Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:464328a7643d5041d01706dd6feb9308b81f9db18639db1046345d879b972bdb","observation_id":"0da6b6ff-c866-4153-8de3-638138dfa54e","resolution":{"observed_at":"2026-08-11T14:11:26.842410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17482","last_updated":"2023-05-27T14:23:14Z","snapshot_observed_at":"2026-08-16T15:29:02.606753Z","submitted_at":"2023-05-27T14:23:14Z","title":"Federated Empirical Risk Minimization via Second-Order Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.17482","snapshot_observed_at":"2026-08-11T14:11:26.845495Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.845495Z"},"links":{"cited_paper":"/paper/2305.17482","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:6909b97a157a90af7fce2a6ea9f8c2991792e43f240a19e0cc18553c945c56b2","observation_id":"fdfffeab-2388-48d7-8555-e24ab680b3e1","resolution":{"observed_at":"2026-08-11T14:11:26.845495Z","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-11T14:11:26.849340Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.849340Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:df55aefaec461c101deb640fe556959455c9ff9120e74c210e4827b640559de3","observation_id":"a445d9bd-9b7a-41ea-b7dd-59f586a39c63","resolution":{"observed_at":"2026-08-11T14:11:26.849340Z","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-11T14:11:26.852623Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.852623Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:4953c04b85a322b3679cf593fc05c92b918fe737a8cca06e0589f43c35dcc6ba","observation_id":"5de42c2f-db0c-4413-bf5f-ab42ec2d3151","resolution":{"observed_at":"2026-08-11T14:11:26.852623Z","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-11T14:11:26.855650Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.855650Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:8ce8edb93a5f7ad8bdb7225045c8fbe9f125f0fe92e5c703e627410158c20a68","observation_id":"09756181-5b5b-417b-917b-9b6da7b42583","resolution":{"observed_at":"2026-08-11T14:11:26.855650Z","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-11T14:11:26.858654Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.858654Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:ee1560f77780843611b3be770ae12dc1058ae306d98aecd44daeef513351f0b9","observation_id":"6ebe249e-fe25-4edd-b4a9-2a31a5d5eb6a","resolution":{"observed_at":"2026-08-11T14:11:26.858654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11648","last_updated":"2020-12-09T02:02:10Z","snapshot_observed_at":"2026-08-15T22:54:40.302290Z","submitted_at":"2020-06-20T20:26:14Z","title":"Training (Overparametrized) Neural Networks in Near-Linear Time","version":2},"cited_work":{"arxiv_id":"2006.11648","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.11648","snapshot_observed_at":"2026-08-11T14:11:29.048451Z","title":"Training (Overparametrized) Neural Networks in Near-Linear Time","venue":"cs.LG","work_id":"397e1b92-9ee4-4d4c-b424-be6baa4d8f5f","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.862323Z"},"links":{"cited_paper":"/paper/2006.11648","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:84a3be0a7634bad7fcfdcbdc0c474cf10744b8df82ac23f5279205cdece71abf","observation_id":"08bc0baf-dca6-4868-9ac4-253f328120ff","resolution":{"observed_at":"2026-08-11T14:11:29.053121Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.02207","last_updated":"2023-04-05T03:43:38Z","snapshot_observed_at":"2026-08-16T15:42:40.256782Z","submitted_at":"2023-04-05T03:43:38Z","title":"Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.02207","snapshot_observed_at":"2026-08-11T14:11:26.866607Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.866607Z"},"links":{"cited_paper":"/paper/2304.02207","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:8cce6df98ce91bdc0d80c97aaa580bb63c347c1bc281d538d59653720f188bc8","observation_id":"b8fc83ed-91f9-4e27-a64d-17256dae9b29","resolution":{"observed_at":"2026-08-11T14:11:26.866607Z","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-11T14:11:26.870204Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.870204Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:92e86487f0363646a5ed3a7cba012784ad800533d98276b388c06c8d540daba3","observation_id":"6b062739-8a2f-411c-8218-78c40bf001a7","resolution":{"observed_at":"2026-08-11T14:11:26.870204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11675","last_updated":"2019-09-25T15:28:33Z","snapshot_observed_at":"2026-08-18T09:12:11.824604Z","submitted_at":"2019-05-28T08:30:24Z","title":"Gram-Gauss-Newton Method: Learning Overparameterized Neural Networks for Regression Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11675","snapshot_observed_at":"2026-08-11T14:11:26.873626Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.873626Z"},"links":{"cited_paper":"/paper/1905.11675","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:df7ea606792b6b15a2abdd1b3bf6021cc23bee22c1a82453853242740b83bbdc","observation_id":"ac556722-e26a-4cda-8be8-12655d14079c","resolution":{"observed_at":"2026-08-11T14:11:26.873626Z","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-11T14:11:26.878266Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.878266Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9e43c49f0a2731319de55705f41c249f35ccb16875b267a057190c6cffba09a2","observation_id":"4a0d4c79-dacc-486a-968e-d23cb87147ee","resolution":{"observed_at":"2026-08-11T14:11:26.878266Z","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-11T14:11:26.881674Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.881674Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:11bc5a3e36580ff6eac565378f33ef9a4d9fbf9b88c78c76ee0ed1f2f5c3b2ec","observation_id":"1194b743-1b9a-403c-b6db-400078b521c8","resolution":{"observed_at":"2026-08-11T14:11:26.881674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07602","last_updated":"2024-12-01T06:39:41Z","snapshot_observed_at":"2026-08-16T13:00:54.576654Z","submitted_at":"2024-11-12T07:24:41Z","title":"Circuit Complexity Bounds for RoPE-based Transformer Architecture","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.07602","snapshot_observed_at":"2026-08-11T14:11:26.885071Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.885071Z"},"links":{"cited_paper":"/paper/2411.07602","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9e53c159ace0aff25e481c2c584e88319c75cefeb4c4e869fb324271d4ec9e0e","observation_id":"d530ae13-cf75-4a9a-87da-ede2e826a662","resolution":{"observed_at":"2026-08-11T14:11:26.885071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11268","last_updated":"2025-02-28T22:12:33Z","snapshot_observed_at":"2026-08-16T13:09:20.125737Z","submitted_at":"2024-10-15T04:44:23Z","title":"Bypassing the Exponential Dependency: Looped Transformers Efficiently Learn In-context by Multi-step Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11268","snapshot_observed_at":"2026-08-11T14:11:26.888859Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.888859Z"},"links":{"cited_paper":"/paper/2410.11268","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:2553bc1fc15d6b101d93b507672f7d3cc99aad460219dbfb9a18a048f95cf7c0","observation_id":"6064b54f-7ea6-4ec2-8904-08c8d1b2efad","resolution":{"observed_at":"2026-08-11T14:11:26.888859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10165","last_updated":"2025-02-24T08:42:25Z","snapshot_observed_at":"2026-08-18T13:01:58.711060Z","submitted_at":"2024-10-14T05:18:02Z","title":"HSR-Enhanced Sparse Attention Acceleration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10165","snapshot_observed_at":"2026-08-11T14:11:26.892506Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.892506Z"},"links":{"cited_paper":"/paper/2410.10165","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9ad934f69f68e1ee88ef57ae8fc57a81b1edd7f447dcecbfd2dbc669b5e86c6d","observation_id":"9c5b33e9-0c68-4216-8a3b-9939d8131743","resolution":{"observed_at":"2026-08-11T14:11:26.892506Z","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-11T14:11:26.896058Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.896058Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5859d32a74c380d446b48f33199a2ee54f329252e558e70d7b3d01584d51f6d2","observation_id":"a96f381c-b648-4054-a971-81b9e961b4d6","resolution":{"observed_at":"2026-08-11T14:11:26.896058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-08-17T14:44:42.060038Z","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-11T14:11:26.899308Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.899308Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:8d0d5a81ea40fb123c2a1ed46d63efd34e8dfde8cbdd9c0cf0e5aca578563891","observation_id":"48eae7ba-db4a-4e2b-b2af-523d127d01df","resolution":{"observed_at":"2026-08-11T14:11:26.899308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04341","last_updated":"2019-06-11T01:31:41Z","snapshot_observed_at":"2026-08-16T14:00:03.452025Z","submitted_at":"2019-06-11T01:31:41Z","title":"What Does BERT Look At? An Analysis of BERT's Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.04341","snapshot_observed_at":"2026-08-11T14:11:26.902928Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.902928Z"},"links":{"cited_paper":"/paper/1906.04341","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:686e342ce2bf64966457b7cd0ab81028635fde511aab09079bf9214cbd13393c","observation_id":"c5a76d25-a374-4606-9d34-f201e49d7a93","resolution":{"observed_at":"2026-08-11T14:11:26.902928Z","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-08-14T19:36:07.505691Z","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-11T14:11:26.906904Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.906904Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:0826e462e1f40f8f7d056fbd482c9ed7ba91994c04427fd19e86f8598e4c9d2b","observation_id":"f375386f-cfcc-48fc-b126-8ba0a028baff","resolution":{"observed_at":"2026-08-11T14:11:26.906904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-11T14:11:26.910858Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.910858Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:d9108dbb3575702385f86e3a86005abbb9316cb1ebe4475919e57ab0deb12d18","observation_id":"cea08c23-92ef-4227-86b0-4ddbe433c5aa","resolution":{"observed_at":"2026-08-11T14:11:26.910858Z","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-11T14:11:26.914687Z","title":"B.; Lee, Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.914687Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5f7b74f18736ecd554c8b84aed455fd43d111032321a33b0abf5cef6b0fb6942","observation_id":"19cc58de-6738-4308-bbe0-e9bb98311704","resolution":{"observed_at":"2026-08-11T14:11:26.914687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0406021","last_updated":"2006-05-20T14:25:21Z","snapshot_observed_at":"2026-07-07T03:05:50.883971Z","submitted_at":"2004-06-16T01:23:03Z","title":"A direct formulation for sparse PCA using semidefinite programming","version":3},"cited_work":{"arxiv_id":"cs/0406021","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0406021","snapshot_observed_at":"2026-08-11T14:11:28.943439Z","title":"A direct formulation for sparse PCA using semidefinite programming","venue":"cs.CE","work_id":"38a4d32d-4f08-45d4-a62b-4b81b66b2b6c","year":2004},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.917693Z"},"links":{"cited_paper":"/paper/cs/0406021","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:013cd1a6af70f4991c539c364dda95bc94a14554422efab64f87fabb7f0ed407","observation_id":"777120cf-a64d-486f-9810-d07010b0a9e4","resolution":{"observed_at":"2026-08-11T14:11:28.947684Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.0156","last_updated":"2014-11-29T21:29:15Z","snapshot_observed_at":"2026-08-15T17:14:08.238178Z","submitted_at":"2014-11-29T21:29:15Z","title":"Constant Step Size Least-Mean-Square: Bias-Variance Trade-offs and Optimal Sampling Distributions","version":1},"cited_work":{"arxiv_id":"1412.0156","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.0156","snapshot_observed_at":"2026-08-11T14:11:28.928496Z","title":"Constant Step Size Least-Mean-Square: Bias-Variance Trade-offs and Optimal Sampling Distributions","venue":"cs.LG","work_id":"def0097c-0d4f-4ba4-bbab-1324a7de5296","year":2014},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.921097Z"},"links":{"cited_paper":"/paper/1412.0156","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:7fa99903bdb2a02c6c412398c19f93d75bee178ba8e95f12671b92310c852039","observation_id":"8c083fec-d2bb-40a1-9c07-6a0a22b2fa65","resolution":{"observed_at":"2026-08-11T14:11:28.932715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:11:26.924819Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.924819Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:f860f46eb0665dec00b9bc7965ad0d611132c123a22cfb816a290346899830fc","observation_id":"24b36cad-59aa-45d3-8bfd-16910e63cc79","resolution":{"observed_at":"2026-08-11T14:11:26.924819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10411","last_updated":"2023-04-26T15:34:52Z","snapshot_observed_at":"2026-08-18T13:07:36.230958Z","submitted_at":"2023-04-20T15:50:35Z","title":"Attention Scheme Inspired Softmax Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10411","snapshot_observed_at":"2026-08-11T14:11:26.927872Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.927872Z"},"links":{"cited_paper":"/paper/2304.10411","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:cd8ad0cdec3508d80867eed3ba0e393d75545f7d995999ad72337dfc2574930d","observation_id":"b131ed28-bd46-42cc-9cf4-0d4f5a577b2a","resolution":{"observed_at":"2026-08-11T14:11:26.927872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04397","last_updated":"2023-04-10T05:52:38Z","snapshot_observed_at":"2026-08-16T15:41:40.150021Z","submitted_at":"2023-04-10T05:52:38Z","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04397","snapshot_observed_at":"2026-08-11T14:11:26.931610Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.931610Z"},"links":{"cited_paper":"/paper/2304.04397","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:301c6e88f2f653b09a77cc451052132ac2e168d2f06931af1ae2a89ec73f8f4a","observation_id":"8fd3a957-14a6-4972-b27a-fcbade682099","resolution":{"observed_at":"2026-08-11T14:11:26.931610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12462","last_updated":"2023-10-19T04:41:01Z","snapshot_observed_at":"2026-08-16T14:50:51.353589Z","submitted_at":"2023-10-19T04:41:01Z","title":"Unmasking Transformers: A Theoretical Approach to Data Recovery via Attention Weights","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12462","snapshot_observed_at":"2026-08-11T14:11:26.935672Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.935672Z"},"links":{"cited_paper":"/paper/2310.12462","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:240374fa071e7e7e0e933d062b32a968de883f2b5e13aae45319e399a5aebb21","observation_id":"7438ad60-30a7-4d3d-a21b-8e8a19428365","resolution":{"observed_at":"2026-08-11T14:11:26.935672Z","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-11T14:11:26.939376Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.939376Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:03bf32fe2f46da7e48b6a35bbb176e11de7cb6373aef2855e1316489138f5480","observation_id":"fc6b1261-7d9c-4b72-b14c-6aebe12227f9","resolution":{"observed_at":"2026-08-11T14:11:26.939376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.06443","last_updated":"2019-03-15T02:31:22Z","snapshot_observed_at":"2026-08-14T22:00:37.383008Z","submitted_at":"2016-04-21T19:54:24Z","title":"Robust Estimators in High Dimensions without the Computational Intractability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.06443","snapshot_observed_at":"2026-08-11T14:11:26.943120Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.943120Z"},"links":{"cited_paper":"/paper/1604.06443","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:a769fc7a5eb4bbe083f92b23ef3a9a12bee2354b6db9d53dcf0e2eef0029b3fc","observation_id":"212cc88d-cd7c-4d35-807e-4199eb597910","resolution":{"observed_at":"2026-08-11T14:11:26.943120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05365","last_updated":"2023-09-13T17:54:27Z","snapshot_observed_at":"2026-08-18T19:54:50.770975Z","submitted_at":"2020-11-10T19:35:02Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","version":3},"cited_work":{"arxiv_id":"2011.05365","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.05365","snapshot_observed_at":"2026-08-11T14:11:28.875699Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","venue":"cs.DS","work_id":"e2532557-5147-4ff7-a405-df40e3f6e8bf","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.946955Z"},"links":{"cited_paper":"/paper/2011.05365","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5dfce9e3dd0ea630ef304bdfd034d14d57965654c6bd01f6f2951c971eaf72a6","observation_id":"c8477f99-cdc1-4e37-bb4e-cafb3f1deb9e","resolution":{"observed_at":"2026-08-11T14:11:28.879217Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11366","last_updated":"2019-06-26T22:23:14Z","snapshot_observed_at":"2026-08-18T16:36:21.353935Z","submitted_at":"2019-06-26T22:23:14Z","title":"Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.11366","snapshot_observed_at":"2026-08-11T14:11:26.951701Z","title":"B.; and Li, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.951701Z"},"links":{"cited_paper":"/paper/1906.11366","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:600ddee5b45d2a7efcc06e092d7aacab6b1018f615201d51276c20be9cedddba","observation_id":"f1553984-7751-4c8d-94b3-f459c030ef37","resolution":{"observed_at":"2026-08-11T14:11:26.951701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02054","last_updated":"2019-02-05T01:59:59Z","snapshot_observed_at":"2026-08-14T18:19:41.565109Z","submitted_at":"2018-10-04T04:47:47Z","title":"Gradient Descent Provably Optimizes Over-parameterized Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02054","snapshot_observed_at":"2026-08-11T14:11:26.956531Z","title":"S.; Zhai, X.; Poczos, B.; and Singh, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.956531Z"},"links":{"cited_paper":"/paper/1810.02054","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:78bc18613a48f184dcbdab9908cd29d7715553b519b343b8e51830e8c4976aba","observation_id":"51784a4e-2868-4f30-ab38-b78aca0448ec","resolution":{"observed_at":"2026-08-11T14:11:26.956531Z","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-11T14:11:26.961024Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.961024Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:1106f5c1c7d6dd1ef5651470a4b62e286ef90c4b46f8c235e7fedaa2099db700","observation_id":"7a5bade8-72f0-4c80-85e9-302210e1bca6","resolution":{"observed_at":"2026-08-11T14:11:26.961024Z","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-11T14:11:26.965318Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.965318Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:8f97cf421b6cefc8b94f141cb147549586693fccee2e7537f3daef58336fa2e0","observation_id":"fe44e09b-2a00-4e3a-9e7b-07071814b7fc","resolution":{"observed_at":"2026-08-11T14:11:26.965318Z","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-11T14:11:26.969862Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.969862Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9cbfc97840bb22e07c3b7af2f41d19b4c55f8cbb4579a523d1380f5d14efd5c2","observation_id":"02a558c5-7db1-4f49-a781-f70e1dd258f6","resolution":{"observed_at":"2026-08-11T14:11:26.969862Z","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-11T14:11:26.974417Z","title":"M.; and Sidford, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.974417Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:7439f5e12594d558fc52bd8c0b1bc5d04f1bb17555631e256ca4cb03ecd48e41","observation_id":"7fa1f912-2f50-4c6d-99d7-f187ef8faa5f","resolution":{"observed_at":"2026-08-11T14:11:26.974417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16504","last_updated":"2023-03-29T07:29:07Z","snapshot_observed_at":"2026-08-16T15:44:28.871755Z","submitted_at":"2023-03-29T07:29:07Z","title":"An Over-parameterized Exponential Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16504","snapshot_observed_at":"2026-08-11T14:11:26.978076Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.978076Z"},"links":{"cited_paper":"/paper/2303.16504","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:a5f3e12d092581aecd4b07439860dd9f4342bf23ab6608f9de717de2578c6345","observation_id":"1a1a41e1-2011-46eb-a0c6-6ba73e354c58","resolution":{"observed_at":"2026-08-11T14:11:26.978076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-08-17T01:32:27.930022Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-08-11T14:11:26.982073Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.982073Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:6c08af4b3592550b574bbbde77ba9eefe0c8e795cc49c54b044ed5f595965627","observation_id":"0b480c9a-a69f-4621-bb48-366cece5ede9","resolution":{"observed_at":"2026-08-11T14:11:26.982073Z","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-11T14:11:26.985810Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.985810Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:0c3c5c1debf9609f854ab9e2d0f3a2d3589978662513ddbd85d700dd75d46c45","observation_id":"7babcac9-2796-4618-802d-cc9055ef9976","resolution":{"observed_at":"2026-08-11T14:11:26.985810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","snapshot_observed_at":"2026-08-16T15:34:47.442597Z","submitted_at":"2023-05-08T13:32:41Z","title":"Differentially Private Attention Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04701","snapshot_observed_at":"2026-08-11T14:11:26.989227Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.989227Z"},"links":{"cited_paper":"/paper/2305.04701","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:997cbaa0f10aae4e153fef1b0d50b0fab30ed58751d2285597c7571ec28ec5c3","observation_id":"44bd6e46-d7bd-48f7-ae2d-a9aa36ee6715","resolution":{"observed_at":"2026-08-11T14:11:26.989227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.00660","last_updated":"2025-02-17T05:12:27Z","snapshot_observed_at":"2026-08-16T15:36:36.165904Z","submitted_at":"2023-05-01T05:16:07Z","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.00660","snapshot_observed_at":"2026-08-11T14:11:26.992847Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.992847Z"},"links":{"cited_paper":"/paper/2305.00660","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5bc7b2824892e8699e1b2233a4104a26cb648fd3c1dd7bfeab87eb60100c382a","observation_id":"15c4b4c2-ae01-462c-9ce5-3a2bb670db9e","resolution":{"observed_at":"2026-08-11T14:11:26.992847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07027","last_updated":"2024-02-10T19:21:29Z","snapshot_observed_at":"2026-08-18T14:05:22.676329Z","submitted_at":"2024-02-10T19:21:29Z","title":"Quantum Speedup for Spectral Approximation of Kronecker Products","version":1},"cited_work":{"arxiv_id":"2402.07027","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.07027","snapshot_observed_at":"2026-08-11T14:11:28.694523Z","title":"Quantum Speedup for Spectral Approximation of Kronecker Products","venue":"cs.DS","work_id":"46922d28-5470-440a-8d03-5d5213103462","year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.996611Z"},"links":{"cited_paper":"/paper/2402.07027","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:ec3054adf74e9bc9b8e344c51f9c15ba084813f4c3eeb00f09ff3d94d4da690f","observation_id":"8fadf5cc-b654-4162-a2b9-bf47c094fc60","resolution":{"observed_at":"2026-08-11T14:11:28.698545Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:11:27.000117Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.000117Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:3e97f775ca0cce1d0a290a8177303c3e4a9870e13f6f0facfd5b9306aca67530","observation_id":"d1bc78c2-6544-48ca-b80d-7e09f2d2d71c","resolution":{"observed_at":"2026-08-11T14:11:27.000117Z","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-11T14:11:27.003567Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.003567Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5cf2366d24dd69f6f5e865e3d20cd042b38c4cfdc28883dee9441277cd12a1a0","observation_id":"7f22d504-5b98-4299-b9a5-25cdbb770463","resolution":{"observed_at":"2026-08-11T14:11:27.003567Z","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-11T14:11:27.007074Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.007074Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:ec4077b36c22d74c7eeb148e3de3ab9b33cd35bb04ee8a2234b821fed11e555a","observation_id":"2d412280-ed29-40a7-b4d4-3d6ab196d620","resolution":{"observed_at":"2026-08-11T14:11:27.007074Z","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-11T14:11:27.010505Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.010505Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:d171765766eddf908796054d2b85e1fe391b41caf21bf4f1c8c641c3debe12db","observation_id":"0157253d-87e2-4fd3-b81d-c89efd72386e","resolution":{"observed_at":"2026-08-11T14:11:27.010505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09469","last_updated":"2025-03-09T07:14:46Z","snapshot_observed_at":"2026-08-16T14:19:27.503188Z","submitted_at":"2024-02-12T05:52:06Z","title":"Fourier Circuits in Neural Networks and Transformers: A Case Study of Modular Arithmetic with Multiple Inputs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09469","snapshot_observed_at":"2026-08-11T14:11:27.013958Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.013958Z"},"links":{"cited_paper":"/paper/2402.09469","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:10928abf2c88abac4d0a436bf7cd2b7ccf515e879cdc7857a6be0a4941379f05","observation_id":"475f8bbe-670a-4978-9d92-64691aaeddc1","resolution":{"observed_at":"2026-08-11T14:11:27.013958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13621","last_updated":"2024-11-02T05:30:20Z","snapshot_observed_at":"2026-08-18T05:29:22.703558Z","submitted_at":"2024-07-18T15:57:55Z","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.13621","snapshot_observed_at":"2026-08-11T14:11:27.017827Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.017827Z"},"links":{"cited_paper":"/paper/2407.13621","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:df1aa9e5622135c7feb96dcc5fd3715fc808baf19424716c2ef0730a23a190cb","observation_id":"ecc92257-f3c7-4402-8db4-d7a245855701","resolution":{"observed_at":"2026-08-11T14:11:27.017827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.06033","last_updated":"2022-11-11T07:09:31Z","snapshot_observed_at":"2026-08-17T23:06:35.595770Z","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.06033","snapshot_observed_at":"2026-08-11T14:11:27.021565Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.021565Z"},"links":{"cited_paper":"/paper/2211.06033","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:45ece7f0335e3d728d33bb81a2df21a412af6d0c84b237a4cc4856968f54382b","observation_id":"d20432d1-1325-4723-940c-14bb35596db3","resolution":{"observed_at":"2026-08-11T14:11:27.021565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07735","last_updated":"2025-02-11T21:37:03Z","snapshot_observed_at":"2026-08-16T15:16:03.842396Z","submitted_at":"2023-07-15T07:19:29Z","title":"Faster Algorithms for Structured Linear and Kernel Support Vector Machines","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07735","snapshot_observed_at":"2026-08-11T14:11:27.025518Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.025518Z"},"links":{"cited_paper":"/paper/2307.07735","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:549ac5af0e1f1cb135c3e411b6215e7d017aca46778d57d0b795474dbbd26b43","observation_id":"1c476d48-7b8a-4adf-b59a-9e80117109dd","resolution":{"observed_at":"2026-08-11T14:11:27.025518Z","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-11T14:11:27.029538Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.029538Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:19f32170a94aa357693eda3ee900ff550fb3a267973ddad6accffe723c1330e2","observation_id":"18ca8f61-e376-4aa8-bb7d-dd1efc03a104","resolution":{"observed_at":"2026-08-11T14:11:27.029538Z","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-11T14:11:27.032870Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.032870Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:79fa0a39361b98eebd7f96595807484d7d4a9e046641c6a0932495f10bc4a821","observation_id":"e504df6c-cba4-4dd7-94c2-d829e65358a6","resolution":{"observed_at":"2026-08-11T14:11:27.032870Z","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-11T14:11:27.036443Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.036443Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:c8925b2d20a5025975b94264efd75620d4720ae6968ca3d1909ab0dc85718478","observation_id":"95beac8a-c205-46b5-adfd-c84133eec324","resolution":{"observed_at":"2026-08-11T14:11:27.036443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03368","last_updated":"2019-09-08T02:04:32Z","snapshot_observed_at":"2026-08-07T17:17:16.059036Z","submitted_at":"2019-09-08T02:04:32Z","title":"Designing and Interpreting Probes with Control Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03368","snapshot_observed_at":"2026-08-11T14:11:27.040097Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.040097Z"},"links":{"cited_paper":"/paper/1909.03368","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:49f3e45a8c85a91032dc5976a1ab0760770c60b475e7312f1cc6cc6d36d7c6e7","observation_id":"828ae020-bb8f-45d8-871f-128c63cf223f","resolution":{"observed_at":"2026-08-11T14:11:27.040097Z","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-11T14:11:27.043902Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.043902Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:3f80b322af6e42b18ae1fdbff89be769fd5047f6177fcb3f8cc94a817f43ffaa","observation_id":"2505b93b-5a0e-43a3-a906-9b3f46a2a4c8","resolution":{"observed_at":"2026-08-11T14:11:27.043902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.08208","last_updated":"2021-11-18T19:59:05Z","snapshot_observed_at":"2026-08-18T01:37:12.806974Z","submitted_at":"2021-01-20T16:41:47Z","title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.08208","snapshot_observed_at":"2026-08-11T14:11:27.048436Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.048436Z"},"links":{"cited_paper":"/paper/2101.08208","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:47cbd8b86a90771f667b2e9f6dd46767d668a133c9f47ffb47458937e8d54c86","observation_id":"c2f461c1-7ae9-4f76-bae0-ac2de985b86c","resolution":{"observed_at":"2026-08-11T14:11:27.048436Z","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-11T14:11:27.052359Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.052359Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:05226fa602a6e6956a93c102077cadba0f17ce4d3f5bc9741c840e679c882d14","observation_id":"1915dddc-6256-4d49-baa8-3c166e69a392","resolution":{"observed_at":"2026-08-11T14:11:27.052359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06980","last_updated":"2020-06-12T07:45:38Z","snapshot_observed_at":"2026-08-15T15:40:06.986419Z","submitted_at":"2020-06-12T07:45:38Z","title":"Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing","version":1},"cited_work":{"arxiv_id":"2006.06980","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.06980","snapshot_observed_at":"2026-08-11T14:11:28.538311Z","title":"Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing","venue":"cs.DS","work_id":"a112c94f-46d2-48fd-a30f-0e4c55aff059","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.055800Z"},"links":{"cited_paper":"/paper/2006.06980","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:5d78fde4ac3ba894975037b707b9c5cce294b9075dc3223f5a52bfb12953d5a7","observation_id":"dba28890-791a-405d-8d9c-2c70eb4420c4","resolution":{"observed_at":"2026-08-11T14:11:28.542018Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12292","last_updated":"2020-02-15T03:53:09Z","snapshot_observed_at":"2026-08-14T14:31:39.571615Z","submitted_at":"2019-09-26T17:56:28Z","title":"Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12292","snapshot_observed_at":"2026-08-11T14:11:27.060164Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.060164Z"},"links":{"cited_paper":"/paper/1909.12292","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:abe2c204534bd0be37f84cf128ec9c847f4ec882e5c314fe7fb01e2090f1998e","observation_id":"99fe9eb9-6565-4438-bce1-f46539cc7e64","resolution":{"observed_at":"2026-08-11T14:11:27.060164Z","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-11T14:11:27.064179Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.064179Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9a3ea6247de08514ebe17fe44cb755dc6dd73e0b784776f4f8598bc49ddee62d","observation_id":"6a53e5dc-36dc-4bbd-9ba9-b15471cd222b","resolution":{"observed_at":"2026-08-11T14:11:27.064179Z","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-11T14:11:27.067209Z","title":"T.; Padmanabhan, S.; and Song, Z","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.067209Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:cc1293f4424e018f102cae5d9992f1c5d7a4310b3087a5c8b84f3fb0bab52fcb","observation_id":"78df230b-76a0-4745-96d0-fb7fb6ef3045","resolution":{"observed_at":"2026-08-11T14:11:27.067209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04250","last_updated":"2020-04-08T20:56:40Z","snapshot_observed_at":"2026-08-15T20:46:56.814403Z","submitted_at":"2020-04-08T20:56:40Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","version":1},"cited_work":{"arxiv_id":"2004.04250","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04250","snapshot_observed_at":"2026-08-11T14:11:28.513279Z","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","venue":"cs.DS","work_id":"9c004fc6-0a02-4f76-959d-5e3a15cf9fbf","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.070032Z"},"links":{"cited_paper":"/paper/2004.04250","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:6ff62400971842c03f3e340e5502ec96137fd671d13048e4a3d2b49644535e10","observation_id":"3b552aee-6ac6-4d06-b9ac-9e8177ec3dfe","resolution":{"observed_at":"2026-08-11T14:11:28.516994Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-15T18:19:48.348663Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-08-11T14:11:27.073634Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.073634Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:00931e01fdfaf74e1d1250ee27803e19fcf703a69569145b4cd1207774f17244","observation_id":"0d15e73a-ef83-44b4-9916-904cb421e935","resolution":{"observed_at":"2026-08-11T14:11:27.073634Z","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-11T14:11:27.077538Z","title":"T.; Ge, R.; and Jordan, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.077538Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:00ddf0ed258e2db88c539d9b3605fd5a37696ce55cfc38dbf92a5284d4504179","observation_id":"8c5093a4-6f79-4e5e-875f-add31d058cc0","resolution":{"observed_at":"2026-08-11T14:11:27.077538Z","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-11T14:11:27.082012Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.082012Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:57241d4960781fc229999d14e28694e7adb68154394a3a43fa587fb6adce7feb","observation_id":"0ad4040e-fd55-4d77-9fbf-a6f1be5149fb","resolution":{"observed_at":"2026-08-11T14:11:27.082012Z","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-11T14:11:27.085660Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.085660Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:f499b2ea632b6cd4bbc7ede860414f988aca34724f2b52288f2638dbc0a1a109","observation_id":"23eeeb72-3dc4-4403-8ab9-e2b88e0fd9a7","resolution":{"observed_at":"2026-08-11T14:11:27.085660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01655","last_updated":"2024-03-17T23:35:24Z","snapshot_observed_at":"2026-08-16T14:55:40.833152Z","submitted_at":"2023-10-02T21:39:04Z","title":"PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01655","snapshot_observed_at":"2026-08-11T14:11:27.089378Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.089378Z"},"links":{"cited_paper":"/paper/2310.01655","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:0810e793e4674ba8b2da805d4251438d8c19418fe49f784b32ff7574080d3e57","observation_id":"794e7b36-7598-46de-96ec-2714a59993f4","resolution":{"observed_at":"2026-08-11T14:11:27.089378Z","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-11T14:11:27.093188Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.093188Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:cb3d172b38215353c962c49251e615dab9614a9ac34351a393e8621384b41bc8","observation_id":"abcdd665-4b31-423b-a596-6e25f0a502d2","resolution":{"observed_at":"2026-08-11T14:11:27.093188Z","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-11T14:11:27.096652Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.096652Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:287dab57fa5d44b3a0b81e138d623c6fae27f60b677e9742f78b94c0dbb223c7","observation_id":"c3c46917-17d8-49c2-b438-6fe08ecc52c0","resolution":{"observed_at":"2026-08-11T14:11:27.096652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.06991","last_updated":"2019-10-30T12:33:29Z","snapshot_observed_at":"2026-08-14T16:46:31.708998Z","submitted_at":"2019-04-15T12:20:32Z","title":"Improved Precision and Recall Metric for Assessing Generative Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.06991","snapshot_observed_at":"2026-08-11T14:11:27.100223Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.100223Z"},"links":{"cited_paper":"/paper/1904.06991","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:f49f48490edeafd16a1fd177a453d1078a68b94540e63ada2782dba79492abf4","observation_id":"8d65b6a8-0cda-4401-a0b1-05aad14059df","resolution":{"observed_at":"2026-08-11T14:11:27.100223Z","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-11T14:11:27.104156Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.104156Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:87afe2a1eb2efa3143f69cc94098c346ebf01591715e04ebe27710bb9d3d9f80","observation_id":"187a4ebf-82fb-4dd0-b934-69a23554666b","resolution":{"observed_at":"2026-08-11T14:11:27.104156Z","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-11T14:11:27.107742Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.107742Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:d6fe0d90e131354a8f12a4523c3f459c201238183fcba1eb98788cf22520252d","observation_id":"a41ab0d6-8604-472e-a737-b73c3e393b23","resolution":{"observed_at":"2026-08-11T14:11:27.107742Z","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-11T14:11:27.111370Z","title":"D.; Shen, R.; Song, Z.; Wang, M.; et al","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.111370Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:42da8c8fd7b37fbb190947e4b4454da3890ebb0f644991bd18ae7d19e1894da1","observation_id":"aa434a82-1710-45af-a880-3d7ece08fcd1","resolution":{"observed_at":"2026-08-11T14:11:27.111370Z","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-11T14:11:27.114864Z","title":"T.; Song, Z.; and Zhang, Q","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.114864Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:c82ee0c16e6aa621158aaf8131a6a9314063fe01fbeea51f82c54f6acb2c4888","observation_id":"5b629ed6-1b2c-4ee5-b7e5-225f66aee5a1","resolution":{"observed_at":"2026-08-11T14:11:27.114864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13276","last_updated":"2023-04-26T04:33:41Z","snapshot_observed_at":"2026-08-16T22:52:14.387165Z","submitted_at":"2023-04-26T04:33:41Z","title":"The Closeness of In-Context Learning and Weight Shifting for Softmax Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.13276","snapshot_observed_at":"2026-08-11T14:11:27.118676Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.118676Z"},"links":{"cited_paper":"/paper/2304.13276","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:dd0cf06e791de9c70605328220d2a257854a75a57893ab55a0463c00a01d49ae","observation_id":"2d3b33ce-246d-4155-b71c-1f7202d2b3f6","resolution":{"observed_at":"2026-08-11T14:11:27.118676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11838","last_updated":"2024-11-01T14:45:36Z","snapshot_observed_at":"2026-08-16T13:42:07.461220Z","submitted_at":"2024-06-17T17:59:58Z","title":"Autoregressive Image Generation without Vector Quantization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11838","snapshot_observed_at":"2026-08-11T14:11:27.122377Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.122377Z"},"links":{"cited_paper":"/paper/2406.11838","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9ead6bed55ff5c1943bc14a247d097fb35c67957c02b921e46f9efa5e0620ccb","observation_id":"d6ee1b4f-92cf-45d0-aeed-0fa96f17a403","resolution":{"observed_at":"2026-08-11T14:11:27.122377Z","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-11T14:11:27.126958Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.126958Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:ed3d1b3d76c70f7e2c6e541d3ee5d7922f9ef69aa62188459cb95288c1553c4a","observation_id":"65435117-4830-4d30-838a-85c955e42d73","resolution":{"observed_at":"2026-08-11T14:11:27.126958Z","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-11T14:11:27.130508Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.130508Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:f8589c044bd99f3cec6045ddf0eb2d6dc736198c26bfd3c54a7e5036acc603fd","observation_id":"e9637e20-5374-4bd1-99d5-df4ffcff7b4f","resolution":{"observed_at":"2026-08-11T14:11:27.130508Z","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-11T14:11:27.134163Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.134163Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:b88b2b8a2b3e564723063d0119f8af27c47a47156b3d32392284fb60132112f1","observation_id":"44205a40-36be-4fbc-bca2-7ade82eb4df9","resolution":{"observed_at":"2026-08-11T14:11:27.134163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19128","last_updated":"2024-10-01T18:40:07Z","snapshot_observed_at":"2026-08-16T13:14:38.550698Z","submitted_at":"2024-09-27T20:21:19Z","title":"Pruning then Reweighting: Towards Data-Efficient Training of Diffusion Models","version":2},"cited_work":{"arxiv_id":"2409.19128","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.19128","snapshot_observed_at":"2026-08-11T14:11:28.385494Z","title":"Pruning then Reweighting: Towards Data-Efficient Training of Diffusion Models","venue":"cs.CV","work_id":"5a25541f-08ed-413d-ab4e-50c309ee1203","year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.137494Z"},"links":{"cited_paper":"/paper/2409.19128","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:bc62bd58d3b56d5f9979f6c498dba2b6554d7a32e8a4a1d78d18a1aba2cb4fd6","observation_id":"82c8a359-0168-4af6-b815-45a67f823c4a","resolution":{"observed_at":"2026-08-11T14:11:28.389739Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-11T14:11:27.140984Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.140984Z"},"links":{"citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:116848ca3c41fe6430dc0661b3ada343be00635d39b0f25a079d6111d7ac2998","observation_id":"84e6a0eb-192c-4965-9a48-dc2f86e8c0a0","resolution":{"observed_at":"2026-08-11T14:11:27.140984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12366","last_updated":"2023-02-28T04:16:53Z","snapshot_observed_at":"2026-08-16T15:53:05.711745Z","submitted_at":"2023-02-23T23:48:20Z","title":"Less is More: Data Pruning for Faster Adversarial Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12366","snapshot_observed_at":"2026-08-11T14:11:27.144019Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.144019Z"},"links":{"cited_paper":"/paper/2302.12366","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:386c3daa60a72a24a966f912d498fc15a7aa712aeca5a27eab6daac62399fac3","observation_id":"a9cb1ce0-5bbc-40ea-a341-291be236df55","resolution":{"observed_at":"2026-08-11T14:11:27.144019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01198","last_updated":"2022-06-02T17:58:54Z","snapshot_observed_at":"2026-08-16T16:55:41.304539Z","submitted_at":"2022-06-02T17:58:54Z","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.01198","snapshot_observed_at":"2026-08-11T14:11:27.147459Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.147459Z"},"links":{"cited_paper":"/paper/2206.01198","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:89aa08bedcb7af01cedbb991d6b8e682a82497584e85e7c6caebd249c240f858","observation_id":"d6a01068-2488-45f7-aa7a-158b9df60c25","resolution":{"observed_at":"2026-08-11T14:11:27.147459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15390","last_updated":"2023-11-26T19:19:02Z","snapshot_observed_at":"2026-08-16T14:40:16.727496Z","submitted_at":"2023-11-26T19:19:02Z","title":"Local Convergence of Approximate Newton Method for Two Layer Nonlinear Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15390","snapshot_observed_at":"2026-08-11T14:11:27.150759Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.150759Z"},"links":{"cited_paper":"/paper/2311.15390","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:9b544c428d1475cbdaa6e39ca11a2d8ba3a7529a24b2f7ef887678150a653124","observation_id":"af064a60-a981-46e0-937e-24c0d47333b2","resolution":{"observed_at":"2026-08-11T14:11:27.150759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15725","last_updated":"2023-05-11T00:22:34Z","snapshot_observed_at":"2026-08-16T15:44:50.486966Z","submitted_at":"2023-03-28T04:26:51Z","title":"Solving Regularized Exp, Cosh and Sinh Regression Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15725","snapshot_observed_at":"2026-08-11T14:11:27.153902Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.153902Z"},"links":{"cited_paper":"/paper/2303.15725","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:6bb37360bfaf9b302e6138548c7e7dfb999802bdb9c3744796973fa6d526479f","observation_id":"a4f34a1b-6875-4ff1-a355-516dd27c99c0","resolution":{"observed_at":"2026-08-11T14:11:27.153902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11261","last_updated":"2025-02-26T18:44:29Z","snapshot_observed_at":"2026-08-16T17:06:50.278442Z","submitted_at":"2024-10-15T04:35:56Z","title":"Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11261","snapshot_observed_at":"2026-08-11T14:11:27.157691Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.157691Z"},"links":{"cited_paper":"/paper/2410.11261","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:2de27a9223141d4171757343c043d4cdd03ac6f64cb1ccfe2820923f1640d445","observation_id":"827c5401-b6c8-4dea-8623-d3494d0ea2dc","resolution":{"observed_at":"2026-08-11T14:11:27.157691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09375","last_updated":"2025-02-20T10:24:53Z","snapshot_observed_at":"2026-08-16T13:10:07.189771Z","submitted_at":"2024-10-12T05:54:17Z","title":"Looped ReLU MLPs May Be All You Need as Practical Programmable Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09375","snapshot_observed_at":"2026-08-11T14:11:27.161894Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.161894Z"},"links":{"cited_paper":"/paper/2410.09375","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:2ed3d510d24e9ebf9c70a7867bd3e4ff5081cdeeda4f3281bd2d36a8f20d2aff","observation_id":"d47fb572-975d-4a5f-bf92-711ff7fed5ce","resolution":{"observed_at":"2026-08-11T14:11:27.161894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13233","last_updated":"2024-10-15T04:11:19Z","snapshot_observed_at":"2026-08-16T13:24:16.127677Z","submitted_at":"2024-08-23T17:16:43Z","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13233","snapshot_observed_at":"2026-08-11T14:11:27.166202Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:27.166202Z"},"links":{"cited_paper":"/paper/2408.13233","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:1286861373d191205339233265427c4e2ad7e807c5aa1e87317dbf8aa8026c99","observation_id":"b47a329f-5930-4b9f-815a-e636e020f842","resolution":{"observed_at":"2026-08-11T14:11:27.166202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":91,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":168},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 100 of 168 outbound references and 2 inbound Pith citation observations for arXiv:2412.12441."}