{"as_of":"2026-08-05T23:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d64009e623db93918f424c9c6f66d8e47cbd48af309134cfd69d131dbee437b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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-07-06T21:31:54.566899Z","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-02T11:44:00.617729Z","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:c54669b98fad2082276d4b14af10c54a61179b209ec834ba486066ebb2363f1c","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-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":"2505.21889","last_updated":"2025-05-29T12:59:26Z","snapshot_observed_at":"2026-07-06T21:31:54.566899Z","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-02T11:44:00.617729Z","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:47e66507d8c73458a388254864e5676dd55d35c6cba59cd2e2d97c3bd70a6c67","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":[],"paper":{"arxiv_id":"2505.21889","last_updated":"2025-05-29T12:59:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T21:31:54.566899Z","submitted_at":"2025-05-28T02:07:03Z","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2505.21889."}