{"as_of":"2026-08-09T20:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d013c549fc17daf3a29600af3df049481cd9326c97b65a2b214e4ea664a406e","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:51:13.062709Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:19:02.536453Z","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-07-02T08:06:48.385427Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-08T20:19:02.536453Z","title":"Crane: Reasoning with constrained llm generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T20:19:02.536453Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2502.05111"},"observation_digest":"sha256:5acb30b42af0a093cd3e6d99245aabbb4697d51d19ccd38ca8014000f26a715d","observation_id":"822a441b-a668-4088-b8e8-436f1fab345f","resolution":{"observed_at":"2026-08-08T20:19:02.536453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-07T12:58:35.777033Z","title":"CRANE : Reasoning with constrained LLM generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23061","last_updated":"2025-05-29T04:04:54Z","snapshot_observed_at":"2026-08-09T08:10:01.486046Z","submitted_at":"2025-05-29T04:04:54Z","title":"DINGO: Constrained Inference for Diffusion LLMs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:58:35.777033Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2505.23061"},"observation_digest":"sha256:535ce1f2cff8281d32e6e3e22638a42ad42be985483050cc3e90a3a45d308cd0","observation_id":"f3631b79-d862-4961-8d77-a59b9c3b5858","resolution":{"observed_at":"2026-08-07T12:58:35.777033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-05T23:25:38.183084Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05429","last_updated":"2025-08-08T01:24:20Z","snapshot_observed_at":"2026-08-09T13:16:21.232682Z","submitted_at":"2025-08-07T14:17:43Z","title":"MyCulture: Exploring Malaysia's Diverse Culture under Low-Resource Language Constraints","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T23:25:38.183084Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2508.05429"},"observation_digest":"sha256:36b045c7e6d2d059dc86745d6b69deeeff128a105190f3173610edabd3a4d9e9","observation_id":"383e5f64-9d34-4cca-b1d1-7d8dd8996d1d","resolution":{"observed_at":"2026-08-05T23:25:38.183084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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-08-07T10:03:46.349624Z","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:c41230e9890001322ebefb114ce68827901c9b0f6a6b8d7c36c33bdb535df5d8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2511.22277","last_updated":"2026-04-24T08:52:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-11-27T09:59:39Z","title":"TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T04:19:18.805697Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2511.22277"},"observation_digest":"sha256:5e596d9192ad0d65087da4adf6f5354981a61864ff8a6736df1ab7d780bd94e4","observation_id":"c08052f7-6116-4317-8819-24b9f2a74eac","resolution":{"observed_at":"2026-05-17T04:21:30.845965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2512.05439","last_updated":"2026-05-07T21:46:58Z","snapshot_observed_at":"2026-08-06T07:24:27.198375Z","submitted_at":"2025-12-05T05:34:06Z","title":"BEAVER: An Efficient Deterministic LLM Verifier","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T01:58:44.719715Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2512.05439"},"observation_digest":"sha256:12c44ea2151ccd4b2fce9d6b661830e91b519c24f8ddc673f74e13210f850ff9","observation_id":"0d70bf75-b13d-40ff-8e5b-1d08f844c541","resolution":{"observed_at":"2026-05-17T01:58:51.242809Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2604.02699","last_updated":"2026-04-03T03:48:27Z","snapshot_observed_at":"2026-07-06T22:52:02.162758Z","submitted_at":"2026-04-03T03:48:27Z","title":"Trivial Vocabulary Bans Improve LLM Reasoning More Than Deep Linguistic Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-13T19:56:07.869326Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2604.02699"},"observation_digest":"sha256:5fcb97e304308960a83dbd9e30cbfed622354b37382a95787c7fc59711021028","observation_id":"3661ff5a-7ed1-4426-a967-801b8c104c39","resolution":{"observed_at":"2026-05-13T19:58:12.210346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-07-13T12:48:03.396039Z","title":"Crane: Reasoning with constrained llm generation, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.03616","last_updated":"2026-04-04T07:16:28Z","snapshot_observed_at":"2026-08-06T04:43:40.860475Z","submitted_at":"2026-04-04T07:16:28Z","title":"The Format Tax","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-13T12:48:03.396039Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2604.03616"},"observation_digest":"sha256:218c15caf48f8c249a0b51cc173b9ee958d08053a7ad9b915f2f8831612ed550","observation_id":"f8245f99-4257-4b41-bd07-2c16137c551b","resolution":{"observed_at":"2026-07-13T12:48:03.396039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2604.14862","last_updated":"2026-04-28T09:45:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T10:52:50Z","title":"Schema Key Wording as an Instruction Channel in Structured Generation under Constrained Decoding","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-10T11:14:29.764233Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2604.14862"},"observation_digest":"sha256:a1b5f069aa0df05625ceb473dec83895932833ff82f7aa1875f5322cc79d3f62","observation_id":"7ae8d753-4c00-4753-84b2-a4fa5ee33b36","resolution":{"observed_at":"2026-05-10T11:15:10.120866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2605.20193","last_updated":"2026-04-04T04:50:03Z","snapshot_observed_at":"2026-08-02T04:22:19.625757Z","submitted_at":"2026-04-04T04:50:03Z","title":"Improving Quantized Model Performance in Qualitative Analysis with Multi-Pass Prompt Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T09:35:10.701255Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2605.20193"},"observation_digest":"sha256:ef31fdbe8b9501c7383f0604a6a57dda4615d1177d38e6163573556f07fb6343","observation_id":"3a732e4f-6d5e-431d-b794-842e8aee8de5","resolution":{"observed_at":"2026-05-21T09:39:57.644035Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","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":"2606.04535","last_updated":"2026-06-03T07:18:23Z","snapshot_observed_at":"2026-07-06T23:44:37.797802Z","submitted_at":"2026-06-03T07:18:23Z","title":"Dynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T06:20:27.041099Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2606.04535"},"observation_digest":"sha256:bb2bcd640a2977fb8aa9290edbee57f1579063dca15407aca6e30dc3fe20e9a6","observation_id":"c016a1ac-9300-4b2a-bbac-bc295e8e0268","resolution":{"observed_at":"2026-07-02T08:06:48.386777Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09061","snapshot_observed_at":"2026-08-02T07:07:39.743637Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22683","last_updated":"2026-07-13T05:02:43Z","snapshot_observed_at":"2026-08-07T06:32:39.192476Z","submitted_at":"2026-07-13T05:02:43Z","title":"Imprompt: A Language Framework for Prompt Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.743637Z"},"links":{"cited_paper":"/paper/2502.09061","citing_paper":"/paper/2607.22683"},"observation_digest":"sha256:1e88a624a94b09780c931cb1d4141f39a5e7b2ccd537a7d5ba08258d1c5a10f2","observation_id":"efeeedae-51cc-48ed-aa8d-a7c2b2171668","resolution":{"observed_at":"2026-08-02T07:07:39.743637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.09061/citation-record","integrity":"/paper/2502.09061/integrity","json":"/paper/2502.09061/citation-record.json","paper":"/paper/2502.09061"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.323985Z","title":"Strobl, L., Merrill, W., Weiss, G., Chiang, D., and Angluin, D","venue":null,"work_id":"7acaaf26-fd75-4c80-88b4-d478146fa527","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.003587Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:543a1ddf9f6872ced710b36cb44d4c67a42c06667b09c07be937730e90aee61f","observation_id":"436a21c0-af9e-46c9-b097-5418237a3cf7","resolution":{"observed_at":"2026-08-07T22:51:13.328950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01007","last_updated":"2025-03-04T00:36:44Z","snapshot_observed_at":"2026-08-09T13:13:40.077979Z","submitted_at":"2024-12-01T23:54:12Z","title":"CoRNStack: High-Quality Contrastive Data for Better Code Retrieval and Reranking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01007","snapshot_observed_at":"2026-08-07T22:51:13.008690Z","title":"Suresh, T., Reddy, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.008690Z"},"links":{"cited_paper":"/paper/2412.01007","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:d6fbec5aa1c0cd09a9cbf674f6528fd5790de26a5e29f7030da336d0f7e29372","observation_id":"58c93124-c2d4-4177-bda5-3bcaa428773b","resolution":{"observed_at":"2026-08-07T22:51:13.008690Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.308571Z","title":null,"venue":null,"work_id":"99f42de3-12e9-4780-b0cc-4da1775d2a88","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.020292Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:da954bb591ab136517ced115d0c50b1a7da1f87775bddfeccc4012c57563b10f","observation_id":"f9dd6e89-6c6b-45f8-bb81-75be91464569","resolution":{"observed_at":"2026-08-07T22:51:13.313414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.292349Z","title":null,"venue":null,"work_id":"5618f894-32ef-43c4-9b51-5e40ca5f554e","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.025607Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:16e4ef750eca03f2dc5173adf66faa1c0d8141608eddb8cb7716153d79169fb3","observation_id":"12698051-c922-4034-a410-53024518d5f2","resolution":{"observed_at":"2026-08-07T22:51:13.298104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.274223Z","title":null,"venue":null,"work_id":"ba78de81-455f-4bfb-acac-cb47dec39895","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.031040Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:8a4ab784abe130959e0c46891df299973d081ffa5eb181de4a9f93056f6e6352","observation_id":"dde69332-575c-4421-a09f-91857dc08260","resolution":{"observed_at":"2026-08-07T22:51:13.279721Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.258319Z","title":null,"venue":null,"work_id":"20278f7b-a82b-480d-9c68-a94889b75ef1","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.035972Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:babfc067069d112e0bd3834de7d0cb11393f388cfb9bde30519d5df8a0bd2c95","observation_id":"cfe2136f-56f0-4808-8e99-a7b5fa42bcea","resolution":{"observed_at":"2026-08-07T22:51:13.263422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.242282Z","title":null,"venue":null,"work_id":"f8fd4171-cc11-4e53-9b95-29bac0052d48","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.041236Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:c43ac98a516155ad9a46810b331ee50e58f520ced78a773997cfd54949a31c01","observation_id":"455de394-6f8d-416c-b5bd-78edd482b4e8","resolution":{"observed_at":"2026-08-07T22:51:13.247027Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.226885Z","title":null,"venue":null,"work_id":"993aea9c-2840-4dc9-aecf-ddb5ceffc303","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.046288Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:fa5a9b3fcaa44b958ed7a9135d660257a8ca6a9248df2eabeffc980fd198adc8","observation_id":"3729d1d4-4b38-415e-9a94-8f84627b2bf3","resolution":{"observed_at":"2026-08-07T22:51:13.231752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07295","snapshot_observed_at":"2026-08-07T22:51:13.014159Z","title":"emnlp-industry.91/","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.014159Z"},"links":{"cited_paper":"/paper/2410.07295","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:db66336eaa1b066f479ac24eeeef42722880a8c2d9afe9db7fb0795c7235d96e","observation_id":"f39f4464-dafc-400e-8472-80ad6bf6c1a0","resolution":{"observed_at":"2026-08-07T22:51:13.014159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.211553Z","title":null,"venue":null,"work_id":"2025e81a-5ade-4a45-a588-0eb36b00d152","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.051250Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:a42d4f674b521440c2d26e74084f599513caed07c7a8f94d5db4f4934537de5a","observation_id":"a6b32990-0973-4791-babe-8bd5a8ee035b","resolution":{"observed_at":"2026-08-07T22:51:13.216326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.195053Z","title":"These are the ONLY operations in the grammar","venue":null,"work_id":"a3f4ddee-2360-48c4-86c1-4f820db7718c","year":1946},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.056887Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:6a4ce26fc8dadd43d1195c98270e2b7c1a85bbb3a6823f97feebe7cd72d992e8","observation_id":"c8b3ee1d-a930-420e-b1b6-5a568656de15","resolution":{"observed_at":"2026-08-07T22:51:13.201101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.12295","last_updated":"2023-10-19T01:54:27Z","snapshot_observed_at":"2026-08-07T13:11:49.965934Z","submitted_at":"2023-05-20T22:25:38Z","title":"Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.12295","snapshot_observed_at":"2026-08-07T22:51:12.993196Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":313,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:12.993196Z"},"links":{"cited_paper":"/paper/2305.12295","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:69707d607e8e01236f700a092a8c5bbab1d1fea9b84a3fe59be28ba460ad3b00","observation_id":"3bd2cf32-83f4-4865-bb23-7e76c137be11","resolution":{"observed_at":"2026-08-07T22:51:12.993196Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T22:51:12.981520Z","title":"ISBN 3540787992","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:12.981520Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:aca4ba8d045a4681d1885c24395bd6b4dbec1b82ffddff11589b75bf0514400b","observation_id":"1b5790da-8e40-40f5-9cf7-db154233454b","resolution":{"observed_at":"2026-08-07T22:51:12.981520Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.339467Z","title":null,"venue":null,"work_id":"9681489a-5ff1-47b7-9ce2-929ffba635f5","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:12.998802Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:9c1c279916c50cd4547f2ff4da4274d80ac65acdbcdbeed72198e344627886f2","observation_id":"22882cdb-60a6-4307-805e-e134d4dc502a","resolution":{"observed_at":"2026-08-07T22:51:13.344186Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05229","last_updated":"2025-08-27T16:24:39Z","snapshot_observed_at":"2026-07-06T19:29:09.714725Z","submitted_at":"2024-10-07T17:36:37Z","title":"GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05229","snapshot_observed_at":"2026-08-07T22:51:12.987734Z","title":"Merrill, W., Sabharwal, A., and Smith, N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:12.987734Z"},"links":{"cited_paper":"/paper/2410.05229","citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:149dcc787ae18649fee0f525df1ea10db9054ff28d99f3fc890e2731e38f4503","observation_id":"5e839002-8106-4ba9-9d39-244be7532dd7","resolution":{"observed_at":"2026-08-07T22:51:12.987734Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.176592Z","title":"<\" \"<\" space? expr space?","venue":null,"work_id":"91411c8e-90be-49c9-bb39-10a077af8dc5","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":3600,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:13.062709Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:666a0dabc303800d67527f5f551f20f945e9a5368644b1c8aef28305f879f819","observation_id":"5b3b0418-45a9-4784-ab8f-423fa95f56e4","resolution":{"observed_at":"2026-08-07T22:51:13.183042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:51:13.354877Z","title":"De Moura, L","venue":null,"work_id":"a1543aa6-31d6-45d7-b59b-286061b5f1d3","year":null},"citing_paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation","version":4},"reference_index":8856,"source":"pdf_text","source_observed_at":"2026-08-07T22:51:12.975620Z"},"links":{"citing_paper":"/paper/2502.09061"},"observation_digest":"sha256:f88351b5259756e672874a1b60b90a833633534ce4ddab4404186d52e7d00186","observation_id":"0d82337f-8d54-4b9a-8f12-6752ec7c04d0","resolution":{"observed_at":"2026-08-07T22:51:13.359669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09061","last_updated":"2025-09-05T01:04:00Z","latest_version":4,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-09T13:14:16.981991Z","submitted_at":"2025-02-13T08:23:42Z","title":"CRANE: Reasoning with constrained LLM generation"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 12 inbound Pith citation observations for arXiv:2502.09061."}