{"as_of":"2026-08-08T10:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0142e846e2cb58155da82f9ca9d3a9bb21a3ec710c6c376ba231b4d6cb5a989f","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:26:03.649776Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.03190/citation-record","integrity":"/paper/2507.03190/integrity","json":"/paper/2507.03190/citation-record.json","paper":"/paper/2507.03190"},"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-06T20:26:07.842886Z","title":"Owhadi, C","venue":null,"work_id":"44241049-0943-40cc-a6b4-0014e52b5184","year":2019},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:59.524477Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:16f50fe56ba1ddc90f6e64d73f52bc3cad3617a85de1c9657a5207ee0fefae2f","observation_id":"5d015a6b-0757-4b12-8280-71b227d758f0","resolution":{"observed_at":"2026-08-06T20:26:07.847684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.827484Z","title":"Fawzi, et al., Discovering faster matrix multiplication algorithms with reinforcement learn- ing","venue":null,"work_id":"a0ed543a-918c-47f5-baae-f3db40ae28ed","year":2022},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:59.588077Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:6a8d29e11aaabcb680337f3f7c98ecbfeab78c792c2bbffe98f11bbae0d5ec9b","observation_id":"0368e0c2-380b-49cd-8997-a48ff4c27ead","resolution":{"observed_at":"2026-08-06T20:26:07.832166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:25:59.718692Z","title":"Novikov, et al., AlphaEvolve: A coding agent for scientific and algorithmic discovery.arXiv preprint arXiv:2506.13131 (2025), white paper","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:59.718692Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:b24f72ff0b4edf142c028880f64ce4e49c8af2502ae0127ed286e9a529e0d995","observation_id":"0d42c406-ba9d-43be-bec8-c2c309e890fd","resolution":{"observed_at":"2026-08-06T20:25:59.718692Z","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-06T20:26:07.811741Z","title":"Lehman, et al","venue":null,"work_id":"7e418de9-f599-415c-902e-da644a0389a8","year":2023},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:59.827329Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:8292280cfc07d473d5d99669eda6ae12722b5c7017b66dbd651d39f72a52ebb1","observation_id":"9cf0e159-2e84-44bf-8d27-87380e578e35","resolution":{"observed_at":"2026-08-06T20:26:07.816782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.794350Z","title":"Romera-Paredes, et al., Mathematical discoveries from program search with large language models","venue":null,"work_id":"dbe68197-1115-4ca0-b638-126cc3c43f23","year":2024},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:59.903356Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:36ab10a50fc6b11428f57cb7b6aebc853cd19d11abcda83e98f6537714312b15","observation_id":"0095932c-7a74-4159-a072-64b392e1fb08","resolution":{"observed_at":"2026-08-06T20:26:07.800434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02051","last_updated":"2024-06-01T16:48:37Z","snapshot_observed_at":"2026-08-06T00:20:28.197923Z","submitted_at":"2024-01-04T04:11:59Z","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02051","snapshot_observed_at":"2026-08-06T20:26:00.012441Z","title":"Liu, et al., Evolution of heuristics: Towards efficient automatic algorithm design using large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.012441Z"},"links":{"cited_paper":"/paper/2401.02051","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:1e3f29bae74279c39ba58cbae0218e6b13cb605ac724145c4baab598a087008e","observation_id":"9a4e30b3-132e-428d-b4f2-0cdf32a5a733","resolution":{"observed_at":"2026-08-06T20:26:00.012441Z","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-06T20:26:07.777309Z","title":null,"venue":null,"work_id":"92a1689a-0bca-4350-9692-e71780a89269","year":1997},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.145841Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:5308c50052dbb8aaacaaf792925dc9826741e5a84bf3600cb81d191b433019ac","observation_id":"3adf17f1-206e-41d7-b271-77a90521f8bf","resolution":{"observed_at":"2026-08-06T20:26:07.782653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.761234Z","title":null,"venue":null,"work_id":"5221d006-5195-4761-b767-504a80ebe5ab","year":2009},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.270219Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:1f118e48c983ac5c5a73e059e706bd3ac4a543c59cef2b921975229e0ac3e187","observation_id":"d5ed211d-1bda-4bd1-8792-d33d0431f971","resolution":{"observed_at":"2026-08-06T20:26:07.766682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.746598Z","title":"Owhadi, Computational graph completion","venue":null,"work_id":"a7c75083-39c4-408e-abec-e2ded91bbabd","year":2022},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.355955Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:b1691f2d13e57a87aa5c028eb392ceb24c41a70bf0e1bd7ef0af7a345045bc74","observation_id":"6a7554d5-f699-4495-a179-71c46a0806fd","resolution":{"observed_at":"2026-08-06T20:26:07.751494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.731493Z","title":null,"venue":null,"work_id":"639e8c0c-1912-45e7-a7d6-12087b85531d","year":2024},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.432736Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:751c1c1c0a5e8de72c817b4f28990e86f17ebc858cb9b16c9a38c0b8bec688b1","observation_id":"ff55cf4c-ade6-4333-ba12-234f2e08d67f","resolution":{"observed_at":"2026-08-06T20:26:07.736169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.715816Z","title":"Guizzo, Closing In On The Perfect Code","venue":null,"work_id":"ef59d83f-1f3f-4006-8978-8aec2cafd8b2","year":2004},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.541567Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:9c749f8e666af7a32be79bb281f4b1d0a3a2f4f096e0d0b2423a8e75e0f0dbcb","observation_id":"cad58cc2-2768-49c5-b5c6-b6bfe5c67200","resolution":{"observed_at":"2026-08-06T20:26:07.721301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.700019Z","title":"Gage, A new algorithm for data compression","venue":null,"work_id":"4e7260ba-2df8-4d03-aa8e-fa50bd083b3b","year":1994},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.636483Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:ae6fb9f6ea755e5e7cca9cda319e8c0027aedf49102197880ed1ca099497c9bb","observation_id":"737e08eb-c534-4c30-8211-0ca26fe399e3","resolution":{"observed_at":"2026-08-06T20:26:07.704771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.685464Z","title":null,"venue":null,"work_id":"a28d05bf-4b71-4638-930e-d365df894e63","year":2012},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.752116Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:da83ddb5c4a78ad84ee82fbb917fe2ec2a33aa87b859799144a81c2e7ba55186","observation_id":"84552284-c8ef-4909-b082-709285b08faa","resolution":{"observed_at":"2026-08-06T20:26:07.689559Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.671908Z","title":"Silver, et al., Mastering the game of Go without human knowledge","venue":null,"work_id":"d4d9abc0-75c2-4488-ad87-7142d495dcad","year":2017},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.869683Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:548bb76ca8bde1613aca4b1c10552082fadec173a5cae77fed188eb119b487af","observation_id":"1cb84c3c-93a8-4065-b893-6326d14f50df","resolution":{"observed_at":"2026-08-06T20:26:07.676015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.658579Z","title":"Silver, et al., A general reinforcement learning algorithm that masters Chess, Shogi, and Go through self-play","venue":null,"work_id":"21819953-ba50-40bd-8866-7a2b9e94e786","year":2018},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:00.952743Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:1998e5e6ac32d70c3387a39f99e4ff7dd56c0726a0dbde26beaedaee161bb5fa","observation_id":"02392762-f11e-4fc0-bb99-cd699f4e6a4a","resolution":{"observed_at":"2026-08-06T20:26:07.662631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.644535Z","title":"Schrittwieser, et al., Mastering Atari, Go, Chess and Shogi by planning with a learned model","venue":null,"work_id":"f7b732c2-02d1-4491-83af-ecbd2095b50e","year":2020},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.033020Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:c46a7aa127f4a8ba59f51f278979fac56bb1a1795fc9e3d2e117a39560341c2b","observation_id":"30054e88-addc-4152-a090-f843a299db58","resolution":{"observed_at":"2026-08-06T20:26:07.649269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11275","last_updated":"2022-10-21T10:24:00Z","snapshot_observed_at":"2026-07-06T13:12:51.785555Z","submitted_at":"2022-05-23T12:47:13Z","title":"RL with KL penalties is better viewed as Bayesian inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11275","snapshot_observed_at":"2026-08-06T20:26:01.136484Z","title":"Korbak, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.136484Z"},"links":{"cited_paper":"/paper/2205.11275","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:cd5bc9b9373d83711f429fc33c4001696d4f0fdbfcfe4d882a9e9f9eac538b0b","observation_id":"5f055b0c-aa79-4eea-ab72-558e90452701","resolution":{"observed_at":"2026-08-06T20:26:01.136484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06533","last_updated":"2025-02-10T14:56:25Z","snapshot_observed_at":"2026-07-06T20:34:02.031605Z","submitted_at":"2025-02-10T14:56:25Z","title":"Ignore the KL Penalty! Boosting Exploration on Critical Tokens to Enhance RL Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06533","snapshot_observed_at":"2026-08-06T20:26:01.278862Z","title":"Vassoyan, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.278862Z"},"links":{"cited_paper":"/paper/2502.06533","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:4b2d090f7ebc6aa7f367c1553a334f82bb1874b3dcadb55b0f37df88a99c7f7c","observation_id":"44b0d37e-a9a3-4184-9cb0-6a9915ea55e8","resolution":{"observed_at":"2026-08-06T20:26:01.278862Z","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-06T20:26:07.631149Z","title":null,"venue":null,"work_id":"27c8702e-9ea4-43b3-8396-eb63b0f8cc9a","year":1997},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.405646Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:4657e9e76b52ab9da87ccf830e4f64cd1fede6631a74f9c65ca6bc49141a330f","observation_id":"99321a80-00ce-4938-bc81-7ad0c5d3d5ee","resolution":{"observed_at":"2026-08-06T20:26:07.635316Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.615234Z","title":"Sahai, A","venue":null,"work_id":"f5b026c3-7e2a-4639-a147-aa03efdf44c9","year":2019},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.482456Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:76b621cdfa41c9da5a0e81e59ccf86444bf81647e25f8cf9add159e7c3fddbb2","observation_id":"20a7d553-64bc-4d2b-bc3a-1487b07f6ba6","resolution":{"observed_at":"2026-08-06T20:26:07.621935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:07.334365Z","title":null,"venue":null,"work_id":"c77aae44-e172-49e1-981c-2c6e84ca9569","year":1955},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.562588Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:3706af6e46cac68cd43ccd0550e5dcf7712492d6a342ad6f5b8e3a69a10161c2","observation_id":"099b05a8-ac85-4f62-8b7c-93c1cd1c9471","resolution":{"observed_at":"2026-08-06T20:26:07.537829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:06.969525Z","title":"Munkres, Algorithms for the assignment and transportation problems","venue":null,"work_id":"173d0a25-4918-4a4f-901d-249f01d314f8","year":1957},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.669063Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:b5a0d55cde3022d23a86c71c05799c0a595ee6033117aa9bb0675bf9b6b86b76","observation_id":"4684a2a7-4828-404d-a40d-e56e9c7e2672","resolution":{"observed_at":"2026-08-06T20:26:07.172685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:06.605449Z","title":null,"venue":null,"work_id":"f36efe9e-be39-4850-a107-4be820b7bf6d","year":2015},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.818344Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:f60bfe443c6c487149bdec602f8a90d9fe42eb87fae845ab8ac43e969bae4f2a","observation_id":"ad7d717c-7d3e-48c7-a750-1cf8684c228c","resolution":{"observed_at":"2026-08-06T20:26:06.763510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:06.386227Z","title":"Palubeckis, An algorithm for construction of test cases for the quadratic assignment problem","venue":null,"work_id":"62eb6643-1ef9-4244-baa1-c4d0ef6e9f40","year":2000},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.902202Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:e24ecd7db0a4288c409f84818c424ae04d07ed12431b43f34e6ffc32187ffe27","observation_id":"5f1ebe13-71c3-4ab1-9066-2854ddab2286","resolution":{"observed_at":"2026-08-06T20:26:06.524909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:06.271547Z","title":null,"venue":null,"work_id":"02c9c371-2181-4528-84a1-b9aab77c0102","year":2015},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:01.956741Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:8e99ec84afa8a942a9e197135ea601d7433eb46df195d063b73042306c1db639","observation_id":"fc7a5453-48e1-45f3-8011-1193a6199913","resolution":{"observed_at":"2026-08-06T20:26:06.332913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:26:02.029901Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.029901Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:9b1c900a25e13e680cdf498f8f055de85c666232e1d8e1a2c1b2f487ce2abae5","observation_id":"65ef091c-4553-4517-91fd-32abef0e1634","resolution":{"observed_at":"2026-08-06T20:26:02.029901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-06T20:26:02.107059Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.107059Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:1c5f351e089c64166ef1454270a4aefa10d3fae5934dc9bbe2d6ab3be88115ea","observation_id":"65c8e8a0-af9c-46a4-a45e-e1187e2152c1","resolution":{"observed_at":"2026-08-06T20:26:02.107059Z","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-06T20:26:06.137209Z","title":"Zhu, et al., Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer","venue":null,"work_id":"edf82a89-4fa1-4ac5-a1ef-7c7add3bb039","year":2022},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.153517Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:2188f3cb04623edd9609018e07181284d47afeb1c744cd94073a6fe23b0c0851","observation_id":"6caa8258-5237-4ef1-8106-d7d270998d4b","resolution":{"observed_at":"2026-08-06T20:26:06.186694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:06.029307Z","title":null,"venue":null,"work_id":"467f44d1-65eb-46d0-bf88-f116c5b6b18e","year":2017},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.220656Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:a500677943f93a2e5f5b264199d08a43a46b8142e564ac74a6deb5cd543ba38f","observation_id":"3d4f02e3-53b6-4321-b13f-4424da15b582","resolution":{"observed_at":"2026-08-06T20:26:06.063934Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.920780Z","title":null,"venue":null,"work_id":"bf9342ab-a646-4a42-b817-cbf11d1808aa","year":1996},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.382624Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:b40f3ccfbb71f62439039a7f71e7e3768f6e95cfcd7801a5c03f2cb890acac56","observation_id":"f5d259a6-bd64-4e36-9a1d-728a626589ca","resolution":{"observed_at":"2026-08-06T20:26:05.974593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.806951Z","title":null,"venue":null,"work_id":"c61e603e-fec3-4dcf-8320-67d49db7bfb7","year":1997},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.459489Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:ace71977b5761a0f09380b161d1f64ebc3613c96a7c835a31a711a1d0f295152","observation_id":"57467998-811b-4995-9a49-50d27b1f28a2","resolution":{"observed_at":"2026-08-06T20:26:05.865125Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.00809","last_updated":"2016-03-02T17:52:34Z","snapshot_observed_at":"2026-07-06T04:48:05.428011Z","submitted_at":"2016-03-02T17:52:34Z","title":"The computation of disconnected bifurcation diagrams","version":1},"cited_work":{"arxiv_id":"1603.00809","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.00809","snapshot_observed_at":"2026-08-06T20:26:03.835954Z","title":"The computation of disconnected bifurcation diagrams","venue":"math.NA","work_id":"bfb0df67-4dda-41f9-bbce-df5777b018f1","year":2016},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.521904Z"},"links":{"cited_paper":"/paper/1603.00809","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:6695a2eb60a5fc355a2a6390c47b2daa84d5900171b4cb4873287dca0a7f38dd","observation_id":"bc5688b6-d94a-44e8-be8c-ee07f46214b5","resolution":{"observed_at":"2026-08-06T20:26:03.922713Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06468","last_updated":"2020-05-26T17:31:31Z","snapshot_observed_at":"2026-07-06T09:20:03.423467Z","submitted_at":"2020-05-13T16:33:03Z","title":"Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.06468","snapshot_observed_at":"2026-08-06T20:26:02.633487Z","title":"Gilliam, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.633487Z"},"links":{"cited_paper":"/paper/2005.06468","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:3408743595520e947fb2a1ad58eab789886ea270c825daae2f061bbe3b70236c","observation_id":"264c12de-a33c-4eb8-85d4-fd2abc7d00ad","resolution":{"observed_at":"2026-08-06T20:26:02.633487Z","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-06T20:26:05.681127Z","title":"Wu, et al., Circuit optimization of Grover quantum search algorithm.Quantum Information Processing 22 (1), 69 (2023)","venue":null,"work_id":"9438f190-f021-423b-9ec0-d1d4f90c7127","year":2023},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.710650Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:2f593cdc75a1613c958d4764f58b164eeb96dd9f12462c075beb801b271e826e","observation_id":"e5ba1407-340f-43d3-b3dc-379c2f2c2d6c","resolution":{"observed_at":"2026-08-06T20:26:05.735270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.576180Z","title":"Zhang, V","venue":null,"work_id":"6f5379d2-76de-4ee9-801c-2174b81fa2ce","year":2020},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.813879Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:43b5d8d39618ed2ed7d789b1176404f6ff903d606bb436bd28fb1ae688952346","observation_id":"cb58a327-d8db-43e7-a0e5-6d70aa6df041","resolution":{"observed_at":"2026-08-06T20:26:05.620134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.458409Z","title":"Piron, M","venue":null,"work_id":"365b812a-6f06-4e1e-8370-5d45e060141a","year":2025},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.910921Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:f02ace3d5e8d39112a2e856459d2a78d7318f7141a95fbb296692859c3b577d0","observation_id":"29964208-ce6f-4ec7-bb87-75e958d4fc2d","resolution":{"observed_at":"2026-08-06T20:26:05.512598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.353329Z","title":null,"venue":null,"work_id":"5e21e046-d092-4c4b-b96b-60bc336c643d","year":1957},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.016128Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:e2bcdaf15a9fd66cba27eff5b2c06ab8b4309ef985b695227ed2786d7bc906fc","observation_id":"aea9c154-82c1-4e6f-8012-cd28db5efdea","resolution":{"observed_at":"2026-08-06T20:26:05.410657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:05.227256Z","title":null,"venue":null,"work_id":"19c8d1de-d45c-4d9d-a593-86cd537559e0","year":2007},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.092121Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:a15cb53ec5c5dc94a845003aa4c8dfda55be0bfe259e7603092e72521bad70c4","observation_id":"09895f8c-b206-4d08-87fb-b1b696c4c4ff","resolution":{"observed_at":"2026-08-06T20:26:05.278915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:26:03.187859Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.187859Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:32c5955a293753d2c7a227d51ce240092825ccf5f6f901a59ba529f877b4fa63","observation_id":"211f6f67-63ef-4eaf-ad25-064854478f21","resolution":{"observed_at":"2026-08-06T20:26:03.187859Z","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-06T20:26:05.116200Z","title":null,"venue":null,"work_id":"7a10dde8-363c-4ce9-8047-b2bac6803db5","year":2006},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.263530Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:605b0ffddde5fa1e3a342f03a53dc4fd4d3a3d29f0c789a648a23596e92cf291","observation_id":"fd63481b-53cd-4c81-93d3-8fa635b69503","resolution":{"observed_at":"2026-08-06T20:26:05.173706Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:04.967214Z","title":null,"venue":null,"work_id":"0c10396c-5b26-4edb-b474-7d6ce283c33a","year":2013},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.403610Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:065ebff3e33b5d586b083366656446e09bf41e252b6a1563e46cce108611e0e0","observation_id":"285d3912-91aa-4945-926e-01fc5c4e59dc","resolution":{"observed_at":"2026-08-06T20:26:05.034586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:04.795471Z","title":null,"venue":null,"work_id":"9298de50-1fca-4a96-9096-4bc7798cc067","year":1998},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.477289Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:105c0c7ec9febbed601e07f77912cf65de11700e49cc67db2d93208d52a3e1e3","observation_id":"acc5af62-23d8-4823-b5a5-6333725bf533","resolution":{"observed_at":"2026-08-06T20:26:04.874692Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:04.606630Z","title":"explore disruptive capabilities in computer-aided algorithm discovery via optimization","venue":null,"work_id":"ddfe6405-7c80-43ea-80cb-9d287a58a519","year":2020},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.564256Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:1857ea01465ea8ad7197e9ecae3fd212917ac185b2bc425c895a4ecba4050e91","observation_id":"6ce45fc6-3141-4cdc-919a-61986a0f68fd","resolution":{"observed_at":"2026-08-06T20:26:04.688781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T20:26:04.338050Z","title":"hardest of the NP-hard problems","venue":null,"work_id":"3506c354-c26c-47dd-8fd5-44491833d891","year":2000},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:03.649776Z"},"links":{"citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:2639043f90389c54bf4154cf621ac8432453f42e12f2278c69d630fe4af1751b","observation_id":"30a922e7-ab1f-4f59-a71a-4e360649fec4","resolution":{"observed_at":"2026-08-06T20:26:04.493881Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T20:13:48.510141Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":44},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2507.03190."}