{"as_of":"2026-08-14T02:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7406a3fe812d67aa1076e394bae13104b277436e99809775310468ca6831673","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:46:10.145741Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T19:46:10.284929Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.20701","last_updated":"2024-05-31T08:53:59Z","snapshot_observed_at":"2026-08-13T22:29:45.204752Z","submitted_at":"2024-05-31T08:53:59Z","title":"Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement","version":1},"cited_work":{"arxiv_id":"2405.20701","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.20701","snapshot_observed_at":"2026-08-10T19:46:10.284929Z","title":"Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement","venue":"cs.CL","work_id":"a2847375-8b82-4207-aa4f-bc47636f2d10","year":2024},"citing_paper":{"arxiv_id":"2608.06848","last_updated":"2026-08-07T06:16:38Z","snapshot_observed_at":"2026-08-12T23:11:24.214097Z","submitted_at":"2026-08-07T06:16:38Z","title":"Understanding and Improving Model Editing for Secure Code Generation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T19:46:10.145741Z"},"links":{"cited_paper":"/paper/2405.20701","citing_paper":"/paper/2608.06848"},"observation_digest":"sha256:66d83dfb789d5e91f6b0a8dcb99d471fc6896e475d7324a6cc43adc860015921","observation_id":"20a2eff2-b5a8-43b9-aa6c-495d173550f8","resolution":{"observed_at":"2026-08-10T19:46:10.292552Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2405.20701/citation-record","integrity":"/paper/2405.20701/integrity","json":"/paper/2405.20701/citation-record.json","paper":"/paper/2405.20701"},"outbound":[],"paper":{"arxiv_id":"2405.20701","last_updated":"2024-05-31T08:53:59Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T22:29:45.204752Z","submitted_at":"2024-05-31T08:53:59Z","title":"Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.20701."}