{"as_of":"2026-08-09T16:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aef9726261308b91c25b426af32f4ab1939e008d51fbd1057015434c1b7bab14","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-09T06:31:02.800959+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-05T18:51:29.226264Z","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-05T18:51:31.405708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.08958","last_updated":"2025-04-11T20:26:49Z","snapshot_observed_at":"2026-08-07T16:06:23.985136Z","submitted_at":"2025-04-11T20:26:49Z","title":"Generating Planning Feedback for Open-Ended Programming Exercises with LLMs","version":1},"cited_work":{"arxiv_id":"2504.08958","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.08958","snapshot_observed_at":"2026-08-05T18:51:31.405708Z","title":"Generating Planning Feedback for Open-Ended Programming Exercises with LLMs","venue":"cs.CL","work_id":"ff99f80c-c74b-4e9d-9f04-70259be63995","year":2025},"citing_paper":{"arxiv_id":"2608.03461","last_updated":"2026-08-04T10:57:31Z","snapshot_observed_at":"2026-08-08T21:06:43.326357Z","submitted_at":"2026-08-04T10:57:31Z","title":"Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T18:51:29.226264Z"},"links":{"cited_paper":"/paper/2504.08958","citing_paper":"/paper/2608.03461"},"observation_digest":"sha256:9c9b05bb18773cd7d2c8c99286a9738df201b9cc6db40e2b69be55d2a2f11145","observation_id":"8dd688c0-8405-427a-8583-a137d61576e9","resolution":{"observed_at":"2026-08-05T18:51:31.408672Z","resolver_source":"local_arxiv","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/2504.08958/citation-record","integrity":"/paper/2504.08958/integrity","json":"/paper/2504.08958/citation-record.json","paper":"/paper/2504.08958"},"outbound":[],"paper":{"arxiv_id":"2504.08958","last_updated":"2025-04-11T20:26:49Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T16:06:23.985136Z","submitted_at":"2025-04-11T20:26:49Z","title":"Generating Planning Feedback for Open-Ended Programming Exercises with LLMs"},"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 1 inbound Pith citation observation for arXiv:2504.08958."}