{"as_of":"2026-08-04T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e8aee30364d2a46ee9add23180d9b4fddc666563962597ad90752f543b233f9","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T20:28:26.767266Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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-02T07:07:41.153208Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.01082","snapshot_observed_at":"2026-08-02T07:07:41.153208Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22683","last_updated":"2026-07-13T05:02:43Z","snapshot_observed_at":"2026-08-04T02:47:53.960435Z","submitted_at":"2026-07-13T05:02:43Z","title":"Imprompt: A Language Framework for Prompt Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:41.153208Z"},"links":{"cited_paper":"/paper/2509.01082","citing_paper":"/paper/2607.22683"},"observation_digest":"sha256:edacbc717d893aefcd84d3c2714dacfa5811b025602202964bd8fbd8379d874b","observation_id":"92830c2a-450a-49ec-b2ee-d91497c9c78c","resolution":{"observed_at":"2026-08-02T07:07:41.153208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.01082/citation-record","integrity":"/paper/2509.01082/integrity","json":"/paper/2509.01082/citation-record.json","paper":"/paper/2509.01082"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.01954","last_updated":"2025-05-04T01:21:28Z","snapshot_observed_at":"2026-07-06T21:18:36.156573Z","submitted_at":"2025-05-04T01:21:28Z","title":"Semantic Probabilistic Control of Language Models","version":1},"cited_work":{"arxiv_id":"2505.01954","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.01954","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Semantic probabilistic control of language models","venue":null,"work_id":"c09ad411-cc4a-48ec-af95-07a98dd7a10e","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2505.01954","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:e2bebe7f8c506b3df7920ff1a7ecace4f4cb8df7e8150125580d28dd64794b26","observation_id":"9c7b9983-cc71-4111-81be-a6acd0e0c00d","resolution":{"observed_at":"2026-05-18T20:31:50.526080Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-07-06T20:35:49.677643Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":"2502.09061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-07-02T08:06:48.385427Z","title":"arXiv preprint arXiv:2502.09061 (2025)","venue":null,"work_id":"f287f3e0-071e-408f-acf5-6163f9ec435a","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:6c38f8d42f0107d39d93a29bead85c2a27cf3d2084fe62798ba9fe3b3f09e11f","observation_id":"b29a63d0-46d2-47f7-9842-9b66fd20bd79","resolution":{"observed_at":"2026-05-18T20:31:50.515984Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.02434","last_updated":"2018-07-16T02:46:10Z","snapshot_observed_at":"2026-07-06T05:25:35.928343Z","submitted_at":"2017-01-10T04:26:06Z","title":"A Conceptual Introduction to Hamiltonian Monte Carlo","version":2},"cited_work":{"arxiv_id":"1701.02434","doi":"10.2307/1126509","metadata_source":"pith","pith_arxiv_id":"1701.02434","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"A Conceptual Introduction to Hamiltonian Monte Carlo","venue":"stat.ME","work_id":"b7f819a9-4fee-4c47-9e83-67bb01c9f7d2","year":2017},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/1701.02434","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:b333df2d240d082c5fc7c2e2d83613e9d97ad02a8a8b63661e8070cbafedb176","observation_id":"397ef175-f5b7-4df8-91f5-2aa4f9f05b97","resolution":{"observed_at":"2026-05-18T20:31:50.520908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pyro: Deep universal probabilistic programming","venue":null,"work_id":"923e63b4-f623-4e3f-8f62-215cf72226d4","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:fd23dadd70b9ccca88c22d6a58d031ab211329e7042bdc85e16ce22d1cd2a311","observation_id":"9892929b-ad99-4945-9115-4dc2b77b5e09","resolution":{"observed_at":"2026-05-18T20:31:51.698845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automated reverse engineering of nonlinear dynamical systems","venue":null,"work_id":"0257261c-7d81-4395-a3d6-eff4f0036658","year":2007},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:7163b889c619427af0401191db4f85ea8abd9efbacab3638e1909d638df5e67e","observation_id":"156bd34c-d97f-4971-8ad5-b4f3d695369f","resolution":{"observed_at":"2026-05-18T20:31:51.696083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18637/jss.v076.i01","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T04:44:16.669675Z","title":"Journal of Statistical Software , author =","venue":null,"work_id":"b517a0eb-9302-4f51-b1f2-42ae9d87b409","year":2017},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:11c1a461d54fc01beb44c7f20bbb48be1187d49c8bb68a1abb095b6668f8a666","observation_id":"48748d5f-21b2-4a95-8d9a-9cfce81fbb44","resolution":{"observed_at":"2026-05-18T20:31:50.029102Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-16T21:20:50.027652+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T21:20:50.027652+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stan: A probabilistic programming language","venue":null,"work_id":"2cbb2379-0e72-49a7-93c2-b2269cddf6d9","year":2017},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:be137213979e5582b330791bd2769af916b7fa49cbcf205f84cf2a95fec10ca1","observation_id":"e00c61e8-6a71-4df3-bd72-9790d47a065e","resolution":{"observed_at":"2026-05-18T20:31:51.693175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A general-purpose algorithm for constrained sequential inference","venue":null,"work_id":"5da6d594-9a2a-4507-af94-a545c89f9699","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:03111002a855ab8d13cd6262ac17e1b525cffb44046ae0b4aa32a39c7c79da33","observation_id":"5c284476-5631-49af-98e5-6ba3b14c1c38","resolution":{"observed_at":"2026-05-18T20:31:51.690296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15100","last_updated":"2025-05-12T08:20:08Z","snapshot_observed_at":"2026-07-06T19:55:37.400185Z","submitted_at":"2024-11-22T18:01:37Z","title":"XGrammar: Flexible and Efficient Structured Generation Engine for Large Language Models","version":3},"cited_work":{"arxiv_id":"2411.15100","doi":"10.48550/arxiv.2411.15100","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.15100","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Ruan, Yaxing Cai, Ruihang Lai, Ziyi Xu, Yilong Zhao, and Tianqi Chen","venue":null,"work_id":"0c3b7694-4a47-4780-8d2c-9d5afe472e3e","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2411.15100","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:2ceb98bb9d580b83c36900c5eb5ff71263dcfde9160babeac5c4f07e49068c74","observation_id":"96fa94b6-4991-4154-b0a4-98e8780a8a3b","resolution":{"observed_at":"2026-05-18T20:31:50.545543Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structure discovery in nonparametric regression through compositional kernel search","venue":null,"work_id":"c0a7ea32-02a7-438e-948c-ec3b9b271d37","year":2013},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:2ad791c1b08b3b3b2705411b67277f16db80f28dc09fd4888fba3f0163c1b7c5","observation_id":"1d4bb7ae-3dfd-4b11-a778-48c8af5e780e","resolution":{"observed_at":"2026-05-18T20:31:51.687218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unsupervised learning by program synthesis","venue":null,"work_id":"8f9fc735-f392-4696-aac2-fc860871a13d","year":2015},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:90969bf781f7fc072dd0440d7981acf2916e0929d723551dcae99326c33fd46c","observation_id":"dd26a228-e1bf-44b1-8096-3aaee2453435","resolution":{"observed_at":"2026-05-18T20:31:51.776017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"UTF -8 plumbing: Byte-level tokenizers unavoidably enable LLM s to generate ill-formed UTF -8","venue":null,"work_id":"c5b2ab45-23ca-4531-9afb-75bdc7ea890e","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:ce47cfe911e8c725e727f85063934bf66e1888a9d84c9877d84a91fd1e9454fb","observation_id":"901b6a65-8c84-4311-a889-4951203761ff","resolution":{"observed_at":"2026-05-18T20:31:51.768223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bayesian data analysis","venue":null,"work_id":"fa44e6cf-c5ca-4434-a497-104c7a2128bd","year":1995},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:e0ec8dd41f4f8879af607074932e163adad0ccdf721cfe1e491450927fbdeeaf","observation_id":"fa55c6c5-87f5-40b9-932d-e379006355b3","resolution":{"observed_at":"2026-05-18T20:31:51.764952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.01808","last_updated":"2020-11-03T15:59:50Z","snapshot_observed_at":"2026-08-04T15:28:29.177208Z","submitted_at":"2020-11-03T15:59:50Z","title":"Bayesian Workflow","version":1},"cited_work":{"arxiv_id":"2011.01808","doi":"10.48550/arxiv.2011.01808","metadata_source":"arxiv_reference","pith_arxiv_id":"2011.01808","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Gelman, A","venue":null,"work_id":"c578ed1d-d3f2-4207-80b1-2146321398b0","year":2011},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2011.01808","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:7917e14ec4458fb228fae75cb236015670026727466ceaba13562b285607d097","observation_id":"8f799081-9ee8-428a-89f9-f1bc1b46fe36","resolution":{"observed_at":"2026-05-18T20:31:50.614510Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning the structure of sum-product networks","venue":null,"work_id":"5fa778a5-b843-4239-9fc8-24f92fe7d96f","year":2013},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:aef0dfa7c06c3010970a63faefba35ffdf5e1982f6196e623a7da00ffbb78f8e","observation_id":"01d5d4ee-7851-4444-b21d-19caa40a0957","resolution":{"observed_at":"2026-05-18T20:31:51.761685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/ase.2015.22","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Search-based synthesis of probabilistic models for quality-of-service software engineering","venue":null,"work_id":"48bc7a49-1ddd-45bc-9c9b-69b3fad03b1e","year":2015},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:cfd1e8ec8831745cf2b42fbab781719b374f77f47ea31ea52a66329cd79138e3","observation_id":"127d8b9c-94c5-4bc4-b9ce-d4ab186b8a10","resolution":{"observed_at":"2026-05-18T20:31:50.052514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning efficient markov networks","venue":null,"work_id":"c4e4ab79-2768-4d31-bea5-e6c7ec037945","year":2010},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:64229ec77b06ec18797d266bc592923810ef45e84af09b41a0b0233bb47144f5","observation_id":"c4efdfa7-3603-4736-aa54-57dab07a9200","resolution":{"observed_at":"2026-05-18T20:31:51.757686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3882.259390","doi":"10.1145/2593882.2593900","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Gordon, Thomas A","venue":null,"work_id":"53cd7168-c40e-4b82-99f7-19a84e4f81ae","year":2014},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:1bfaad3e4d0d6cb83b37ed8f8017575ebf1ecb406ce581c0f77a9c5ab5aba657","observation_id":"ac0f751f-8cf2-43d8-b69b-8d8a8847db02","resolution":{"observed_at":"2026-05-18T20:31:50.065876Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07081","last_updated":"2025-08-08T17:58:01Z","snapshot_observed_at":"2026-07-06T21:06:50.056353Z","submitted_at":"2025-04-09T17:54:22Z","title":"Self-Steering Language Models","version":2},"cited_work":{"arxiv_id":"2504.07081","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.07081","snapshot_observed_at":"2026-07-04T10:49:46.147283Z","title":"Tenenbaum, Vikash K","venue":null,"work_id":"db5971aa-bdad-4882-b112-b63490231a8e","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2504.07081","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:e129853ad1417dbb3f68ac84d0c4f8e1af324ffca11c6036c68ba55110a9ce6d","observation_id":"633f308a-4f46-4e00-92a1-2adc6d12d4f7","resolution":{"observed_at":"2026-05-18T20:31:50.569974Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:52f4bd2e1b0f6dee5a1c2bfd1069fe387a823044fce8c7360b3ba0ec832d9ec5","observation_id":"e113b1c3-84d3-464b-a460-104af480876f","resolution":{"observed_at":"2026-05-18T20:31:50.607708Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Grosse, Ruslan Salakhutdinov, William T","venue":null,"work_id":"0ce9b3c0-d623-4302-9624-92fcdeae8153","year":2012},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:17f00e88dba8ecd57569d8ba3d66b7f25f497d0de9db8cd87427ab4f6f23fc15","observation_id":"145934a0-85c8-4e0e-b59f-8c33e573c528","resolution":{"observed_at":"2026-05-18T20:31:51.753937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Model selection in compositional spaces","venue":null,"work_id":"2ada7116-c988-4c88-a3eb-728e50a0552c","year":2014},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:85053038bce5674035a312b446b577d36d9b155b57bab957ea27e1a53a5baad4","observation_id":"f69a7d95-6222-4206-af47-c17d8a4c9b58","resolution":{"observed_at":"2026-05-18T20:31:51.750864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:de7bb567006333a0aaaee8fb2d2d98ba008142fd7f0a446d8cf7244105b27e7c","observation_id":"f61efe36-0e6f-4b6e-a01f-a2b2deb0293e","resolution":{"observed_at":"2026-05-18T20:31:50.549522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The no-u-turn sampler: adaptively setting path lengths in hamiltonian monte carlo","venue":null,"work_id":"3abf3bf1-95d6-4fbc-a29c-8def4ce2ca8e","year":2014},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:b28aff5c383d0e8188e665bc221f42f69073c036b7b6f79d8808ee339f9f2e87","observation_id":"f544aac1-2ff6-4e28-8c6c-47cc7bf70d08","resolution":{"observed_at":"2026-05-18T20:31:51.746848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":"2409.12186","doi":"10.48550/arxiv.2409.12186","metadata_source":"pith","pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-07-10T16:07:20.290468Z","title":"Qwen2.5-Coder Technical Report","venue":"cs.CL","work_id":"09ba463d-6377-4017-9801-444ffb94b056","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:42707fa88fbafb60ae55e0ec22f7b02369f8b4dbd60ea4045d414d8275f74e88","observation_id":"840fa26c-2694-48c2-900d-40d0fe227912","resolution":{"observed_at":"2026-05-18T20:31:50.530698Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automata-based constraints for language model decoding","venue":null,"work_id":"6f2770ee-fe44-4752-b80c-06350501be58","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:5053abee1c9d2937fe4323e2c1b73b44b2d7dbae466f93c67646abcae97f9d1d","observation_id":"c3b0df92-e7d1-453f-b04d-a7cbcce83fee","resolution":{"observed_at":"2026-05-18T20:31:51.743142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Validating large language models with RELM","venue":null,"work_id":"08d251e6-1be6-4368-bafe-5bf5704d4ed0","year":2023},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:24edf39a5d3639240fb82fa0d6a947defb6c785178ef63cd302f9cad3942e728","observation_id":"88f01669-f40b-40ee-a76c-048adb9f5c9c","resolution":{"observed_at":"2026-05-18T20:31:51.739160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17879","last_updated":"2024-06-22T05:08:30Z","snapshot_observed_at":"2026-08-04T14:51:19.255821Z","submitted_at":"2024-02-27T20:33:22Z","title":"Automated Statistical Model Discovery with Language Models","version":2},"cited_work":{"arxiv_id":"2402.17879","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17879","snapshot_observed_at":"2026-07-04T20:30:07.297991Z","title":"arXiv preprint arXiv:2402.17879 , year =","venue":null,"work_id":"f1fadc77-fea4-448b-b577-c2a3f7162354","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2402.17879","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:6fc21f3c9abb15875c478f79c4ead1f1a92258d998a5c5d6d123c2813be4965c","observation_id":"983ffecb-00f5-4103-83a6-14a34f2e4b27","resolution":{"observed_at":"2026-05-18T20:31:50.564823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automated model discovery for human brain using constitutive artificial neural networks","venue":null,"work_id":"57a2eacb-8b77-4e72-ab93-41ce2d362338","year":2023},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:aa62cf21fe5a369c93a60a6b333e3b739ff5f431d2bb87b635a82c925edf8fe4","observation_id":"2c629ae3-afe9-44a8-ab8a-472462803260","resolution":{"observed_at":"2026-05-18T20:31:51.735840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.13139","last_updated":"2025-04-18T18:45:25Z","snapshot_observed_at":"2026-07-06T21:11:05.749637Z","submitted_at":"2025-04-17T17:49:40Z","title":"Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo","version":2},"cited_work":{"arxiv_id":"2504.13139","doi":"10.48550/arxiv.2504.13139","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.13139","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Syntactic and semantic control of large language models via sequential","venue":null,"work_id":"a01365f7-5867-45d5-8bb6-b4a4495e5646","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2504.13139","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:001a27b54f2f77c96b1f40d6012f56a6fc708b4ecaf65cbf88264e8764178267","observation_id":"113e9985-9d90-4bf0-91eb-4bd87e5e5631","resolution":{"observed_at":"2026-05-18T20:31:50.554434Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-24T13:24:33.421833+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T13:24:33.421833+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.3271","last_updated":"2012-06-13T15:38:26Z","snapshot_observed_at":"2026-07-06T02:49:58.517151Z","submitted_at":"2012-06-13T15:38:26Z","title":"Learning Arithmetic Circuits","version":1},"cited_work":{"arxiv_id":"1206.3271","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.3271","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning Arithmetic Circuits","venue":"cs.AI","work_id":"2ac2c26b-350d-45e6-a252-0e98dfe4aba0","year":2012},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/1206.3271","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:e4e9857d0874fd867ad9eb9d34989ad145b58cdc05275ca1aa98432f4a73af2d","observation_id":"13ed3f45-279d-4061-b36a-63cc71341110","resolution":{"observed_at":"2026-05-18T20:31:50.602744Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bayesian population analysis using WinBUGS","venue":null,"work_id":"6a1dac0c-21be-49f5-9061-2e75ca3a412b","year":2011},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:8f13d59106705ec3e499abc447db61e1b254d825d7a1dff741ab47dfdd697bff","observation_id":"c99af2e6-2b8f-4360-9634-88e1c896f8b1","resolution":{"observed_at":"2026-05-18T20:31:51.732253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04967","last_updated":"2024-07-06T06:01:02Z","snapshot_observed_at":"2026-07-06T18:42:18.289966Z","submitted_at":"2024-07-06T06:01:02Z","title":"posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms","version":1},"cited_work":{"arxiv_id":"2407.04967","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.04967","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2024 , archiveprefix =","venue":null,"work_id":"ede64e77-4ed7-40fe-91a1-7b9bc6da1a5b","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2407.04967","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:5b04599485e8f74daa641ed4ac8146bc33f0c9d7bfe99fd283fd77ac3e6e0b3a","observation_id":"fb99b199-1bc4-499c-904d-7ef1602f7a78","resolution":{"observed_at":"2026-05-18T20:31:50.593378Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ba045c9a-6200-4c58-9536-132ceaf9bd82","year":2006},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:9f2535ea374cce48c46d9d862e0ea5cf059e7078bad7efbbd78c11a3adcbc99b","observation_id":"9fc45498-d9aa-4b8d-9593-66123a29f00b","resolution":{"observed_at":"2026-05-18T20:31:51.728549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hybrid grammar-based approach to nonlinear dynamical system identification from biological time series","venue":null,"work_id":"1ef21396-3d32-4229-8803-12e8ff9ce43e","year":2006},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:cd7f39b4bbd6efbda4ce78fcb96619cc658787f44648216e13025784af5e0728","observation_id":"9b532d52-a9a7-4c99-8f5a-324befd3079d","resolution":{"observed_at":"2026-05-18T20:31:51.722635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mcmc using hamiltonian dynamics","venue":null,"work_id":"cee50f0b-9481-4007-a041-ba134c7530da","year":2011},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:3fb904265d8d0536b65d3385f4322bdb2a97d416de2fed6f55ec8badd0df2ce1","observation_id":"709c72b6-e219-4b79-9b26-466bb6714d23","resolution":{"observed_at":"2026-05-18T20:31:51.719852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7924.273798","doi":"10.1145/2737924.2737982","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Nori, Sherjil Ozair, Sriram K","venue":null,"work_id":"dea2188f-0dbe-417b-8f5d-13ef1dc2387a","year":2015},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:113c9974f1005ea087ea9fa08b19cb9fe650790d9afc0a5f9988a101ce23b676","observation_id":"07449cb8-4b2c-427c-86ff-bf55ac31af43","resolution":{"observed_at":"2026-05-18T20:31:50.042121Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":"a75d4161-9ea9-487f-bf22-500f6b868cbf","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:dc773d9f4553aa00f69f0d5b1c44c62e7f7ab96530f2b82662283b8b6a2df6cc","observation_id":"e50bd979-ddd0-43ee-aa32-79a4c07c4aed","resolution":{"observed_at":"2026-05-18T20:31:51.717008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.11554","last_updated":"2019-12-24T22:09:36Z","snapshot_observed_at":"2026-07-06T08:46:54.138798Z","submitted_at":"2019-12-24T22:09:36Z","title":"Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro","version":1},"cited_work":{"arxiv_id":"1912.11554","doi":"10.48550/arxiv.1912.11554","metadata_source":"pith","pith_arxiv_id":"1912.11554","snapshot_observed_at":"2026-07-10T20:27:36.674824Z","title":"Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro","venue":"stat.ML","work_id":"a2a03fcf-38c5-4ebe-b5a4-4bc41761dca5","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/1912.11554","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:ae85fb506389747a50e44368d7e4d3c3c3759645c5993579ae6d4d9a19477cb1","observation_id":"f5bce92d-b75e-4011-912b-383fd549581e","resolution":{"observed_at":"2026-05-18T20:31:50.583972Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-17T23:51:13.105218+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T23:51:13.105218+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Synchromesh: Reliable code generation from pre-trained language models","venue":null,"work_id":"933ef9de-6254-4a6d-a8d7-25edc69757db","year":2022},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:086728107f97037aa40c33c2657f2a601e35c79c666e81f2660d9f8d3bdd32c6","observation_id":"d006981f-d1ed-41c7-9f2b-709dc8b97795","resolution":{"observed_at":"2026-05-18T20:31:51.714226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Estimation in parallel randomized experiments","venue":null,"work_id":"79901660-7828-4b0d-bc5b-2308b94f5f6f","year":1981},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:195eec1ec4d88778f42737affaec4651802331b3a2ddb1d37525f70ceb16956c","observation_id":"132ab93b-5d5e-467f-ba7c-3d8b4e420d21","resolution":{"observed_at":"2026-05-18T20:31:51.711818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3290350","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Saad, Marco F","venue":null,"work_id":"8c5c79be-f84a-4f19-b58c-52535bfe1479","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:859265493f18147b478234ffd5537f42d6f10c7b707fb77202b375ac93bcb353","observation_id":"4d48aaa0-a5ec-48f7-b60b-6f23a516706f","resolution":{"observed_at":"2026-05-18T20:31:50.059045Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7717/peerj-cs.55","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T22:50:13.477069Z","title":"V., & Fonnesbeck, C","venue":null,"work_id":"3056f99b-5cd4-4d11-b03b-1acc79ba0d5b","year":2016},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:fb2af1042948f59e891bccacb68f7eef97bc737aaa5cca3fbeec2c52374fcda2","observation_id":"f39f3459-fd82-4aa8-a82e-51cb0147df0e","resolution":{"observed_at":"2026-05-18T20:31:50.022823Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distilling free-form natural laws from experimental data","venue":null,"work_id":"7d7dba3b-0ca3-4eef-a16d-2d286d71bcc8","year":2009},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:dcdc13527885d1c8dd635d1477f54e8194ed32c82c3ebd9d282bd1f943ed5629","observation_id":"23c5c793-95f8-422d-a75d-801246d411b9","resolution":{"observed_at":"2026-05-18T20:31:51.708881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23061","last_updated":"2025-05-29T04:04:54Z","snapshot_observed_at":"2026-07-06T21:32:38.137341Z","submitted_at":"2025-05-29T04:04:54Z","title":"DINGO: Constrained Inference for Diffusion LLMs","version":1},"cited_work":{"arxiv_id":"2505.23061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23061","snapshot_observed_at":"2026-07-04T19:50:11.231721Z","title":"Dingo: Constrained inference for diffusion llms","venue":null,"work_id":"0dc5599f-d4db-49ec-9e4f-23393b8c8ae7","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2505.23061","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:78bbdd784370703575ed244044af97a534561fb04237f3dfceffcdb5d35dcd76","observation_id":"d21b7d98-0f9f-41f8-86f4-9049dd07c6d9","resolution":{"observed_at":"2026-05-18T20:31:50.598078Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11409","last_updated":"2024-06-19T02:37:50Z","snapshot_observed_at":"2026-07-06T18:32:06.826381Z","submitted_at":"2024-06-17T10:54:35Z","title":"CodeGemma: Open Code Models Based on Gemma","version":2},"cited_work":{"arxiv_id":"2406.11409","doi":"10.48550/arxiv.2406.11409","metadata_source":"pith","pith_arxiv_id":"2406.11409","snapshot_observed_at":"2026-07-10T16:07:20.299518Z","title":"Codegemma: Open code models based on gemma","venue":"cs.CL","work_id":"f71ad4ac-ddea-4be1-a103-56d82d7ac8a3","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2406.11409","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:58cfbcde4eec9b24c2d0c272fa0d0494c9be926614cb9b75f062ca438799f4ea","observation_id":"1d1440f6-541b-4109-a59c-1077bd1ef6cb","resolution":{"observed_at":"2026-05-18T20:31:50.559782Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07295","last_updated":"2025-03-02T01:39:57Z","snapshot_observed_at":"2026-07-06T19:30:43.691433Z","submitted_at":"2024-10-09T16:21:38Z","title":"IterGen: Iterative Semantic-aware Structured LLM Generation with Backtracking","version":2},"cited_work":{"arxiv_id":"2410.07295","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.07295","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Itergen: Iterative structured llm generation","venue":null,"work_id":"05a87dd8-1b74-45d4-a4a5-3f083367c372","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2410.07295","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:ad386ca406f2d8c49d2d6dc96d1670fc9cb3b9d27711daa63280880bb5f46d71","observation_id":"a5f4ca6f-0b0e-423a-9e58-e60fe4d21b11","resolution":{"observed_at":"2026-05-18T20:31:50.579667Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01632","last_updated":"2024-11-06T18:04:35Z","snapshot_observed_at":"2026-08-01T22:59:30.608547Z","submitted_at":"2024-03-03T22:38:35Z","title":"SynCode: LLM Generation with Grammar Augmentation","version":4},"cited_work":{"arxiv_id":"2403.01632","doi":"10.48550/arxiv.2403.01632","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.01632","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Ugare, T","venue":null,"work_id":"0b1c7f79-2cff-43fe-b2cd-18963f1efdd8","year":2024},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2403.01632","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:89bc236e1b34f52412941e395a4c8a38d6b28f96410c3e7a105843e68b16df40","observation_id":"69201c0d-0172-405e-9081-733731a0a75e","resolution":{"observed_at":"2026-05-18T20:31:50.575145Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IterGen : Iterative structured LLM generation","venue":null,"work_id":"829b6f03-fb48-42ef-a86e-338a5856533e","year":2025},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:0ce1819f00b5b465f89549c02c7c377e837585003fd7cc0750898905a580bb3e","observation_id":"720535b4-4edf-4280-88c1-c229a0973046","resolution":{"observed_at":"2026-05-18T20:31:51.725639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Examples volume 1, a","venue":null,"work_id":"0d4ae7a1-93fd-46d3-999c-ddbe5c83a4d5","year":null},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:44aafafd2ca92588f80fb5b22b2195b1a1418e749d3fea202a3fb000e8dfb954","observation_id":"d9904c39-99b5-44d6-ade7-00c1c59c035c","resolution":{"observed_at":"2026-05-18T20:31:51.680416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Examples volume 2, b","venue":null,"work_id":"b02da527-85e9-4f22-b5f5-73fa9f352c63","year":null},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:af78d192261b9a525224d71181fa6f522c4c285416d5fb004d219bdfaf000240","observation_id":"a319b008-58a5-4964-a735-b3e17376c52b","resolution":{"observed_at":"2026-05-18T20:31:51.684047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10756","last_updated":"2021-10-19T10:56:50Z","snapshot_observed_at":"2026-08-01T14:51:22.613991Z","submitted_at":"2018-09-27T20:44:23Z","title":"An Introduction to Probabilistic Programming","version":2},"cited_work":{"arxiv_id":"1809.10756","doi":"10.48550/arxiv.1809.10756","metadata_source":"arxiv_reference","pith_arxiv_id":"1809.10756","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"An introduction to probabilistic programming","venue":null,"work_id":"e0d9664f-f519-4c55-b035-0f5e384b0835","year":2018},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/1809.10756","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:c2cab202c687c940edfd0461b4d307510c4ba9c1c4bdc8c32f1d9ccbe44ad31a","observation_id":"77eae328-f183-49cc-ad72-799aa382470d","resolution":{"observed_at":"2026-05-18T20:31:50.535525Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Practical bayesian model evaluation using leave-one-out cross-validation and waic","venue":null,"work_id":"b17faacc-c7dd-4690-8bdd-068181ad5d81","year":2017},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:43bef9b7625d0f0b2e48fb100e3bf96dfa5428c5c82554409b7adc7e6ab0ba67","observation_id":"135fd82f-800f-4c88-b2f5-8315b512d650","resolution":{"observed_at":"2026-05-18T20:31:51.705224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rank-normalization, folding, and localization: An improved R for assessing convergence of mcmc (with discussion)","venue":null,"work_id":"c20e9871-ecee-4160-a630-a108f9355264","year":2021},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:8f359cb626e8219dfc19377cea166d700c9d7d98021e484e5185b33c1c538836","observation_id":"90d80ba6-4dc8-4314-8e0f-0c1a5b4857e1","resolution":{"observed_at":"2026-05-18T20:31:51.701844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09702","last_updated":"2023-08-19T21:27:51Z","snapshot_observed_at":"2026-07-06T15:55:41.294452Z","submitted_at":"2023-07-19T01:14:49Z","title":"Efficient Guided Generation for Large Language Models","version":4},"cited_work":{"arxiv_id":"2307.09702","doi":"10.48550/arxiv.2307.09702","metadata_source":"pith","pith_arxiv_id":"2307.09702","snapshot_observed_at":"2026-07-10T22:07:38.513339Z","title":"Efficient Guided Generation for Large Language Models","venue":"cs.CL","work_id":"eed83982-64d7-41e1-b7ec-21167ca473d5","year":2023},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/2307.09702","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:e79793849f098bb30153796cb360f720638b51d51449da281cc928c21c10552f","observation_id":"fcab3d21-9d92-4541-a4b8-23d96da255e3","resolution":{"observed_at":"2026-05-18T20:31:50.588497Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-22T13:23:27.209789+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T13:23:27.209789+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12371","last_updated":"2019-04-28T19:15:33Z","snapshot_observed_at":"2026-07-06T07:49:00.896271Z","submitted_at":"2019-04-28T19:15:33Z","title":"Counterexample-Driven Synthesis for Probabilistic Program Sketches","version":1},"cited_work":{"arxiv_id":"1904.12371","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.12371","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Counterexample-Driven Synthesis for Probabilistic Program Sketches","venue":"cs.SE","work_id":"3b40e709-f58a-4e54-a4e3-0395c64b0ce8","year":2019},"citing_paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-18T20:28:26.767266Z"},"links":{"cited_paper":"/paper/1904.12371","citing_paper":"/paper/2509.01082"},"observation_digest":"sha256:193d5d76dfe5f1cab1babbe347fbbd7bdb0f3015504ec4c1b64a5aab20dfec26","observation_id":"a29ae7e6-a87f-4ea6-b79b-79e11b3f592b","resolution":{"observed_at":"2026-05-18T20:31:50.540592Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.01082","last_updated":"2026-04-19T01:13:14Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-01T03:13:36Z","title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":1,"verified_exact":21,"verified_fuzzy":28},"total_outbound_references":56},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2509.01082."}