{"as_of":"2026-08-10T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96e815b61199b5e27132c571d52e9a29980512472e6670aa6610d6ba82c95f7e","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:27:56.457882Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T11:44:03.236830Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-27T05:30:35.738281Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"cited_work":{"arxiv_id":"2505.21889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.21889","snapshot_observed_at":"2026-06-27T05:30:35.738281Z","title":"Efim: Efficient serving of llms for infill- ing tasks with improved kv cache reuse.arXiv preprint arXiv:2505.21889,","venue":null,"work_id":"ed0e0b8d-bc48-4bf0-be86-21cd84788bed","year":null},"citing_paper":{"arxiv_id":"2606.13097","last_updated":"2026-07-29T12:55:33Z","snapshot_observed_at":"2026-08-06T14:19:46.913836Z","submitted_at":"2026-06-11T09:25:27Z","title":"Functional Cache Grafting: Robust and Rapid Code-Policy Synthesis for Embodied Agents","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T05:26:48.431739Z"},"links":{"cited_paper":"/paper/2505.21889","citing_paper":"/paper/2606.13097"},"observation_digest":"sha256:27dde2f7b30bb20f81105bd68b832bffc16092a1cdfeb14b48017f6f25423b43","observation_id":"4b525eff-5756-4369-886d-d32e2d596363","resolution":{"observed_at":"2026-06-27T05:30:35.740148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.21889","snapshot_observed_at":"2026-08-02T11:44:03.236830Z","title":"Efim: Efficient serving of llms for infill- ing tasks with improved kv cache reuse.arXiv preprint arXiv:2505.21889,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.13097","last_updated":"2026-07-29T12:55:33Z","snapshot_observed_at":"2026-08-06T14:19:46.913836Z","submitted_at":"2026-06-11T09:25:27Z","title":"Functional Cache Grafting: Robust and Rapid Code-Policy Synthesis for Embodied Agents","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T11:44:03.236830Z"},"links":{"cited_paper":"/paper/2505.21889","citing_paper":"/paper/2606.13097"},"observation_digest":"sha256:1180fd158c474f055e1bb107dcb83ac29632567b37889159c98abbffb5b592fe","observation_id":"23eeb072-e8e1-4b93-ac91-1b3f10b351a8","resolution":{"observed_at":"2026-08-02T11:44:03.236830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.21889/citation-record","integrity":"/paper/2505.21889/integrity","json":"/paper/2505.21889/citation-record.json","paper":"/paper/2505.21889"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1404.2022","last_updated":"2014-04-08T06:50:36Z","snapshot_observed_at":"2026-07-06T03:40:36.456030Z","submitted_at":"2014-04-08T06:50:36Z","title":"Neutrino Production via $e^-e^+$ Collision at $Z$-boson Peak","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.2022","snapshot_observed_at":"2026-08-07T13:27:53.010377Z","title":"In: SC (2022).https://doi.org/10.1109/SC41404.2022.00051","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.010377Z"},"links":{"cited_paper":"/paper/1404.2022","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:b9ec39ffdf0a46dd2f8870cb732f436e14bb1bb101b66cae19150dee8e7a689c","observation_id":"1d3518b2-f3de-4c51-b449-572050a9be17","resolution":{"observed_at":"2026-08-07T13:27:53.010377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14255","last_updated":"2022-07-28T17:40:47Z","snapshot_observed_at":"2026-08-07T11:38:07.397956Z","submitted_at":"2022-07-28T17:40:47Z","title":"Efficient Training of Language Models to Fill in the Middle","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.14255","snapshot_observed_at":"2026-08-07T13:27:53.164642Z","title":"arXiv (2022).https://doi.org/10.48550/ARXIV.2207.14255","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.164642Z"},"links":{"cited_paper":"/paper/2207.14255","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:cf043efbcf0dd8516c7b87c2c2e9aa9bcec5da7f71815e0762d537ab09bf0024","observation_id":"2be474d2-7754-4d82-b44b-fd6b901947d5","resolution":{"observed_at":"2026-08-07T13:27:53.164642Z","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-07T13:28:01.292535Z","title":"In: NeurIPS (2020)","venue":null,"work_id":"b5ff8873-6109-4303-ad98-d364c1f2f6cf","year":2020},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.314168Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:8559b945ddd1fa5bbe65db51d39280f8c653538ba69bda6061ee4f3c0459b560","observation_id":"036ffae1-c181-44f3-88d6-c7e06635644e","resolution":{"observed_at":"2026-08-07T13:28:01.377248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:01.132881Z","title":"https://openai.com/index/introducing-canvas/","venue":null,"work_id":"4b26fc65-a303-4cb3-a3c9-ce82db34d709","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.473874Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:c9184ddcf01677c1a6a37aa2c47662c6fe28780408cd9683ef12b2241758c38e","observation_id":"e22ccac4-ec34-4819-bc10-47558a1f6d66","resolution":{"observed_at":"2026-08-07T13:28:01.176072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.984773Z","title":"arXiv (2021)","venue":null,"work_id":"958220df-98b1-4d21-996f-e9bc6885ee33","year":2021},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.578510Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:61ffaa05fe7b38d8a5cd9f3b890d029c5ba1b749027d52bf5b15211fa98dc6b9","observation_id":"ec06ab93-e5d2-4110-a7cb-b53ad00cab5f","resolution":{"observed_at":"2026-08-07T13:28:01.051758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.828090Z","title":null,"venue":null,"work_id":"9ac1f269-5701-476f-80dc-60dfa3cece8a","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.694537Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:6b89055e8cb0f1f78586ffb51b858767a950d90548fef46396d99ed6ae12b2e4","observation_id":"3fd129b3-58b7-4ad9-9bc3-f8b7179247d7","resolution":{"observed_at":"2026-08-07T13:28:00.902359Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.638562Z","title":"https://docs.aws.amazon.com/codewhisperer/","venue":null,"work_id":"b8272dc0-a460-4b84-a540-68a5044b5091","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.797235Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:68835f5ca88857323d894e202d397006d03509f4e8f29eb1f4065220d7959309","observation_id":"e53978e4-30d2-4152-bfb6-71c66c7405c3","resolution":{"observed_at":"2026-08-07T13:28:00.706112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.521807Z","title":"https://github.com/features/copilot","venue":null,"work_id":"029899a4-fe25-48da-8612-e8634570eb17","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:53.942344Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:a875a410ed48f99c9872769d7f17e288673a01b28cd9d0238d256727683e6ea1","observation_id":"ed596d71-7fcb-4daa-8bff-305148206cc9","resolution":{"observed_at":"2026-08-07T13:28:00.576109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.298865Z","title":"In: ICLR (2024)","venue":null,"work_id":"3bf4dedd-e5e3-4e6a-a1f3-98d036a953ff","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.077221Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:da300ddd46026d58ee44ef503c2d2421966837e658f751db19a11a25cdc550f5","observation_id":"e767bcbe-d177-4005-85fc-a8e429fed6fb","resolution":{"observed_at":"2026-08-07T13:28:00.391765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:28:00.196663Z","title":"In: NeurIPS (2022)","venue":null,"work_id":"86af85c6-f994-45f6-97a0-43bd1708cd57","year":2022},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.240873Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:ed019602f683555fdaecb7af58e7deb3c4ea0e44c7ec4b178d57869205467e59","observation_id":"ae6318fc-5dc8-4b7e-a5cc-1e57ef433dbe","resolution":{"observed_at":"2026-08-07T13:28:00.232675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T13:27:54.413540Z","title":"arXiv (2024).https://doi.org/10.48550/ARXIV.2412.19437","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.413540Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:f8bb18b2a03cdc3d6580349a246faf5a07533e28c0f6357a054bf8eb399123b3","observation_id":"1e7d32a3-1bcb-4410-baa4-d8645e614403","resolution":{"observed_at":"2026-08-07T13:27:54.413540Z","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":"p/2718146","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:57.265335Z","title":"https://zhuanlan.zhihu.com/p/27181462601","venue":null,"work_id":"a9c3c075-34d5-4fa0-b4bb-991b6f4dd02f","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.610234Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:15d0246938f59667d74ddbf61043716041e670c8352ae973cadb2b7d09f9473a","observation_id":"5b70f913-49a4-4873-b874-ea47ad437310","resolution":{"observed_at":"2026-08-07T13:27:57.403193Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:54.750554Z","title":"In: NAACL-HLT (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.750554Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:c4fe6a9f08466c99673426bae2acad546ed5c98d56256239ab8bef224ca893ea","observation_id":"a9319a61-149b-478f-8f50-1bfc4dbcfc77","resolution":{"observed_at":"2026-08-07T13:27:54.750554Z","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-07T13:28:00.017403Z","title":"In: NeurIPS (2023)","venue":null,"work_id":"176272d3-129a-4678-b89b-39bbb9b02452","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.857566Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:d2ade8fdac1a505bd00adbaa02648851d47f73cef5ebf229fface93b067c8287","observation_id":"a133d8cc-d63c-4be4-b235-84a472b9ed53","resolution":{"observed_at":"2026-08-07T13:28:00.102489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T13:27:54.959612Z","title":"arXiv (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:54.959612Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:305bf2dd07b5d7c24f6e860485aed228e412dc19e115fcaebf9d38761a74985f","observation_id":"e7f4834e-dff6-473e-8c89-145bd0256be7","resolution":{"observed_at":"2026-08-07T13:27:54.959612Z","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-07T13:27:59.795031Z","title":"In: ICLR (2023)","venue":null,"work_id":"0a301c1e-6151-4b98-88ab-8728a92b3fb5","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.068057Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:cbd5311691d5feafdd020468800b5ae354195ec6bb8ff1733e52f133647e9a92","observation_id":"c3799a13-7087-4f19-b0e7-e71cc8112f23","resolution":{"observed_at":"2026-08-07T13:27:59.903384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:59.669576Z","title":"In: ATC (2024)","venue":null,"work_id":"a5a60fa4-293b-4cec-a7a9-3230b9a2072b","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.180632Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:b3e96fc7457d1144c2c3b90e049bf2b41d92b4af37969e90d59489e71a8dd030","observation_id":"42ebb158-7328-4c7e-83db-378b1ccdb5ad","resolution":{"observed_at":"2026-08-07T13:27:59.712255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:59.528647Z","title":"In: MLSys (2024) 14 T","venue":null,"work_id":"9e4f2679-d037-4cbb-a92e-ef4fc54841f5","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.294401Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:578a7879d03abdeb6006ae07ca9da44ede1b50ab09d1e41b59e6cd56a8c3a070","observation_id":"84e70d16-b83c-42c8-8bb9-5ea95ee67b32","resolution":{"observed_at":"2026-08-07T13:27:59.595273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-07T13:27:55.385828Z","title":"arXiv (2024).https://doi.org/ 10.48550/ARXIV.2401.14196","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.385828Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:e39eab67b658646d930f85bb34ce37514220aebe581b11a56db83368301a9499","observation_id":"3ae1345a-91a2-46b2-b409-93bfddcb5089","resolution":{"observed_at":"2026-08-07T13:27:55.385828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-07T13:27:55.430889Z","title":"arXiv (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.430889Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:d70dae2f4f9a1d61f0e755519a1ca1be0ce2d7eb6899c63e274b1af00ecd8f8f","observation_id":"ca685629-9f3b-454a-978a-d03bf5b02214","resolution":{"observed_at":"2026-08-07T13:27:55.430889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:55.478205Z","title":"In: SOSP (2023).https://doi.org/10","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.478205Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:ed43a3e4dce9de27d9c7b918495ce7b66928dfbfa49374128c35298fb61a9d90","observation_id":"bd72d76b-b544-46c5-8972-1e804e925ae7","resolution":{"observed_at":"2026-08-07T13:27:55.478205Z","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-07T13:27:59.330792Z","title":"In: OSDI (2024)","venue":null,"work_id":"1dd4fdba-5713-4dc3-b56e-94b640a5ed4b","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.557630Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:c9599847645b473b1a51a34854ac901748d9b0c0b82ac645f366be2104544a2d","observation_id":"b535eaf6-61e6-46e9-84f5-af7ad659db77","resolution":{"observed_at":"2026-08-07T13:27:59.427254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:59.156796Z","title":null,"venue":null,"work_id":"f2b14b6e-815f-4fad-a85b-8399b19c1a0f","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.595165Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:6cf50d1537a592ad1161362938a4ed092100af1da57071bcd1651883a3305a75","observation_id":"451d4046-99ae-400e-8663-4ea5eb695989","resolution":{"observed_at":"2026-08-07T13:27:59.224584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:58.992053Z","title":"https://huggingface.co/meta-llama/Llama-3.1-8B","venue":null,"work_id":"0dc24eec-7c30-47ac-9ea2-0c343cefbe41","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.696746Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:6388e22e06d1fb13db56c4939810d589ccd4d5ddbcf9f74aaab2533e97e6968b","observation_id":"3de80296-29a0-4bb3-aa16-87cc8db135f2","resolution":{"observed_at":"2026-08-07T13:27:59.077716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19173","last_updated":"2024-02-29T13:53:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T13:53:35Z","title":"StarCoder 2 and The Stack v2: The Next Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19173","snapshot_observed_at":"2026-08-07T13:27:55.789896Z","title":"arXiv (2024).https://doi.org/10.48550/ARXIV.2402.19173","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.789896Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:e72153f1251501fef363f18590f15d1bd79972f4b1283dabade01a03c8feea9b","observation_id":"5595af3d-3ab6-422a-af76-ab9ee48e3a88","resolution":{"observed_at":"2026-08-07T13:27:55.789896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02309","last_updated":"2023-07-11T21:11:23Z","snapshot_observed_at":"2026-07-06T15:22:55.122322Z","submitted_at":"2023-05-03T17:55:25Z","title":"CodeGen2: Lessons for Training LLMs on Programming and Natural Languages","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02309","snapshot_observed_at":"2026-08-07T13:27:55.849826Z","title":"arXiv (2023).https://doi.org/10.48550/ ARXIV.2305.02309","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.849826Z"},"links":{"cited_paper":"/paper/2305.02309","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:f2ab75cdad5365527cb177bce498d68d68cb9601057acfe45d9c22767f1634fa","observation_id":"f006770e-c09a-462f-8dac-c82957f11475","resolution":{"observed_at":"2026-08-07T13:27:55.849826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-07T13:27:55.891152Z","title":"In: ICLR (2023).https://doi.org/ 10.48550/ARXIV.2312.11805","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.891152Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:f5bf5cf572a06069c5a2a70772819fced0fa51327562c23174554fc76ee97bb8","observation_id":"ff3889c5-0509-4dea-9757-533fde14364c","resolution":{"observed_at":"2026-08-07T13:27:55.891152Z","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-07T13:27:58.802748Z","title":"In: MLSys (2023)","venue":null,"work_id":"ebd3800f-88a1-4407-8fd5-cb0708606c18","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.926871Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:9a7ce9a1b6bee8715d91ec6d425cd3210b462366a95cba1b08d2bd58fe359b35","observation_id":"d05d44a3-bcef-4a32-b21c-ca0a32054a43","resolution":{"observed_at":"2026-08-07T13:27:58.884425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-07T13:27:55.968329Z","title":"arXiv (2023).https://doi.org/10.48550/ARXIV.2308.12950","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:55.968329Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:e80598f7fe800600864e356c6c04d3b92c34d1ef2e84e4e9c2261fb8e5619df2","observation_id":"66f1ad18-700b-4c07-b8c9-7ae1e3899799","resolution":{"observed_at":"2026-08-07T13:27:55.968329Z","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-07T13:27:58.611302Z","title":"https://huggingface.co/datasets/bigcode/starcoderdata","venue":null,"work_id":"c27d054e-7c06-4bfa-9346-810b81935049","year":null},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.028923Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:ad91809e94b67faadb734a7d8ae2d3fbe8d6cba04f6e6491aeca27f0c655efad","observation_id":"042ed788-7b13-4d0b-ab82-a4010350feab","resolution":{"observed_at":"2026-08-07T13:27:58.719117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:58.365116Z","title":"In: NeurIPS (2017)","venue":null,"work_id":"e6bc23e4-cbe8-46df-92e6-465a040ded47","year":2017},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.084985Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:90fedcc0213d105dd359ac68c567c9c43b0981ed442b19ffb3ae0b451a29301e","observation_id":"77d370ed-ff3c-4e97-948e-fa0ba9f337f0","resolution":{"observed_at":"2026-08-07T13:27:58.444500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:58.144798Z","title":"In: ICLR (2024)","venue":null,"work_id":"3d94f762-2e24-4139-aa3b-107d32e06d98","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.137711Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:44203efe6ad13deead323a63b14fdb92fafba55aa2dbe21a99d76c428f4905d6","observation_id":"19e3c019-f610-4c4f-84be-6bafee6a3e80","resolution":{"observed_at":"2026-08-07T13:27:58.252541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:56.192156Z","title":"In: EuroSys (2023).https://doi.org/10.1145/ 3552326.3587438","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.192156Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:798e01289cef5bdd0a5dbfea6f02d846170324a4271e663f1a96d90d1a572c5d","observation_id":"d6b1d7ec-990d-4aec-99b0-511948d95c2b","resolution":{"observed_at":"2026-08-07T13:27:56.192156Z","resolver_source":null,"status":"malformed_identifier"},"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-07T13:27:58.015982Z","title":"In: ICLR (2024)","venue":null,"work_id":"f22e047b-a3cb-4e78-807e-80c7421570fd","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.246882Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:56e29785d5fc44fedf9964f029024a2e880154f5440c6611771ea3a454dfc28d","observation_id":"20485f11-f0ff-4384-aec1-f1de2e68315c","resolution":{"observed_at":"2026-08-07T13:27:58.107313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:56.290558Z","title":"In: ACL (2024).https://doi","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.290558Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:cca65f2e95c1cbd176d849c121f7d674c93fb37801ce19327628650b6a54a161","observation_id":"319db48f-fd0e-49a7-ab39-85a9768e9bb7","resolution":{"observed_at":"2026-08-07T13:27:56.290558Z","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-07T13:27:57.837871Z","title":"In: OSDI (2022)","venue":null,"work_id":"4d1e4de2-d28e-4929-848f-53409d2a8dc8","year":2022},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.327187Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:3b65c45da1f27be4805000c31956a12cd4f94fc6d63ac1873209119e59f740c4","observation_id":"5daa932f-5fe9-443d-9dc2-569e04448b27","resolution":{"observed_at":"2026-08-07T13:27:57.903960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:27:56.375333Z","title":"In: EuroSys (2025).https://doi.org/10.1145/3689031.3696086","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.375333Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:1b27f239b124b85568650e46b2a1424b0ad3f9a7059022a85bb115fcd55a5881","observation_id":"a8a61d9d-9fe0-49fa-8cb2-0a180a22a98c","resolution":{"observed_at":"2026-08-07T13:27:56.375333Z","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-07T13:27:57.637354Z","title":"In: NeurIPS (2023)","venue":null,"work_id":"3617e4e8-02e5-4ae5-a3bd-0dd11f943493","year":2023},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.423607Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:b767b902d319588bff5986215e374b44bcc41a962a0168745034fc55a59b1242","observation_id":"3d05e9b3-5814-4adb-b4c8-62a0a20ff9a9","resolution":{"observed_at":"2026-08-07T13:27:57.713222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T13:27:57.512054Z","title":"In: NeurIPS (2024)","venue":null,"work_id":"ab14d942-33f1-4bb8-9d64-0302cbeedd4c","year":2024},"citing_paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:27:56.457882Z"},"links":{"citing_paper":"/paper/2505.21889"},"observation_digest":"sha256:523995c3645bb19614a32a0a4a1163efb072df100d3f5e77ab60a37ac6f5723a","observation_id":"39b510c3-7171-4a7d-a157-de4b6961144f","resolution":{"observed_at":"2026-08-07T13:27:57.568720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T13:17:55.518983Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":39},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 2 inbound Pith citation observations for arXiv:2505.21889."}