{"as_of":"2026-08-21T10:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:542d547b60e9b7da901727c52402b59752df6e7acfe1e2b6e93749c11ac10318","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:22:55.603340Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:28:48.169991Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-16T04:22:55.603340Z","title":"ArXivabs/2308.01589(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01485","last_updated":"2025-05-02T16:36:57Z","snapshot_observed_at":"2026-08-19T10:22:40.908416Z","submitted_at":"2025-05-02T16:36:57Z","title":"CHORUS: Zero-shot Hierarchical Retrieval and Orchestration for Generating Linear Programming Code","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T04:22:55.603340Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2505.01485"},"observation_digest":"sha256:38e6aba53a4cba8ad39d7971566073a167f8d22865a8c2c139f4e52e4ee61dec","observation_id":"ac312b69-5e2f-47b0-a027-037b26071538","resolution":{"observed_at":"2026-08-16T04:22:55.603340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-15T23:34:30.221747Z","title":"Holy Grail 2.0: From natural language to constraint models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04354","last_updated":"2025-05-07T12:07:49Z","snapshot_observed_at":"2026-08-20T04:50:02.587555Z","submitted_at":"2025-05-07T12:07:49Z","title":"Optimization Problem Solving Can Transition to Evolutionary Agentic Workflows","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:34:30.221747Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2505.04354"},"observation_digest":"sha256:dc463430e2cd0309e8d5376c87d1e08fb658f9bbfd9e5b671c36de06ef523c02","observation_id":"711cae60-790e-46f7-a976-1784fce08b19","resolution":{"observed_at":"2026-08-15T23:34:30.221747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-07T13:26:47.065915Z","title":"Holy grail 2.0: From natural language to constraint models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21775","last_updated":"2025-05-27T21:19:33Z","snapshot_observed_at":"2026-08-18T16:49:10.729905Z","submitted_at":"2025-05-27T21:19:33Z","title":"DualSchool: How Reliable are LLMs for Optimization Education?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:26:47.065915Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2505.21775"},"observation_digest":"sha256:54420a014c4ea0da28a806bbab4472e3d65c0892a045ac6d1cd362d0f08ba56c","observation_id":"743bf790-aac0-47d3-8fc7-09cd025068a4","resolution":{"observed_at":"2026-08-07T13:26:47.065915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-07T11:18:53.948161Z","title":"Holy grail 2.0: From natural language to constraint models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02917","last_updated":"2026-08-17T15:52:03Z","snapshot_observed_at":"2026-08-20T23:15:27.610365Z","submitted_at":"2025-06-03T14:18:37Z","title":"Language-Guided Generation for Personalized Inspection Planning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:18:53.948161Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2506.02917"},"observation_digest":"sha256:d29486b606bd73b3fc4c6f34703dd33d405862c6b0f53641f712e0e724f523a8","observation_id":"44aab211-fbf3-405a-a0b2-aa0d236541ad","resolution":{"observed_at":"2026-08-07T11:18:53.948161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":"2308.01589","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-07T04:28:48.169991Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","venue":"cs.AI","work_id":"0aec1ec9-ba3a-4461-b4f2-a85e6ff1a9b9","year":2023},"citing_paper":{"arxiv_id":"2506.10527","last_updated":"2025-06-12T09:47:02Z","snapshot_observed_at":"2026-08-17T09:34:23.528331Z","submitted_at":"2025-06-12T09:47:02Z","title":"LogiPlan: A Structured Benchmark for Logical Planning and Relational Reasoning in LLMs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:28:46.653749Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2506.10527"},"observation_digest":"sha256:e38f4985688e85f49a22d0c0ce9624c4e70822d8f99fdb5267e0b511a8c1f977","observation_id":"b8a51838-5ab7-44b6-bc01-16188e1fbe78","resolution":{"observed_at":"2026-08-07T04:28:48.259984Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01589","snapshot_observed_at":"2026-08-04T20:55:41.373260Z","title":"Holy grail 2.0: From natural language to constraint models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08269","last_updated":"2026-08-19T09:09:41Z","snapshot_observed_at":"2026-08-21T10:16:52.465395Z","submitted_at":"2025-09-10T04:05:54Z","title":"A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving","version":6},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T20:55:41.373260Z"},"links":{"cited_paper":"/paper/2308.01589","citing_paper":"/paper/2509.08269"},"observation_digest":"sha256:0199ca1feb90372b36762b794dd315c19c2c81d589927ba130593b611e4c9eb9","observation_id":"16685d87-565c-443f-bc57-0a3eac28d7ce","resolution":{"observed_at":"2026-08-04T20:55:41.373260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.01589/citation-record","integrity":"/paper/2308.01589/integrity","json":"/paper/2308.01589/citation-record.json","paper":"/paper/2308.01589"},"outbound":[],"paper":{"arxiv_id":"2308.01589","last_updated":"2023-08-03T07:48:02Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T13:28:37.280006Z","submitted_at":"2023-08-03T07:48:02Z","title":"Holy Grail 2.0: From Natural Language to Constraint Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2308.01589."}