{"as_of":"2026-08-10T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb612d9de70b2b58f3e18a035a3ac7045c1f2bfffae6700247bb81424b8205ae","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-10T06:31:04.303077+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-06T20:19:18.967869Z","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-06T20:19:21.080091Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.15989","last_updated":"2025-05-29T18:29:37Z","snapshot_observed_at":"2026-08-08T05:54:25.617618Z","submitted_at":"2025-04-22T15:51:00Z","title":"Optimizing Token Consumption in LLMs: A Nano Surge Approach for Code Reasoning Efficiency","version":2},"cited_work":{"arxiv_id":"2504.15989","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.15989","snapshot_observed_at":"2026-08-06T20:19:21.080091Z","title":"Optimizing Token Consumption in LLMs: A Nano Surge Approach for Code Reasoning Efficiency","venue":"cs.SE","work_id":"e4aaa067-cb90-4608-a5d1-696e59729819","year":2025},"citing_paper":{"arxiv_id":"2507.03254","last_updated":"2025-07-04T02:20:19Z","snapshot_observed_at":"2026-08-09T12:28:10.149601Z","submitted_at":"2025-07-04T02:20:19Z","title":"CodeAgents: A Token-Efficient Framework for Codified Multi-Agent Reasoning in LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:19:18.967869Z"},"links":{"cited_paper":"/paper/2504.15989","citing_paper":"/paper/2507.03254"},"observation_digest":"sha256:4237d9272cc43fa3882c3ca18f77db29385fad7dfa02f647fe5a8cc44ab29b1e","observation_id":"f5e23077-5f98-4968-b45e-50c21baca477","resolution":{"observed_at":"2026-08-06T20:19:21.147626Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15989/citation-record","integrity":"/paper/2504.15989/integrity","json":"/paper/2504.15989/citation-record.json","paper":"/paper/2504.15989"},"outbound":[],"paper":{"arxiv_id":"2504.15989","last_updated":"2025-05-29T18:29:37Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-08T05:54:25.617618Z","submitted_at":"2025-04-22T15:51:00Z","title":"Optimizing Token Consumption in LLMs: A Nano Surge Approach for Code Reasoning Efficiency"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.15989."}