{"as_of":"2026-08-22T10:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:131aa2c7007c6bca01bd14f124d4e96181fdbfa279d9a88dc735e3aaff012b0e","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T08:10:12.356298Z","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-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:40:13.618376Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.29268","snapshot_observed_at":"2026-08-01T15:40:13.618376Z","title":"arXiv preprint arXiv:2605.29268 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18235","last_updated":"2026-07-20T17:59:37Z","snapshot_observed_at":"2026-08-19T08:34:49.284572Z","submitted_at":"2026-07-20T17:59:37Z","title":"Automated Discovery Has No Universally Superior Harness","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T15:40:13.618376Z"},"links":{"cited_paper":"/paper/2605.29268","citing_paper":"/paper/2607.18235"},"observation_digest":"sha256:b41318fc0f3d34229ce03d2d47c291a3d2a968a1f40c922947b4b8841a4ebba5","observation_id":"80ac4220-2816-4bbb-8918-15237b34aaf6","resolution":{"observed_at":"2026-08-01T15:40:13.618376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.29268","snapshot_observed_at":"2026-07-31T09:14:06.259024Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24647","last_updated":"2026-07-27T16:46:33Z","snapshot_observed_at":"2026-08-19T00:49:45.380953Z","submitted_at":"2026-07-27T16:46:33Z","title":"Efficiency Matters in Autonomous Research","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T09:14:06.259024Z"},"links":{"cited_paper":"/paper/2605.29268","citing_paper":"/paper/2607.24647"},"observation_digest":"sha256:83252b838ab81f909f8a2f091b90a50c0dace7aa50a55b40dfee9a7dbcf8e419","observation_id":"361dedb0-8dcc-40d4-937f-560098f71636","resolution":{"observed_at":"2026-07-31T09:14:06.259024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.29268","snapshot_observed_at":"2026-07-30T19:53:04.588057Z","title":"Compute allocation in evolutionary search: From depth-breadth to multi-armed bandits.arXiv preprint arXiv:2605.29268,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26828","last_updated":"2026-07-30T03:06:21Z","snapshot_observed_at":"2026-08-18T23:08:59.354867Z","submitted_at":"2026-07-29T12:21:28Z","title":"Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T19:53:04.588057Z"},"links":{"cited_paper":"/paper/2605.29268","citing_paper":"/paper/2607.26828"},"observation_digest":"sha256:b93c1163740892020d7fa4b64f078b7b14e6a7bcbb663fa194e93c65211490a4","observation_id":"67f3a1af-1f16-4343-92af-bd26039995ed","resolution":{"observed_at":"2026-07-30T19:53:04.588057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.29268","snapshot_observed_at":"2026-08-01T10:47:32.802796Z","title":"Compute allocation in evolutionary search: From depth-breadth to multi-armed bandits.arXiv preprint arXiv:2605.29268,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26828","last_updated":"2026-07-30T03:06:21Z","snapshot_observed_at":"2026-08-18T23:08:59.354867Z","submitted_at":"2026-07-29T12:21:28Z","title":"Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T10:47:32.802796Z"},"links":{"cited_paper":"/paper/2605.29268","citing_paper":"/paper/2607.26828"},"observation_digest":"sha256:a80bcd1b83e119079faabaa39622d44c5bc063435ae5fda85706f63c0d814e6f","observation_id":"197e15bd-d486-4ae2-88db-85c1d8992274","resolution":{"observed_at":"2026-08-01T10:47:32.802796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.29268/citation-record","integrity":"/paper/2605.29268/integrity","json":"/paper/2605.29268/citation-record.json","paper":"/paper/2605.29268"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:10:12.356298Z","title":"In Parallel Problem Solving from Nature – PPSN XIII, pages 892–901","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:686838c8f0a533ee52bbd42d7e8cf98f11abf815d2fb22b144822f1ac5caa05f","observation_id":"ea4df140-7e17-4fa0-a040-f99775cd020f","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-08-14T10:00:52.343929Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":"2407.21787","doi":"10.48550/arxiv.2407.21787","metadata_source":"pith","pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","venue":"cs.LG","work_id":"b124064d-5a56-42ad-86f5-3cc349b86a3a","year":2024},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:8e8794639bb9075edc85a118e942f18f1d451b75d8d72a01220834000b057045","observation_id":"abf97e13-e6c4-4a04-9c48-85b4c88729e3","resolution":{"observed_at":"2026-06-29T08:13:14.958440Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-12T02:20:41.492703+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T02:20:41.492703+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19349","last_updated":"2025-09-17T17:49:02Z","snapshot_observed_at":"2026-08-15T22:10:58.636387Z","submitted_at":"2025-09-17T17:49:02Z","title":"ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution","version":1},"cited_work":{"arxiv_id":"2509.19349","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.19349","snapshot_observed_at":"2026-07-04T20:00:08.586809Z","title":"ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution","venue":"cs.CL","work_id":"41f30c7f-ee82-49b7-9ce9-463d3124269c","year":2025},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"cited_paper":"/paper/2509.19349","citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:4c421b3c3bfbeaa3b31ecf5615ada9f1372151402f2c58ee7850ff13bc25137e","observation_id":"cc045929-5e4c-462d-a5dd-991001a95016","resolution":{"observed_at":"2026-06-29T08:13:14.962119Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08896","last_updated":"2022-06-17T17:07:04Z","snapshot_observed_at":"2026-08-16T16:52:11.513223Z","submitted_at":"2022-06-17T17:07:04Z","title":"Evolution through Large Models","version":1},"cited_work":{"arxiv_id":"2206.08896","doi":"10.48550/arxiv.2206.08896","metadata_source":"arxiv_reference","pith_arxiv_id":"2206.08896","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stanley , title =","venue":"arXiv (Cornell University)","work_id":"d378af55-0b14-4700-a7aa-ec83a2226580","year":2022},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"cited_paper":"/paper/2206.08896","citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:c38ad2ed63ff6929218faf09aeaff4db5d5782d60710f1e847b7699d01878817","observation_id":"dcb56272-102b-4123-be0b-28f30af9e8bd","resolution":{"observed_at":"2026-06-29T08:13:14.959250Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-29T08:10:12.356298Z","title":"ACM Transactions on Evolution- ary Learning, 4(4):1–40","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:bcf3c9b2a49e5c1c0948c0ede02edf18183b8f823192b357dd25af0417797c0f","observation_id":"9717aba0-92f4-41e9-b494-bcd4ed54fed8","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.09574","last_updated":"2026-06-04T09:49:18Z","snapshot_observed_at":"2026-08-16T16:15:52.929396Z","submitted_at":"2026-02-10T09:23:26Z","title":"Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs","version":2},"cited_work":{"arxiv_id":"2602.09574","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.09574","snapshot_observed_at":"2026-07-01T14:55:48.177294Z","title":"Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs","venue":"cs.CL","work_id":"23ed9895-2705-43ea-912d-4ba9748fa845","year":2026},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"cited_paper":"/paper/2602.09574","citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:333b4fe3242fa2c40395b87ba96daf6af134e4e03cb915502b827e7cd05bf603","observation_id":"b4834bf5-901b-43af-979c-941fc0c74121","resolution":{"observed_at":"2026-06-29T08:13:14.950812Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-20T22:23:36.450758Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":"2506.13131","doi":"10.1016/j.shpsa.2017.03.005","metadata_source":"pith","pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","venue":"cs.AI","work_id":"76a0f850-d490-4e4f-ab98-8d25df82cd23","year":2025},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:7568861cd5ff914c013fa02ad1704a2e4798db1f250442319c0f1611517f3756","observation_id":"ec2cf317-674c-4c4a-8521-ea913f6ff5ca","resolution":{"observed_at":"2026-06-29T08:13:14.953555Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0110.9974","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:13:14.954765Z","title":"CP run 6 gen 437","venue":null,"work_id":"526ff455-3fa5-4213-82cc-7e8701e735d4","year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:918295a7ba2edff8851b795c0fad7991739380b2304b07afd7a8f8d4d39fbf6f","observation_id":"553d149d-0ad0-4576-86b2-485b77663354","resolution":{"observed_at":"2026-06-29T08:13:14.956433Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:1d6fba1ccfa3f7b3ca67d4e6c8fc8d27d6878fe1e318dfcc3f3241b221a3d2ab","observation_id":"c0ba3878-36fb-400a-ab57-5f09763afdc0","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:6eed3f4763e9b7a5d4753d0de77ce8c6e52cdac8a95107194dbb4486c7b801f7","observation_id":"741b7d93-30c2-4772-bbc8-c996b0f1dd4e","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":"### SEARCH Block Requirements:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:d8f3b36cd34d8cda964731d6bb4c4796bf9953b0dc460bbf875babce26e42c16","observation_id":"9eb6c145-d389-4865-9239-31404d07efd8","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:e936476377b3a45e754218e717bf083204d498944cade9ea0e2edb810086e552","observation_id":"a131eb86-a820-4bda-99ba-9f6d848ebce4","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:8b936b690271fe885b0202c5db17f13cd494123edd0bc8cf1c6ffd57643c429c","observation_id":"d1d4c401-6440-4969-803a-ac7a82c810b2","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":"### Output & Compatibility:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:84eb07789141036c210b27bf97b4aaf6362d4eb1d18c24739788037b70d72a7b","observation_id":"7feb6572-0f7e-4b86-8323-cc6606e79f2f","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:5e716c50584dfffeb1f1e0c0d4d012fb1bfdb7b811cd42ba52ab8569ef0ed551","observation_id":"48e6e29f-32a5-4d14-a0e9-2a46400c7773","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:62518e993dcc1d901754b575dce0167bf3bdc417140ba846ec6ab759c1888afb","observation_id":"a27d3b01-8858-4aeb-899d-86d7febdf77d","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","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-06-29T08:10:12.356298Z","title":"EVOLVE-BLOCK-START","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T08:10:12.356298Z"},"links":{"citing_paper":"/paper/2605.29268"},"observation_digest":"sha256:52dcca36f7148729f5813dea4fa34277ca5866b6e80f1339855dadad2cb0826a","observation_id":"f1887816-7544-4f77-9598-0abc01b1bbd0","resolution":{"observed_at":"2026-06-29T08:10:12.356298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.29268","last_updated":"2026-05-29T00:46:10Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T15:45:50.659740Z","submitted_at":"2026-05-28T02:37:51Z","title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":17},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 4 inbound Pith citation observations for arXiv:2605.29268."}