{"as_of":"2026-08-19T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ccacc2c174673705a12657056fff7cac50e913f311b378dc69359f801b6913a","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:00:54.897618Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2501.14630/citation-record","integrity":"/paper/2501.14630/integrity","json":"/paper/2501.14630/citation-record.json","paper":"/paper/2501.14630"},"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-10T15:00:55.957153Z","title":"Efficient inference of optimal decision trees","venue":null,"work_id":"ca5e7414-142b-4e1a-b7bd-3e63981224fe","year":2020},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.626778Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:0f2d8f87ca53fe2902d5f419a75d9e1e0d8aaba07fd15ddb51ecf5cb0cf4e7a3","observation_id":"84cdb05b-524d-4bf9-b679-92c7bb9ad643","resolution":{"observed_at":"2026-08-10T15:00:55.961839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.29007/28ww","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.472715Z","title":"Boosting the performance of SLS and CDCL solvers by preprocessor tuning","venue":null,"work_id":"577a9ce4-a829-406a-a515-203495fea49a","year":2013},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.632909Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:5683cd3c39097a2aba9120d24708b9a44953b468e06cc93ae9963dd61b73557a","observation_id":"74ea0d19-c842-45e2-b53f-943cffda8979","resolution":{"observed_at":"2026-08-10T15:00:55.478753Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.941892Z","title":"Minimising decision tree size as combinatorial optimisation","venue":null,"work_id":"87673744-3709-4532-8454-ac0ff2b14091","year":2009},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.644098Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:e5d5b64faf013b1e1530563ecaa9cad96dbb53b57030886cc9e200546c4f29cf","observation_id":"fb25ce43-aee8-499a-b398-106f6749ac1b","resolution":{"observed_at":"2026-08-10T15:00:55.947132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.927097Z","title":"CaDiCaL , Kissat , Paracooba , Plingeling , and Treengeling entering the SAT competition 2020","venue":null,"work_id":"bed19d7e-f889-4c9d-a4e3-7c55426c2bc4","year":2020},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.648879Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:9ef3a67de06483812e1dfbdb03319523a2014ebda7642efe3a9277187cead1cf","observation_id":"741c9132-c3c5-4855-b21c-2acc3d68387e","resolution":{"observed_at":"2026-08-10T15:00:55.932035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.653662Z","title":"Cadical 2.0","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.653662Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:f6205adfeae84760baf94ded2928670d5cfff175ca06421a098fe083e6ba3c90","observation_id":"73e0528f-c5b2-4235-9fda-8a3cd650f830","resolution":{"observed_at":"2026-08-10T15:00:54.653662Z","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-10T15:00:55.913209Z","title":"Yet another local search solver and Lingeling and friends entering the SAT Competition 2014","venue":null,"work_id":"f4b17b1c-80d3-40b9-af65-9c1f2670738d","year":2014},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.658888Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:523ad3581108d14433975afa8f33f155fd1d6c5b1a302a8da0691d61544750d5","observation_id":"5ae711dc-34cf-47ad-ae34-0542abecb15e","resolution":{"observed_at":"2026-08-10T15:00:55.917920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.899435Z","title":"CaDiCaL at the SAT race 2019","venue":null,"work_id":"a03b0dd5-e5c1-47f9-a6e5-2bb53b32c50b","year":2019},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.664414Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:9d7a17af346cde40f505eca5dd3375e44807178f117f27b991d972bad37f13d5","observation_id":"feb2742d-18ef-437d-8ae2-3b658a04c525","resolution":{"observed_at":"2026-08-10T15:00:55.903522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.670436Z","title":"New methods to color the vertices of a graph","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.670436Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:c5c44820c4ff3d5a6fbb4fea64ab42aad108c0a39d9cb77966b92227c0733c7c","observation_id":"f1cf30a1-173c-40eb-8f21-2fd21d4e2998","resolution":{"observed_at":"2026-08-10T15:00:54.670436Z","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":"10.1007/978-3-030-80223-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"Deep cooperation of CDCL and local search for SAT","venue":"Lecture notes in computer science","work_id":"d0c89be1-7536-45a6-8b3d-e5601555a581","year":2021},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.676770Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:550bf0189d0fe81fa4eac5beb595c873a6b2f6724a6e57ae2acad6d2ca27b43e","observation_id":"52344670-8347-4901-b050-692736499b16","resolution":{"observed_at":"2026-08-10T15:00:55.440752Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.1.13666","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.416291Z","title":"Better decision heuristics in CDCL through local search and target phases","venue":null,"work_id":"95324bc5-dd73-42d7-b966-6425fa50eb57","year":2022},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.682953Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:30e77e2740f6bb0d734774af4b479f5d8003968465bbf3e12773ac19e1a585ad","observation_id":"fa415553-e974-4e21-9f79-e0e3910a5e07","resolution":{"observed_at":"2026-08-10T15:00:55.422199Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07062","last_updated":"2023-09-11T22:11:46Z","snapshot_observed_at":"2026-08-16T19:59:28.411907Z","submitted_at":"2023-09-11T22:11:46Z","title":"Large Language Models for Compiler Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07062","snapshot_observed_at":"2026-08-10T15:00:54.689679Z","title":"Hazelwood, Gabriel Synnaeve, and Hugh Leather","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.689679Z"},"links":{"cited_paper":"/paper/2309.07062","citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:fb1781c137f20998c99664cc60dfe1f33a6c61a5795f239c34640f69d3a65d8f","observation_id":"4d276cd7-9f83-4b86-b331-c0fc9db78d7e","resolution":{"observed_at":"2026-08-10T15:00:54.689679Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.696442Z","title":"SAT -based local improvement for finding tree decompositions of small width","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.696442Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:fadf604587fb43d13509f87a2446e34dee5bb2811dcd395e8300e8de0b809b3d","observation_id":"82f98701-1406-4145-a470-f0256a605e49","resolution":{"observed_at":"2026-08-10T15:00:54.696442Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.707565Z","title":"The silent (r)evolution of SAT","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.707565Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:a0cc1695bae57b5fa47ecf38ded35138741064dbf7940d2259588e9f31ec9488","observation_id":"13914a02-4889-49a6-af51-9120d58d81b5","resolution":{"observed_at":"2026-08-10T15:00:54.707565Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.713297Z","title":"Another look at graph coloring via propositional satisfiability","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.713297Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:86d67825107cd9a531cdf85ceef08346ba8bb53e33c7a397fe76416a4754c7e0","observation_id":"0a394338-a6c3-4d7e-b9d5-9f290a5c62f0","resolution":{"observed_at":"2026-08-10T15:00:54.713297Z","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":"10.4230/lipics.ipec.2022.26","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.348210Z","title":"The PACE 2022 parameterized algorithms and computational experiments challenge: Directed feedback vertex set","venue":null,"work_id":"405df47a-8adb-44b6-840d-0b8ada6b89b3","year":2022},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.718334Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:bd170858002b62f7505749ea3dc9a7ebc2c7f91d35ee7bf2fba26d3f72f61bf8","observation_id":"dc5c49fb-1f64-4c86-9b36-8ccf5b1c02d3","resolution":{"observed_at":"2026-08-10T15:00:55.354385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.884364Z","title":null,"venue":null,"work_id":"ca91053b-86d3-4bc8-9431-5ff0a539d3e6","year":2002},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.726592Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:5dd99c81d5f71d4cd819024de33000561476eef249e619310b6db81e51339d76","observation_id":"b2a91d8e-54cd-4cdd-8296-ced5be8905f8","resolution":{"observed_at":"2026-08-10T15:00:55.889051Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.731158Z","title":"PySAT: A Python toolkit for prototyping with SAT oracles","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.731158Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:dbaeac009adb5a05a86c07610f39736f27caa43ad8c96e7e468ec84e79de2b34","observation_id":"d0177a5d-2306-437e-80fd-97c9868a6b6a","resolution":{"observed_at":"2026-08-10T15:00:54.731158Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.735790Z","title":"Towards universally accessible SAT technology","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.735790Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:09d84e7d5a820f3982c608ef81dc79fa1f9813ddd62da1bf29fee2dbc7a9abee","observation_id":"c6b3c2ef-004e-4f95-83f3-542ef86ba10f","resolution":{"observed_at":"2026-08-10T15:00:54.735790Z","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-10T15:00:55.868082Z","title":"On the quest for an acyclic graph","venue":null,"work_id":"827895df-7fbf-4c63-a127-4bc0ddd0b67c","year":2017},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.740530Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:a375a0f2d30953203b33c5a809af79fecd26d25a39163699d2ec1b936503e15a","observation_id":"054f5fb3-c946-4090-a133-78c388e655cd","resolution":{"observed_at":"2026-08-10T15:00:55.873071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00515","last_updated":"2024-11-10T22:02:27Z","snapshot_observed_at":"2026-08-14T16:40:35.729198Z","submitted_at":"2024-06-01T17:48:15Z","title":"A Survey on Large Language Models for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00515","snapshot_observed_at":"2026-08-10T15:00:54.745609Z","title":"A survey on large language models for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.745609Z"},"links":{"cited_paper":"/paper/2406.00515","citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:dbee185add8f67b4d879cb70b90aa01b6f58b727505453b359229eb357a9920c","observation_id":"bfbd3c9c-6bb9-450b-9ddd-d99a374a67c7","resolution":{"observed_at":"2026-08-10T15:00:54.745609Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.751150Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.751150Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:55f6e62dcbd62030f182a79d62f7f117ea1c0252d0ebe0ada46f52dedda73169","observation_id":"f011eec6-b8ef-4279-a2db-a88222f52832","resolution":{"observed_at":"2026-08-10T15:00:54.751150Z","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":"10.4230/lipics.ipec.2022.32","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.267999Z","title":"PACE solver description: Dager - cutting out cycles with maxsat","venue":null,"work_id":"14ffc247-d8de-4fea-b099-b3f1cf808b86","year":2022},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.755369Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:8080a0a993b3598badc3b7bb90ce45a81e0e7555765634d381004107c3275b90","observation_id":"4b48afd9-e693-4257-8365-96d0bb416c60","resolution":{"observed_at":"2026-08-10T15:00:55.273674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977561.ch4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.249757Z","title":"A dynamic MaxSAT -based approach to directed feedback vertex sets","venue":null,"work_id":"c3df0220-beee-4b34-8954-29e584ee6908","year":2023},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.759701Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:19dd37947282a1e701cceadf452768aeaa272f25c1e140078c594b3617ca8f84","observation_id":"3799790c-6013-420d-8e7f-a1fab630a40d","resolution":{"observed_at":"2026-08-10T15:00:55.255093Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.764663Z","title":"Satisfying versus falsifying in local search for satisfiability - (poster presentation)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.764663Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:2187ee09094fa96800682f77094b36befb8e550c63507479817359c349d68b20","observation_id":"9f082213-d1ac-4f27-92e7-40b65f3326af","resolution":{"observed_at":"2026-08-10T15:00:54.764663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.07814","last_updated":"2022-02-08T23:16:31Z","snapshot_observed_at":"2026-08-15T05:41:03.327624Z","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.07814","snapshot_observed_at":"2026-08-10T15:00:54.769751Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.769751Z"},"links":{"cited_paper":"/paper/2203.07814","citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:931e572d35c4de9cac4e63666a6815b21545b85b4d74893a86c5d16e25298f67","observation_id":"40e04e5d-690e-46fa-9094-164b08ee19ce","resolution":{"observed_at":"2026-08-10T15:00:54.769751Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.777281Z","title":"Conflict-driven clause learning SAT solvers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.777281Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:09991d9280e78cb566e0c4fa0710c367e5ec92d0feb2820d12f8e94ca358265c","observation_id":"c773b4d7-cced-42c2-8dd7-d3f73669778c","resolution":{"observed_at":"2026-08-10T15:00:54.777281Z","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-10T15:00:55.850719Z","title":"McAllester, Bart Selman, and Henry A","venue":null,"work_id":"794ee6ee-abd2-4ac9-b89e-80ad3d1c8bad","year":1997},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.786461Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:eb2e14fd127b2ed0a9d5c7bf71b7c532810586f8dfe1cc6ab234becddbfa4242","observation_id":"e72b9e23-d7a2-4611-8dcf-e2844333a751","resolution":{"observed_at":"2026-08-10T15:00:55.857228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2018/189","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.204388Z","title":"Learning optimal decision trees with SAT","venue":null,"work_id":"695bef19-9f45-47f8-8930-29b01163d473","year":2018},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.795010Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:900fcdf78ec3b0180c9b479ceab55f488f156dab0e5a69feacbf17cc862a34ae","observation_id":"997c2e5b-1706-4348-8a31-293ccb9b95a5","resolution":{"observed_at":"2026-08-10T15:00:55.209646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.834017Z","title":"Codegen: An open large language model for code with multi-turn program synthesis","venue":null,"work_id":"63486d2c-9668-49ad-8c45-0a35003c42d1","year":2023},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.804833Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:1fb7078ea41bed488f0c6969c6756a4ba45af311a81456acb83ae919959bdd84","observation_id":"c6629eb6-c280-4806-bc40-fed504b10acf","resolution":{"observed_at":"2026-08-10T15:00:55.839586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.810580Z","title":"Olson, William La Cava, Patryk Orzechowski, Ryan J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.810580Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:c7efe8ffcd5dc028d679628f4961339782d4566f6abba49720233f41df1d0882","observation_id":"f3def39e-c4ce-41dc-b560-4bed0b38c10c","resolution":{"observed_at":"2026-08-10T15:00:54.810580Z","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":"10.1613/jair.1.15956","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.170950Z","title":"SAT -based decision tree learning for large data sets","venue":null,"work_id":"a1c44028-65c3-4c39-bb27-cb3f94fe909c","year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.816840Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:4351e5dc00efaa4ec288d635fd1a59218475df355fc63baaf915cf90bd76738b","observation_id":"16a6ee61-427a-4846-9836-20eceee10e01","resolution":{"observed_at":"2026-08-10T15:00:55.177014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14732109","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.151227Z","title":"Extracting problem structure with LLMs for optimized SAT local search, January 2025","venue":null,"work_id":"7a4ace17-b364-499e-ba81-377b73bc9062","year":2025},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.821689Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:ae3d856b67317701b85a0fe63e3e90a69fd24f86c0369485ab71e7f474548e9c","observation_id":"906ad2bc-30fa-4e7b-8d82-8176effd03dd","resolution":{"observed_at":"2026-08-10T15:00:55.157593Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.815741Z","title":"Levesque, and David G","venue":null,"work_id":"ce02ab4a-25f2-4ccf-b14f-24200e9cb81e","year":1992},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.827262Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:fae6f96484ecbe8c7083291a4bfc820fd2d0e633efed94f6470d66e179bba219","observation_id":"767804c5-9f2f-4041-a9e0-c42990fde771","resolution":{"observed_at":"2026-08-10T15:00:55.821628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.799052Z","title":"Kautz, and Bram Cohen","venue":null,"work_id":"1fa7da99-6863-4472-8859-7f956244c27c","year":1994},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.832551Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:cc702ef2980920e9d66450010e17892875632a57924d4b87c5830217ab2013b4","observation_id":"3a7fa4c8-144b-48af-82bf-8315a4f888c7","resolution":{"observed_at":"2026-08-10T15:00:55.804254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-24258-9_24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":null,"venue":"Lecture notes in computer science","work_id":"aa5bbed8-2767-4e2f-907f-60f7b52e40b6","year":2019},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.838295Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:caa5c832d0a5618825f0920060ca8b2a2e6689be197250abc7f690e1aa1c82f9","observation_id":"881a462c-bd14-4bfc-aee1-8ee00b094a73","resolution":{"observed_at":"2026-08-10T15:00:55.137722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cp.2021.50","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.115109Z","title":"McIlraith","venue":null,"work_id":"cf1b14d2-e89b-4265-a067-d34c6f30169e","year":2021},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.843610Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:8b696d7ca91e0269400e1285d0fa1e77d1a8ca1446fcc3b0d3504b394528043d","observation_id":"4e95e8fb-e971-4f3e-b328-7fb71f4d901e","resolution":{"observed_at":"2026-08-10T15:00:55.120664Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.848888Z","title":"Marques Silva and Karem A","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.848888Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:e2e8aad26c3153450436d3dd9251dcce8ba49f0e4859f2a90e90959de5d3b999","observation_id":"dedcc232-717d-4e79-826a-a6fa43a9624a","resolution":{"observed_at":"2026-08-10T15:00:54.848888Z","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-10T15:00:55.777202Z","title":"Cryptominisat 5.6.8","venue":null,"work_id":"fb756a53-f6f0-4b8f-ac47-6d74c960d001","year":2020},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.853812Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:59936e57d047726cd508a58f337b439bbc6ae7a9535c508b9aac80cbedb62e13","observation_id":"5d575011-cc15-4985-98ca-80e31aef8769","resolution":{"observed_at":"2026-08-10T15:00:55.782431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.858596Z","title":"A solution-driven multilevel approach for graph coloring","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.858596Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:e5af6fb2bc6817eb9e266c731ae2303be073ad691442445fe49ba86d58a9f340","observation_id":"6bb66234-fc2d-4e57-bb0f-57b470b45597","resolution":{"observed_at":"2026-08-10T15:00:54.858596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00539","last_updated":"2025-04-06T08:39:04Z","snapshot_observed_at":"2026-08-18T08:54:51.803384Z","submitted_at":"2024-12-31T16:49:27Z","title":"MCP-Solver: Integrating Language Models with Constraint Programming Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00539","snapshot_observed_at":"2026-08-10T15:00:54.863646Z","title":"MCP -solver: Integrating language models with constraint programming systems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.863646Z"},"links":{"cited_paper":"/paper/2501.00539","citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:d750e6f57ba6e237b49acc824145bc9b14347025cdfb5e6d4c4d6bb41bab1a02","observation_id":"94c721e5-c877-4918-bf96-a1c20b1a36fa","resolution":{"observed_at":"2026-08-10T15:00:54.863646Z","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":"10.1609/aaai.v33i01.33011624","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.077574Z","title":"Learning optimal classification trees using a binary linear program formulation","venue":null,"work_id":"46cc7ce8-e9a6-40fb-ad25-37412a52360a","year":2019},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.869463Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:b47e3e29c2ac165a887670e9c3002b146f5514c09a01d5154fb96317794c7305","observation_id":"8cfd84c4-0ec0-429b-ab35-c76e929800ec","resolution":{"observed_at":"2026-08-10T15:00:55.082715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2408.10268","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:55.060996Z","title":"Generating streamlining constraints with large language models","venue":null,"work_id":"f1f5fac6-1780-4bf4-ac29-a35dccaa91a6","year":2024},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.876099Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:0f5097b0a352b6f33015b06440ff8df46be63b765e1780fa797286fa6842e689","observation_id":"d96e0730-a2d4-4aa3-9d21-ebdc2e520ab6","resolution":{"observed_at":"2026-08-10T15:00:55.066220Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.759100Z","title":"Realtime generation of streamliners with large language models","venue":null,"work_id":"3aab6fd7-a693-4aab-8fe1-cbce3efca978","year":2025},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.881710Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:09693770315e663cc2acca5005ec6c81c623b5052a64c182aad4ea01ccfddcda","observation_id":"f082920b-4d75-49aa-9682-0f7a84f8bf10","resolution":{"observed_at":"2026-08-10T15:00:55.764957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.740928Z","title":"Learning local search heuristics for boolean satisfiability","venue":null,"work_id":"d527e32c-da02-4102-8e41-931596354cb7","year":2019},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.886864Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:f887645c1050c55dbc4897a334c71a0016abaa208f34823e9b62f9e9625f821a","observation_id":"91749e61-b329-4273-96ef-a106cf1f547f","resolution":{"observed_at":"2026-08-10T15:00:55.745681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1742-5468/2016/07/073303","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:00:54.934328Z","title":"A spin glass approach to the directed feedback vertex set problem","venue":null,"work_id":"342f2284-32b2-4083-9c88-51e8328657a3","year":2016},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.892345Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:bb677709780dd6875150a881108cb0c3802fb6e5f2a5652802d744c7bf157879","observation_id":"eb054d60-2d73-4f37-a6ad-67f27ee9efbc","resolution":{"observed_at":"2026-08-10T15:00:54.942077Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T15:00:55.724924Z","title":"write newline","venue":null,"work_id":"e550df7b-24f1-4a53-8552-887d59539875","year":null},"citing_paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T15:00:54.897618Z"},"links":{"citing_paper":"/paper/2501.14630"},"observation_digest":"sha256:c3d56d75d9500445edfa2a8cd849e310a90e499cb0a6e21f851c4c81407d59fd","observation_id":"fb32665a-fb4f-49c1-bc9b-46e4e5e8afd0","resolution":{"observed_at":"2026-08-10T15:00:55.730016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.14630","last_updated":"2025-02-04T13:55:19Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T12:05:36.642283Z","submitted_at":"2025-01-24T16:49:08Z","title":"Extracting Problem Structure with LLMs for Optimized SAT Local Search"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":13,"verified_fuzzy":14},"total_outbound_references":46},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2501.14630."}