{"as_of":"2026-08-09T23:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40886713957f6d24c4257c95c532130859328f66031027de78cdcb05329d30b4","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-09T06:31:02.800959+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-04T15:40:45.417699Z","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-04T01:49:21.537508Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.00489","last_updated":"2024-10-17T15:20:23Z","snapshot_observed_at":"2026-08-05T01:25:23.800398Z","submitted_at":"2024-03-30T23:07:58Z","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00489","snapshot_observed_at":"2026-08-04T15:40:45.417699Z","title":"Prompt-saw: Leveraging relation-aware graphs for textual prompt compression","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19228","last_updated":"2026-07-02T23:01:43Z","snapshot_observed_at":"2026-08-08T17:17:41.205918Z","submitted_at":"2025-09-23T16:49:43Z","title":"CompLLM: Compression for Long Context Q&A","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T15:40:45.417699Z"},"links":{"cited_paper":"/paper/2404.00489","citing_paper":"/paper/2509.19228"},"observation_digest":"sha256:9732bdafdc32ed64e45878423b8a1114408f6d26a3892c3ab72682a2690b1a8a","observation_id":"86fa3b02-d056-4596-b8d9-fc2d50fb0e72","resolution":{"observed_at":"2026-08-04T15:40:45.417699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00489","last_updated":"2024-10-17T15:20:23Z","snapshot_observed_at":"2026-08-05T01:25:23.800398Z","submitted_at":"2024-03-30T23:07:58Z","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","version":2},"cited_work":{"arxiv_id":"2404.00489","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.00489","snapshot_observed_at":"2026-07-04T01:49:21.537508Z","title":"arXiv preprint arXiv:2404.00489 , year=","venue":null,"work_id":"73e791d4-8857-4206-bee6-b8b1ba5a9de7","year":null},"citing_paper":{"arxiv_id":"2607.01241","last_updated":"2026-05-04T01:41:31Z","snapshot_observed_at":"2026-08-08T17:02:41.853193Z","submitted_at":"2026-05-04T01:41:31Z","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-04T01:45:36.335508Z"},"links":{"cited_paper":"/paper/2404.00489","citing_paper":"/paper/2607.01241"},"observation_digest":"sha256:f03fdfd39966d41972c09a715a307e9fba15040dce0d02818b679ebbc97c2b02","observation_id":"8b803126-328c-478b-bcf7-1f8c0cfa75c6","resolution":{"observed_at":"2026-07-04T01:49:21.538989Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.00489/citation-record","integrity":"/paper/2404.00489/integrity","json":"/paper/2404.00489/citation-record.json","paper":"/paper/2404.00489"},"outbound":[],"paper":{"arxiv_id":"2404.00489","last_updated":"2024-10-17T15:20:23Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T01:25:23.800398Z","submitted_at":"2024-03-30T23:07:58Z","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.00489."}