{"as_of":"2026-08-10T22:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29a938a3db6096f948467b9376347e379bb8e96900788b03165ef02a2695affe","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:18:53.999284Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:33:02.885010Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-05T10:33:02.885010Z","title":"arXiv preprint arXiv:2507.22876","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.04007","last_updated":"2025-09-04T08:38:42Z","snapshot_observed_at":"2026-08-10T00:22:18.999777Z","submitted_at":"2025-09-04T08:38:42Z","title":"AutoPBO: LLM-powered Optimization for Local Search PBO Solvers","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T10:33:02.885010Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2509.04007"},"observation_digest":"sha256:56d2b7a81b44d8c15099d778a5e8f0ba77391893a5a6fe5e2effc788cf937172","observation_id":"6bda0d4a-f7fe-41ae-9d04-483dad803ad7","resolution":{"observed_at":"2026-08-05T10:33:02.885010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-04T22:22:13.491459Z","title":"arXiv preprint arXiv:2507.22876 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07367","last_updated":"2025-09-09T03:28:06Z","snapshot_observed_at":"2026-08-08T12:12:24.053049Z","submitted_at":"2025-09-09T03:28:06Z","title":"Autonomous Code Evolution Meets NP-Completeness","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T22:22:13.491459Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2509.07367"},"observation_digest":"sha256:41f9ee46a0cce864bb218500d7ef8092d63dac44535522409b0753679108e8d2","observation_id":"82e8132f-451a-48f9-924b-ff658e0f3c12","resolution":{"observed_at":"2026-08-04T22:22:13.491459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":"2507.22876","doi":"10.48550/arxiv.2507.22876","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.2507.22876 , url =","venue":"arXiv (Cornell University)","work_id":"d9fcb9f2-50d9-41f8-8aad-250e469a7b82","year":2025},"citing_paper":{"arxiv_id":"2510.27176","last_updated":"2026-04-03T01:49:52Z","snapshot_observed_at":"2026-07-06T22:34:33.419178Z","submitted_at":"2025-10-31T04:58:00Z","title":"Glia: A Human-Inspired AI for Automated Systems Design and Optimization","version":5},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-18T03:28:59.276079Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2510.27176"},"observation_digest":"sha256:5e28d59bdb5653087d63bd353b89e7c9cb2fc68cfa96882e0d7023b7a1f9aa82","observation_id":"e795cf73-6198-4afa-8d1a-e2567a57eb38","resolution":{"observed_at":"2026-06-09T02:05:20.310261Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-02T19:18:46.786771Z","title":"Automatically discovering heuristics in a complex sat solver with large language models,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.02792","last_updated":"2026-07-19T10:36:17Z","snapshot_observed_at":"2026-08-07T11:23:35.985164Z","submitted_at":"2026-03-03T09:27:52Z","title":"From Heuristic Selection to Automated Algorithm Design: LLMs Benefit from Strong Priors","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:46.786771Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:2b06e0f5e8a8dc603bfb7a42c0ef1e5277c45383e469935fded227d72071b21a","observation_id":"4f819069-c449-4fa5-b4df-9bfde7732097","resolution":{"observed_at":"2026-08-02T19:18:46.786771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":"2507.22876","doi":"10.48550/arxiv.2507.22876","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.2507.22876 , url =","venue":"arXiv (Cornell University)","work_id":"d9fcb9f2-50d9-41f8-8aad-250e469a7b82","year":2025},"citing_paper":{"arxiv_id":"2605.09186","last_updated":"2026-05-09T21:53:28Z","snapshot_observed_at":"2026-08-06T11:07:39.943626Z","submitted_at":"2026-05-09T21:53:28Z","title":"Agentic MIP Research: Accelerated Constraint Handler Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T02:12:27.170669Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2605.09186"},"observation_digest":"sha256:01879fdf65049ac96912c2ddbc9fb15c57894b56944f3fac6cf187bb0b4ae80b","observation_id":"e0a3c3a0-9f7b-4972-921c-5a3d716ea4a0","resolution":{"observed_at":"2026-06-09T02:05:20.310261Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":"2507.22876","doi":"10.48550/arxiv.2507.22876","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.48550/arXiv.2507.22876 , url =","venue":"arXiv (Cornell University)","work_id":"d9fcb9f2-50d9-41f8-8aad-250e469a7b82","year":2025},"citing_paper":{"arxiv_id":"2605.16379","last_updated":"2026-05-11T01:27:59Z","snapshot_observed_at":"2026-08-02T15:49:28.691819Z","submitted_at":"2026-05-11T01:27:59Z","title":"An Information-Theoretic Criterion for Efficient Data Synthesis","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-20T22:16:57.983741Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2605.16379"},"observation_digest":"sha256:1bd5c1e8187b9e1553448d56275b50c7f793809f6663d86a117e5a8e3b4c81d7","observation_id":"833c77da-0a8e-4192-8b05-b18657ff116c","resolution":{"observed_at":"2026-06-09T02:05:20.310261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22876","snapshot_observed_at":"2026-08-02T01:00:22.977292Z","title":"17 Yiwen Sun, Furong Ye, Xianyin Zhang, Shiyu Huang, Bingzhen Zhang, Ke Wei, and Shaowei Cai","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14818","last_updated":"2026-07-16T10:37:02Z","snapshot_observed_at":"2026-08-08T14:10:54.117891Z","submitted_at":"2026-07-16T10:37:02Z","title":"Can LLMs Build a MaxSAT Solver from Papers? The CoreForge Experience","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T01:00:22.977292Z"},"links":{"cited_paper":"/paper/2507.22876","citing_paper":"/paper/2607.14818"},"observation_digest":"sha256:a5af99a85531c98bf008b315e7bc87da1cfdfbad8b3405c7328793d9a3753f39","observation_id":"791b3f6a-6736-4a12-ae5e-3d1283cb9dbb","resolution":{"observed_at":"2026-08-02T01:00:22.977292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.22876/citation-record","integrity":"/paper/2507.22876/integrity","json":"/paper/2507.22876/citation-record.json","paper":"/paper/2507.22876"},"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-06T11:19:04.041622Z","title":null,"venue":null,"work_id":"02f6b228-9edf-4ee5-ac85-e1517aa8a20a","year":1971},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:48.462724Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:1ace5838e0f79b7fa3eb8556345c85b7143140cc461f51a8d25818b754aacf42","observation_id":"f5c61a88-1f84-4a2e-838d-d00813a4340d","resolution":{"observed_at":"2026-08-06T11:19:04.123320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:03.818571Z","title":"& Zhou, X","venue":null,"work_id":"1c63748d-5690-4041-9d17-f94a0d79d841","year":2017},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:48.582007Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:5aec435de839a03c9edc8fa856b28657093cda9f49c192e0e4636144374ad426","observation_id":"debb00d9-fbbb-4b11-9dca-8edaac2f04b5","resolution":{"observed_at":"2026-08-06T11:19:03.919192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:03.695825Z","title":null,"venue":null,"work_id":"4abaede9-3842-482f-9da6-e76c72ead985","year":2019},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:48.652422Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:7291ea6edb1b11cd6eac619d65e724293246bcbe8cf3bb1cc521de5cc7433d65","observation_id":"9de5beb6-33c1-433f-a5d0-31fcb5b518f4","resolution":{"observed_at":"2026-08-06T11:19:03.755926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03711","last_updated":"2026-08-03T08:17:46Z","snapshot_observed_at":"2026-08-07T16:30:55.310876Z","submitted_at":"2025-03-28T07:27:27Z","title":"A Survey of Circuit Foundation Model: Foundation AI Models for VLSI Circuit Design and EDA","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03711","snapshot_observed_at":"2026-08-06T11:18:48.720836Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:48.720836Z"},"links":{"cited_paper":"/paper/2504.03711","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:d75fa11840799bb2c591c529d29f91c21476a36844320812d871bf7f65ed6bc0","observation_id":"f9fb87bf-ac4b-4600-9a36-daa0e4a5c954","resolution":{"observed_at":"2026-08-06T11:18:48.720836Z","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-06T11:19:03.582432Z","title":"H., Hutter, F","venue":null,"work_id":"578ec75d-20df-4441-9cae-312836065b11","year":2021},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:48.854845Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:903e89d004b827471c1279974c1c2f03c717efc2b69e2949259c5ee437a30116","observation_id":"32fba24c-9a7d-4e9f-8bb3-a86a4c9d2aa2","resolution":{"observed_at":"2026-08-06T11:19:03.633207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:03.418052Z","title":"& V an Den Herik, H","venue":null,"work_id":"39d29a5e-a325-42d3-8339-5110f9c620d8","year":2022},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.054354Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:15dc0f489b2eb6ca116017aa2e7346b5293e538e37c3e589201d06267162b85c","observation_id":"785e6ab0-9bcf-4901-ae22-54ac92dfcc01","resolution":{"observed_at":"2026-08-06T11:19:03.501370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:03.258367Z","title":"& Dutheillet, C","venue":null,"work_id":"3dcfc6ba-69bf-43c9-a2dd-5fbae55445e4","year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.202915Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:01456cd4b21ac6c70b6973d5fd3b56e3baf05beb9728f6f513e6b31a1eb0c904","observation_id":"163f720e-f069-4131-9487-491e500ca4ff","resolution":{"observed_at":"2026-08-06T11:19:03.322275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-06T11:18:49.356977Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.356977Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:c0e208479757afd06376d95f02ee796befb8a11e4ff92d68ae1d64da197144b8","observation_id":"0ddb207b-0c88-4b34-96ef-d1bb0155e82d","resolution":{"observed_at":"2026-08-06T11:18:49.356977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-10T17:02:50.054809Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-06T11:18:49.412140Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.412140Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:928ff4adf1c5bb048ac90b28dc07168b26458d01728740729e15b40ce22c2614","observation_id":"1fdbc5b5-09d2-464a-9975-de981181825b","resolution":{"observed_at":"2026-08-06T11:18:49.412140Z","resolver_source":null,"status":"unresolved"},"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-06T11:18:49.469342Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.469342Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:3ad96ef7acada109cd8cd2f35c52e812bda121d306ac150282c67b3ff3dd4e99","observation_id":"1f9c4f82-b191-47f5-995e-2559d1528bad","resolution":{"observed_at":"2026-08-06T11:18:49.469342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-06T11:18:49.520048Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.520048Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:7acde3256958167b1fd8b76a867cc972ef596f21eae0627a7aab09c6119ed382","observation_id":"ea144efe-8915-45f9-ae14-b081055e49de","resolution":{"observed_at":"2026-08-06T11:18:49.520048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-06T11:18:49.576873Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.576873Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:2f160f43f9d614770fe5132d8657850bef497b33a31516e95444a95b6c862b55","observation_id":"8139666c-9090-482c-b1db-f5ae4e12f16f","resolution":{"observed_at":"2026-08-06T11:18:49.576873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-06T11:18:49.637023Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.637023Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:d517067a51eb215fbd33b6f7f2f19c0a80bfe2beac3af58d18b428d92301f967","observation_id":"6d04f3b3-9534-4c87-b0d3-6f00bef69d34","resolution":{"observed_at":"2026-08-06T11:18:49.637023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-06T11:18:49.670140Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.670140Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:afd3a0b2dd0826ef8bb55d2dafcd0be86edb3cf2302f7239c69c0805fb232b7c","observation_id":"caedcb12-80a0-4495-9db6-9888080aeab2","resolution":{"observed_at":"2026-08-06T11:18:49.670140Z","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-06T11:18:49.737187Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.737187Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:0a832feb35392c97009ec6f6a1c0b93c90a9218c01a89b62414c11a9e487b0b9","observation_id":"d892dfcf-07a0-4161-868d-807f567a51a8","resolution":{"observed_at":"2026-08-06T11:18:49.737187Z","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-06T11:19:03.090913Z","title":null,"venue":null,"work_id":"6d899df4-9edd-4a84-8014-2365e180ec7a","year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.806067Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:9161019a91d77191c36533420f2cba37eb190dcd7684e7a6530363ad215fb684","observation_id":"7c54b45f-1969-4c12-bad2-c4cabdb3e388","resolution":{"observed_at":"2026-08-06T11:19:03.144316Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:02.923081Z","title":null,"venue":null,"work_id":"202177ae-6244-4849-9f7c-be48920da3cb","year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.843548Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:1ad3799f4b2b37facdbb49b6eca7eb0372d0bc434dbbfa21269260fd281e111b","observation_id":"66f77771-6344-47ef-909c-4ef441a68028","resolution":{"observed_at":"2026-08-06T11:19:03.031311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:02.702385Z","title":null,"venue":null,"work_id":"98f59c5e-7091-4047-9161-72086f26831a","year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.912303Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:e6abcf3c7843861fed3f5f3ae0f06ad7e4e6939812d530728cc5f7e60dfc39ec","observation_id":"75b24ce8-3f64-4e1a-b299-bee11750aa8f","resolution":{"observed_at":"2026-08-06T11:19:02.820361Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10705","last_updated":"2024-11-13T15:46:08Z","snapshot_observed_at":"2026-08-07T14:55:26.591545Z","submitted_at":"2024-02-16T14:04:56Z","title":"AutoSAT: Automatically Optimize SAT Solvers via Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-06T11:18:49.995315Z","title":"AutoSA T: Automatically optimize SA T solvers via large language models.arXiv preprint arXiv:2402.10705 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:49.995315Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:5e019b3bf050a1d239949ce11914a864ea0d172f4d83369adb1ac20216ca8887","observation_id":"673a386c-bd32-4c0a-b0d7-6f0c0dd05ff3","resolution":{"observed_at":"2026-08-06T11:18:49.995315Z","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-06T11:19:02.556478Z","title":"& Zhang, Y","venue":null,"work_id":"7d7070ee-d053-4195-928e-e2312c98ee67","year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.065690Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:3196c87a728f52daaaa351b04ff75c9202760152adc8c7385172f131ddbd1875","observation_id":"2db05d74-8aef-4c4f-a254-d0f4b6eb10f6","resolution":{"observed_at":"2026-08-06T11:19:02.620056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:02.379203Z","title":null,"venue":null,"work_id":"93689f54-9f29-4dd3-a958-f823ce02c19d","year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.169731Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:ef5cee701bb6503f00cb2448c5a3186c707dc464600b82d8db2825a2362f43b3","observation_id":"7ca6f265-3eaf-4739-8c3c-25bfa83b97f9","resolution":{"observed_at":"2026-08-06T11:19:02.463125Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:02.189824Z","title":"& Szeider, S","venue":null,"work_id":"2ae5b4fa-26c1-4aec-940b-43e8f719a3c2","year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.241819Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:e2f6414b2bfd30f3f275d0339090ce60f0f26b3bda24f54461e493ba208341b7","observation_id":"4d562cd6-b162-4b4d-a489-90549f894e06","resolution":{"observed_at":"2026-08-06T11:19:02.292333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-08-07T04:21:43.190472Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-06T11:18:50.316346Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.316346Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:8134308ba32e3fe84b3ebe8baf5d00666741074c1623cabdd618a1283e1c7270","observation_id":"e634211d-7110-4f6b-97e8-daad9edb6f96","resolution":{"observed_at":"2026-08-06T11:18:50.316346Z","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-06T11:19:02.067045Z","title":"& Heisinger, M","venue":null,"work_id":"5e1e2e2c-fb26-44fd-a37f-c935a27e016a","year":2020},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.442755Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:0bfce6fdf310b2f4df44233ac1ceb12ccb261d79526451f47f4dd38d3c6d0e48","observation_id":"b84bc143-84ee-4433-96e1-23763303f139","resolution":{"observed_at":"2026-08-06T11:19:02.125321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.898418Z","title":"Cadical at the sat race 2019","venue":null,"work_id":"f9ffcaea-1412-465f-9ffc-802d16f6a605","year":2019},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.587655Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:110b0a3200536519c8e54f840df6a417e50d138bbdf71a0e8408e66461129f9e","observation_id":"a42ba699-85cb-4d7d-8d14-45968c167bf8","resolution":{"observed_at":"2026-08-06T11:19:01.973869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.763313Z","title":"& Neumann, F","venue":null,"work_id":"5cf02861-a877-4cb8-b238-8ea9c53f79e5","year":2019},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.681145Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:10698de0e9b57ec06f1ed6346085d363de2468ecfd3585666bac2cd38c48b453","observation_id":"74fa189b-30d7-4866-8fe3-963f5adbc8de","resolution":{"observed_at":"2026-08-06T11:19:01.834195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.596573Z","title":"& Suda, M","venue":null,"work_id":"5e7fc288-b191-447f-9e0d-d450c2fbcd89","year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.755438Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:e4e775b79b45da497800f0da6c93532eb0483cee928c558e529a8ad0c335f934","observation_id":"23bed3d2-903b-4f7e-8edb-4fb92462d493","resolution":{"observed_at":"2026-08-06T11:19:01.671010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.422076Z","title":null,"venue":null,"work_id":"eee7159d-760f-48fd-a55b-874f59f46695","year":2024},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.813696Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:bf09e514adb6305669e6116bc40e177234f99570c7c0c8028d3b52bab77cd5e9","observation_id":"3252b37a-1cad-4d89-aea2-994715dc2b8d","resolution":{"observed_at":"2026-08-06T11:19:01.506356Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.226226Z","title":"& Fruhman, J","venue":null,"work_id":"b24fb012-7949-48ad-b60f-753053cc803b","year":2015},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.859166Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:5a0196d0b2ade764311049a3556821b9cf221cb3f9644dfec123d11ad88f3761","observation_id":"04544951-05dc-4ea1-83f0-c68a961dff19","resolution":{"observed_at":"2026-08-06T11:19:01.325245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:01.055004Z","title":"& Een, N","venue":null,"work_id":"517c7594-61d5-46a8-a061-5757c2970eae","year":2005},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:50.927923Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:1a0157b669f404c35610e718c880a62c3481de8c6518c7ce60e7e6d8535338f8","observation_id":"e68f9fea-9b85-4ff7-8691-79c481fa0227","resolution":{"observed_at":"2026-08-06T11:19:01.138806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.911460Z","title":null,"venue":null,"work_id":"db461c13-aeb6-48a6-a78c-8ab532ff7aab","year":2022},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.007264Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:89a7460a5a3f508430ff0f967f1da5bd34709325fed94d7e71164217b100b055","observation_id":"c6a15561-a744-4d99-8c75-52be0ed53964","resolution":{"observed_at":"2026-08-06T11:19:00.991357Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.706235Z","title":null,"venue":null,"work_id":"9a287a11-cd0c-4af4-98c4-4cc20db0ea35","year":1999},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.075307Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:f6462877560db6fb75b78fc67d5ac28ab3a9b319be0c2fb0ae5daec675a425c9","observation_id":"b57c7407-916f-4d25-9a61-4ee6f3c3af8d","resolution":{"observed_at":"2026-08-06T11:19:00.800306Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.535327Z","title":"& Bäck, T","venue":null,"work_id":"230c739e-d347-4440-b77a-58cd7fb121d8","year":2018},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.113278Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:f035427a3619274934bd03015cac39e1142ab3ef59efde9ee89e78be30764eb7","observation_id":"6daf5ebb-377d-4caa-b24f-35351e8e2270","resolution":{"observed_at":"2026-08-06T11:19:00.613822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.374212Z","title":"& Bäck, T","venue":null,"work_id":"22f2517c-fc01-4304-b307-25124fff19e6","year":2020},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.222772Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:1c8ba349111d7421b21c3fcc7cf3c8f7d78c15c526ea5bc404af304ec1427747","observation_id":"5fb5f5f7-4470-46ad-b5a6-7026fe0e3d69","resolution":{"observed_at":"2026-08-06T11:19:00.440128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.175403Z","title":"& Kötzing, T","venue":null,"work_id":"2a35ecf6-8ba0-40c9-afd3-bebd7ad07614","year":2018},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.331433Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:4aa8c8b53dcde8c668ba9981be69910732200fe59504ccfbeafa97aceed0dd0a","observation_id":"31cc2b79-2d43-4f1b-8371-66bc1a8efee0","resolution":{"observed_at":"2026-08-06T11:19:00.286539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:19:00.048112Z","title":"OpenAI API Documentation","venue":null,"work_id":"95fcdb23-ea36-40a0-b30a-9bfd77100cb9","year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.395660Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:9be5d362b2cbce3b043d2cbb7b7511b12106aaddcaf9476ba4fe7f793d80d002","observation_id":"30a5ea45-404c-4f41-95b2-e3e378af8677","resolution":{"observed_at":"2026-08-06T11:19:00.119265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.837146Z","title":"& Nakatumba-Nabende, J","venue":null,"work_id":"a498218d-553e-4e9e-82fb-f82084e14b0d","year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.517841Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:b75a38b97c6872797575baf95e866d624c026067d5d0623668d4967984a184c5","observation_id":"ed7bb5a2-5106-451d-9e60-25b633f1a1c4","resolution":{"observed_at":"2026-08-06T11:18:59.954012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.690409Z","title":"S., Reid, M., Matsuo, Y","venue":null,"work_id":"1c39abb3-c7b0-4b4d-a41a-22920122ece4","year":2022},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.613186Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:bcbde47f592f8895845b54d188726779f656a2a32089fda69ce883c4e29ede14","observation_id":"b52698e8-2457-41ac-bcd9-827d8228f051","resolution":{"observed_at":"2026-08-06T11:18:59.769315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.557725Z","title":"Large language models are human-level prompt engineers","venue":null,"work_id":"11ef34b0-f0ca-4767-b0ae-33d622d443a8","year":2022},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.763474Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:c9d87f775137480e86f364c03392cee208245aa31e9f10243254ce3e57b4809f","observation_id":"d0a4dd29-e159-433f-85f8-27838f39dbdd","resolution":{"observed_at":"2026-08-06T11:18:59.630051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.378647Z","title":null,"venue":null,"work_id":"e9eaabf2-5c39-4bf4-bd31-5e7dd3622fc2","year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.903577Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:cd707b1ef6a54de9e3c08bb40991cab3e41addf41cd62bcdb48101c99bc6f8f2","observation_id":"69d02d24-102e-48fb-8ffc-c1d5253351d9","resolution":{"observed_at":"2026-08-06T11:18:59.462079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.238850Z","title":"CodeT5+: Open code large language models for code understanding and generation","venue":null,"work_id":"7a937a5e-08fb-4521-baa5-e045cc9fa136","year":2023},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:51.996744Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:f3ed7087562d908aaeea15bc82744f2e9ea3f50bec051454037f98b5cb3ff6b8","observation_id":"083a1040-5dfe-463f-97ae-aeec3c67a7a3","resolution":{"observed_at":"2026-08-06T11:18:59.311680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:59.039589Z","title":"Google C++ Style Guide","venue":null,"work_id":"33bdc887-6e95-478f-b45a-d19e40b2c53c","year":2025},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.070181Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:70844bf184f3933adf052f7d2c37e9b25a2ecd301ee0feeffab15ac9a983070f","observation_id":"d1921bad-ba04-4900-9516-63b2961809c0","resolution":{"observed_at":"2026-08-06T11:18:59.163660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:58.798684Z","title":"& V assilvitskii, S","venue":null,"work_id":"22af5aba-de05-4cd1-9260-4d292ddf4173","year":2007},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.146029Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:aa378b2b494c9c1ff2c2c047e986345829361f835bed7b2471d44e7c30b07680","observation_id":"ef85d8aa-9cc1-4898-b701-86e46e98a782","resolution":{"observed_at":"2026-08-06T11:18:58.912827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:58.578096Z","title":null,"venue":null,"work_id":"612e59a3-9cb1-4ba5-a135-936f6bc365e9","year":2014},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.205647Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:3966a77a3ad13804ef6754f94d1e37e8bdd37533b858f6bcffa299a0c23c5ed5","observation_id":"43fad281-d417-4dfd-80a4-019fb102e3bf","resolution":{"observed_at":"2026-08-06T11:18:58.674635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:58.359116Z","title":"& Walsh, T","venue":null,"work_id":"6aa927ea-82e3-4c62-93d2-542000662a4e","year":2009},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.310255Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:a313fad420f690bb3de20ed58281d2e68831c041e8b233481761e30557442d27","observation_id":"ce3fc7b7-d798-44b0-9647-cdbf89488b30","resolution":{"observed_at":"2026-08-06T11:18:58.461348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:58.121149Z","title":"H., Ganesh, V ., Poupart, P","venue":null,"work_id":"0c1e0251-6558-4cc0-8437-2352ded267a7","year":2016},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.408348Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:08f4de8ada465de1af7be755d6e79f66f8e05fdf00d226022f17f96168e052e6","observation_id":"40dbfced-27fa-49fb-a3b7-048d938270d0","resolution":{"observed_at":"2026-08-06T11:18:58.231767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:57.895840Z","title":"& Heule, M","venue":null,"work_id":"88e65e9e-4afe-4c80-8156-6551a1daff77","year":2011},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.504376Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:5923a834fc572084346d0766806a084cb9652d3c162893ad1438520ed2beabc0","observation_id":"684363cb-5bcf-4a90-b589-35726bf4da48","resolution":{"observed_at":"2026-08-06T11:18:58.009994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:57.644379Z","title":"& Zuckerman, D","venue":null,"work_id":"ffb47352-2c75-427b-bdec-12b0f671fa7a","year":1993},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.648804Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:aa1cfd6765e02c890fab98aec0a62a5766578b3c69b9f217ec7071dac9d50a9a","observation_id":"4f560182-ef61-4bf6-b5f4-096507377942","resolution":{"observed_at":"2026-08-06T11:18:57.750661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:57.400804Z","title":"& Simon, L","venue":null,"work_id":"f522d222-dd4f-4128-ab0e-3e29c6358e03","year":2012},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.759223Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:2e4994c612fac22659704d8c531a23495fd572c27c31ab59fd8db875f379d45c","observation_id":"7ee5b513-29bd-460a-a442-eda7ca7f2b07","resolution":{"observed_at":"2026-08-06T11:18:57.553179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:57.136361Z","title":"& Fröhlich, A","venue":null,"work_id":"3f18239c-9a06-4c30-8ea8-4bed9cd0268a","year":2015},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.826636Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:d82efdfc4e0b1e43f61d43bd99cef0080d83c98f4aa96fde9e79adfa1d789ec1","observation_id":"7e7471f5-77d4-44e1-bed7-ca090b14bced","resolution":{"observed_at":"2026-08-06T11:18:57.242059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:56.871186Z","title":"Lingeling, plingeling, picosat and precosat at sat race 2010","venue":null,"work_id":"02a14a1b-d7f1-4bc6-9a86-2a935b3418f3","year":2010},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:52.942165Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:ee6dc8332a18407684d41f9603bbf6f7353e0d5e6f546bb2fd40ba70a293a87a","observation_id":"a00f5e27-15b0-45b7-92bc-b86abe526b0a","resolution":{"observed_at":"2026-08-06T11:18:56.994806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:56.674082Z","title":null,"venue":null,"work_id":"3ffc1fbb-b70e-4f13-8ec7-5fdfc0f5cf1a","year":1990},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.015078Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:9cacf30d1a3e82ebf29cf0ff93ffd075fb5e75ef9fcd1bbd3cfde1e00e6161f7","observation_id":"38b8c4b4-433f-4cb7-9188-f8afdf4b34c0","resolution":{"observed_at":"2026-08-06T11:18:56.759531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:56.542413Z","title":"Strangenight","venue":null,"work_id":"d15b5046-f8b9-410e-b394-07950c2f61f2","year":2013},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.086818Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:90d5082b7bbf621e3463666db43ac4ffdd173dd5c021134ec4a337b8d80452f0","observation_id":"6b42df6d-6288-4c88-b380-2a039798ab02","resolution":{"observed_at":"2026-08-06T11:18:56.591642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:56.387641Z","title":"max : Both types must be integers ( int or long int )","venue":null,"work_id":"de436d34-6ce2-473f-81aa-a73aef6ac604","year":2015},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.157321Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:00c6ae318fdd818983e23f71d87db1c6d3848431fd95c83e53dbc9fb7094fb78","observation_id":"44c67af4-b1e4-497e-9e95-f23afdaf13f8","resolution":{"observed_at":"2026-08-06T11:18:56.447438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:56.182993Z","title":null,"venue":null,"work_id":"cd9640d9-7ecb-40c5-a2b6-de4e7953c3bd","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.228649Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:5b03e70fc6f6e488294a69ecbd304c907d69fb9c2460db14516283a46e60e8eb","observation_id":"4367ea9f-5057-4e2e-babf-563b8fdc4d6d","resolution":{"observed_at":"2026-08-06T11:18:56.278685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.996253Z","title":null,"venue":null,"work_id":"ed39d055-4447-4d26-9dfa-8f9798d93779","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.297266Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:4b2429ca14d8d70d07b57cb6d9c1470629f2a66f1573e89c618ae22bfb0a75eb","observation_id":"f11f51b5-528c-4ea6-9058-3e69d7959bb7","resolution":{"observed_at":"2026-08-06T11:18:56.091430Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.783175Z","title":"Y ou are not allowed to create your own new global variables, but you can use the global variables existing in the <key code>","venue":null,"work_id":"a97f19fc-7582-4b75-a57f-303f8930e327","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.334001Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:b88f8418d1222b55c89da15fdb7c0ee418e20170e44c07d9689044d80e0f28c8","observation_id":"8cda1abd-fca0-48a3-bcb3-e382ba778e90","resolution":{"observed_at":"2026-08-06T11:18:55.893642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.581728Z","title":"<key code> of SA T solver is: {{ replace_key_code }} Updated Prompt (Role) Y ou are a SA T solver researcher trying to improve the {{ func_name }} function","venue":null,"work_id":"13dcf7e7-cff5-46c3-bae1-8a32a9fed987","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.437161Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:8bf850267014837f8bd33d88a29f62718894ca70e28ee468c5183fb81829bef3","observation_id":"e9b62826-b8bc-40c5-b977-6d8af4184b78","resolution":{"observed_at":"2026-08-06T11:18:55.686850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.384268Z","title":null,"venue":null,"work_id":"89610a55-709f-4f02-89a3-67c2b1aee884","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.577148Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:ec5675f6e0c6face4e758db331477b74eec5dd0c267259325f6893f27fd4ba4c","observation_id":"e0539b24-d394-49e5-a45d-267b765dc253","resolution":{"observed_at":"2026-08-06T11:18:55.459500Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.221066Z","title":null,"venue":null,"work_id":"78ea2a1c-1d2a-4976-b54d-d939519da4d6","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.678010Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:48f8618362def3f71d6b4632a6cb7e32c183489618550f3ac78660026d25a2fa","observation_id":"202dbffd-7cb1-4519-bb66-e6e22130dcef","resolution":{"observed_at":"2026-08-06T11:18:55.291416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:55.060212Z","title":null,"venue":null,"work_id":"12dcb057-675f-4c4c-8317-0b24545a43a3","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.736927Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:aac331453ae65822f0be71b2d50038706890b251fe0e02682287188440a95739","observation_id":"be6389ba-c2ad-4f10-be54-879b0f7f8812","resolution":{"observed_at":"2026-08-06T11:18:55.124442Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:54.914135Z","title":null,"venue":null,"work_id":"0ebe91bc-4b85-42e0-99c0-19dba4af43f5","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.818186Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:31a8510c59d16094df5ddd8a8c46f435410e87c1e995277aad92c513d4a7b4e6","observation_id":"6b41f65d-95be-4ee1-9b84-c2834efd13d1","resolution":{"observed_at":"2026-08-06T11:18:54.995553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:54.706418Z","title":null,"venue":null,"work_id":"ff9f3bc0-00b1-4ac4-b709-0c7c95d9ed03","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.900876Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:8fb05f54cee5e8f78c07832b5c927b84647d67bb6e565468d54aac376bd762ee","observation_id":"6ab327c1-a5e3-420d-9a72-962ee61ddf6e","resolution":{"observed_at":"2026-08-06T11:18:54.819484Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:54.519400Z","title":"\"\" {{ replace_key_code }}","venue":null,"work_id":"567f15ac-184e-4b80-9636-bdaf3f41794a","year":null},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.930983Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:58928fbbee16a8fc14af822fd45921a1e8f8332558310999358cbb549488f9d7","observation_id":"df2efcd4-8b7d-4d30-843a-354e17ebd26d","resolution":{"observed_at":"2026-08-06T11:18:54.617575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T11:18:54.337721Z","title":"similar ideas","venue":null,"work_id":"a580e6bd-40b2-449b-aaca-228a1be2790d","year":2000},"citing_paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:53.999284Z"},"links":{"citing_paper":"/paper/2507.22876"},"observation_digest":"sha256:dbb449ca0640bf8b066f80ac345d16cd90e149d15c241961500bc015b213b6c8","observation_id":"491ec091-d0fe-40e9-bf08-3982d840f32a","resolution":{"observed_at":"2026-08-06T11:18:54.428826Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.22876","last_updated":"2026-06-06T04:54:11Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T11:18:46.669531Z","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":65},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 7 inbound Pith citation observations for arXiv:2507.22876."}