{"as_of":"2026-08-17T20:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f41d59184564472b436548e9ea90c824df4e9744548dcfa400afa82515a570ce","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:56:05.385637Z","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-17T06:30:58.91139+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/2506.18260/citation-record","integrity":"/paper/2506.18260/integrity","json":"/paper/2506.18260/citation-record.json","paper":"/paper/2506.18260"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00157","last_updated":"2024-09-16T19:20:59Z","snapshot_observed_at":"2026-08-16T14:22:43.713388Z","submitted_at":"2024-01-31T20:26:32Z","title":"Large Language Models for Mathematical Reasoning: Progresses and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00157","snapshot_observed_at":"2026-08-15T18:56:05.277032Z","title":"(2024, April 5).Large Language Models for Mathematical Reasoning: Progresses and Challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.277032Z"},"links":{"cited_paper":"/paper/2402.00157","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:e0995d3aed9e05284807a620e18f607eeb856c9881974821b08d6502a3493ae9","observation_id":"0040e1a2-4dfc-4a3a-a9d0-40d5dbf5cbc0","resolution":{"observed_at":"2026-08-15T18:56:05.277032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00234","last_updated":"2024-10-05T11:47:02Z","snapshot_observed_at":"2026-07-06T14:36:25.690733Z","submitted_at":"2022-12-31T15:57:09Z","title":"A Survey on In-context Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00234","snapshot_observed_at":"2026-08-15T18:56:05.283510Z","title":"(2024, June 18)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.283510Z"},"links":{"cited_paper":"/paper/2301.00234","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:36f417497f8f25680de27db9242373f292b665f54ba85289ccdf0e2913b808d7","observation_id":"9dd2a732-c845-4dc9-b462-3d9f9a39b6c8","resolution":{"observed_at":"2026-08-15T18:56:05.283510Z","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-15T18:56:05.289327Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.289327Z"},"links":{"citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:91b93e633d8b42b232b8a2ace4d2f6b280fef1b74b2414c8c8c99a32092c0320","observation_id":"4333c6a8-1c75-4ace-a69e-28dd7a437ebf","resolution":{"observed_at":"2026-08-15T18:56:05.289327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01680","last_updated":"2024-04-19T01:15:16Z","snapshot_observed_at":"2026-08-10T13:10:07.804621Z","submitted_at":"2024-01-21T23:36:14Z","title":"Large Language Model based Multi-Agents: A Survey of Progress and Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01680","snapshot_observed_at":"2026-08-15T18:56:05.294785Z","title":"V ., Wiest, O., & Zhang, X","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.294785Z"},"links":{"cited_paper":"/paper/2402.01680","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:3d2fedf73d57951c081ccfdc9e9510fa69ea8d154bb8a1473db7fc1f1c0c71c0","observation_id":"d2be91a6-527c-4f5d-b064-df6b9702c46d","resolution":{"observed_at":"2026-08-15T18:56:05.294785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13345","last_updated":"2022-12-27T02:54:46Z","snapshot_observed_at":"2026-08-16T16:05:54.047188Z","submitted_at":"2022-12-27T02:54:46Z","title":"The Forward-Forward Algorithm: Some Preliminary Investigations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.13345","snapshot_observed_at":"2026-08-15T18:56:05.299895Z","title":"(2022, December 26).The Forward-Forward Algorithm: Some Preliminary Investigations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.299895Z"},"links":{"cited_paper":"/paper/2212.13345","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:dc48e5f74ec9e2aee0a38a80992e3491fc1eda5b87c57f897261469df94789af","observation_id":"95681b0a-a272-40da-8966-45f131e958f7","resolution":{"observed_at":"2026-08-15T18:56:05.299895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00352","last_updated":"2024-11-01T14:36:52Z","snapshot_observed_at":"2026-08-12T16:02:21.969968Z","submitted_at":"2023-08-01T07:49:10Z","title":"MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00352","snapshot_observed_at":"2026-08-15T18:56:05.305305Z","title":"(2023, November 6)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.305305Z"},"links":{"cited_paper":"/paper/2308.00352","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:c8240c6aca7e13d574770fc978149a25d14847f3697dc0d3ebd3d419df83e2b1","observation_id":"3bccacb5-4ce5-4b76-abc2-2089415581db","resolution":{"observed_at":"2026-08-15T18:56:05.305305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06292","last_updated":"2024-09-01T00:41:18Z","snapshot_observed_at":"2026-07-06T18:59:43.564435Z","submitted_at":"2024-08-12T16:58:11Z","title":"The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06292","snapshot_observed_at":"2026-08-15T18:56:05.311198Z","title":"T., Foerster, J., Clune, J., & Ha, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.311198Z"},"links":{"cited_paper":"/paper/2408.06292","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:79049eb3abeb5fb501cae63642efc78226e4973eaf29b3a36e9b7db15bedff24","observation_id":"bf20fa1b-9d35-4e62-9d7d-d296e2e06334","resolution":{"observed_at":"2026-08-15T18:56:05.311198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.04738","last_updated":"2023-07-10T17:52:01Z","snapshot_observed_at":"2026-08-16T15:17:22.599093Z","submitted_at":"2023-07-10T17:52:01Z","title":"RoCo: Dialectic Multi-Robot Collaboration with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.04738","snapshot_observed_at":"2026-08-15T18:56:05.316362Z","title":"(2023, July 10)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.316362Z"},"links":{"cited_paper":"/paper/2307.04738","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:9b97a9c126f76ff61e736c117cbb21fe877ccfcfbfcc5179b079799a7064a780","observation_id":"f646a37d-ae4e-439c-a722-4440775e7d87","resolution":{"observed_at":"2026-08-15T18:56:05.316362Z","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":"10.48550/arxiv.2401.09253","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:56:05.652825Z","title":"B., Campos-Gonzalez-Angulo, J","venue":null,"work_id":"299b50de-f382-4ced-bb60-3ca2b7c3a7c6","year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.322297Z"},"links":{"citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:a644862c1a809acf65d9797e0f7dbddb5b39a4008e25bcf3e2e5851df8f007fc","observation_id":"6a1ea19d-0d25-4274-96c1-d7650d44050c","resolution":{"observed_at":"2026-08-15T18:56:05.659134Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07924","last_updated":"2024-06-05T13:23:49Z","snapshot_observed_at":"2026-08-16T00:37:44.307785Z","submitted_at":"2023-07-16T02:11:34Z","title":"ChatDev: Communicative Agents for Software Development","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07924","snapshot_observed_at":"2026-08-15T18:56:05.328302Z","title":"(2024, June 5)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.328302Z"},"links":{"cited_paper":"/paper/2307.07924","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:8a630e1bb55c58de80de024a5d0d130f8f06cc37a699a0555c454a545cf818e5","observation_id":"aedc8c16-8deb-4373-9b19-dd414b62f6ba","resolution":{"observed_at":"2026-08-15T18:56:05.328302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18290","last_updated":"2024-07-29T22:26:36Z","snapshot_observed_at":"2026-08-01T16:34:38.795326Z","submitted_at":"2023-05-29T17:57:46Z","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18290","snapshot_observed_at":"2026-08-15T18:56:05.333445Z","title":"D., & Finn, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.333445Z"},"links":{"cited_paper":"/paper/2305.18290","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:e466d5878a344a209cad2de860d4a6745b1d0bb2d5bc731589ecc8783d0aa99b","observation_id":"a7b32955-26ec-404e-ac5d-12fdf5d1a52d","resolution":{"observed_at":"2026-08-15T18:56:05.333445Z","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-15T18:56:05.338322Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.338322Z"},"links":{"citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:d41e865fa0ad435ced2716aa733e3995ab482b993fa127fa0349e3c61dec9ceb","observation_id":"6439059b-9d0c-47da-ac84-96edf03b3f7d","resolution":{"observed_at":"2026-08-15T18:56:05.338322Z","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-15T18:56:05.343180Z","title":"E., Hinton, G","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.343180Z"},"links":{"citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:6fe44eac6255458cb9b7707f94f0e48090f9ff4e35297725f55c0a85264046fa","observation_id":"8c7546fa-283b-455f-8cf1-f06ea7c0590a","resolution":{"observed_at":"2026-08-15T18:56:05.343180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20132","last_updated":"2025-01-30T08:54:54Z","snapshot_observed_at":"2026-08-17T02:01:48.946484Z","submitted_at":"2024-05-30T15:10:59Z","title":"LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20132","snapshot_observed_at":"2026-08-15T18:56:05.348749Z","title":"L., McDougall, C., MacDiarmid, M., Freeman, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.348749Z"},"links":{"cited_paper":"/paper/2405.20132","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:3851fcded2d60b2a4b8d0aac184b9c718302d1fb829ad3b47b226f7c33bc9d82","observation_id":"efa1e938-2076-4b5c-bdb4-e906562dd721","resolution":{"observed_at":"2026-08-15T18:56:05.348749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18272","last_updated":"2024-02-28T12:04:05Z","snapshot_observed_at":"2026-08-16T14:14:33.771779Z","submitted_at":"2024-02-28T12:04:05Z","title":"Rethinking the Bounds of LLM Reasoning: Are Multi-Agent Discussions the Key?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18272","snapshot_observed_at":"2026-08-15T18:56:05.353761Z","title":"(2024, February 28).Rethinking the Bounds of LLM Reasoning: Are Multi-Agent Discussions the Key? (1)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.353761Z"},"links":{"cited_paper":"/paper/2402.18272","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:fa6e6c006c99d07fe0b846782c2bec8cb97983eaeeb7daf3678febce000915e7","observation_id":"f55732d9-fb1f-4b09-9e20-8439f19062cc","resolution":{"observed_at":"2026-08-15T18:56:05.353761Z","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-15T18:56:05.803777Z","title":null,"venue":null,"work_id":"4f70deb7-bd65-47cd-97ba-6dc3c7404413","year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.358933Z"},"links":{"citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:cd2e9b214fb8927ba6e77fa3399c18ebae8ad6b45dce6d118dd4fb757c1277a5","observation_id":"378913c4-8cf8-4be1-b2ac-9b5fc4551ef4","resolution":{"observed_at":"2026-08-15T18:56:05.809082Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15884","last_updated":"2024-10-07T02:19:21Z","snapshot_observed_at":"2026-08-17T09:14:38.619275Z","submitted_at":"2024-01-29T04:36:39Z","title":"Corrective Retrieval Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15884","snapshot_observed_at":"2026-08-15T18:56:05.363562Z","title":"(2024, February 16)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.363562Z"},"links":{"cited_paper":"/paper/2401.15884","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:25135806c2dcc7155603e33c4c84ab8ff566f6673718ecf92ce7a2de5b04becb","observation_id":"8ab37d6b-7466-4cdc-8ba9-7c8e7d74e38b","resolution":{"observed_at":"2026-08-15T18:56:05.363562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.03409","last_updated":"2024-04-15T07:50:32Z","snapshot_observed_at":"2026-08-15T09:21:11.223719Z","submitted_at":"2023-09-07T00:07:15Z","title":"Large Language Models as Optimizers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.03409","snapshot_observed_at":"2026-08-15T18:56:05.368841Z","title":"V ., Zhou, D., & Chen, X","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.368841Z"},"links":{"cited_paper":"/paper/2309.03409","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:9bf03805bcff6a9a021db78e51ea901121ca35a6dd6c557ea7316f2199da09c9","observation_id":"3cec376c-cdec-481f-a3fd-808c5bd372c9","resolution":{"observed_at":"2026-08-15T18:56:05.368841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10601","last_updated":"2023-12-03T22:50:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T23:16:17Z","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10601","snapshot_observed_at":"2026-08-15T18:56:05.374065Z","title":"L., Cao, Y ., & Narasimhan, K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.374065Z"},"links":{"cited_paper":"/paper/2305.10601","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:07409f333b8a2816ff88507a061b5e53da15772f92a7108d1e7a75c23e103fef","observation_id":"db8e5aaf-1dcd-4a38-b20d-2c3c0c8b2bb1","resolution":{"observed_at":"2026-08-15T18:56:05.374065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02485","last_updated":"2024-02-17T05:27:56Z","snapshot_observed_at":"2026-08-16T15:18:28.133558Z","submitted_at":"2023-07-05T17:59:27Z","title":"Building Cooperative Embodied Agents Modularly with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02485","snapshot_observed_at":"2026-08-15T18:56:05.379927Z","title":"B., Shu, T., & Gan, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.379927Z"},"links":{"cited_paper":"/paper/2307.02485","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:d0dcab61e9e5cb77f82b8590cb98c386e6b15d62e1d9d40e2d374f9aad7228d3","observation_id":"dc9e68b8-4609-4003-bbde-5a69247758ec","resolution":{"observed_at":"2026-08-15T18:56:05.379927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04528","last_updated":"2024-11-11T17:30:55Z","snapshot_observed_at":"2026-08-16T14:36:44.881453Z","submitted_at":"2023-12-07T18:46:50Z","title":"Using Large Language Models for Hyperparameter Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04528","snapshot_observed_at":"2026-08-15T18:56:05.385637Z","title":"R., Desai, N., Bae, J., Lorraine, J., & Ba, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:56:05.385637Z"},"links":{"cited_paper":"/paper/2312.04528","citing_paper":"/paper/2506.18260"},"observation_digest":"sha256:adeea81f44361a010f585d4c8616c00bdd0e69ab3c369df1064f92993e4ad906","observation_id":"aa22bf0a-38a7-4dd0-a90a-a496082a6cc0","resolution":{"observed_at":"2026-08-15T18:56:05.385637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.18260","last_updated":"2025-06-23T03:19:36Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T18:50:37.007391Z","submitted_at":"2025-06-23T03:19:36Z","title":"Advanced For-Loop for QML algorithm search"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":21},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2506.18260."}