{"as_of":"2026-08-13T06:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:791af5e267dc5d3163e64393b3494dae53c5ba58fba6b8076df7abc63a69ff2a","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:56:42.441755Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.15785/citation-record","integrity":"/paper/2411.15785/integrity","json":"/paper/2411.15785/citation-record.json","paper":"/paper/2411.15785"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-12T13:56:42.410688Z","title":"Bert: Pre-training of deep bidirectional transformers for language under- standing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.410688Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:db5a3f900ac037277d1a758d4870e0c9e5e80845da6a1b15f64f347a90a7f801","observation_id":"356f7a31-e04e-43f1-a230-a83a23a041d1","resolution":{"observed_at":"2026-08-12T13:56:42.410688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:56:42.582555Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":"4076aab3-91bc-41cf-b83f-a2016ecdc04a","year":2020},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.415624Z"},"links":{"citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:eb08120f21fd723261671e0885fc798f55c5ca7bb62529f0c16ef2259ed238d0","observation_id":"7b184d4e-cb4b-4049-9ca6-90a5f28c98d0","resolution":{"observed_at":"2026-08-12T13:56:42.587020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:56:42.568546Z","title":"Attention is all you need","venue":null,"work_id":"e9df8e9f-a996-407f-bc7d-f6e1a0a93c67","year":2017},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.419707Z"},"links":{"citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:47a41ac5e308d2347efc3fce4a963c522bfb1167322ef7e409d30b7c58c02b2b","observation_id":"31c6e77b-281b-4c84-b8ac-7043e3678098","resolution":{"observed_at":"2026-08-12T13:56:42.573088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:56:42.555563Z","title":"Efficient streaming language models with attention sinks","venue":null,"work_id":"41e50cbe-5ce3-476f-a666-b7984b718b62","year":2023},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.423801Z"},"links":{"citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:c2c33a6446204b6ff474cd0b39290ae097387b86f181ace2f5728d8f2220b4c7","observation_id":"11d7c036-3fe8-4f77-a745-5cac2e497bf2","resolution":{"observed_at":"2026-08-12T13:56:42.559847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:56:42.542239Z","title":"Get more with less: Synthesizing recurrence with kv cache compression for efficient llm inference","venue":null,"work_id":"8d8d30f8-4fac-4fbf-bc96-831f3caeaff5","year":2024},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.427287Z"},"links":{"citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:215106d0474717176074e0d34c2b5141bba63cfeb9e73d3dcca980c844c0a95c","observation_id":"3e6ff11f-cb84-443f-babb-e88c3cb0d4a8","resolution":{"observed_at":"2026-08-12T13:56:42.546702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.5401","last_updated":"2014-12-10T16:01:39Z","snapshot_observed_at":"2026-08-12T12:07:42.706444Z","submitted_at":"2014-10-20T19:28:26Z","title":"Neural Turing Machines","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1410.5401","snapshot_observed_at":"2026-08-12T13:56:42.430892Z","title":"Neural turing machines","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.430892Z"},"links":{"cited_paper":"/paper/1410.5401","citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:7e0e2068fb230ea8bd76c21b0c2aa535cbf0bf9114b01076df312fb384b3f2b2","observation_id":"3fc328af-fea1-426e-9ceb-7b1af717e7e3","resolution":{"observed_at":"2026-08-12T13:56:42.430892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:56:42.527400Z","title":"Common crawl: A corpus for web-scale information extraction","venue":null,"work_id":"298988d8-d6af-447c-a0f8-905d7e211514","year":2019},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.434864Z"},"links":{"citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:d57f7934d301e46ca5e6330ac8cab364d8f70c81c007c40c2b67976f4b60c8b5","observation_id":"8cdcb0a3-14b6-4412-a6a6-abefa1f74fde","resolution":{"observed_at":"2026-08-12T13:56:42.531703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09714","last_updated":"2022-05-19T17:28:48Z","snapshot_observed_at":"2026-08-13T04:44:25.060613Z","submitted_at":"2022-05-19T17:28:48Z","title":"Threshold solutions for the intercritical inhomogeneous NLS","version":1},"cited_work":{"arxiv_id":"2205.09714","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.09714","snapshot_observed_at":"2026-08-12T13:56:42.484700Z","title":"Threshold solutions for the intercritical inhomogeneous NLS","venue":"math.AP","work_id":"ab1cbf09-255d-425b-be8e-a2a07de78479","year":2022},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.438279Z"},"links":{"cited_paper":"/paper/2205.09714","citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:86785a92f487e9d96a66c750d4bd53dea64aacc5e7fcf3bd04e0a0e8b2856891","observation_id":"7b1c6afa-01b8-48f1-955f-578db0189259","resolution":{"observed_at":"2026-08-12T13:56:42.491376Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-12T13:56:42.441755Z","title":"The pile: An 800gb dataset of diverse text for language modeling","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:56:42.441755Z"},"links":{"cited_paper":"/paper/2101.00027","citing_paper":"/paper/2411.15785"},"observation_digest":"sha256:939cfdbb30f3bcc67070122f23efa756698fa4b9e69e0868a5fc3a8bc9c58c62","observation_id":"0a3369a6-0046-40e0-b196-8e6875d5b6ca","resolution":{"observed_at":"2026-08-12T13:56:42.441755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.15785","last_updated":"2024-11-27T03:07:20Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T13:51:47.245339Z","submitted_at":"2024-11-24T11:30:00Z","title":"A Method for Building Large Language Models with Predefined KV Cache Capacity"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":9},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2411.15785."}