{"as_of":"2026-08-17T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a86b902b7a0e22c8afb1aa70c86624616020d9660b4ad3a54987f78695fbb3f","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-17T06:30:58.91139+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-16T11:17:35.269159Z","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-16T11:17:36.116982Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.20042","last_updated":"2024-07-29T14:27:08Z","snapshot_observed_at":"2026-08-16T13:30:12.269854Z","submitted_at":"2024-07-29T14:27:08Z","title":"When to Stop? Towards Efficient Code Generation in LLMs with Excess Token Prevention","version":1},"cited_work":{"arxiv_id":"2407.20042","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.20042","snapshot_observed_at":"2026-08-16T11:17:36.116982Z","title":"When to Stop? Towards Efficient Code Generation in LLMs with Excess Token Prevention","venue":"cs.SE","work_id":"ae0b7cef-e67c-4571-98b8-57aa659bfe56","year":2024},"citing_paper":{"arxiv_id":"2504.15989","last_updated":"2025-05-29T18:29:37Z","snapshot_observed_at":"2026-08-16T11:10:56.816544Z","submitted_at":"2025-04-22T15:51:00Z","title":"Optimizing Token Consumption in LLMs: A Nano Surge Approach for Code Reasoning Efficiency","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:17:35.269159Z"},"links":{"cited_paper":"/paper/2407.20042","citing_paper":"/paper/2504.15989"},"observation_digest":"sha256:658da2511d47b4798937f63a73ecef8dafe4d5e226d37c8cbe9a1e6ac41ba6de","observation_id":"649bacc0-45d2-40de-a7dd-43d7f3f71149","resolution":{"observed_at":"2026-08-16T11:17:36.121959Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.20042/citation-record","integrity":"/paper/2407.20042/integrity","json":"/paper/2407.20042/citation-record.json","paper":"/paper/2407.20042"},"outbound":[],"paper":{"arxiv_id":"2407.20042","last_updated":"2024-07-29T14:27:08Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T13:30:12.269854Z","submitted_at":"2024-07-29T14:27:08Z","title":"When to Stop? Towards Efficient Code Generation in LLMs with Excess Token Prevention"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.20042."}