{"as_of":"2026-08-09T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b971ea185a179de7a9d31788ff74d25d0ba4fe37383e98079ec0dbacce7eaa2","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-08T06:32:00.761636+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:31.230367Z","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.309467Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.03094","last_updated":"2024-12-24T10:00:23Z","snapshot_observed_at":"2026-08-06T02:46:43.789053Z","submitted_at":"2023-01-08T19:10:55Z","title":"A Divide-Align-Conquer Strategy for Program Synthesis","version":2},"cited_work":{"arxiv_id":"2301.03094","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03094","snapshot_observed_at":"2026-08-05T18:51:31.309467Z","title":"A Divide-Align-Conquer Strategy for Program Synthesis","venue":"cs.AI","work_id":"013b63b8-1fd7-46e1-86ad-c96f3799ac0a","year":2023},"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":35,"source":"pdf_text","source_observed_at":"2026-08-05T18:51:31.230367Z"},"links":{"cited_paper":"/paper/2301.03094","citing_paper":"/paper/2608.03461"},"observation_digest":"sha256:781114bd854f205c6eb4ae409ed853544ca7d6967dead1c80e0a6e0ddfbbf4ea","observation_id":"6a881051-4e9f-4ee4-bfc2-f677d019a542","resolution":{"observed_at":"2026-08-05T18:51:31.312954Z","resolver_source":"local_arxiv","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/2301.03094/citation-record","integrity":"/paper/2301.03094/integrity","json":"/paper/2301.03094/citation-record.json","paper":"/paper/2301.03094"},"outbound":[],"paper":{"arxiv_id":"2301.03094","last_updated":"2024-12-24T10:00:23Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T02:46:43.789053Z","submitted_at":"2023-01-08T19:10:55Z","title":"A Divide-Align-Conquer Strategy for Program Synthesis"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2301.03094."}