{"as_of":"2026-08-08T01:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c822a48f6dfecdbcf1d2f4b69522b3a58ea2db63c7de2bf1ebc56a56e3c089f5","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:11:56.637641Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T15:39:56.699149Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-07T21:11:56.637641Z","title":"Monte carlo tree search for comprehensive exploration in llm-based automatic heuristic design,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.09544","last_updated":"2025-02-13T17:58:18Z","snapshot_observed_at":"2026-08-07T23:50:42.071725Z","submitted_at":"2025-02-13T17:58:18Z","title":"Explainable AI-assisted Optimization for Feynman Integral Reduction","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T21:11:56.637641Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2502.09544"},"observation_digest":"sha256:bd07d45eaad72d48fed19cd0475c6eb9ee261f14615304fcf99a7b367669bd75","observation_id":"1e64a29d-4968-40ba-ac57-f06e3e17d3f3","resolution":{"observed_at":"2026-08-07T21:11:56.637641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-07T14:01:14.866863Z","title":"Monte carlo tree search for compre- hensive exploration in llm-based automatic heuristic design.arXiv preprint arXiv:2501.08603, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20296","last_updated":"2025-05-26T17:59:53Z","snapshot_observed_at":"2026-08-07T20:41:25.052132Z","submitted_at":"2025-05-26T17:59:53Z","title":"Reasoning LLMs are Wandering Solution Explorers","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:14.866863Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2505.20296"},"observation_digest":"sha256:384da1716c1ac04a887dab169e1eebbba30f7784fec3f1d8c3d39ec0b39c949d","observation_id":"80104fb0-7886-4760-87d1-cd3100a41473","resolution":{"observed_at":"2026-08-07T14:01:14.866863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-07T13:20:57.564365Z","title":"Monte carlo tree search for compre- hensive exploration in llm-based automatic heuristic design","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22086","last_updated":"2025-05-31T11:52:20Z","snapshot_observed_at":"2026-08-07T13:13:05.387753Z","submitted_at":"2025-05-28T08:08:57Z","title":"iDSE: Navigating Design Space Exploration in High-Level Synthesis Using LLMs","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:57.564365Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2505.22086"},"observation_digest":"sha256:1d6f89fb8ade9db7461a938ca4aa90ad4054d9d27938d627a60e918e33a19376","observation_id":"1b0e85c0-69ea-468d-908e-0cb4c2e20320","resolution":{"observed_at":"2026-08-07T13:20:57.564365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-06T21:13:13.077881Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.00711","last_updated":"2025-07-01T12:14:22Z","snapshot_observed_at":"2026-08-07T07:21:03.621965Z","submitted_at":"2025-07-01T12:14:22Z","title":"Large Reasoning Models are not thinking straight: on the unreliability of thinking trajectories","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T21:13:13.077881Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2507.00711"},"observation_digest":"sha256:51c33aa03e4b33603c450d917a9f8d6168481d64b4d6d27d34175f7f6a24f071","observation_id":"b7acd3fa-06b0-4497-87a5-1012cee4c031","resolution":{"observed_at":"2026-08-06T21:13:13.077881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-05T23:49:05.708180Z","title":"arXiv preprint arXiv:2501.08603","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.04848","last_updated":"2025-08-06T19:51:29Z","snapshot_observed_at":"2026-08-07T23:52:59.955522Z","submitted_at":"2025-08-06T19:51:29Z","title":"Large Language Models Reasoning Abilities Under Non-Ideal Conditions After RL-Fine-Tuning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T23:49:05.708180Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2508.04848"},"observation_digest":"sha256:b5c17256d059907ec7c620fb796d446be6e7abb329de5ae0a16465615a694ffc","observation_id":"8a413b4d-c7e9-4a91-b607-8b6cf0a66171","resolution":{"observed_at":"2026-08-05T23:49:05.708180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-04T20:55:41.737491Z","title":"Monte carlo tree search for comprehensive exploration in llm-based automatic heuristic design,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08269","last_updated":"2026-07-17T08:53:46Z","snapshot_observed_at":"2026-08-07T13:22:52.525692Z","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":168,"source":"pdf_text","source_observed_at":"2026-08-04T20:55:41.737491Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2509.08269"},"observation_digest":"sha256:9a83b9593ec4abbc8f1234b30bed4b59a77c1c3a4f93da41bad9fc1b331c0c0a","observation_id":"2c351161-ec41-4b80-9e51-984e8fcd3a9f","resolution":{"observed_at":"2026-08-04T20:55:41.737491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-04T14:51:25.067330Z","title":"Monte carlo tree search for comprehensive exploration in llm-based automatic heuristic design","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23413","last_updated":"2026-05-25T17:39:39Z","snapshot_observed_at":"2026-08-06T12:55:38.720862Z","submitted_at":"2025-09-27T17:11:09Z","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-04T14:51:25.067330Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2509.23413"},"observation_digest":"sha256:a61813fc3269d5e869a5e0a2c6a6f7566e98e7e005d8755de27e9924f8de90dc","observation_id":"b4163532-2beb-449d-b178-a9e22f01a983","resolution":{"observed_at":"2026-08-04T14:51:25.067330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","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":92,"source":"pdf_text","source_observed_at":"2026-05-18T03:28:59.276079Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2510.27176"},"observation_digest":"sha256:0d03f8e5fcc02540a832422208abe1a9a974fdc8494a625f7ee8f7f2e30dda41","observation_id":"4da70347-7c3c-401e-90df-bdafb3bd90a1","resolution":{"observed_at":"2026-05-18T03:30:51.073727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-14T22:25:04.080629Z","title":"Monte carlo tree search for comprehensive exploration in llm-based automatic heuristic design.arXiv preprint arXiv:2501.08603, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.12252","last_updated":"2026-06-18T07:56:55Z","snapshot_observed_at":"2026-07-14T22:25:02.474086Z","submitted_at":"2026-03-12T17:58:48Z","title":"EndoCoT: Scaling Endogenous Chain-of-Thought Reasoning in Diffusion Models","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T22:25:04.080629Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2603.12252"},"observation_digest":"sha256:d6665b0ba106bba3d3c9a32a0621d8e7fc6a8582554c634f46281956572c92be","observation_id":"1d3bdde0-9044-4a6a-9ca8-db616a8d2005","resolution":{"observed_at":"2026-07-14T22:25:04.080629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2605.03339","last_updated":"2026-05-05T04:00:29Z","snapshot_observed_at":"2026-07-06T23:16:15.509235Z","submitted_at":"2026-05-05T04:00:29Z","title":"Automated Large-scale CVRP Solver Design via LLM-assisted Flexible MCTS","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-07T16:47:38.834354Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2605.03339"},"observation_digest":"sha256:f182dc1f68cf6e0c36331f03b5bc04e56a6a4ead5840e52ae9727bf8ac7dfc12","observation_id":"fd255605-c42c-48ac-ba52-9ebd6fe2f64e","resolution":{"observed_at":"2026-05-11T23:31:16.913378Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2605.07214","last_updated":"2026-05-08T04:02:28Z","snapshot_observed_at":"2026-08-02T12:32:35.324467Z","submitted_at":"2026-05-08T04:02:28Z","title":"HMACE: Heterogeneous Multi-Agent Collaborative Evolution for Combinatorial Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-11T01:49:50.520222Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2605.07214"},"observation_digest":"sha256:dd348fbe44b067de7101d3885b64b62bf5b69be3a3e7b09405487735aaa6bfd5","observation_id":"3e51fbba-5732-4e83-93a7-976d252b689f","resolution":{"observed_at":"2026-05-11T01:50:51.173520Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2605.08756","last_updated":"2026-05-09T07:36:45Z","snapshot_observed_at":"2026-07-06T23:20:57.084438Z","submitted_at":"2026-05-09T07:36:45Z","title":"AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Design","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-12T01:14:39.643357Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2605.08756"},"observation_digest":"sha256:e4e67d623f6f6747877a1c4c17b10f5b7e5eb0bd19bbfb610f5714870f37090d","observation_id":"86393c54-efea-4f18-99da-ba663aee869f","resolution":{"observed_at":"2026-05-12T08:21:23.878537Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2605.10598","last_updated":"2026-05-11T14:01:52Z","snapshot_observed_at":"2026-08-02T11:54:02.966349Z","submitted_at":"2026-05-11T14:01:52Z","title":"Budget-Efficient Automatic Algorithm Design via Code Graph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:09.715264Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2605.10598"},"observation_digest":"sha256:add077bcd1fd320ab48acb6516812227dcd45982c8563dde3c3122f10a5bc408","observation_id":"e5c83030-2258-4cf2-a859-0338341121c2","resolution":{"observed_at":"2026-05-12T07:06:25.538263Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2605.18692","last_updated":"2026-05-27T03:54:52Z","snapshot_observed_at":"2026-08-02T15:33:16.125919Z","submitted_at":"2026-05-18T17:28:25Z","title":"Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-20T10:07:01.820644Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2605.18692"},"observation_digest":"sha256:b44cf6ce5157e7eb9a3eb97af15023b013d4357269f73f92c7a06822861e4255","observation_id":"ebc68764-d25a-448d-a787-fb9118e2dd19","resolution":{"observed_at":"2026-05-20T10:08:12.198414Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2606.14202","last_updated":"2026-06-28T07:03:26Z","snapshot_observed_at":"2026-08-03T16:06:18.183844Z","submitted_at":"2026-06-12T07:36:38Z","title":"MeEvo: Metacognitive Evolution Combined with Natural Evolution for Automatic Heuristic Design","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T05:01:48.486590Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2606.14202"},"observation_digest":"sha256:a4c956de7fb55c90a7f0284940a5cd11f0a96534d3168db9ac22af77a620f7e8","observation_id":"340380be-5a4a-4fc7-abb5-bf9b11651db1","resolution":{"observed_at":"2026-07-03T16:48:40.036323Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2606.14202","last_updated":"2026-06-28T07:03:26Z","snapshot_observed_at":"2026-08-03T16:06:18.183844Z","submitted_at":"2026-06-12T07:36:38Z","title":"MeEvo: Metacognitive Evolution Combined with Natural Evolution for Automatic Heuristic Design","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T10:53:36.354925Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2606.14202"},"observation_digest":"sha256:e1720ac4c143e93fd7f39e36c916b24d32118f8cc2f2efd24cff220621a159ff","observation_id":"e7a37659-ba47-4e4b-bc80-d45f53848525","resolution":{"observed_at":"2026-06-30T10:54:36.232402Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2606.20625","last_updated":"2026-05-26T15:48:09Z","snapshot_observed_at":"2026-07-06T23:55:43.830896Z","submitted_at":"2026-05-26T15:48:09Z","title":"AlphaMemo: Structured Search-Process Memory for Self-Evolving Alpha Mining Agents","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-29T16:55:21.649886Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2606.20625"},"observation_digest":"sha256:443a4297c90c3b07040dcbc01710b6a12d2b2f4c2d1f0fe9b651c755594441d2","observation_id":"5be6e065-cf57-4456-b3f5-e2f959003285","resolution":{"observed_at":"2026-06-29T17:03:41.276369Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2606.26399","last_updated":"2026-06-24T21:34:08Z","snapshot_observed_at":"2026-07-07T00:00:46.505337Z","submitted_at":"2026-06-24T21:34:08Z","title":"Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T01:31:06.792515Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2606.26399"},"observation_digest":"sha256:885673315d67300a87ef76c69bf39602ba6495c80bb46c7fa5b0a3f1db44c96a","observation_id":"4223abb3-2cc0-453a-b0a0-2bb1ff176a90","resolution":{"observed_at":"2026-07-04T15:39:56.700650Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":"2501.08603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-04T15:39:56.699149Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":"78652e90-3830-4bf8-81c6-c1b72f412579","year":2025},"citing_paper":{"arxiv_id":"2606.26728","last_updated":"2026-06-25T08:11:48Z","snapshot_observed_at":"2026-08-07T21:53:05.161777Z","submitted_at":"2026-06-25T08:11:48Z","title":"Scientific discovery as meta-optimization: a combinatorial optimization case study","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T05:12:43.536126Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2606.26728"},"observation_digest":"sha256:d40da5c507d405372355842091293bb6e1319424a82d380ae3b76863d22e9a6e","observation_id":"95a9f516-daed-4077-b58a-8d60d0886afc","resolution":{"observed_at":"2026-07-04T13:29:51.427787Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-07-30T16:16:27.229217Z","title":"arXiv preprint arXiv:2501.08603 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23676","last_updated":"2026-07-26T14:22:15Z","snapshot_observed_at":"2026-08-06T15:45:01.094949Z","submitted_at":"2026-07-26T14:22:15Z","title":"SpecAHD: Localize to Specialize for Automated Heuristic Design in Large-Scale Routing Problems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-30T16:16:27.229217Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2607.23676"},"observation_digest":"sha256:cbc9f2c5b25dbb5657d0bbdb339c2832473bc969b87ffbf70a903fe7820737f4","observation_id":"9127291e-c07c-4b1c-acb8-08e5b4e6c851","resolution":{"observed_at":"2026-07-30T16:16:27.229217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08603","snapshot_observed_at":"2026-08-05T15:18:34.146948Z","title":"Please design an evo- lutionary algorithm scheme for solving the network dismantling problem","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.03653","last_updated":"2026-08-04T13:34:52Z","snapshot_observed_at":"2026-08-07T23:12:15.300676Z","submitted_at":"2026-08-04T13:34:52Z","title":"AutoSND: From Execution Evidence to Structural Policies for Automated Network Dismantling Heuristic Discovery","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T15:18:34.146948Z"},"links":{"cited_paper":"/paper/2501.08603","citing_paper":"/paper/2608.03653"},"observation_digest":"sha256:a3dfdef593983b24414d9978d6dc8928fa60cdc07d440d62bdde5cf246993844","observation_id":"a5eed7be-28b6-4a8a-b0d0-0c0186c48709","resolution":{"observed_at":"2026-08-05T15:18:34.146948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.08603/citation-record","integrity":"/paper/2501.08603/integrity","json":"/paper/2501.08603/citation-record.json","paper":"/paper/2501.08603"},"outbound":[],"paper":{"arxiv_id":"2501.08603","last_updated":"2025-01-31T05:28:15Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T06:00:50Z","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2501.08603."}