{"as_of":"2026-08-12T03:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9cd4ca8ddbf3f1015269860c7813a839635331f465bc796da99913eb95af255d","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:57:57.351798Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.06689/citation-record","integrity":"/paper/2501.06689/integrity","json":"/paper/2501.06689/citation-record.json","paper":"/paper/2501.06689"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-06T23:27:24.356320Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-10T20:57:57.204584Z","title":"A survey of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.204584Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:987585809a327fb12d9e582ef03994372720500f1e141c4819becaed3dc36dd9","observation_id":"3f023041-1a13-40cf-9f97-8512b471c7d3","resolution":{"observed_at":"2026-08-10T20:57:57.204584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01910","last_updated":"2023-03-10T17:20:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-11-03T15:43:03Z","title":"Large Language Models Are Human-Level Prompt Engineers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01910","snapshot_observed_at":"2026-08-10T20:57:57.209794Z","title":"Large language models are human-level prompt engineers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.209794Z"},"links":{"cited_paper":"/paper/2211.01910","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:7da531cbcb0ee61260104f1a9e3818530598fbb5ba27c0e1a36695d8add14a0f","observation_id":"c8a47a52-bd68-49dc-bec2-5375490bf66d","resolution":{"observed_at":"2026-08-10T20:57:57.209794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.11890","last_updated":"2022-11-21T22:38:20Z","snapshot_observed_at":"2026-08-12T00:50:36.679683Z","submitted_at":"2022-11-21T22:38:20Z","title":"TEMPERA: Test-Time Prompting via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.11890","snapshot_observed_at":"2026-08-10T20:57:57.214519Z","title":"Tem- pera: Test-time prompting via reinforcement learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.214519Z"},"links":{"cited_paper":"/paper/2211.11890","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:545299c06ee2fcb8b92052c2cc8aff5c74a7fbc9344274232ea39575879b45c4","observation_id":"db62fc0d-8277-4df0-928e-0e4ee1865dc4","resolution":{"observed_at":"2026-08-10T20:57:57.214519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.01975","last_updated":"2022-09-05T14:01:15Z","snapshot_observed_at":"2026-08-12T00:49:57.766433Z","submitted_at":"2022-09-05T14:01:15Z","title":"Selective Annotation Makes Language Models Better Few-Shot Learners","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.01975","snapshot_observed_at":"2026-08-10T20:57:57.219130Z","title":"Selective annota- tion makes language models better few-shot learners,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.219130Z"},"links":{"cited_paper":"/paper/2209.01975","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:9c8b07421edb971d1df10d1f9a41b54b4ebb5a2c94b591b74d67117bfc685583","observation_id":"ce491cec-002a-4be4-9849-791a67f5aeb8","resolution":{"observed_at":"2026-08-10T20:57:57.219130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03493","last_updated":"2022-10-07T12:28:21Z","snapshot_observed_at":"2026-07-06T14:01:50.333970Z","submitted_at":"2022-10-07T12:28:21Z","title":"Automatic Chain of Thought Prompting in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03493","snapshot_observed_at":"2026-08-10T20:57:57.223686Z","title":"Automatic chain of thought prompting in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.223686Z"},"links":{"cited_paper":"/paper/2210.03493","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:91b00ef858c77952a2f87650cf39ed05385f5288ae0de132b87d52a2d476b3cb","observation_id":"a5015de3-dd5c-46fa-924a-474c8af93ccd","resolution":{"observed_at":"2026-08-10T20:57:57.223686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16797","last_updated":"2023-09-28T19:01:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T19:01:07Z","title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16797","snapshot_observed_at":"2026-08-10T20:57:57.228068Z","title":"Promptbreeder: Self-referential self-improvement via prompt evolution,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.228068Z"},"links":{"cited_paper":"/paper/2309.16797","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:e61beff0b457d8fd5bab15a927c5aa87168ecad8396883819873d83aff9d826e","observation_id":"7dbaf967-916d-481c-bd3a-7dc686e5df20","resolution":{"observed_at":"2026-08-10T20:57:57.228068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11589","last_updated":"2023-10-17T21:11:21Z","snapshot_observed_at":"2026-07-06T16:34:42.650324Z","submitted_at":"2023-10-17T21:11:21Z","title":"Eliciting Human Preferences with Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11589","snapshot_observed_at":"2026-08-10T20:57:57.232588Z","title":"Eliciting human preferences with language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.232588Z"},"links":{"cited_paper":"/paper/2310.11589","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:2ad1c4036aadababdc793c5843d2ee1296a884c0e67e4fabc71a0a92a8b00c2e","observation_id":"3b9de0e8-0556-425d-a29f-0dc540e73cbe","resolution":{"observed_at":"2026-08-10T20:57:57.232588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08429","last_updated":"2024-01-16T15:16:34Z","snapshot_observed_at":"2026-08-12T00:50:32.028447Z","submitted_at":"2024-01-16T15:16:34Z","title":"Machine Translation with Large Language Models: Prompt Engineering for Persian, English, and Russian Directions","version":1},"cited_work":{"arxiv_id":"2401.08429","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.08429","snapshot_observed_at":"2026-08-10T20:57:57.844873Z","title":"Machine Translation with Large Language Models: Prompt Engineering for Persian, English, and Russian Directions","venue":"cs.CL","work_id":"6264de55-732c-4bf4-b60f-be31e73d5263","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.236585Z"},"links":{"cited_paper":"/paper/2401.08429","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:1457c7df30b632c128d945942f32137ed7920fbb1c6b4b0cc803180eb7123f74","observation_id":"cdab32b4-89be-4f94-a7ed-5b2fe2c5ec82","resolution":{"observed_at":"2026-08-10T20:57:57.851676Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:58.060071Z","title":"Learning to solve arithmetic word problems with verb categorization,","venue":null,"work_id":"2a1fb545-b0d7-4326-9337-fdf0f54ae0b7","year":2014},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.240723Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:cb5ad602798ea2912aeffad122eb0ce3040b21a66db69bf8eb494c26be5680c0","observation_id":"bed22a47-5f96-4ab6-9e0a-db937800109c","resolution":{"observed_at":"2026-08-10T20:57:58.064779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.01413","last_updated":"2016-08-20T11:50:41Z","snapshot_observed_at":"2026-08-09T10:12:36.401845Z","submitted_at":"2016-08-04T01:47:23Z","title":"Solving General Arithmetic Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.01413","snapshot_observed_at":"2026-08-10T20:57:57.244666Z","title":"Solving general arithmetic word problems,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.244666Z"},"links":{"cited_paper":"/paper/1608.01413","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:19ec3cadee4d0df68e10555eeb2ec22c724f49a458ce661ef037f2ffb2d8b7c4","observation_id":"e0585452-8361-4a80-990e-73c4e9183963","resolution":{"observed_at":"2026-08-10T20:57:57.244666Z","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-10T20:57:58.047698Z","title":"Parsing algebraic word problems into equations,","venue":null,"work_id":"13ec43e6-f665-405c-a4d2-de23730bcb5e","year":2015},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.248843Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:24fee1aa076ec0ed49a8cb813ac1980fcd4148d16956a3af591e8388c7495940","observation_id":"4d3068c4-0f41-48ba-8e69-1626d8eedadd","resolution":{"observed_at":"2026-08-10T20:57:58.051959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.07191","last_updated":"2021-04-15T06:11:12Z","snapshot_observed_at":"2026-08-07T13:11:17.300265Z","submitted_at":"2021-03-12T10:23:47Z","title":"Are NLP Models really able to Solve Simple Math Word Problems?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.07191","snapshot_observed_at":"2026-08-10T20:57:57.253032Z","title":"Are nlp models really able to solve simple math word problems?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.253032Z"},"links":{"cited_paper":"/paper/2103.07191","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:975939b1831803b236141bf14c6af2a7ed729376cf299d1366f67c8f86e354dc","observation_id":"786ec855-78fc-49bf-8966-0defde8d8956","resolution":{"observed_at":"2026-08-10T20:57:57.253032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","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-10T20:57:57.257834Z","title":"Training verifiers to solve math word problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.257834Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:11322d7ad58e272523c3bfec26888d6c02bc3cf0f9ae64dee8e403925757b486","observation_id":"f1ab0ca7-4e95-4206-a6a9-7073807e8e8a","resolution":{"observed_at":"2026-08-10T20:57:57.257834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09261","last_updated":"2022-10-17T17:08:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-17T17:08:26Z","title":"Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09261","snapshot_observed_at":"2026-08-10T20:57:57.261868Z","title":"Challenging big-bench tasks and whether chain-of-thought can solve them,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.261868Z"},"links":{"cited_paper":"/paper/2210.09261","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:c8b155fd462dffa914fcd1bea836e51284842e12c777697c09f83d033c7225c1","observation_id":"0df76838-29dd-462a-9686-812e9eef82e6","resolution":{"observed_at":"2026-08-10T20:57:57.261868Z","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-10T20:57:57.265588Z","title":"Chain-of-thought prompting elicits reasoning in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.265588Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:752d8cade921f594854a892e2daefdc95e7defe0cc5bf65b9713c57d912201a3","observation_id":"9f618c1d-46b5-4f77-9c70-c9f6d7af3caf","resolution":{"observed_at":"2026-08-10T20:57:57.265588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05661","last_updated":"2024-07-03T01:29:20Z","snapshot_observed_at":"2026-07-06T16:45:24.070954Z","submitted_at":"2023-11-09T08:00:32Z","title":"Prompt Engineering a Prompt Engineer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.05661","snapshot_observed_at":"2026-08-10T20:57:57.269171Z","title":"Prompt engineering a prompt engineer,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.269171Z"},"links":{"cited_paper":"/paper/2311.05661","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:8c1565bcb96639b0bc40b0718c11fd28ca78400b5244cbf22cce9d7696867840","observation_id":"48bd574a-f133-46a3-a46f-b376c212ff4a","resolution":{"observed_at":"2026-08-10T20:57:57.269171Z","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-10T20:57:58.026972Z","title":"Gpt-3.5 turbo model documentation,","venue":null,"work_id":"05936f31-dc20-46c1-8e8d-d53863ecfd86","year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.273042Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:42306c56be9a0d09bb493bbc023966721793e164d28a9a5500c21b30d513dfee","observation_id":"e86a117e-311d-4541-98d8-2363c75d15d9","resolution":{"observed_at":"2026-08-10T20:57:58.031212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-10T20:57:57.276383Z","title":"Gpt-4o system card,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.276383Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:c7fc7f7392182515e885af70a3de735506d3aad0ef4bfaaff9300fb0bc85c640","observation_id":"2b8c105a-0ff5-45c0-bdab-efbbc9bef7b3","resolution":{"observed_at":"2026-08-10T20:57:57.276383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-10T20:57:57.280108Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.280108Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:172a84c9513fe0f791ecce486a0a762585243b72b626860c50934480c3c0ef97","observation_id":"5ea3741b-e87c-4291-8d84-3a1445c427f5","resolution":{"observed_at":"2026-08-10T20:57:57.280108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-10T20:57:57.283958Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.283958Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:bf4235835d3fcb9db824b3f61bea44c990bda02a4eead364f9c2ccc7e99da9a0","observation_id":"438feaf7-c3a7-4a58-a5fa-27e19e30d9c5","resolution":{"observed_at":"2026-08-10T20:57:57.283958Z","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-10T20:57:57.287798Z","title":"Language models are unsupervised multitask learners,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.287798Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:d8ee7a8acd4548c611d8ff0c16752e2197254ca02c8d0d6d8bf6bd44bcddb6ab","observation_id":"930562fb-262f-4fe2-9576-9fe6b792d7e0","resolution":{"observed_at":"2026-08-10T20:57:57.287798Z","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-10T20:57:58.005410Z","title":"Agentir: 1st workshop on agent-based information retrieval,","venue":null,"work_id":"48dea646-9757-4dd4-925d-7fc4c969041f","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.291646Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:d46a7219a69bf0e27e93aeeaac38e05e6de05e4ae4c51520f22240691b04533c","observation_id":"a9e0e4b7-baae-4226-9d20-5b52840e2e83","resolution":{"observed_at":"2026-08-10T20:57:58.009674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15450","last_updated":"2023-12-24T10:14:44Z","snapshot_observed_at":"2026-08-03T17:43:30.370443Z","submitted_at":"2023-12-24T10:14:44Z","title":"Agent4Ranking: Semantic Robust Ranking via Personalized Query Rewriting Using Multi-agent LLM","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.15450","snapshot_observed_at":"2026-08-10T20:57:57.295476Z","title":"Agent4ranking: Semantic robust ranking via personalized query rewrit- ing using multi-agent llm,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.295476Z"},"links":{"cited_paper":"/paper/2312.15450","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:397fb96588b9695f5c089b1307905c6f676800d2358579e85dd60d66313001b7","observation_id":"1763a815-8c84-44a2-81bf-285f7fcb0fe9","resolution":{"observed_at":"2026-08-10T20:57:57.295476Z","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-10T20:57:57.299393Z","title":"Bridging relevance and reasoning: Rationale distillation in retrieval-augmented generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.299393Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:85b54fd3491ccc38fe7304b749a85f4f7e83593c50524eb22f8b54f49ebdf0f9","observation_id":"389c37ed-4bab-477c-927d-682f32cbeb24","resolution":{"observed_at":"2026-08-10T20:57:57.299393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14702","last_updated":"2024-10-31T09:08:48Z","snapshot_observed_at":"2026-07-06T18:18:43.328203Z","submitted_at":"2024-05-23T15:37:06Z","title":"G3: An Effective and Adaptive Framework for Worldwide Geolocalization Using Large Multi-Modality Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14702","snapshot_observed_at":"2026-08-10T20:57:57.303315Z","title":"G3: an effective and adaptive framework for worldwide geolocalization using large multi-modality models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.303315Z"},"links":{"cited_paper":"/paper/2405.14702","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:25ea78fc55371c2f10f284e61fd5c8d5a3054afc8ab4ede1a30c8b6b9f32b204","observation_id":"ccfd6b27-d8c3-4228-ae77-6c1767a7117e","resolution":{"observed_at":"2026-08-10T20:57:57.303315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17250","last_updated":"2024-12-23T03:49:00Z","snapshot_observed_at":"2026-08-11T05:37:51.167307Z","submitted_at":"2024-12-23T03:49:00Z","title":"SyNeg: LLM-Driven Synthetic Hard-Negatives for Dense Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17250","snapshot_observed_at":"2026-08-10T20:57:57.307405Z","title":"Syneg: Llm-driven synthetic hard-negatives for dense retrieval,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.307405Z"},"links":{"cited_paper":"/paper/2412.17250","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:14775b77748435fb158fbe4a1d269f39af36a31a0ca428785381af690a0ebfdb","observation_id":"bc09719e-d048-4440-9ccb-1908200242bd","resolution":{"observed_at":"2026-08-10T20:57:57.307405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19056","last_updated":"2024-03-28T06:49:56Z","snapshot_observed_at":"2026-08-12T01:37:04.578059Z","submitted_at":"2023-10-29T16:04:10Z","title":"MILL: Mutual Verification with Large Language Models for Zero-Shot Query Expansion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19056","snapshot_observed_at":"2026-08-10T20:57:57.311452Z","title":"Mill: Mutual verification with large language models for zero-shot query expansion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.311452Z"},"links":{"cited_paper":"/paper/2310.19056","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:5a478f7e3dad82ecf5c800543f2be0983e8f33f2a9d44843cead8c08db111dec","observation_id":"1d934965-6c4f-4ad8-a2d9-08fe42313ac8","resolution":{"observed_at":"2026-08-10T20:57:57.311452Z","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-10T20:57:57.992253Z","title":"When moe meets llms: Parameter efficient fine-tuning for multi-task medical applications,","venue":null,"work_id":"58d8bd15-1cda-4d73-ac4e-713bad7db694","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.315684Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:a739180e00f84884e5d5b97b0723ae9410f71f9090920f07f76726068fcc7e92","observation_id":"0b4af15d-f18e-4548-b6fa-8d6ef921e42e","resolution":{"observed_at":"2026-08-10T20:57:57.996449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:57.979737Z","title":"Llm-esr: Large language models enhancement for long-tailed sequential recommendation,","venue":null,"work_id":"d9f69813-a85c-4b51-8131-f9a38c9ba343","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.319691Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:b4a4ddb33a8ed8a059a24fda7324c8548af2f0097dc32cb8ee9341420ed32aa5","observation_id":"5bf60ac7-6766-4ef2-ab7a-89867eb8baae","resolution":{"observed_at":"2026-08-10T20:57:57.984358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:57.967807Z","title":"Hamur: Hyper adapter for multi-domain recommendation,","venue":null,"work_id":"599f3974-06a0-474c-91bf-4e41e02c999a","year":2023},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.323852Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:d647b48c277e9592754efff76fd76a6e41f9500105991d7814e256e706a59e49","observation_id":"2c29968a-5eae-4828-90a6-26bbadba1325","resolution":{"observed_at":"2026-08-10T20:57:57.971827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:57.955142Z","title":"Hierrec: Scenario-aware hierarchical modeling for multi-scenario recommendations,","venue":null,"work_id":"95dc3942-418b-462a-88a1-3726d60388db","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.327719Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:ae40b43836be913f69c9f857ff83861b9ca2a283d5fe2ea89983510fd37e9140","observation_id":"1157c6b6-1827-454e-a222-8a3fe8c5164b","resolution":{"observed_at":"2026-08-10T20:57:57.959671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:57.941649Z","title":"D3: A methodological exploration of domain division, modeling, and balance in multi-domain recommendations,","venue":null,"work_id":"29db5af6-4957-4969-95b6-5182b5a2fa82","year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.331530Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:44099d95a234bbe01250e0feb176903096ce4cb99f3eb35500f949b99dedc60b","observation_id":"55ad6b5a-3c81-4e23-b1c6-a38b55424f89","resolution":{"observed_at":"2026-08-10T20:57:57.946284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T20:57:57.335312Z","title":"Scenario-wise rec: A multi-scenario recommendation benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.335312Z"},"links":{"citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:a3cebb8d11e5cdb9d994a4186d0d2a9281d0d879f10b9ee70b1c4600fe42feee","observation_id":"5c93207a-a107-43aa-b548-b6075042177b","resolution":{"observed_at":"2026-08-10T20:57:57.335312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13432","last_updated":"2025-03-10T08:49:00Z","snapshot_observed_at":"2026-08-11T13:05:44.284951Z","submitted_at":"2024-12-18T02:07:21Z","title":"Large Language Model Enhanced Recommender Systems: A Survey","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13432","snapshot_observed_at":"2026-08-10T20:57:57.339073Z","title":"Large language model enhanced recommender systems: Taxonomy, trend, application and future,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.339073Z"},"links":{"cited_paper":"/paper/2412.13432","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:350975f8b212c6c2c1cf06b749f74de613a9227e996e64c4a5e181156fad5eb2","observation_id":"93b1f11d-d6f7-415c-9b9a-7d7733184e1e","resolution":{"observed_at":"2026-08-10T20:57:57.339073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16984","last_updated":"2024-12-22T12:00:04Z","snapshot_observed_at":"2026-08-12T01:37:22.960898Z","submitted_at":"2024-12-22T12:00:04Z","title":"LLM-Powered User Simulator for Recommender System","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16984","snapshot_observed_at":"2026-08-10T20:57:57.343470Z","title":"Llm-powered user simulator for recommender system,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.343470Z"},"links":{"cited_paper":"/paper/2412.16984","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:2e7796810d01a1a148e8ae98951dfcb86de521cb22939bf7dc6dd7eeef508c14","observation_id":"c4805968-4bf5-4b99-887c-d574c4096d86","resolution":{"observed_at":"2026-08-10T20:57:57.343470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12548","last_updated":"2022-10-22T15:21:46Z","snapshot_observed_at":"2026-08-04T09:47:52.854204Z","submitted_at":"2022-05-25T07:50:31Z","title":"RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12548","snapshot_observed_at":"2026-08-10T20:57:57.347711Z","title":"Rlprompt: Optimizing discrete text prompts with reinforcement learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.347711Z"},"links":{"cited_paper":"/paper/2205.12548","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:b070b51ff9a30aabf18a28c37d186c61b5e11538bee5fa62809e284e38f1c620","observation_id":"578c3166-080e-4c40-b478-5d9a0c485158","resolution":{"observed_at":"2026-08-10T20:57:57.347711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03921","last_updated":"2024-03-08T12:23:56Z","snapshot_observed_at":"2026-08-10T15:53:33.689870Z","submitted_at":"2024-02-06T11:44:06Z","title":"Large Language Models to Enhance Bayesian Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03921","snapshot_observed_at":"2026-08-10T20:57:57.351798Z","title":"Large language models to enhance bayesian optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T20:57:57.351798Z"},"links":{"cited_paper":"/paper/2402.03921","citing_paper":"/paper/2501.06689"},"observation_digest":"sha256:bc08685a0d5985995f7a6f5835eba13bf6e46f2807de174278d30e9c730f01e1","observation_id":"13e9e4b2-5e41-4ea5-a9b3-af2e065d6df2","resolution":{"observed_at":"2026-08-10T20:57:57.351798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.06689","last_updated":"2025-02-26T16:36:55Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T00:50:17.190030Z","submitted_at":"2025-01-12T02:43:59Z","title":"TAPO: Task-Referenced Adaptation for Prompt Optimization"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":37},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2501.06689."}