{"as_of":"2026-08-17T04:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:051f59f17dcbdf60aedc0e647827f6c376220ef9b0b49c246dcc6ed3590e7a8f","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:31:45.949488Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:45:52.675056Z","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":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.16389","snapshot_observed_at":"2026-08-03T16:45:52.675056Z","title":"arXiv preprint arXiv:2506.16389 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28947","last_updated":"2026-07-31T02:05:45Z","snapshot_observed_at":"2026-08-17T03:28:09.745516Z","submitted_at":"2026-07-31T02:05:45Z","title":"Overcoming the Weakest-Link Effect in LLM-Driven Program Optimization via Heterogeneous Edit Recombination","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-03T16:45:52.675056Z"},"links":{"cited_paper":"/paper/2506.16389","citing_paper":"/paper/2607.28947"},"observation_digest":"sha256:37e265a6030d8025c08c6cc0573730a6c4fa5a152aef37fef7b8346c3b98c487","observation_id":"6eb81169-c170-43a8-a0c4-552372f05d11","resolution":{"observed_at":"2026-08-03T16:45:52.675056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.16389/citation-record","integrity":"/paper/2506.16389/integrity","json":"/paper/2506.16389/citation-record.json","paper":"/paper/2506.16389"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:31:45.758106Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.758106Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:628fb859b7ea287d8c45241fe28654add59c2745cf3d5ef2591d505fd0a60ae2","observation_id":"8e610697-3bf6-4b62-bb5a-e3f1f1b7c01f","resolution":{"observed_at":"2026-08-15T19:31:45.758106Z","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-15T19:31:45.762581Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.762581Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:ce7e36225007ebc60a8ca3cfef2b270905a4e3ebb864bc1cd1f1310264ce4462","observation_id":"a0d31dc5-7672-4a9e-bd21-46d018fa1b9a","resolution":{"observed_at":"2026-08-15T19:31:45.762581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T03:30:12.735656Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-15T19:31:45.766296Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.766296Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:75c4fac708945acc2fe30c8dbe875c72bf9486c1d49e42b2fea86552f9577003","observation_id":"28fcdaad-5877-4aa9-9778-ea3d33870f76","resolution":{"observed_at":"2026-08-15T19:31:45.766296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14423","last_updated":"2024-05-05T00:54:26Z","snapshot_observed_at":"2026-08-16T14:24:59.752499Z","submitted_at":"2024-01-24T06:20:18Z","title":"Prompt Design and Engineering: Introduction and Advanced Methods","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14423","snapshot_observed_at":"2026-08-15T19:31:45.769812Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.769812Z"},"links":{"cited_paper":"/paper/2401.14423","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:6089e83c8a5c4ef0be81be874513ca8649b27f896c832e54b74a65bfb12623a8","observation_id":"3bc5d44a-6c76-477b-be99-a9d8510ebc1a","resolution":{"observed_at":"2026-08-15T19:31:45.769812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13923","last_updated":"2025-02-19T18:00:14Z","snapshot_observed_at":"2026-08-14T04:17:22.593941Z","submitted_at":"2025-02-19T18:00:14Z","title":"Qwen2.5-VL Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13923","snapshot_observed_at":"2026-08-15T19:31:45.773548Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.773548Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:4bbac2096ff66557acb646fbb3739395b04b2836f011505d5e157e11066c41c8","observation_id":"aa5ca91b-8e28-4675-8add-a76398659e97","resolution":{"observed_at":"2026-08-15T19:31:45.773548Z","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-15T19:31:46.635171Z","title":null,"venue":null,"work_id":"b4d73c09-4616-4b32-a489-b2d35b4324ae","year":2006},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.777258Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:034693c72e5f84affc8fec5f7db7f3120cf554090e4ee32a08bfefd67c44f51d","observation_id":"1cc2ecf1-bf59-471e-991a-ccd202e812fa","resolution":{"observed_at":"2026-08-15T19:31:46.638992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-15T19:31:45.780747Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.780747Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:f2a0cbf425ee252fa4fd90e4d29f665b46783a92a63515c6506bdc042829c695","observation_id":"e6924f67-a593-4d91-8e10-79ccb582fb2e","resolution":{"observed_at":"2026-08-15T19:31:45.780747Z","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-15T19:31:45.784163Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.784163Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:3645f81c80549cb5eaf863999206f1a597512dd2fc0b137ee5ba31bfa3880b8b","observation_id":"907d46a4-6f00-4e6b-a015-154d24875a40","resolution":{"observed_at":"2026-08-15T19:31:45.784163Z","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-15T19:31:45.787525Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.787525Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:32e6aa845c7f61e00ca4eb68777f5f894fc2df0afe65588391a3522eb3436af7","observation_id":"11b4a282-ee90-4e16-a0cc-e7e5e1c82a9c","resolution":{"observed_at":"2026-08-15T19:31:45.787525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13007","last_updated":"2024-06-21T19:34:27Z","snapshot_observed_at":"2026-08-16T14:58:22.593686Z","submitted_at":"2023-09-22T17:12:45Z","title":"ReConcile: Round-Table Conference Improves Reasoning via Consensus among Diverse LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13007","snapshot_observed_at":"2026-08-15T19:31:45.790562Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.790562Z"},"links":{"cited_paper":"/paper/2309.13007","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:c12447235d26011aa002ea4e9db47ecff5007c1366840e7ddca9b6e6e8896199","observation_id":"7d8a1316-0b0b-4db2-bcd5-040503042c62","resolution":{"observed_at":"2026-08-15T19:31:45.790562Z","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.1162/dint_a_00251","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:31:46.054005Z","title":null,"venue":null,"work_id":"4589900a-715e-449e-aaff-5ae58dae7de8","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.794023Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:82b43a57008c585f9a619955173881a9f53876e598b143cdd8876fb611d8816b","observation_id":"fb99ad81-d42f-4dda-8a52-5c6d746d5cd1","resolution":{"observed_at":"2026-08-15T19:31:46.057231Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-15T19:31:45.797511Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.797511Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:dd2bb9dbc1d3f58e28cc07848b0848ee201352577a5d0038fb58f47d3acd005f","observation_id":"0216b504-969d-4c6d-b4fc-1b1d090acffc","resolution":{"observed_at":"2026-08-15T19:31:45.797511Z","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-15T19:31:45.800778Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.800778Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:bec9875d47b4a46b3c1cd33f25626f79a07dad1b09dced1675ec8f63b26290f9","observation_id":"6e5945c8-649c-432e-b068-7a87d5ddad2c","resolution":{"observed_at":"2026-08-15T19:31:45.800778Z","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-15T19:31:45.804136Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.804136Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:de7eb3f927619c1032dd67cc35edb4f2a522041a331fe09daede2b5655c49a63","observation_id":"80d3f998-c176-4ce3-8e00-b3ed7a21da5c","resolution":{"observed_at":"2026-08-15T19:31:45.804136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14325","last_updated":"2023-05-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:55:11Z","title":"Improving Factuality and Reasoning in Language Models through Multiagent Debate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14325","snapshot_observed_at":"2026-08-15T19:31:45.807266Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.807266Z"},"links":{"cited_paper":"/paper/2305.14325","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:315befc2f8ab0372e9fc93e930ca17ccd95713324d1f26cc66c92eb617e5369b","observation_id":"2d19e590-529b-4c3c-b7aa-d31ce37229af","resolution":{"observed_at":"2026-08-15T19:31:45.807266Z","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-15T19:31:45.810753Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.810753Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:05706ef3c664e57f04eab0a9077ff8f57eb22407538c2d76e05204846de2e5fd","observation_id":"5cb3ed5f-3454-4b69-8b50-736dd2487aeb","resolution":{"observed_at":"2026-08-15T19:31:45.810753Z","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-15T19:31:45.813714Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.813714Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:77b22dd0414ea73dd7d3015a84a81aee4ccaea648dc1499d537e8dfc500a11b1","observation_id":"e843c297-2ef7-43d8-b251-ea889e14d796","resolution":{"observed_at":"2026-08-15T19:31:45.813714Z","resolver_source":null,"status":"malformed_identifier"},"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-15T19:31:45.816795Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.816795Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:faa86b1c72fccfa6592a1d8c400d947f29e8daa191b8dbbbc2cfcd00d82d7398","observation_id":"4586c3e4-d988-47e1-8fdc-45ab53f1beca","resolution":{"observed_at":"2026-08-15T19:31:45.816795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00805","last_updated":"2025-06-01T03:11:00Z","snapshot_observed_at":"2026-08-15T21:25:53.313888Z","submitted_at":"2025-06-01T03:11:00Z","title":"HSCR: Hierarchical Self-Contrastive Rewarding for Aligning Medical Vision Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.00805","snapshot_observed_at":"2026-08-15T19:31:45.820094Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.820094Z"},"links":{"cited_paper":"/paper/2506.00805","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:d86c2c99fcf234fd150450ef3d168bf9eed8529250005257d0fefd33fe2a0c91","observation_id":"d4463c4a-fb36-4814-9e27-491ea0809502","resolution":{"observed_at":"2026-08-15T19:31:45.820094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04514","last_updated":"2024-04-06T05:59:02Z","snapshot_observed_at":"2026-08-16T14:03:11.286175Z","submitted_at":"2024-04-06T05:59:02Z","title":"Joint Visual and Text Prompting for Improved Object-Centric Perception with Multimodal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.04514","snapshot_observed_at":"2026-08-15T19:31:45.823618Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.823618Z"},"links":{"cited_paper":"/paper/2404.04514","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:2855d80d78849ab595ea1baadda46e3de1db281afb3cad3abd435690feade40d","observation_id":"1080c5c9-fd64-4870-93b5-1fcb16b090cd","resolution":{"observed_at":"2026-08-15T19:31:45.823618Z","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.18653/v1/2024.findings-emnlp.221","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:31:46.019964Z","title":null,"venue":null,"work_id":"cc22d622-835a-42c4-a7e1-be389deb82b7","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.827428Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:9f09a119a18f1931630304ff0e9884292b375c9cea81c44d289d55e9cd0b0207","observation_id":"c82160b8-5af3-4656-824b-20c2587fc7ab","resolution":{"observed_at":"2026-08-15T19:31:46.024945Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00806","last_updated":"2025-06-01T03:15:29Z","snapshot_observed_at":"2026-08-09T07:52:39.727951Z","submitted_at":"2025-06-01T03:15:29Z","title":"Fast or Slow? Integrating Fast Intuition and Deliberate Thinking for Enhancing Visual Question Answering","version":1},"cited_work":{"arxiv_id":"2506.00806","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.00806","snapshot_observed_at":"2026-08-15T19:31:46.251633Z","title":"Fast or Slow? Integrating Fast Intuition and Deliberate Thinking for Enhancing Visual Question Answering","venue":"cs.CL","work_id":"d110abca-0c8b-4c4d-83f9-a6dda56e4050","year":2025},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.830484Z"},"links":{"cited_paper":"/paper/2506.00806","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:c32ebe9ba36ddf37711df362632223919ade0a0d7e30fff71948568416c5b8d5","observation_id":"109e3e8d-2ec2-418f-be28-f26ef0ed8efa","resolution":{"observed_at":"2026-08-15T19:31:46.257862Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.833514Z","title":"Joshi, Hanna Moazam, Heather Miller, Matei Zaharia, and Christopher Potts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.833514Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:bac2ee99fd9a68c5370dca3f5f2ab14362c0bb368da90606bee2b51f679585e7","observation_id":"870ccefd-442c-43ac-b57e-c7e21f25ef76","resolution":{"observed_at":"2026-08-15T19:31:45.833514Z","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-15T19:31:46.606620Z","title":null,"venue":null,"work_id":"813914cb-a3b4-4618-8528-d36e4c49241e","year":2017},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.836900Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:c28dec54e0c3465e7e3f1998a56cb947c03d25e569839de6a99f75f3bd1690fe","observation_id":"01d4d6af-ce18-4cb1-9e54-9c1cabe1b573","resolution":{"observed_at":"2026-08-15T19:31:46.610327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.596458Z","title":null,"venue":null,"work_id":"94a7d9d7-bfdb-4475-83ba-669c8c00e92b","year":2017},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.840058Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:1e458d699cb3400034c96354f47ef4da04e602bc210d0dd3437433eeb863937b","observation_id":"be6b5984-29a6-4c36-8877-1477550db522","resolution":{"observed_at":"2026-08-15T19:31:46.599824Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.843611Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.843611Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:09987f4fd894d0ee7fb846f3501c6e8ab625a952f2c7fd3e458acae2a00525b7","observation_id":"6c01a146-8e5f-4296-af8f-9bd233657b82","resolution":{"observed_at":"2026-08-15T19:31:45.843611Z","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-15T19:31:45.846830Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.846830Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:a301d5ea0957db1a99384c094529773e47943807bcd20ee35809760f76a7cc07","observation_id":"b624b63d-2b62-42bb-b3e6-d1ad9cd84454","resolution":{"observed_at":"2026-08-15T19:31:45.846830Z","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-15T19:31:45.850413Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.850413Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:5b3e1871ceaa83999fbfb055cbe45adfbefca5f0c125cddd07b2af7fd2f1a0d1","observation_id":"0e6fd5a0-1f98-41bc-9705-a21a6f9db3e7","resolution":{"observed_at":"2026-08-15T19:31:45.850413Z","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-15T19:31:45.853885Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.853885Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:680f1f40ffa4732600627aa20fc3888810221d138adb9295b2a1a13e9340e11c","observation_id":"b6322f43-bb35-485f-acd8-219fccc30b61","resolution":{"observed_at":"2026-08-15T19:31:45.853885Z","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-15T19:31:45.857169Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.857169Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:4981fa1e0f75a35b1ad0577e098d6e33360b39747472b887313e1d58d40449ed","observation_id":"c57ae881-6dc1-4bdb-9e09-32184778a402","resolution":{"observed_at":"2026-08-15T19:31:45.857169Z","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-15T19:31:46.569175Z","title":null,"venue":null,"work_id":"6f7bcfcc-463a-4131-a6d2-55976c1b7c11","year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.860325Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:9f12ac3567b9525fc56da4a110d8a239e9e3c959733d29b6f8dc8dda9c0e9056","observation_id":"de616ca2-3a2e-4bf4-bd41-81113285d108","resolution":{"observed_at":"2026-08-15T19:31:46.572507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.558829Z","title":null,"venue":null,"work_id":"65a393bb-16a0-4ce5-9f27-e8199c38ef44","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.863482Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:cc2cbab05039514e2fa5a67ada329086ea5fcf849faa2c57277b061425897957","observation_id":"094ffda6-ed60-4c6b-adb7-b00906c3e61d","resolution":{"observed_at":"2026-08-15T19:31:46.562087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.548510Z","title":null,"venue":null,"work_id":"c16aada2-54be-429b-ad2e-aa600b776fd1","year":2019},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.866955Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:f65b654f2cd2a6f60829efe512e1368cf50d85dae83e2b816bd58eff676f2504","observation_id":"cfbd30df-3ca6-4a0e-baa5-0fa6599984d3","resolution":{"observed_at":"2026-08-15T19:31:46.551885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.870488Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.870488Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:a5e382f21c8579a39ce4f1493d90683c0aff2adbaf63bcd1d4a283de6d362b76","observation_id":"997f95f4-8ba1-4ffb-b407-2050ad914edc","resolution":{"observed_at":"2026-08-15T19:31:45.870488Z","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-15T19:31:46.531733Z","title":null,"venue":null,"work_id":"e6c29598-44d2-4d09-b5de-6f5164ce042d","year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.873863Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:3dddfe6853ed89ae5d01f9fb772d5bb2434a6d2eecfa64758a93c2f8ff8e7e23","observation_id":"5b929d0a-528f-4b13-ba7e-f13549b65d39","resolution":{"observed_at":"2026-08-15T19:31:46.535631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.520393Z","title":null,"venue":null,"work_id":"ed8a2648-93e7-4b2d-b6f0-e1f6ef999801","year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.877510Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:3ac95cebd938b3cd814826c9f4cbe35c7dfa204f76fe63633b86ee331324bc70","observation_id":"a7b01451-3324-456a-8ab5-6df512863277","resolution":{"observed_at":"2026-08-15T19:31:46.524588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.509206Z","title":null,"venue":null,"work_id":"1479c6bf-4127-40a5-ac65-374017cabbcd","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.880658Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:027f5957b485283b4c468daa0723e9cab78e736df24aa4489b7ee072d811edf2","observation_id":"734fa178-f266-4f25-9fc7-d64f24b5e962","resolution":{"observed_at":"2026-08-15T19:31:46.513136Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.883957Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.883957Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:f83400963fe65e8e38ae904544e32c05a942b84c6c055aaa9d9aa0987ca8206a","observation_id":"3efc940c-0817-4d4a-912f-24d55298fe6c","resolution":{"observed_at":"2026-08-15T19:31:45.883957Z","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-15T19:31:45.887284Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.887284Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:aedb97415b0c45faad7682278a1d66daeaae9f2f7e444e005fdea1d03d8704f1","observation_id":"343877ef-e834-4b6d-974d-5a73ebf91312","resolution":{"observed_at":"2026-08-15T19:31:45.887284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18865","last_updated":"2024-02-29T05:27:45Z","snapshot_observed_at":"2026-08-16T14:14:17.655732Z","submitted_at":"2024-02-29T05:27:45Z","title":"Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18865","snapshot_observed_at":"2026-08-15T19:31:45.890490Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.890490Z"},"links":{"cited_paper":"/paper/2402.18865","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:d29ffecfb630a8174034b7fb1864d5ef8ce0d302ed234491cd0b98197c7f1c20","observation_id":"89fa8134-619e-4c66-9114-dc06363a3d01","resolution":{"observed_at":"2026-08-15T19:31:45.890490Z","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-15T19:31:45.894068Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.894068Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:5bb477366ea1a63e618cb76e259c072442722dfcac0e62899555a8bf7ea300ba","observation_id":"ffca3082-0cad-4563-a3bb-15d72fff56e3","resolution":{"observed_at":"2026-08-15T19:31:45.894068Z","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-15T19:31:46.493841Z","title":null,"venue":null,"work_id":"209e6001-4683-439d-b12a-569ea9c56411","year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.897196Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:fa743eab08d4771ff41be59e6f905995b38562f4e369839ac4787c5c41098e8e","observation_id":"7fc72af8-b4e2-47df-b007-de946efae97b","resolution":{"observed_at":"2026-08-15T19:31:46.497162Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.900368Z","title":null,"venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.900368Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:df58d62ba77cf649e045db0c3dfb9ee4adff03d7ae2aaf7c3d335e11beab2b46","observation_id":"4a262a7e-713f-4db1-bd69-b5fbe5fbd903","resolution":{"observed_at":"2026-08-15T19:31:45.900368Z","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-15T19:31:45.904108Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.904108Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:31fbb3338f02498093c26c700eb13058b27c1f6b4db6b2a5c8a490189a52188c","observation_id":"271724bd-457b-4b63-9682-1bc262afdb87","resolution":{"observed_at":"2026-08-15T19:31:45.904108Z","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-15T19:31:45.907287Z","title":"Logan IV, Eric Wallace, and Sameer Singh","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.907287Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:88c4d2e79db592c211410bf22ba0b77b7ffc0cc6f0f446cd46fbbbbd65725bde","observation_id":"5bda2dbf-e7e3-483e-a6c3-590b3105451e","resolution":{"observed_at":"2026-08-15T19:31:45.907287Z","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-15T19:31:46.478506Z","title":null,"venue":null,"work_id":"7be86f28-3095-4b34-ba60-1a018c175d6d","year":2012},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.910568Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:a280d656e5d5aa3a5589e3d58c319b73f0f5a6fb4b3e758bdf2f41f02b853bef","observation_id":"490beb2c-7dfe-4335-8a3b-3f19a55a00cb","resolution":{"observed_at":"2026-08-15T19:31:46.481762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:46.468657Z","title":null,"venue":null,"work_id":"c265f350-9180-4ea6-9cbd-bb9cce2d9084","year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.913628Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:9d5f72001a31b383a16c915e718f83bd5518160210eaaf2805897d19605e86f7","observation_id":"1fe9d177-3fe8-4c77-a4b7-ba64bb9a8a2e","resolution":{"observed_at":"2026-08-15T19:31:46.472030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.916740Z","title":"Le, Ed H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.916740Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:f611a41ef720132fc203e208e0ace3acb6681eb868b3a93f0b96ead3147f1c45","observation_id":"1586c3a0-6589-4dd1-b44e-a0b937b3fb15","resolution":{"observed_at":"2026-08-15T19:31:45.916740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-08-14T18:15:53.516440Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-15T19:31:45.919962Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.919962Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:4fd548c69ca973423741a9706b80fee00f4fe70dadcb9ff16241cc739bac1c3c","observation_id":"7cee1a38-c5a6-4b36-8b7f-5ada18703b50","resolution":{"observed_at":"2026-08-15T19:31:45.919962Z","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-15T19:31:45.923136Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.923136Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:368c95b50d4a3d191af22bbf4a67166189cc784715523faf32d1fc19a8fc32e4","observation_id":"fafc36a0-1079-4fdb-a0f5-123a6ce95a9f","resolution":{"observed_at":"2026-08-15T19:31:45.923136Z","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-15T19:31:46.452204Z","title":null,"venue":null,"work_id":"4b173fc3-cc61-428b-bb7f-492f1c72f21b","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.926112Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:edec41d28cdae4fb9e364ee024b897d87a0e10ea4767470941efcf0aeafbeb84","observation_id":"c85a1188-0e51-4cae-bb46-4d0b025a4c69","resolution":{"observed_at":"2026-08-15T19:31:46.455618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.929390Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.929390Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:c33c8cbb97a7c73dfda9e0dabe4e20a353f64f9f8fd7e863c5bf057fc6f1a111","observation_id":"0794c232-5134-4773-805b-17b955cff406","resolution":{"observed_at":"2026-08-15T19:31:45.929390Z","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-15T19:31:46.441316Z","title":"Le, Denny Zhou, and Xinyun Chen","venue":null,"work_id":"efd375d5-ae25-4bcb-ada4-ea84b1ed39ef","year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.932905Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:a37aaebbf42e8f216663a6ea27153503ca15ac7356c9acec2cfd9c6af6141380","observation_id":"3bec112d-0dfe-44be-ae1a-4dbf36229e10","resolution":{"observed_at":"2026-08-15T19:31:46.445207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.936244Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.936244Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:2078966ca47c50afde1c834df5250104fc5aa5581ffd7481282d938539792f42","observation_id":"cd2f1f92-3a52-4011-b491-5c459c6a696a","resolution":{"observed_at":"2026-08-15T19:31:45.936244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07496","last_updated":"2024-06-11T17:32:21Z","snapshot_observed_at":"2026-08-13T02:15:58.634561Z","submitted_at":"2024-06-11T17:32:21Z","title":"TextGrad: Automatic \"Differentiation\" via Text","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07496","snapshot_observed_at":"2026-08-15T19:31:45.939560Z","title":"differentiation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.939560Z"},"links":{"cited_paper":"/paper/2406.07496","citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:62502492830f803163765830797ae5d78ae23eb4acee49b06bb75c0980e2d3bb","observation_id":"a2555c2a-630c-4426-bea2-91fc1a15d667","resolution":{"observed_at":"2026-08-15T19:31:45.939560Z","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-15T19:31:46.423626Z","title":"Gonzalez","venue":null,"work_id":"dced2577-067d-462f-a58e-bcf11e15a7ae","year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.943296Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:ca498420338a506dac0cfa3138f22f1963419bb62cdef51585d335d5b0eaaee0","observation_id":"160d7530-86fe-496a-8da7-746c82caed49","resolution":{"observed_at":"2026-08-15T19:31:46.427698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T19:31:45.946396Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.946396Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:cf9ac93e44e4d099182cf94ac42bbbaaf2c129469e1bce0bd733dca61780e455","observation_id":"3c8831f7-84a3-44ee-8608-7958dec3dcf1","resolution":{"observed_at":"2026-08-15T19:31:45.946396Z","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-15T19:31:45.949488Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T19:31:45.949488Z"},"links":{"citing_paper":"/paper/2506.16389"},"observation_digest":"sha256:21cfea823225b5ca1545cb1a9f1fa24fba94c2ae68802497d6741b0c86cc6b95","observation_id":"8dbb3197-f4f8-4523-99e4-01cea3d4b12b","resolution":{"observed_at":"2026-08-15T19:31:45.949488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.16389","last_updated":"2025-06-19T15:19:56Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T21:26:43.754056Z","submitted_at":"2025-06-19T15:19:56Z","title":"RiOT: Efficient Prompt Refinement with Residual Optimization Tree"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":3,"verified_fuzzy":2},"total_outbound_references":58},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 1 inbound Pith citation observation for arXiv:2506.16389."}