{"as_of":"2026-08-05T14:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0aa160703e21b750d1b2f559509449f8bb5578f14f0c713857701e08c934fa0","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:11:08.621947Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":52,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T16:29:18.675199Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2603.23516","last_updated":"2026-04-13T03:01:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-03-06T02:29:54Z","title":"MSA: Memory Sparse Attention for Efficient End-to-End Memory Model Scaling to 100M Tokens","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T16:00:03.578685Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2603.23516"},"observation_digest":"sha256:7c5ea76b5f5cb62cffa842096f389990bd00a0c7762535041e84993a412ff512","observation_id":"c51c285c-7847-466a-9cf1-c225799c2643","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2603.25414","last_updated":"2026-06-16T01:22:57Z","snapshot_observed_at":"2026-07-31T16:58:01.663077Z","submitted_at":"2026-03-26T13:09:36Z","title":"Decidable By Construction: Design-Time Verification for Trustworthy AI","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T00:43:45.198512Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2603.25414"},"observation_digest":"sha256:8b2397a758bc0153b8afa558b5e817ccff1cb830bf7b7338d24cd6336f467645","observation_id":"841fb43f-4845-479a-bc84-4f8240cb83d5","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2603.28342","last_updated":"2026-04-23T09:14:32Z","snapshot_observed_at":"2026-08-02T23:18:14.887276Z","submitted_at":"2026-03-30T12:12:49Z","title":"Kernel-Smith: A Unified Recipe for Evolutionary Kernel Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T22:17:13.431164Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2603.28342"},"observation_digest":"sha256:b386ad725559b87f3780a528a742bbcc2d2c7a5493069e6acd6a6d94de002123","observation_id":"888b1d78-a7de-436a-b97f-055050f49dc8","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.06956","last_updated":"2026-04-08T11:19:17Z","snapshot_observed_at":"2026-07-06T22:55:20.208897Z","submitted_at":"2026-04-08T11:19:17Z","title":"NestPipe: Large-Scale Recommendation Training on 1,500+ Accelerators via Nested Pipelining","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:46.821857Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.06956"},"observation_digest":"sha256:62618ee7daabfae1ffa144c1a1ca623c97d5d56bff82a24205d3d045bed5b061","observation_id":"d2132d71-7dc6-45fd-a27e-6ecf369e8154","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.08216","last_updated":"2026-05-18T11:20:22Z","snapshot_observed_at":"2026-07-31T19:05:02.577530Z","submitted_at":"2026-04-09T13:13:53Z","title":"MemCoT: Test-Time Scaling through Memory-Driven Chain-of-Thought","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:59.581486Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.08216"},"observation_digest":"sha256:29fb37b41eefea50d7b97888ff7e89c22b24ea0348e8543b17b19caf87e1c1a0","observation_id":"a3fa2210-7e3a-47ab-8119-549983171449","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.08216","last_updated":"2026-05-18T11:20:22Z","snapshot_observed_at":"2026-07-31T19:05:02.577530Z","submitted_at":"2026-04-09T13:13:53Z","title":"MemCoT: Test-Time Scaling through Memory-Driven Chain-of-Thought","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T09:34:16.292323Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.08216"},"observation_digest":"sha256:570e0574d1ed1a3418465c6cf3fc94c391866858b93777479c59ad7ed0cdee0e","observation_id":"6ec8b0e4-6a05-4476-94e8-a11770a5267b","resolution":{"observed_at":"2026-05-21T09:34:57.120651Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.08224","last_updated":"2026-04-09T13:19:41Z","snapshot_observed_at":"2026-08-02T22:56:00.067549Z","submitted_at":"2026-04-09T13:19:41Z","title":"Externalization in LLM Agents: A Unified Review of Memory, Skills, Protocols and Harness Engineering","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-10T17:40:14.733882Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.08224"},"observation_digest":"sha256:c2fbb50e60c7790fe28df7b754fe3621a1c4877bd933763f91b01cf38439e568","observation_id":"03041826-d9a0-4aeb-a400-49e3ed26be4c","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.08519","last_updated":"2026-04-09T17:55:50Z","snapshot_observed_at":"2026-07-06T22:57:35.435713Z","submitted_at":"2026-04-09T17:55:50Z","title":"Cram Less to Fit More: Training Data Pruning Improves Memorization of Facts","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-10T17:42:31.465077Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.08519"},"observation_digest":"sha256:97ada7795861313b094c75c59d47d9576025fb2daf99d0bb469fb52480238b87","observation_id":"b0fdaa8f-4671-4880-8064-66f5fce2fba5","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.11297","last_updated":"2026-04-13T10:59:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-13T10:59:28Z","title":"The Past Is Not Past: Memory-Enhanced Dynamic Reward Shaping","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T15:34:31.715954Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.11297"},"observation_digest":"sha256:a67547e1fb100488d72c52d531cb518656efc544e8fae1389e7dfa4fe5f8bf67","observation_id":"1f4da862-42a4-4883-92f6-6af5516f5b65","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.21724","last_updated":"2026-04-24T17:56:56Z","snapshot_observed_at":"2026-07-06T23:08:14.631453Z","submitted_at":"2026-04-23T14:27:10Z","title":"Beyond N-gram: Data-Aware X-GRAM Extraction for Efficient Embedding Parameter Scaling","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T22:28:26.681945Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.21724"},"observation_digest":"sha256:89e3b126e83094ce9f9e8f14f39b49c8c6117c5ad31fd4638ee63364a3f7ab4e","observation_id":"6dae30c5-e164-4847-9b8b-be55add85dac","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.27263","last_updated":"2026-05-14T11:02:51Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-29T23:29:08Z","title":"Decoupling the Benefits of Subword Tokenization for Language Model Training via Byte-level Simulation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T10:05:24.009460Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.27263"},"observation_digest":"sha256:6c0ac24fa21158c595c512d08cea6df532acc0f28e9b202eff8ac06178a42b60","observation_id":"3c41a122-3f89-463d-aabc-8ac9b8954223","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2604.27263","last_updated":"2026-05-14T11:02:51Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-29T23:29:08Z","title":"Decoupling the Benefits of Subword Tokenization for Language Model Training via Byte-level Simulation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T06:58:22.362262Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2604.27263"},"observation_digest":"sha256:3b09aa06034650eae67f2b4e6e77fa981e01a7e934d8242d360f8c9d5c142083","observation_id":"d4d42306-7c63-4387-a689-c1a9fc8fd9eb","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.00814","last_updated":"2026-05-08T16:52:48Z","snapshot_observed_at":"2026-07-06T23:14:11.211164Z","submitted_at":"2026-05-01T17:54:37Z","title":"Persistent Visual Memory: Sustaining Perception for Deep Generation in LVLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T18:53:06.494640Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.00814"},"observation_digest":"sha256:5b24202df5aafe09e28302a9d4416a8cd1eef632c04a6e6ba3a75e6baf34d021","observation_id":"fcb822c7-b17f-42a3-8f24-4da4ce46e9a0","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.00814","last_updated":"2026-05-08T16:52:48Z","snapshot_observed_at":"2026-07-06T23:14:11.211164Z","submitted_at":"2026-05-01T17:54:37Z","title":"Persistent Visual Memory: Sustaining Perception for Deep Generation in LVLMs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-11T01:49:15.136031Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.00814"},"observation_digest":"sha256:163b5d60d7ea1ec290d93b34a245dfc76add79338baad07fcb987d4ecf944707","observation_id":"b393deaa-e210-4084-8de0-32d82da96554","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.04400","last_updated":"2026-05-07T01:29:17Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:44:24Z","title":"Contextual Memory-Enhanced Source Coding for Low-SNR Communications","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T17:22:41.484860Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.04400"},"observation_digest":"sha256:d5d505f0a5314c1345639cd71540cd7eefc9140884a1978651d98acf432181e4","observation_id":"2083d652-045c-4605-be15-e897bdc37057","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.06615","last_updated":"2026-05-07T17:32:09Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-07T17:32:09Z","title":"When and Why SignSGD Outperforms SGD: A Theoretical Study Based on $\\ell_1$-norm Lower Bounds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T12:14:28.866499Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.06615"},"observation_digest":"sha256:b75fb1b19590528bd22c665a33bc561e8c56395c511ec1f46e27c3b83f30ee1f","observation_id":"4ae1cbee-3701-4896-829c-ed0198f41c7e","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.10739","last_updated":"2026-05-11T15:42:09Z","snapshot_observed_at":"2026-07-06T23:22:37.355450Z","submitted_at":"2026-05-11T15:42:09Z","title":"Geospatial-Temporal Sensemaking of Remote Sensing Activity Detections with Multimodal Large Language Model","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-12T04:33:31.231685Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.10739"},"observation_digest":"sha256:0ce05d7d0682ee1fc73a1d1cf21898efed212aa7816bd6af1a4876ba873886c8","observation_id":"de65d8de-1d45-4bb9-81a2-58f3c172c659","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.11447","last_updated":"2026-05-12T02:56:59Z","snapshot_observed_at":"2026-08-02T15:43:17.755280Z","submitted_at":"2026-05-12T02:56:59Z","title":"Conditional Memory Enhanced Item Representation for Generative Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-13T02:30:29.654122Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.11447"},"observation_digest":"sha256:07211f23fdf8ab2cf9a0152b7f0e3de1657ac685633235bffa2492dcee56209f","observation_id":"af5044db-ef97-4ee1-8bbc-96aef3d8e338","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.12426","last_updated":"2026-05-12T17:22:22Z","snapshot_observed_at":"2026-07-30T10:50:56.815226Z","submitted_at":"2026-05-12T17:22:22Z","title":"Geometric Factual Recall in Transformers","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-13T04:50:17.479689Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.12426"},"observation_digest":"sha256:327d478977b61a6231aac02a58180cee2b197a40853832d92313476b80958783","observation_id":"6cd32407-95cd-4c8a-9f53-31a3e7e6d02a","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.13179","last_updated":"2026-05-13T08:40:46Z","snapshot_observed_at":"2026-07-06T23:24:47.309044Z","submitted_at":"2026-05-13T08:40:46Z","title":"Does Engram Do Memory Retrieval in Autoregressive Image Generation?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T20:33:17.978924Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.13179"},"observation_digest":"sha256:5f3c4e53e0cab2c1cedafcd64dd26a2f716b2f4636681937af2f390914deef8e","observation_id":"2c72eb8e-58bb-41f2-ad77-18d1dc0d82ef","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.13370","last_updated":"2026-05-13T11:28:06Z","snapshot_observed_at":"2026-08-03T02:10:50.275997Z","submitted_at":"2026-05-13T11:28:06Z","title":"Phasor Memory Networks: Stable Backpropagation Through Time for Scalable Explicit Memory","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T20:36:12.321162Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.13370"},"observation_digest":"sha256:719b10e03a7472ed30df486297abc5cb8a3e8e4bcd6b8e42fefd5b43740fa7e7","observation_id":"21177e49-70a8-4d81-8ff8-1151a35a9036","resolution":{"observed_at":"2026-05-16T04:54:49.681471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.16893","last_updated":"2026-05-16T09:12:52Z","snapshot_observed_at":"2026-08-01T19:24:03.890902Z","submitted_at":"2026-05-16T09:12:52Z","title":"NGM: A Plug-and-Play Training-Free Memory Module for LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T20:47:50.356747Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.16893"},"observation_digest":"sha256:bf3158dccb03f6c3d81ca0d14d157c2836316a6eeec0e8e25eadc2290f071d0c","observation_id":"4c98b0a2-1612-4414-b8f0-afe96af46951","resolution":{"observed_at":"2026-05-19T20:52:46.340163Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.18556","last_updated":"2026-05-18T15:37:02Z","snapshot_observed_at":"2026-08-02T16:07:48.911748Z","submitted_at":"2026-05-18T15:37:02Z","title":"Key-Gram: Extensible World Knowledge for Embodied Manipulation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-20T09:09:20.538333Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.18556"},"observation_digest":"sha256:13a6916cbd605ee2ac30af027c7a6b67feb9e38e1d6b12742379a39de5748958","observation_id":"83b3500a-2240-4e84-b677-bb47d355bc70","resolution":{"observed_at":"2026-05-20T09:13:10.140293Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.18848","last_updated":"2026-06-04T09:09:51Z","snapshot_observed_at":"2026-08-03T02:32:15.025703Z","submitted_at":"2026-05-13T08:06:48Z","title":"Exact Linear Attention","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T20:58:21.512157Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.18848"},"observation_digest":"sha256:39959656bee1785c1b06b1e94046595de1b511e854723bd6274b078670d0658d","observation_id":"45d5c64f-2e35-40a7-b62c-f83ab39773dc","resolution":{"observed_at":"2026-05-20T20:59:01.531155Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.18848","last_updated":"2026-06-04T09:09:51Z","snapshot_observed_at":"2026-08-03T02:32:15.025703Z","submitted_at":"2026-05-13T08:06:48Z","title":"Exact Linear Attention","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T08:44:58.108341Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.18848"},"observation_digest":"sha256:1f70cf06a4489850d62362916270b6e7229defc15306cf39673cf996f643c95c","observation_id":"9c96a97b-c26c-4196-9c3e-d806053ea265","resolution":{"observed_at":"2026-05-21T08:49:53.921505Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.18848","last_updated":"2026-06-04T09:09:51Z","snapshot_observed_at":"2026-08-03T02:32:15.025703Z","submitted_at":"2026-05-13T08:06:48Z","title":"Exact Linear Attention","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T21:45:51.507382Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.18848"},"observation_digest":"sha256:55cb67ed0e337ff96f43439ac5b9503538d292a062856ab10095bd955eb1165e","observation_id":"82041fa1-9b5a-4367-af61-8d56bfb9833b","resolution":{"observed_at":"2026-07-01T14:15:47.712542Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.20309","last_updated":"2026-05-19T16:27:07Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-19T16:27:07Z","title":"Tiny-Engram: Trigger-Indexed Concept Tables for Generative Vision","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T07:46:05.375388Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.20309"},"observation_digest":"sha256:868d02c31e5c3cd9f1f1406788e624494040a71d1f7e787152069268e3c90ee8","observation_id":"9f32e03d-f49f-4ad2-8f90-2954aa206ce1","resolution":{"observed_at":"2026-05-21T07:49:50.277369Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.20613","last_updated":"2026-05-20T01:59:50Z","snapshot_observed_at":"2026-08-03T22:01:57.501216Z","submitted_at":"2026-05-20T01:59:50Z","title":"HRM-Text: Efficient Pretraining Beyond Scaling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-21T05:41:41.397554Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.20613"},"observation_digest":"sha256:4bed07af94b2ea7cba9166bc89a77ef3389e589490c4f7cf91d642a0f57d4206","observation_id":"d1a88c86-9450-4e75-919e-b47de01712e5","resolution":{"observed_at":"2026-05-21T05:43:59.027438Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.20948","last_updated":"2026-05-20T09:35:04Z","snapshot_observed_at":"2026-07-06T23:31:27.989406Z","submitted_at":"2026-05-20T09:35:04Z","title":"Memory Grafting: Scaling Language Model Pre-training via Offline Conditional Memory","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T05:49:14.789955Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.20948"},"observation_digest":"sha256:18168be714a21dc2e36fce2069d252de152119a35e58dcde2fe17fa8d4b653fe","observation_id":"3e19df51-edf5-43df-b59a-9c798c04422a","resolution":{"observed_at":"2026-05-21T05:49:40.804095Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.21463","last_updated":"2026-05-20T17:51:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-20T17:51:05Z","title":"Mem-$\\pi$: Adaptive Memory through Learning When and What to Generate","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T04:27:25.041652Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.21463"},"observation_digest":"sha256:c6638c1a14b1c564b3626f5a768a29a444aa3ec13db8847f07e7e1320ded9e18","observation_id":"86108285-99c7-4b9d-9248-cae1b1d44b70","resolution":{"observed_at":"2026-05-21T04:29:34.555281Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.24869","last_updated":"2026-05-24T04:59:11Z","snapshot_observed_at":"2026-08-03T10:54:34.128178Z","submitted_at":"2026-05-24T04:59:11Z","title":"Lngram: N-gram Conditional Memory in Latent Space","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T12:27:38.766272Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.24869"},"observation_digest":"sha256:3a0fd85f134eb148cc1e7b3990ab9499168bc2ff0e522ab0fef6679ed7432617","observation_id":"deb3445f-9de7-4394-93ae-27ce89656279","resolution":{"observed_at":"2026-06-30T12:34:38.927635Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.25680","last_updated":"2026-05-25T10:39:08Z","snapshot_observed_at":"2026-08-02T02:16:17.525704Z","submitted_at":"2026-05-25T10:39:08Z","title":"Simulating Human Memory with Language Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T22:00:26.703406Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.25680"},"observation_digest":"sha256:8c97d18817685dc81f756836a3bbf0a8568182dfd3b7d359854f90f0185c50b9","observation_id":"47ebb449-7de9-42d6-a870-4060fcb17de5","resolution":{"observed_at":"2026-06-29T22:04:00.251833Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2605.27686","last_updated":"2026-05-26T21:03:42Z","snapshot_observed_at":"2026-08-02T04:59:17.402182Z","submitted_at":"2026-05-26T21:03:42Z","title":"Tensor Memory: Fixed-Size Recurrent State for Long-Horizon Transformers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T18:08:42.533804Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2605.27686"},"observation_digest":"sha256:d970a2618a10c9285b336342cb2fe11390315573c2acbb0d491ebba98b151872","observation_id":"579762a0-a66f-4c2b-8ef8-baef08c275d2","resolution":{"observed_at":"2026-06-29T18:13:48.703630Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.00324","last_updated":"2026-05-29T20:01:06Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T20:01:06Z","title":"LLMs Need Encoders for Semantic IDs Too","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T20:32:36.937027Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.00324"},"observation_digest":"sha256:76d92d812b8e009fe63198b0b07d3190f665ebed7d27fcfca115215651d7117a","observation_id":"aa85cbbb-e1a6-4b6e-99f0-16f387e468af","resolution":{"observed_at":"2026-06-28T20:42:37.363154Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.01155","last_updated":"2026-05-31T10:51:18Z","snapshot_observed_at":"2026-07-06T23:41:43.820102Z","submitted_at":"2026-05-31T10:51:18Z","title":"When Data Is Scarce: Scaling Sparse Language Models with Repeated Training","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T17:16:48.536850Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.01155"},"observation_digest":"sha256:a22df865e19574dc5ffb14719b92b4769221e702449a4c86ced0738dd25f3f12","observation_id":"3c9bf9f1-7640-47fa-9630-cdac8d453449","resolution":{"observed_at":"2026-06-28T17:22:25.190601Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.02780","last_updated":"2026-07-18T16:18:38Z","snapshot_observed_at":"2026-08-02T12:41:17.637289Z","submitted_at":"2026-06-01T18:43:34Z","title":"Do Value Vectors in Deep Layers Need Context from the Residual Stream?","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-28T14:35:48.292081Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.02780"},"observation_digest":"sha256:3408d21efdb2dbd088210380a9cad928d6637a42355a1dcf80d09e09ee7f2df2","observation_id":"e2396907-cb81-411d-b5a4-e7c0c8a7082d","resolution":{"observed_at":"2026-07-01T23:16:23.379670Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-02T12:41:19.450015Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.02780","last_updated":"2026-07-18T16:18:38Z","snapshot_observed_at":"2026-08-02T12:41:17.637289Z","submitted_at":"2026-06-01T18:43:34Z","title":"Do Value Vectors in Deep Layers Need Context from the Residual Stream?","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T12:41:19.450015Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.02780"},"observation_digest":"sha256:cf500c26398d8305cb81710fa7317fcb0a3d5217b5e7a8e27078e40f7fc3995b","observation_id":"4df6c729-90dc-4efa-a9a6-ae3fe0c8d6f7","resolution":{"observed_at":"2026-08-02T12:41:19.450015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.09888","last_updated":"2026-06-03T09:10:06Z","snapshot_observed_at":"2026-08-02T01:54:56.458376Z","submitted_at":"2026-06-03T09:10:06Z","title":"SinkRec: Mitigating Semantic State Sink in Long Sequence Recommendation with Memory-Conditioned Gated Delta Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T07:13:54.031036Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.09888"},"observation_digest":"sha256:76bc9e6b1fb8275778188aecbca9f3910b8a08fb22f059b1a588a13821e282b7","observation_id":"4dc36325-4dc3-4ddd-9b1c-0500be344904","resolution":{"observed_at":"2026-07-02T07:06:43.800288Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.12113","last_updated":"2026-06-10T14:07:18Z","snapshot_observed_at":"2026-07-06T23:51:02.805629Z","submitted_at":"2026-06-10T14:07:18Z","title":"Augmenting Molecular Language Models with Local $n$-gram Memory","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-27T09:57:12.398344Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.12113"},"observation_digest":"sha256:84a11b40c0e9e4061522a4035fbcc8cd4cb89ecac1a3c30c5099807b849e3a90","observation_id":"2bf646af-2d36-436f-83f4-cf625ebd6c36","resolution":{"observed_at":"2026-07-03T10:37:56.675156Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.13680","last_updated":"2026-06-11T17:59:52Z","snapshot_observed_at":"2026-07-06T23:52:23.981568Z","submitted_at":"2026-06-11T17:59:52Z","title":"Learning to Reason by Analogy via Retrieval-Augmented Reinforcement Fine-Tuning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-27T06:30:55.592334Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.13680"},"observation_digest":"sha256:47a40ec4e0cd81c55ccc8591e690cfb098e92fa98cbfa65d70b49dcfcb9abd28","observation_id":"0f0ae932-35c6-4ba3-92fe-bf1dc7f13d83","resolution":{"observed_at":"2026-06-27T07:10:41.966732Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.19172","last_updated":"2026-06-17T15:15:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-17T15:15:19Z","title":"User as Engram: Internalizing Per-User Memory as Local Parametric Edits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-26T20:37:01.382431Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.19172"},"observation_digest":"sha256:726564d0eac63379809d45c31c49e878764ab01be005ef87ffd4cbfd5eddaa17","observation_id":"fc49c01c-3190-46ae-a730-9a008f6784c3","resolution":{"observed_at":"2026-07-04T01:09:19.491229Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.22874","last_updated":"2026-06-22T05:39:12Z","snapshot_observed_at":"2026-07-06T23:57:42.632111Z","submitted_at":"2026-06-22T05:39:12Z","title":"SpotAttention: Plug-In Block-Sparse Routing for Pretrained Long-Context Transformers","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-26T08:59:44.970855Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.22874"},"observation_digest":"sha256:d9deaa5d1290e5e1928a5195447bf35bd2b794c6d3f1ca6de6ab24d8ff46c83c","observation_id":"bb257ad8-23b1-4b94-9d0b-dc4028ffeb2b","resolution":{"observed_at":"2026-07-04T10:19:47.321264Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2606.28116","last_updated":"2026-06-26T14:18:22Z","snapshot_observed_at":"2026-07-07T00:02:14.441610Z","submitted_at":"2026-06-26T14:18:22Z","title":"Mechanism-Driven Monitors for Preemptive Detection of LLM Training Instability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T04:08:37.263436Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2606.28116"},"observation_digest":"sha256:f28d2ae23119a5933fde34c1cb69d58cc0763b721b2074139b9a76a66119091d","observation_id":"61fb8017-8b0f-438b-b281-505c2ee7b87b","resolution":{"observed_at":"2026-07-01T17:15:50.565438Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-07-11T10:45:46.618668Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models.arXiv preprint arXiv:2601.07372,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04969","last_updated":"2026-07-06T11:57:32Z","snapshot_observed_at":"2026-07-11T10:45:45.626304Z","submitted_at":"2026-07-06T11:57:32Z","title":"Train Smarter, Not Longer: Memorization-Guided Data Reuse for Efficient LLM Training","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T10:45:46.618668Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.04969"},"observation_digest":"sha256:21f02a7a1efe00f40a5d279b30d3cab431b7958110a0dce56858545c7af5fd4f","observation_id":"57b7f3bd-d63e-46e9-8f64-c6b2c8044616","resolution":{"observed_at":"2026-07-11T10:45:46.618668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2607.07388","last_updated":"2026-07-08T13:19:52Z","snapshot_observed_at":"2026-07-11T23:20:03.614952Z","submitted_at":"2026-07-08T13:19:52Z","title":"TF-Engram: A Train-Free Engram with SSD-Backed Memory for Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T12:31:30.985214Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.07388"},"observation_digest":"sha256:b92edf5b0c7a5b7501ba58736596b4032f5014c92e2f80b0e25ab20018f3064c","observation_id":"3f2e62be-9fc0-42b3-a789-cad75535c455","resolution":{"observed_at":"2026-07-09T12:36:13.989046Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":"2601.07372","doi":"10.48550/arxiv.2601.07372","metadata_source":"pith","pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","venue":"cs.CL","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},"citing_paper":{"arxiv_id":"2607.07707","last_updated":"2026-07-08T17:59:45Z","snapshot_observed_at":"2026-07-11T23:20:21.553440Z","submitted_at":"2026-07-08T17:59:45Z","title":"Co-LMLM: Continuous-Query Limited Memory Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T01:44:45.683349Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.07707"},"observation_digest":"sha256:7201803e400518c4082c021e81ae6861af7f7befe0e7b7af9438514464c8eef6","observation_id":"2762f43b-0ce2-429a-968f-49f24013220e","resolution":{"observed_at":"2026-07-09T01:45:50.752920Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-02T09:48:57.809316Z","title":"2026 , eprint =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16254","last_updated":"2026-06-27T10:21:07Z","snapshot_observed_at":"2026-08-04T07:43:29.198611Z","submitted_at":"2026-06-27T10:21:07Z","title":"More Than Memory: Task-Conditioned Signed FFN Writes in Long-Context Retrieval","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T09:48:57.809316Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.16254"},"observation_digest":"sha256:8b661e8d2829e61cf14fd7811689b1531a867439bb954870d53e6141b6b20402","observation_id":"95d9189e-7255-4d8e-9a2f-4da35ced5462","resolution":{"observed_at":"2026-08-02T09:48:57.809316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-02T06:33:13.744408Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16305","last_updated":"2026-07-14T08:03:00Z","snapshot_observed_at":"2026-08-02T14:55:22.478767Z","submitted_at":"2026-07-14T08:03:00Z","title":"LookME: Lookup-Based Multimodal Embeddings for Layer Injection in Vision-Language Models","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T06:33:13.744408Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.16305"},"observation_digest":"sha256:2691d70deb916242ac4b27f390adc7900849cff97f50c41765e6c7a1cd2af2d1","observation_id":"33dd7702-4e23-4626-8262-b2c0afafed97","resolution":{"observed_at":"2026-08-02T06:33:13.744408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-01T15:33:19.088107Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models.arXiv preprint arXiv:2601.07372,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18413","last_updated":"2026-07-20T18:02:25Z","snapshot_observed_at":"2026-08-02T20:07:46.906862Z","submitted_at":"2026-07-20T18:02:25Z","title":"Convolution for Large Language Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T15:33:19.088107Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.18413"},"observation_digest":"sha256:044bf64d1ce172f797e522997b6ce22ceef4c7738892c98d539b26f442b655b5","observation_id":"5176f9e4-3092-4c31-8827-9b2a1d3d1562","resolution":{"observed_at":"2026-08-01T15:33:19.088107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-01T02:37:54.108483Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.25380","last_updated":"2026-07-28T07:34:53Z","snapshot_observed_at":"2026-08-01T14:23:07.610419Z","submitted_at":"2026-07-28T07:34:53Z","title":"Memory for Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T02:37:54.108483Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.25380"},"observation_digest":"sha256:f87c1dff4d9d7f482c7c8aba89784e84174f370bccb7501364be6083ef81d849","observation_id":"59f4c2fd-fa14-4b82-bcab-d16b5853bad1","resolution":{"observed_at":"2026-08-01T02:37:54.108483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-01T01:59:49.791419Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models.arXiv preprint arXiv:2601.07372,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25614","last_updated":"2026-07-28T11:45:34Z","snapshot_observed_at":"2026-08-04T00:06:42.832855Z","submitted_at":"2026-07-28T11:45:34Z","title":"MemSFT: Mitigating Alignment Tax with an External Parametric Memory","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T01:59:49.791419Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2607.25614"},"observation_digest":"sha256:84458b18ae37d632489f7e03abaadfec522de0d631dd941a86ffe40462e3f466","observation_id":"9fba827b-e92a-412a-a116-be7990f3b112","resolution":{"observed_at":"2026-08-01T01:59:49.791419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.07372","snapshot_observed_at":"2026-08-04T16:29:18.675199Z","title":"Conditional memory via scalable lookup: A new axis of sparsity for large language models.arXiv preprint arXiv:2601.07372, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02023","last_updated":"2026-08-04T08:54:48Z","snapshot_observed_at":"2026-08-05T14:05:42.223563Z","submitted_at":"2026-08-03T10:20:52Z","title":"SwanTale: Unified Multi-Speaker Speech and Audio Generation for Instruct and Zero-Shot Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T16:29:18.675199Z"},"links":{"cited_paper":"/paper/2601.07372","citing_paper":"/paper/2608.02023"},"observation_digest":"sha256:7c9c81a8417ed7ce3e1b181d5357f1b2ac5df9dec5ee04cc4195bb42f702c38a","observation_id":"22a35314-e357-4eb4-ac6b-ca9a4e3e324e","resolution":{"observed_at":"2026-08-04T16:29:18.675199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.07372/citation-record","integrity":"/paper/2601.07372/integrity","json":"/paper/2601.07372/citation-record.json","paper":"/paper/2601.07372"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.16668","last_updated":"2020-06-30T10:42:02Z","snapshot_observed_at":"2026-07-06T09:33:58.857566Z","submitted_at":"2020-06-30T10:42:02Z","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16668","snapshot_observed_at":"2026-08-03T11:11:08.617260Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"reference_index":184,"source":"pdf_text","source_observed_at":"2026-08-03T11:11:08.617260Z"},"links":{"cited_paper":"/paper/2006.16668","citing_paper":"/paper/2601.07372"},"observation_digest":"sha256:bcd6a6e52fc178ec4f54407e3b9740a24c8daf13c519e0e72c423b49e7179da9","observation_id":"125c5cb4-67ab-4190-a979-649592cee87b","resolution":{"observed_at":"2026-08-03T11:11:08.617260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02132","last_updated":"2026-04-22T02:35:37Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-02T18:01:56Z","title":"Model Internal Sleuthing: Finding Lexical Identity and Inflectional Features in Modern Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02132","snapshot_observed_at":"2026-08-03T11:11:08.621947Z","title":"RWKV-V8’s DeepEmbed","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T11:11:08.621947Z"},"links":{"cited_paper":"/paper/2506.02132","citing_paper":"/paper/2601.07372"},"observation_digest":"sha256:b85581cd47947fae9c4f6511814b93e698f374b44455bc77d8c5afe020735573","observation_id":"d09894e6-ad3a-42fe-bb7d-02359cad7714","resolution":{"observed_at":"2026-08-03T11:11:08.621947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00027","last_updated":"2020-12-31T19:00:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-12-31T19:00:10Z","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00027","snapshot_observed_at":"2026-08-03T11:11:08.611735Z","title":"doi: 10.18653/V1/N19-1246","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","version":2},"reference_index":2378,"source":"pdf_text","source_observed_at":"2026-08-03T11:11:08.611735Z"},"links":{"cited_paper":"/paper/2101.00027","citing_paper":"/paper/2601.07372"},"observation_digest":"sha256:0c8be637e2cf2d360c7aea378cce25f84aa47dd24070aa582c26bfb594e6d21a","observation_id":"2f6994ee-833b-4d18-9f6b-97262cfc7be0","resolution":{"observed_at":"2026-08-03T11:11:08.611735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.07372","last_updated":"2026-07-12T07:41:31Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-03T11:11:06.036270Z","submitted_at":"2026-01-12T09:54:49Z","title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":3},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 52 inbound Pith citation observations for arXiv:2601.07372."}