{"as_of":"2026-08-09T15:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9de073c5c0f6889d43aae7028db8aa8f5dd615ba04fd2cf38d2d08c252f69c8","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T19:18:49.167143Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T18:58:46.374476Z","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-05-13T19:03:08.625761Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2603.02792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.02792","snapshot_observed_at":"2026-07-21T02:20:35.628763Z","title":"Huang, F","venue":null,"work_id":"ae550ca7-83d6-4bb3-b51c-6575c40b4ce2","year":2026},"citing_paper":{"arxiv_id":"2604.16420","last_updated":"2026-04-03T07:35:43Z","snapshot_observed_at":"2026-08-03T20:56:06.399724Z","submitted_at":"2026-04-03T07:35:43Z","title":"Breaking Validity-Induced Boundaries to Expand Algorithm Search Space: A Two-Stage AST-Based Operator for LLM-Driven Automated Heuristic Evolution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T18:58:46.374476Z"},"links":{"cited_paper":"/paper/2603.02792","citing_paper":"/paper/2604.16420"},"observation_digest":"sha256:25b0016af8834cbb9b85d8c2df582824f4791cd7f5ecfb543c3fc8fd44c50187","observation_id":"41289d95-6691-4004-a2f6-583854e7d5ff","resolution":{"observed_at":"2026-07-21T02:20:35.628763Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2603.02792/citation-record","integrity":"/paper/2603.02792/integrity","json":"/paper/2603.02792/citation-record.json","paper":"/paper/2603.02792"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T19:18:48.950704Z","title":"Focus only on algorithmic changes, not formatting or comments","venue":null,"work_id":null,"year":2020},"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":1,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.950704Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:f897a9192a195ad2109c0980f89ed94e09e1a1d51dc02699cbfbe274365af2a5","observation_id":"be4db682-9cd0-4754-9fc1-bae24fc92dd1","resolution":{"observed_at":"2026-08-02T19:18:48.950704Z","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-02T19:18:46.648452Z","title":"Approxi- mation algorithms for bin-packing—an updated survey,","venue":null,"work_id":null,"year":1984},"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":2,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:46.648452Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:68903fef4afd38753e7b5b1c622bcf71b816aa17f3127662a3228adfe9ba70b7","observation_id":"867e9a9e-7e73-4dfc-9b94-6efc9dd0a31a","resolution":{"observed_at":"2026-08-02T19:18:46.648452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.04007","last_updated":"2025-09-04T08:38:42Z","snapshot_observed_at":"2026-08-08T00:50:24.904448Z","submitted_at":"2025-09-04T08:38:42Z","title":"AutoPBO: LLM-powered Optimization for Local Search PBO Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.04007","snapshot_observed_at":"2026-08-02T19:18:47.014206Z","title":"Autopbo: Llm- powered optimization for local search pbo solvers,","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":5,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.014206Z"},"links":{"cited_paper":"/paper/2509.04007","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:0ae2af86dc82b1343ecc36aec4873ee3023b657565860c57176d4fd3b6a14f0b","observation_id":"77878530-7a94-4efc-ac97-549fe4213a47","resolution":{"observed_at":"2026-08-02T19:18:47.014206Z","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-02T19:18:47.135273Z","title":"Understanding the importance of evolutionary search in automated heuristic design with large language models,","venue":null,"work_id":null,"year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.135273Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:cf1b9426e8ff953b09dd76bf92a2656b064186eaf1ab74a0fb996ac7b7f3d685","observation_id":"d60d45bf-b183-4b77-ab59-7c36a9450f91","resolution":{"observed_at":"2026-08-02T19:18:47.135273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03488","last_updated":"2020-12-16T22:36:27Z","snapshot_observed_at":"2026-07-06T09:36:09.122377Z","submitted_at":"2020-07-07T14:20:26Z","title":"Benchmarking in Optimization: Best Practice and Open Issues","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03488","snapshot_observed_at":"2026-08-02T19:18:47.283722Z","title":"Benchmarking in optimization: Best practice and open issues,","venue":null,"work_id":null,"year":2007},"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":7,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.283722Z"},"links":{"cited_paper":"/paper/2007.03488","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:04e961eef64ca8667d41c53d4cc445dc3f3974f42dbbfe7d66ab4c7674dd06c1","observation_id":"4da50941-ef9c-43a8-a0b1-eed7e70ddffe","resolution":{"observed_at":"2026-08-02T19:18:47.283722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.14786","last_updated":"2021-05-28T04:17:32Z","snapshot_observed_at":"2026-08-06T03:31:56.239727Z","submitted_at":"2020-04-30T14:02:29Z","title":"Perturbed Masking: Parameter-free Probing for Analyzing and Interpreting BERT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.14786","snapshot_observed_at":"2026-08-02T19:18:47.501408Z","title":"Visualizing and understanding neural models in NLP,","venue":null,"work_id":null,"year":2016},"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":9,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.501408Z"},"links":{"cited_paper":"/paper/2004.14786","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:3a3c12f3e2e8e04a3de9fb55e76e5c56d0312a1a1388ec108091f7af3e8ad3ff","observation_id":"6bf5931e-3dc6-40e1-8c92-e5d7bc1f8c8e","resolution":{"observed_at":"2026-08-02T19:18:47.501408Z","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-02T19:18:48.074339Z","title":"Compar- ing results of 31 algorithms from the black-box optimization benchmarking bbob-2009,","venue":null,"work_id":null,"year":2009},"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":14,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.074339Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:d310f08c4b8a80a47fb346e61882e1b4e64df0ad38b5aa25acb675d703d39c31","observation_id":"6a9086d0-aa77-4b01-89a4-18966c799cc2","resolution":{"observed_at":"2026-08-02T19:18:48.074339Z","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-02T19:18:48.360844Z","title":"Bleu: a method for automatic evaluation of machine translation,","venue":null,"work_id":null,"year":2002},"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":16,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.360844Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:e190d3ffe358e2b08ed494554ce205ffc018313199ca089673f49b17a8dee912","observation_id":"a79f4274-e8ed-428d-b5cb-2603218bf760","resolution":{"observed_at":"2026-08-02T19:18:48.360844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00772","last_updated":"2023-03-10T09:45:23Z","snapshot_observed_at":"2026-07-06T04:51:38.670553Z","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00772","snapshot_observed_at":"2026-08-02T19:18:48.594822Z","title":"The cma evolution strategy: A tutorial,","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":18,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.594822Z"},"links":{"cited_paper":"/paper/1604.00772","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:f670d9de972e320a77196b6a27bd83c28f15efd1fbacd67a8769b9a6afd0e05b","observation_id":"e90b7f3e-adb9-4849-b79e-771cb31d4ff3","resolution":{"observed_at":"2026-08-02T19:18:48.594822Z","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-02T19:18:49.097165Z","title":null,"venue":null,"work_id":null,"year":2020},"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":22,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:49.097165Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:cfd89fd2802abf940aeb77e6690956a4a0f4521ce9d578d41401a656b4dadadc","observation_id":"b0c01d90-aec0-44de-a17f-3471f093dead","resolution":{"observed_at":"2026-08-02T19:18:49.097165Z","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-02T19:18:49.167143Z","title":"Thex-axis represents the cumulative number of algorithms generated by the LLM, and they-axis indicates the best-so-far AUC value","venue":null,"work_id":null,"year":1914},"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":23,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:49.167143Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:5f1ffd263686937d9b6784c837b32069e98a9043168a4832dccdf19bcb24d4f7","observation_id":"a863a777-6fdc-4609-83e5-518d45f18ae6","resolution":{"observed_at":"2026-08-02T19:18:49.167143Z","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-02T19:18:47.711321Z","title":"23 238–23","venue":null,"work_id":null,"year":2024},"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":235,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.711321Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:15fe742dc08ecbfb91596edf4dd729cd181eca1dc7df0944b47287b4cc5f036e","observation_id":"d3ea9aa8-22d4-4d50-bbf3-f44c08e01e70","resolution":{"observed_at":"2026-08-02T19:18:47.711321Z","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-02T19:18:47.849885Z","title":"JoPA: Explaining large language model’s generation via joint prompt attribution,","venue":null,"work_id":null,"year":2025},"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":255,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.849885Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:c0600e81b844be049997c488d7505422f7623d3af3cb4a12de7704a8a2b436db","observation_id":"346b3bfc-7f44-4f74-949f-18bd2744c72a","resolution":{"observed_at":"2026-08-02T19:18:47.849885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10297","last_updated":"2020-09-27T04:07:11Z","snapshot_observed_at":"2026-08-01T07:33:26.380394Z","submitted_at":"2020-09-22T03:10:49Z","title":"CodeBLEU: a Method for Automatic Evaluation of Code Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10297","snapshot_observed_at":"2026-08-02T19:18:48.198228Z","title":"Codebleu: a method for automatic evaluation of code synthesis,","venue":null,"work_id":null,"year":2009},"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":1696,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.198228Z"},"links":{"cited_paper":"/paper/2009.10297","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:73bc172a60017a6310356b7289c1e589947d72656f9846fbacf0e59de0335302","observation_id":"abe9fbf1-c332-471c-9023-726604b9e9c1","resolution":{"observed_at":"2026-08-02T19:18:48.198228Z","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-02T19:18:48.497281Z","title":"Stochastic local search,","venue":null,"work_id":null,"year":2018},"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":2002,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.497281Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:305cff67ac963c92dcdca6d7d5b26176dfc2db331ef2b5380be684a787d2f04e","observation_id":"8979149d-0923-48cc-82b3-6351ea98c9c7","resolution":{"observed_at":"2026-08-02T19:18:48.497281Z","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-02T19:18:48.738888Z","title":"Cumulative step-size adaptation on linear functions,","venue":null,"work_id":null,"year":2012},"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":2016,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.738888Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:61805aebc3933e4e6f314aa01d12befbd80f39be800146476dfd5af33b82d8e9","observation_id":"797c4b13-4da9-4ec2-ab2b-1c9b415f0a87","resolution":{"observed_at":"2026-08-02T19:18:48.738888Z","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-02T19:18:48.821059Z","title":"Transformers: State-of-the-art natural language processing,","venue":null,"work_id":null,"year":2020},"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":2018,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:48.821059Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:fa56d1d9c4c228910fc1fc71ea9e0ad4435392edde097c391b9c4edaeddb7b7b","observation_id":"8474e880-555c-41ed-9c5c-557cbad12698","resolution":{"observed_at":"2026-08-02T19:18:48.821059Z","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-02T19:18:46.537203Z","title":"Automated design of metaheuristic algorithms,","venue":null,"work_id":null,"year":2018},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:46.537203Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:b5eca4948112f5790d5694b713318e3c3504a08a468aacd8a8aa01a1490cd8be","observation_id":"3f8e7318-4b5e-4ae2-8198-87eb5e915d41","resolution":{"observed_at":"2026-08-02T19:18:46.537203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15853","last_updated":"2023-05-25T08:44:11Z","snapshot_observed_at":"2026-08-03T14:33:08.717847Z","submitted_at":"2023-05-25T08:44:11Z","title":"Sequential Integrated Gradients: a simple but effective method for explaining language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15853","snapshot_observed_at":"2026-08-02T19:18:47.616762Z","title":"” why should i trust you?","venue":null,"work_id":null,"year":2016},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.616762Z"},"links":{"cited_paper":"/paper/2305.15853","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:24a7aebf840004653a27da1357f071c20396c5395b7e6aa79e3948c10da4cc3b","observation_id":"81b7f4e8-3323-4fea-805c-c0f26054e55f","resolution":{"observed_at":"2026-08-02T19:18:47.616762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07367","snapshot_observed_at":"2026-08-02T19:18:47.408187Z","title":"Autonomous 10 code evolution meets np-completeness,","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":2021,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.408187Z"},"links":{"cited_paper":"/paper/2509.07367","citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:69d021d251c17ad9c2616155cf85e7925910243d7a284706c517dfb7e115cfd6","observation_id":"ff4d9a4a-075c-44a4-a0af-acfa733b20a5","resolution":{"observed_at":"2026-08-02T19:18:47.408187Z","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-02T19:18:47.972121Z","title":"Pretrained optimization model for zero-shot black box optimization,","venue":null,"work_id":null,"year":2024},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:47.972121Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:4a0febc717ae9c5b5a6a07cb47d2dec8a8621e9710299989e72e28497b238687","observation_id":"6feb46a3-d20e-476a-943e-6798f027c15a","resolution":{"observed_at":"2026-08-02T19:18:47.972121Z","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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T19:18:46.906643Z","title":"Multi- objective evolution of heuristic using large language model,","venue":null,"work_id":null,"year":2025},"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":2025,"source":"pdf_text","source_observed_at":"2026-08-02T19:18:46.906643Z"},"links":{"citing_paper":"/paper/2603.02792"},"observation_digest":"sha256:acec1ca5223f93c830175f08e82901100c534a4e2fedc55ca0c415d92541ca6f","observation_id":"aca24648-b1bc-481c-b6c8-a83178b7f96f","resolution":{"observed_at":"2026-08-02T19:18:46.906643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.02792","last_updated":"2026-07-19T10:36:17Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":23},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2603.02792."}