{"as_of":"2026-08-08T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4aa48a6fdcf67434b12d17168068f266811508dbf11b20bbd388caf14f0a506","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-08T06:32:00.761636+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-07T04:30:43.704737Z","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-05-13T20:13:13.164813Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.16416","last_updated":"2024-09-24T19:28:55Z","snapshot_observed_at":"2026-07-06T19:21:25.132336Z","submitted_at":"2024-09-24T19:28:55Z","title":"Selection of Prompt Engineering Techniques for Code Generation through Predicting Code Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16416","snapshot_observed_at":"2026-08-07T04:30:43.704737Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.704737Z"},"links":{"cited_paper":"/paper/2409.16416","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:8f8f2e39bfd276511aa073a248f39c560347634f808889ef64decdd89a55a840","observation_id":"25c25e3a-7ab5-4e77-957f-277fca33f16d","resolution":{"observed_at":"2026-08-07T04:30:43.704737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16416","last_updated":"2024-09-24T19:28:55Z","snapshot_observed_at":"2026-07-06T19:21:25.132336Z","submitted_at":"2024-09-24T19:28:55Z","title":"Selection of Prompt Engineering Techniques for Code Generation through Predicting Code Complexity","version":1},"cited_work":{"arxiv_id":"2409.16416","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.16416","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a59a87ef-e8e3-40cc-ab27-1ef29c4eb2e4","year":2024},"citing_paper":{"arxiv_id":"2604.02776","last_updated":"2026-04-03T06:37:51Z","snapshot_observed_at":"2026-08-02T13:25:19.726180Z","submitted_at":"2026-04-03T06:37:51Z","title":"Evaluating the Environmental Impact of using SLMs and Prompt Engineering for Code Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-13T20:12:12.283350Z"},"links":{"cited_paper":"/paper/2409.16416","citing_paper":"/paper/2604.02776"},"observation_digest":"sha256:0cdb41d3126cfa38699cf29cd5159aee70149d782ae75e00af5cd342658c033c","observation_id":"f524e44d-300f-4f18-a758-8233281c7d38","resolution":{"observed_at":"2026-05-13T20:13:13.167195Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.16416/citation-record","integrity":"/paper/2409.16416/integrity","json":"/paper/2409.16416/citation-record.json","paper":"/paper/2409.16416"},"outbound":[],"paper":{"arxiv_id":"2409.16416","last_updated":"2024-09-24T19:28:55Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T19:21:25.132336Z","submitted_at":"2024-09-24T19:28:55Z","title":"Selection of Prompt Engineering Techniques for Code Generation through Predicting Code Complexity"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2409.16416."}