{"as_of":"2026-08-10T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:952ffe0475c241e04e9bb4587f3c39346707f658312cc847acf6cd54204ecfd0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:26:04.471454Z","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":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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-08T14:26:04.471454Z","title":"Au- tosat: Automatically optimize sat solvers via large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06769","last_updated":"2025-03-18T11:12:46Z","snapshot_observed_at":"2026-08-09T19:40:49.682258Z","submitted_at":"2025-02-10T18:48:45Z","title":"Enhancing Trust in Language Model-Based Code Optimization through RLHF: A Research Design","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T14:26:04.471454Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2502.06769"},"observation_digest":"sha256:902b9d3d2fccbb88b2386a4d74f4118bcd997a691348f363e35597cdb9d583d7","observation_id":"c1e0671c-5a67-4511-9cb0-cfa087527d1c","resolution":{"observed_at":"2026-08-08T14:26:04.471454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T14:58:26.912495Z","title":"Autosat: Automatically optimize sat solvers via large language models.arXiv preprint arXiv:2402.10705, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11057","last_updated":"2025-05-22T15:37:42Z","snapshot_observed_at":"2026-08-08T13:31:47.967420Z","submitted_at":"2025-05-22T15:37:42Z","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:58:26.912495Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2506.11057"},"observation_digest":"sha256:f418c66f7bd643b01b262ee10a2eee7b9f6b26d1fab8885efde79d1f9cd87a3d","observation_id":"ce1d5194-f6be-40b1-bd60-47776fbb0987","resolution":{"observed_at":"2026-08-07T14:58:26.912495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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-04T20:55:41.695004Z","title":"Au- tosat: Automatically optimize sat solvers via large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08269","last_updated":"2026-07-17T08:53:46Z","snapshot_observed_at":"2026-08-08T15:31:01.848037Z","submitted_at":"2025-09-10T04:05:54Z","title":"A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving","version":6},"reference_index":156,"source":"pdf_text","source_observed_at":"2026-08-04T20:55:41.695004Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2509.08269"},"observation_digest":"sha256:bfae670993dbc5bbb19eb5a06c599de6efd79cd46541ce78097f1994bf7f39af","observation_id":"da5ff7e8-9aba-48c2-bb34-a88bfafbae74","resolution":{"observed_at":"2026-08-04T20:55:41.695004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"citing_paper":{"arxiv_id":"2604.03232","last_updated":"2026-01-18T12:37:27Z","snapshot_observed_at":"2026-07-06T22:52:25.307426Z","submitted_at":"2026-01-18T12:37:27Z","title":"IC3-Evolve: Proof-/Witness-Gated Offline LLM-Driven Heuristic Evolution for IC3 Hardware Model Checking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T13:23:20.746776Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2604.03232"},"observation_digest":"sha256:ffd04f15c0f2ff42fd38afd890cc4276d4abfaf7e8bf9aea697fce87a7e602bb","observation_id":"fd757683-e1cb-4f82-9d6d-d2657da3fdd7","resolution":{"observed_at":"2026-05-16T13:27:55.893010Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"citing_paper":{"arxiv_id":"2604.07872","last_updated":"2026-04-09T06:36:15Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T06:36:15Z","title":"PyVRP$^+$: LLM-Driven Metacognitive Heuristic Evolution for Hybrid Genetic Search in Vehicle Routing Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T18:21:52.115078Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2604.07872"},"observation_digest":"sha256:aa89cfb6deab9e3057e52cb630b2dfdd2dce35942bd66f18703ed1fdf3b08e16","observation_id":"82fa6eac-03b7-4da3-97e4-accd82e45e03","resolution":{"observed_at":"2026-05-11T00:45:49.258516Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"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":16,"source":"pdf_text","source_observed_at":"2026-05-12T02:12:27.170669Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2605.09186"},"observation_digest":"sha256:d00763da9e237a68f48e7d3d88363b537e613b2701157f61372824aa5ff5aaa0","observation_id":"efb82260-fce0-4bde-b0da-6067157dfacf","resolution":{"observed_at":"2026-05-12T02:16:16.329182Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"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":33,"source":"arxiv_source","source_observed_at":"2026-05-20T22:16:57.983741Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2605.16379"},"observation_digest":"sha256:5fad97b0ccf9df7ae7a389236b5fae8de045ba3c4e343815c1dacbcf6a4b10f1","observation_id":"543ff213-807d-42fd-afb7-d68ec3b98a3f","resolution":{"observed_at":"2026-05-20T22:19:07.349622Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"citing_paper":{"arxiv_id":"2605.20849","last_updated":"2026-05-20T07:40:05Z","snapshot_observed_at":"2026-08-05T14:32:21.145968Z","submitted_at":"2026-05-20T07:40:05Z","title":"Large Language Models for Operations Research: A Comprehensive Survey","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-05-21T03:56:29.983335Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2605.20849"},"observation_digest":"sha256:fa337138e0b66bcb64aaf223c783e78c4b08619aeec2dc0fee5bf0575ca7435c","observation_id":"53bba090-2716-451b-8426-70e2c9dff875","resolution":{"observed_at":"2026-05-21T03:59:32.547651Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"citing_paper":{"arxiv_id":"2606.25832","last_updated":"2026-06-25T05:38:04Z","snapshot_observed_at":"2026-08-09T11:58:00.809851Z","submitted_at":"2026-06-24T13:48:06Z","title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-25T20:19:30.720291Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2606.25832"},"observation_digest":"sha256:9cfbbd2dca4c452ebdad93858f83e867d538294fa76a932173b36d21b16ea961","observation_id":"7a0c654f-cd17-4f14-9bf1-3cfb14e03f55","resolution":{"observed_at":"2026-07-04T20:20:07.389894Z","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":"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":"2402.10705","doi":"10.48550/arxiv.2402.10705","metadata_source":"arxiv_reference","pith_arxiv_id":"2402.10705","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2402.10705 (2024)","venue":"arXiv (Cornell University)","work_id":"60f3ca65-c2ee-431f-abb5-c4de65a664b1","year":2024},"citing_paper":{"arxiv_id":"2606.25832","last_updated":"2026-06-25T05:38:04Z","snapshot_observed_at":"2026-08-09T11:58:00.809851Z","submitted_at":"2026-06-24T13:48:06Z","title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T05:18:55.074710Z"},"links":{"cited_paper":"/paper/2402.10705","citing_paper":"/paper/2606.25832"},"observation_digest":"sha256:2297c87790fa0e31109866b4ea22358e8d2aa337773f0b0122e0cb43f0cb5f2d","observation_id":"96964318-db12-4208-be14-3f4216845e5a","resolution":{"observed_at":"2026-07-04T13:19:50.722659Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.10705/citation-record","integrity":"/paper/2402.10705/integrity","json":"/paper/2402.10705/citation-record.json","paper":"/paper/2402.10705"},"outbound":[],"paper":{"arxiv_id":"2402.10705","last_updated":"2024-11-13T15:46:08Z","latest_version":3,"primary_category":"cs.AI","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2402.10705."}