{"as_of":"2026-08-07T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:485042e4c11312818f5f9f7534457d1c5458aab9974ce6a12b5c8d20ca31d994","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:40:46.821236Z","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-07-02T03:36:29.176189Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-08-04T15:40:46.821236Z","title":"Efficient prompt compression with evaluator heads for long-context transformer inference, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-04T15:40:30.929389Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:46.821236Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:8143f479c7b42cc47dd9a7b4b0c9d8b917141ea884405dc7cb91594731399a3c","observation_id":"d0262d80-0f86-49d0-8388-69a56ff59abd","resolution":{"observed_at":"2026-08-04T15:40:46.821236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":"2501.12959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-07-02T03:36:29.176189Z","title":"BrowseComp: A simple yet challenging benchmark for browsing agents","venue":null,"work_id":"9099bbef-32d2-4f7c-9643-0354677fcef4","year":2025},"citing_paper":{"arxiv_id":"2604.02368","last_updated":"2026-04-21T02:53:40Z","snapshot_observed_at":"2026-07-06T22:51:44.663367Z","submitted_at":"2026-03-27T11:28:15Z","title":"Xpertbench: Expert Level Tasks with Rubrics-Based Evaluation","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T23:22:53.368231Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2604.02368"},"observation_digest":"sha256:319c03214e614f655f6bb0e7a10c886ee418fbe76d10174147936f8570a641cf","observation_id":"378e9ac5-f859-4f12-bea7-08d0a5689fd9","resolution":{"observed_at":"2026-05-14T23:23:15.858229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":"2501.12959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-07-02T03:36:29.176189Z","title":"BrowseComp: A simple yet challenging benchmark for browsing agents","venue":null,"work_id":"9099bbef-32d2-4f7c-9643-0354677fcef4","year":2025},"citing_paper":{"arxiv_id":"2606.03618","last_updated":"2026-07-31T18:54:12Z","snapshot_observed_at":"2026-08-06T23:11:19.390691Z","submitted_at":"2026-06-02T13:17:45Z","title":"Cross-Lingual Token Arbitrage: Optimizing Code Agent Context Windows via Local LLM Preprocessing","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T09:57:31.393007Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2606.03618"},"observation_digest":"sha256:f3890936761fc8864825ed4004c7c7ad68980cc3abf9f5e7abb7b636804574ef","observation_id":"fbafbac9-f3fc-4a9a-99e3-53733a8e083b","resolution":{"observed_at":"2026-07-02T03:36:29.177753Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-08-04T04:55:05.475228Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03618","last_updated":"2026-07-31T18:54:12Z","snapshot_observed_at":"2026-08-06T23:11:19.390691Z","submitted_at":"2026-06-02T13:17:45Z","title":"Cross-Lingual Token Arbitrage: Optimizing Code Agent Context Windows via Local LLM Preprocessing","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T04:55:05.475228Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2606.03618"},"observation_digest":"sha256:2b5b069f2347ac23409ad2aee9cad70b792602f50c93e97e9a1714b4a0cd9c05","observation_id":"4567f9e4-ed95-42be-89b4-71c4188c58e6","resolution":{"observed_at":"2026-08-04T04:55:05.475228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":"2501.12959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-07-02T03:36:29.176189Z","title":"BrowseComp: A simple yet challenging benchmark for browsing agents","venue":null,"work_id":"9099bbef-32d2-4f7c-9643-0354677fcef4","year":2025},"citing_paper":{"arxiv_id":"2606.20571","last_updated":"2026-04-27T16:11:28Z","snapshot_observed_at":"2026-07-06T23:55:43.830896Z","submitted_at":"2026-04-27T16:11:28Z","title":"Less is More: Lightweight Prompt Compression for Question Answering Applications on Edge Devices","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-01T08:49:28.538659Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2606.20571"},"observation_digest":"sha256:d92ae7fe23b6eab1e3b8d85c3f3b4e9eff3c053b095ead6ca450e94f40b6d41c","observation_id":"a531b368-d5c8-46c3-b43a-d19c4e65239e","resolution":{"observed_at":"2026-07-01T08:55:34.918070Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12959","snapshot_observed_at":"2026-08-01T17:30:39.088415Z","title":"Efficient prompt compression with evaluator heads for long-context transformer inference.arXiv preprint arXiv:2501.12959, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17621","last_updated":"2026-07-20T07:17:50Z","snapshot_observed_at":"2026-08-03T22:21:37.176693Z","submitted_at":"2026-07-20T07:17:50Z","title":"Mechanistic Attention Guidance for Agent Memory Refinement","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T17:30:39.088415Z"},"links":{"cited_paper":"/paper/2501.12959","citing_paper":"/paper/2607.17621"},"observation_digest":"sha256:9a37b6dd699b0241448f0ae3269159698ffb0fe2bedc30673a79fc92fc5117cc","observation_id":"b2bc5205-1132-45ea-a1eb-6c31a33bf1c9","resolution":{"observed_at":"2026-08-01T17:30:39.088415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.12959/citation-record","integrity":"/paper/2501.12959/integrity","json":"/paper/2501.12959/citation-record.json","paper":"/paper/2501.12959"},"outbound":[],"paper":{"arxiv_id":"2501.12959","last_updated":"2025-02-05T09:35:38Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T20:24:27.525217Z","submitted_at":"2025-01-22T15:33:17Z","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2501.12959."}