{"as_of":"2026-08-08T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:149153c23eebedb38a0134b45c7373e051980e29aaabf6f35071afba0c4a04cf","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:51:03.281958Z","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-18T15:31:33.529813Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-08-06T17:51:03.281958Z","title":"Symbolic prompt program search: A structure-aware approach to efficient compile-time prompt optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09839","last_updated":"2026-06-23T00:54:38Z","snapshot_observed_at":"2026-08-08T12:12:03.373773Z","submitted_at":"2025-07-14T00:20:14Z","title":"Stabilizing Black-Box Prompt Optimization with Textual Regularization and Signal Aggregation","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:51:03.281958Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2507.09839"},"observation_digest":"sha256:d913af27f44684d1b781fc69841ed70d4b29ea05a2cb74aec3ee8cbd9c8cf35b","observation_id":"5944f9cb-8ff8-471e-aa95-0dc23cd8f8d6","resolution":{"observed_at":"2026-08-06T17:51:03.281958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-08-05T19:30:02.429425Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12475","last_updated":"2025-08-17T19:34:24Z","snapshot_observed_at":"2026-08-05T21:48:11.708386Z","submitted_at":"2025-08-17T19:34:24Z","title":"Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T19:30:02.429425Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2508.12475"},"observation_digest":"sha256:bc0473204623f649206ce9de4151eb47989ba13a8d9224e6f8940fa7d1c24d0d","observation_id":"724841ab-46f6-4db1-a82d-0aa31eb63453","resolution":{"observed_at":"2026-08-05T19:30:02.429425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-08-05T18:53:54.740907Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13948","last_updated":"2025-08-19T15:37:29Z","snapshot_observed_at":"2026-08-05T18:53:31.383828Z","submitted_at":"2025-08-19T15:37:29Z","title":"Prompt Orchestration Markup Language","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T18:53:54.740907Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2508.13948"},"observation_digest":"sha256:4272c1dbec340937c868afe8cfb9336130ee27691af168cb9d8b138276a9fb51","observation_id":"0dc3d32d-05ab-4fec-86b2-6422c8fbfdee","resolution":{"observed_at":"2026-08-05T18:53:54.740907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":"2404.02319","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reshabh K Sharma, Jonathan De Halleux, Shraddha Barke, and Benjamin Zorn","venue":null,"work_id":"857d7334-f549-45fc-b7fc-a5e98f287045","year":2024},"citing_paper":{"arxiv_id":"2509.17314","last_updated":"2026-07-01T05:02:47Z","snapshot_observed_at":"2026-08-08T12:03:30.889315Z","submitted_at":"2025-09-22T02:34:09Z","title":"Clotho: Measuring Task-Specific Pre-Generation Test Adequacy for LLM Inputs","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T15:28:58.083223Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2509.17314"},"observation_digest":"sha256:2b0584b3be2440e64631a40162e63656b1921d8457ca2625267fa79587fe5507","observation_id":"ff217655-ec1f-4b4c-97a9-e30f1e62de2a","resolution":{"observed_at":"2026-05-18T15:31:33.533191Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-08-04T15:58:39.854771Z","title":"Reshabh K Sharma, Jonathan De Halleux, Shraddha Barke, and Benjamin Zorn","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.17314","last_updated":"2026-07-01T05:02:47Z","snapshot_observed_at":"2026-08-08T12:03:30.889315Z","submitted_at":"2025-09-22T02:34:09Z","title":"Clotho: Measuring Task-Specific Pre-Generation Test Adequacy for LLM Inputs","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T15:58:39.854771Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2509.17314"},"observation_digest":"sha256:711a9def09a9c088c6411f52f6f336c127a17b60a9821ae5cc63fa75686a6d52","observation_id":"583c5d6d-a952-4b40-8020-9952ed68404b","resolution":{"observed_at":"2026-08-04T15:58:39.854771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization","version":2},"cited_work":{"arxiv_id":"2404.02319","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02319","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reshabh K Sharma, Jonathan De Halleux, Shraddha Barke, and Benjamin Zorn","venue":null,"work_id":"857d7334-f549-45fc-b7fc-a5e98f287045","year":2024},"citing_paper":{"arxiv_id":"2605.04107","last_updated":"2026-05-04T15:35:45Z","snapshot_observed_at":"2026-07-06T23:16:54.673178Z","submitted_at":"2026-05-04T15:35:45Z","title":"TSCG: Deterministic Tool-Schema Compilation for Agentic LLM Deployments","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-08T17:42:23.586416Z"},"links":{"cited_paper":"/paper/2404.02319","citing_paper":"/paper/2605.04107"},"observation_digest":"sha256:a4a376b463b0e6f9627a35c703557aebc05a546fdf50a3bea3f9195ca4923562","observation_id":"9dc09455-52de-4190-8654-17d5f7022fc7","resolution":{"observed_at":"2026-05-11T17:21:07.286567Z","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/2404.02319/citation-record","integrity":"/paper/2404.02319/integrity","json":"/paper/2404.02319/citation-record.json","paper":"/paper/2404.02319"},"outbound":[],"paper":{"arxiv_id":"2404.02319","last_updated":"2024-06-27T23:22:14Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:54:47.689340Z","submitted_at":"2024-04-02T21:35:54Z","title":"Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization"},"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 6 inbound Pith citation observations for arXiv:2404.02319."}