{"as_of":"2026-08-06T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c36784369450c51b304ecb0a93d9211fce6ffebfd264017cb0c27352dd72db6","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T05:25:38.967645Z","state":"measured"},{"denominator":97,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":97,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2605.14055/citation-record","integrity":"/paper/2605.14055/integrity","json":"/paper/2605.14055/citation-record.json","paper":"/paper/2605.14055"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"International conference on machine learning , pages=","venue":null,"work_id":"b0afdc1a-933a-4632-8573-7d9369733159","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:813d78f89ff74234b66b783b710f2270c1d220922933aa1a1f75255cf06cfd9e","observation_id":"bcf55b7a-04e6-4b4f-998e-c6873fe1976b","resolution":{"observed_at":"2026-05-15T05:30:05.486646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c30f71f5-c2f5-4aa0-ab94-964798d41ffd","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:e3a685940e067c256c431a8292d94276e4a9b7a0d7c226a53f0141b3a07ccf85","observation_id":"5417c59d-8c30-4009-8689-c69f3eed8c42","resolution":{"observed_at":"2026-05-15T05:30:05.496614Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages=","venue":null,"work_id":"78866b2d-199c-4f39-bbee-b29ec1cae08d","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:b9c719f8b4f14b03bef6d4023b8d76be86e64dc3db471340ca0ac00718acba47","observation_id":"482ed2ff-05cf-4cc6-82a0-d32de5f3a28b","resolution":{"observed_at":"2026-05-15T05:30:05.481788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2024.findings-emnlp.956","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"H yper L o RA : Efficient Cross-task Generalization via Constrained Low-Rank Adapters Generation","venue":null,"work_id":"960c86ea-b25e-4898-9d4c-823c9a6372ad","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:a93dba0bb47aa627f0de235ea0deda46c7776ee925c373ed85b1f55635b4b50d","observation_id":"b32d3681-6d31-47da-b400-1cfcfdcc0bab","resolution":{"observed_at":"2026-05-15T05:29:46.597247Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13269","last_updated":"2024-08-19T03:31:19Z","snapshot_observed_at":"2026-07-06T15:58:08.777051Z","submitted_at":"2023-07-25T05:39:21Z","title":"LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Composition","version":3},"cited_work":{"arxiv_id":"2307.13269","doi":"10.48550/arxiv.2307.13269","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.13269","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Huang, Q","venue":"arXiv (Cornell University)","work_id":"66ee831a-2b33-423d-87ec-ba52b341a21b","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2307.13269","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:64ea9bae3be8832d2de19324d9142c9e30dc808f8e82da98de062adf756d344e","observation_id":"438803ec-618f-4807-ad0c-39e237afe02b","resolution":{"observed_at":"2026-05-15T05:29:48.367727Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-23T21:53:05.128527+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T21:53:05.128527+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06105","last_updated":"2025-06-09T14:19:59Z","snapshot_observed_at":"2026-08-06T10:27:37.564201Z","submitted_at":"2025-06-06T14:11:27Z","title":"Text-to-LoRA: Instant Transformer Adaption","version":2},"cited_work":{"arxiv_id":"2506.06105","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.06105","snapshot_observed_at":"2026-07-07T18:44:06.124049Z","title":"Charakorn, E","venue":"cs.LG","work_id":"44dc8a61-cd57-47bf-a6a2-6878117791b9","year":2025},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2506.06105","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:03a6ab1ca1a968c6f6a5531e323d8f7a197a2406850ac1870afd27af8303adf2","observation_id":"552f58d2-94eb-4d68-95ca-4d1e462ada64","resolution":{"observed_at":"2026-05-15T05:29:48.373780Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T14:52:36.643594Z","title":"Findings of the Association for Computational Linguistics: EMNLP 2024 , pages=","venue":null,"work_id":"91c5029e-2479-47e5-94ab-2a607c4ff264","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:6cbbf8e17e2bc166233abd8e654818de3c7c70bf63dd80149983bd2324e9e373","observation_id":"5d5daea2-e85d-4209-a112-9e5220114399","resolution":{"observed_at":"2026-05-15T05:30:05.491655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"847e5ee0-cc86-44de-9353-7452b50caf1b","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:4345f46aba8cf72d4207d6fd0816d28e04a34a61ecd1f649c991327e8cbacd39","observation_id":"17a0a289-389d-4dbb-88b1-19381c55542b","resolution":{"observed_at":"2026-05-15T05:30:05.501348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , pages=","venue":null,"work_id":"9aa31cb0-9868-4213-ae0a-12a4dfcf2704","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:993ccfc8c9b0c231237b418d6c8b84757e42b64cf49c6dcd9e5bbb36d590468d","observation_id":"45aaa30a-adc1-431a-98c6-95c8109a7e84","resolution":{"observed_at":"2026-05-15T05:30:05.476928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06252","last_updated":"2025-01-24T01:26:30Z","snapshot_observed_at":"2026-08-06T13:31:06.533573Z","submitted_at":"2025-01-09T01:19:21Z","title":"Transformer-Squared: Self-adaptive LLMs","version":3},"cited_work":{"arxiv_id":"2501.06252","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06252","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2501.06252 , year=","venue":null,"work_id":"a0aa3095-6438-4f73-8ab6-4a654d9bbcd2","year":2025},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2501.06252","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:935c6559fac4f19a3b2da6cbe946a52f42ccad2a80bc995095350c68897abbdf","observation_id":"289da9f5-9e17-4418-af58-3d48ad312157","resolution":{"observed_at":"2026-05-15T05:29:48.294981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01411","last_updated":"2024-08-25T09:39:23Z","snapshot_observed_at":"2026-08-06T12:12:43.075500Z","submitted_at":"2024-07-01T16:00:53Z","title":"HyperLoader: Integrating Hypernetwork-Based LoRA and Adapter Layers into Multi-Task Transformers for Sequence Labelling","version":3},"cited_work":{"arxiv_id":"2407.01411","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01411","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.01411 , year=","venue":null,"work_id":"49ce4f70-7863-4daa-9d36-6e18553c8a10","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2407.01411","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:8ca3a9a6d86690fa113882a7b04fb59287a980bb1b9d6c7587fb4a06adb5f8f8","observation_id":"7f73c780-1a90-4937-97da-496f7c808946","resolution":{"observed_at":"2026-05-15T05:29:48.097347Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":"2e1d53a1-963d-4ac5-93c7-ce68fcb79bfc","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:4ec62648714146a1e906f77e4bc282b8a48babde0354cdf946a22b0be1dfbe8b","observation_id":"05f01c5c-48f2-405a-9155-16cd86309858","resolution":{"observed_at":"2026-05-15T05:35:05.832672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Fourteenth International Conference on Learning Representations , year =","venue":null,"work_id":"8601157d-b233-4dfa-893d-a54ec668df35","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:03942feb0e94ad789e83c96646e969eb777833c69952086d21e344bfe51a725d","observation_id":"8ad1179f-6cb5-4865-952e-9917dab30ab0","resolution":{"observed_at":"2026-05-15T05:35:05.877636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"a9523e15-c69b-457a-86a6-b142b15bf7e4","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:7fed2fe9a65adda7a50fbfbc9a5817ce6b344c6027a5ebaccda78a826af7ea84","observation_id":"e573403e-bbad-4022-bd58-4e79cb0e895c","resolution":{"observed_at":"2026-05-15T05:35:05.885085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"IEEE transactions on pattern analysis and machine intelligence , volume=","venue":null,"work_id":"c14ba181-f89c-4f3f-9cbc-56c36c6f3d05","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2c3d42ceacda3be706a61060775cd3f07668c68118ca3c68af83f8814ea67c68","observation_id":"6af73287-38fe-4a0f-8a50-735787ac7f3b","resolution":{"observed_at":"2026-05-15T05:35:05.827571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00537","last_updated":"2020-02-13T00:28:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-05-02T00:41:50Z","title":"SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems","version":3},"cited_work":{"arxiv_id":"1905.00537","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.00537","snapshot_observed_at":"2026-07-03T17:58:46.542639Z","title":"SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems","venue":"cs.CL","work_id":"54fdcd2d-ade5-4d5e-9b37-8d75abcbaae2","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1905.00537","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c71e91b560d30ea3f478a87c4c94c6e69af5a4b7ec37516f2d8f956a64a8582e","observation_id":"a7d2df73-c1fa-4269-8a5f-fd44bef71aed","resolution":{"observed_at":"2026-05-15T05:29:48.296815Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T14:06:16.682435Z","title":"Proceedings of the International Conference on Learning Representations (ICLR) , year=","venue":null,"work_id":"9fc03996-1ca4-4c37-9b48-66c12a36bb17","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:216b61c8de9ce4596013609f6beddd509b7e590c41ec0bd3be3e04887376bb95","observation_id":"3bb1e569-1ca3-4987-b0ea-0f335e80eb18","resolution":{"observed_at":"2026-05-15T05:35:05.896872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"and Ng, Andrew and Potts, Christopher","venue":null,"work_id":"46843f77-1dd7-4201-b379-c523a2c44660","year":2013},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:8f7fefd3ae2f91e2128c762f74f7b1decede5dbaaa63adbda73761d70fc67a9f","observation_id":"9840d736-da0a-4e6e-a705-34e32f834821","resolution":{"observed_at":"2026-05-15T05:35:05.888741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"c5f85459-e0c2-4447-823b-d3b2b76a2dbb","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:1ac40117989327b09f0dc5b0df30ab3ae282e2af50ba777bb77add06974b9567","observation_id":"e4f3416a-6f01-4306-afe2-9f6f11b1e3f7","resolution":{"observed_at":"2026-05-15T05:35:05.850297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-04T15:46:25.710484Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:203fdc41afecf8374964b44b043f60fa18c40c958d222657d91fdc39d146d4fb","observation_id":"519323ed-fc38-4a2b-b1dc-14b280f26e96","resolution":{"observed_at":"2026-05-15T05:29:48.291485Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/p17-1099","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Liu, and Christopher D","venue":null,"work_id":"a1a1cd4a-ba74-4ac0-af55-001f180ad173","year":2017},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c38a67efc09e1badc433ee68df051810f07ed9e05378b9fc07568625ae6870a3","observation_id":"e0b42042-7357-433f-9065-620fc81d3ef8","resolution":{"observed_at":"2026-05-15T05:29:46.615085Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-14T17:50:52.50407+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T17:50:52.50407+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09700","last_updated":"2019-11-04T20:37:33Z","snapshot_observed_at":"2026-07-06T08:31:12.309726Z","submitted_at":"2019-10-21T23:57:32Z","title":"Quantifying the Carbon Emissions of Machine Learning","version":2},"cited_work":{"arxiv_id":"1910.09700","doi":"10.48550/arxiv.1910.09700","metadata_source":"pith","pith_arxiv_id":"1910.09700","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantifying the Carbon Emissions of Machine Learning","venue":"cs.CY","work_id":"7bc98d11-b344-40f2-b27f-2e08a08d1b95","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1910.09700","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:b43ac53c7133497d3d784af54caab9deee1829d8e18280e4c75e2084de87e932","observation_id":"7d4e083a-c42f-4418-aa07-fa748ed758e0","resolution":{"observed_at":"2026-05-15T05:52:44.534862Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"8966e3f4-04b0-448a-8d1a-b88c93769560","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:54fb7b5e6b9c9e1fb3617ee640c1170f23e3919feb3d6f3141cb6b4ffe49300b","observation_id":"8ba3270e-441a-4142-80d1-6f7b703f069d","resolution":{"observed_at":"2026-05-15T05:35:05.862123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages=","venue":null,"work_id":"ee47c500-1da1-497a-9531-992bdb84bd30","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:f61141f0e37f27f3cc894dc34bb6da029915a1b0d975624714ff084ba821303f","observation_id":"bc424473-998e-4bd9-8525-9b7b508b6c29","resolution":{"observed_at":"2026-05-15T05:35:05.872590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"978a031a-97e4-4ba9-9c1f-14baa27615de","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2af55414e71a3c14d4da345410c480082c4d687f58704636a67fad3fdf3dc3ed","observation_id":"d04859c5-ed0e-4430-893d-164863b8a93c","resolution":{"observed_at":"2026-05-15T05:35:05.868164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages=","venue":null,"work_id":"0ad4dadb-21c7-4982-a23f-06cc2aafdc06","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:5bae6e2363a3921839b427ffcd9e9f7a63bc45d3d4b7aa3c37fb7b2dd3ed0970","observation_id":"1a94ef4e-1345-46de-bade-e382727810ac","resolution":{"observed_at":"2026-05-15T05:35:05.846169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (ACL) , pages=","venue":null,"work_id":"f09cbb65-543a-4460-ae09-7c31065e3b21","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:ea07b48ca906b1434da0fca2e591187d8489c6898f32887f706279f4c6e5a5ed","observation_id":"17ea8872-d122-4d2f-b377-3e0438105e6d","resolution":{"observed_at":"2026-05-15T05:35:05.858107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":"1803.05457","doi":"10.1162/tacl_a_00448.https://aclanthology.org/2022.tacl-1.5","metadata_source":"pith","pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","venue":"cs.AI","work_id":"28ea1282-d657-4c61-a83c-f1249be6d6b1","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:9cc3c6bb9548297afd8d00629dd1e83ae2349ab5939f7db01394cbe546475893","observation_id":"05af8d05-7f76-4e84-b8c8-51d4bce3bd40","resolution":{"observed_at":"2026-05-15T05:29:48.267187Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11127","last_updated":"2026-05-31T18:23:52Z","snapshot_observed_at":"2026-07-06T15:18:30.127408Z","submitted_at":"2023-04-21T17:02:38Z","title":"Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance","version":5},"cited_work":{"arxiv_id":"2304.11127","doi":"10.48550/arxiv.2304.11127","metadata_source":"pith","pith_arxiv_id":"2304.11127","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Watanabe, Tree-structured parzen estimator: Understanding its al- gorithm components and their roles for better empirical performance (2023)","venue":"cs.LG","work_id":"597aa187-6f49-4d69-95d6-1ef98e0b8f7c","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2304.11127","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c9b6703c291c738c844adb5e4c421fc29a0256de528d939ea81431db374b64c7","observation_id":"02909fa4-9b8e-40f9-b499-fcd1dde57e5e","resolution":{"observed_at":"2026-06-02T03:03:57.525930Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-11T23:49:47.333696+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T23:49:47.333696+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03248","last_updated":"2023-12-06T02:47:56Z","snapshot_observed_at":"2026-07-06T16:57:34.388852Z","submitted_at":"2023-12-06T02:47:56Z","title":"Customizable Combination of Parameter-Efficient Modules for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"2312.03248","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.03248","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2312.03248 , year=","venue":null,"work_id":"b264b4e9-cd26-4c6c-96df-20a56c5ec0d5","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2312.03248","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:4fda643f9bd217978a01bad8b435bc471ac7f41231c8614d274f5fcc678509fa","observation_id":"3e62ada4-2b7f-45db-8bc7-8dcdc53d1213","resolution":{"observed_at":"2026-05-15T05:29:48.313903Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00055","last_updated":"2017-07-31T20:12:06Z","snapshot_observed_at":"2026-08-04T03:50:51.013049Z","submitted_at":"2017-07-31T20:12:06Z","title":"SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluation","version":1},"cited_work":{"arxiv_id":"1708.00055","doi":null,"metadata_source":"pith","pith_arxiv_id":"1708.00055","snapshot_observed_at":"2026-07-04T20:00:08.867761Z","title":"SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluation","venue":"cs.CL","work_id":"b884e540-64cb-4ba2-8bc3-ed507116ef2c","year":2017},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1708.00055","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:e73a9d5a7cc4a4ee2e072b54ffefb4eca1ebe2786dcd5ff6b5e4c882bf16839d","observation_id":"f0516c93-6977-4afe-9865-c6827b4b2b8e","resolution":{"observed_at":"2026-05-15T05:29:48.362326Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":"2302.13971","doi":"10.48550/arxiv.2302.13971","metadata_source":"pith","pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LLaMA: Open and Efficient Foundation Language Models","venue":"cs.CL","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:715981d7beb3e196222b8988686206be9d9d428b5bfa1fb21a440a5a7d901f17","observation_id":"741efc66-d360-4219-b007-059e8eb72c4f","resolution":{"observed_at":"2026-05-15T05:29:48.278482Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12471","last_updated":"2019-10-01T18:41:05Z","snapshot_observed_at":"2026-07-06T06:42:15.167440Z","submitted_at":"2018-05-31T13:52:06Z","title":"Neural Network Acceptability Judgments","version":3},"cited_work":{"arxiv_id":"1805.12471","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.12471","snapshot_observed_at":"2026-07-09T21:16:34.237758Z","title":"Neural Network Ac- ceptability Judgments","venue":"cs.CL","work_id":"ee6536e2-986a-4e85-877b-cd6cf6b9219e","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1805.12471","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:7f9c8bdcdfee0341752036f3d44b424ea0d6a3742f6ca24486dca8f6715ba39b","observation_id":"3e71d4bb-e23e-4504-ae70-71ccab984c87","resolution":{"observed_at":"2026-05-15T05:29:48.204626Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07461","last_updated":"2019-02-22T23:53:34Z","snapshot_observed_at":"2026-07-06T06:34:26.609892Z","submitted_at":"2018-04-20T06:35:04Z","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","version":3},"cited_work":{"arxiv_id":"1804.07461","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07461","snapshot_observed_at":"2026-07-04T09:19:44.134394Z","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","venue":"cs.CL","work_id":"1bb6fb0c-482d-43cf-94a8-ed18f72a5563","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1804.07461","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:cea84ab0deb17efbcecc16d941f3a5f8ccd1fa0c13e3207b1f36240d3ee8f336","observation_id":"0399b2bd-3042-4a3d-9690-7be8cdd0d294","resolution":{"observed_at":"2026-05-15T05:29:48.109609Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":"2307.09288","doi":"10.24963/ijcai.2025/706","metadata_source":"pith","pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","venue":"cs.CL","work_id":"68a5177f-d644-44c1-bd4f-4e5278c22f5d","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c3d27d1333fe053d8ede27d7cdce91015e2730cc79a779d72567d2be7ac74422","observation_id":"945fa463-fdff-4973-a5e1-39cca53e6b0e","resolution":{"observed_at":"2026-05-15T05:29:48.115715Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T16:15:06.372663Z","title":"Liu , title =","venue":null,"work_id":"cdbfa130-054a-4c46-ba43-f51f9c363d25","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:475692c08008692b3e8a604389f8fd9cc7c2df82de3568163c88f18bf8f2bc42","observation_id":"46b7c17b-9249-4fe1-b967-fe63fec2bd0f","resolution":{"observed_at":"2026-05-15T05:30:05.575215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":"2106.09685","doi":"10.4088/pcc.v03n0609","metadata_source":"pith","pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","venue":"cs.CL","work_id":"0426219a-789e-4964-adc8-a04538510818","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:b0a1607da3a391237645d6f5e59c12847be34dbe05fc4059ce01020747136b85","observation_id":"5a99d368-f264-4835-9d13-8884b59908fb","resolution":{"observed_at":"2026-05-15T05:29:48.155939Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09055","last_updated":"2019-04-23T06:29:32Z","snapshot_observed_at":"2026-08-01T17:05:53.501765Z","submitted_at":"2018-06-24T00:06:13Z","title":"DARTS: Differentiable Architecture Search","version":2},"cited_work":{"arxiv_id":"1806.09055","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.09055","snapshot_observed_at":"2026-07-10T21:27:35.708872Z","title":"DARTS: Differentiable Architecture Search","venue":"cs.LG","work_id":"2f7f6e44-42e7-498e-a68f-a01e092a8903","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1806.09055","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:52651b4d420f71d23ecf1cfcd160ad841981b5aee92f5ed779dc8f49656ba149","observation_id":"59223836-e98b-4cef-b036-8dba6a28df4c","resolution":{"observed_at":"2026-05-15T05:29:48.237622Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10902","last_updated":"2019-07-25T08:55:22Z","snapshot_observed_at":"2026-08-03T10:00:13.416332Z","submitted_at":"2019-07-25T08:55:22Z","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","version":1},"cited_work":{"arxiv_id":"1907.10902","doi":"10.48550/arxiv.1907.10902","metadata_source":"pith","pith_arxiv_id":"1907.10902","snapshot_observed_at":"2026-07-10T22:27:36.451891Z","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","venue":"cs.LG","work_id":"a8219024-82bb-4802-97b6-8cb1aed9e461","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1907.10902","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:174cd6b19b4bdb97db396fd814af61daa5ac45715b3726bf63609a5ce9722a79","observation_id":"21362e0c-9a07-490e-bd4e-b478f383904f","resolution":{"observed_at":"2026-05-15T05:29:48.168552Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-06-02T00:56:03.861108+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:56:03.861108+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":"1905.10044","doi":"10.48550/arxiv.1905.10044","metadata_source":"pith","pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","venue":"cs.CL","work_id":"511eeb84-4b95-46d5-b14f-50da43f4f19f","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:bb03d822aea597b31a2115e3b5be78992d9063b9eba416849f8ba966fb965208","observation_id":"61117474-2fc0-4ff2-b818-6b37e8df62e6","resolution":{"observed_at":"2026-05-15T05:29:48.301721Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2019 , url=","venue":null,"work_id":"15866d3f-afa4-46e0-bcb9-a4eea9d3f7ca","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:f336c8cb63f43093e3a6b9556130f43b4d363228d060d14288457efa596122f0","observation_id":"078c9401-6ddb-43d9-aeec-906ae9d22fa1","resolution":{"observed_at":"2026-05-15T05:30:05.579889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning , year=","venue":null,"work_id":"81d95c7d-19a8-4f83-9625-99eb7f33ba78","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:72229799ede4603ec6ee957356fb1a81989bfd59be9e92a6c5be1a7ddc385801","observation_id":"ba686881-02b6-4a1f-ab51-0259d180a0f5","resolution":{"observed_at":"2026-05-15T05:30:05.565340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/n18-1023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Looking Beyond the Surface: A Challenge Set for Reading Comprehension over Multiple Sentences , url =","venue":null,"work_id":"27070247-76c7-48f5-b45e-14c35bd5e042","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:4a1e191e23885ec24134fe9794cf4c9f5869ab1e6344ebe66e28979ba39e281e","observation_id":"32ce307c-4863-45e6-916f-7bdf0776edaf","resolution":{"observed_at":"2026-05-15T05:29:46.606883Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.03061","last_updated":"2020-10-06T22:23:00Z","snapshot_observed_at":"2026-08-05T04:11:24.144756Z","submitted_at":"2020-10-06T22:23:00Z","title":"A Survey on Recognizing Textual Entailment as an NLP Evaluation","version":1},"cited_work":{"arxiv_id":"2010.03061","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.03061","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"e346363c-266b-45a8-9c29-96215f23a766","year":2020},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2010.03061","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:3a5d92c8299700edfb742434458a0007d379335ec56a0061d2961639b9fbd593","observation_id":"0ad709ab-99fd-4d07-936d-4ace61e49fdd","resolution":{"observed_at":"2026-05-15T05:29:48.112481Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.09121","last_updated":"2019-04-27T09:31:59Z","snapshot_observed_at":"2026-07-06T06:57:46.546190Z","submitted_at":"2018-08-28T05:16:35Z","title":"WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representations","version":3},"cited_work":{"arxiv_id":"1808.09121","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.09121","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representations","venue":"cs.CL","work_id":"3b102550-a9b3-410b-81fb-eb673ce7630d","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1808.09121","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:54b85780c2b85d6be4c624c2f7a4b1c5c400136d37f00c069b77f097d9b61826","observation_id":"654070f4-8309-418b-ba1c-c187e4103ad5","resolution":{"observed_at":"2026-05-15T05:29:48.248683Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"and Davis, Ernest and Morgenstern, Leora , title =","venue":null,"work_id":"5f373e8c-2701-496f-a9e9-cbee7ae234b7","year":2012},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:424c562801392c3f4bde1ba85401a4cd7ff46f6f73f34f7b53a8eff613fcb2dc","observation_id":"eadfbd93-c0cd-4605-8294-bb01a824a5a5","resolution":{"observed_at":"2026-05-15T05:30:05.560339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The PASCAL Recognising Textual Entailment Challenge","venue":null,"work_id":"7b469591-e12b-412e-95b0-8137fe8cf097","year":2006},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:b1178f4080d3f19bd659515f027a4c5c5db052e93d3f999fcfa71b2e777204ea","observation_id":"46fc189f-a5f8-48e1-86f5-d98c2ac163a5","resolution":{"observed_at":"2026-05-15T05:30:05.570016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"author =","venue":null,"work_id":"cc992f88-4dbd-4e41-8228-dc1187010de3","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:57cc098b0eb7ba222c415cf24e85003ade8de280c20d7ca1258d48b3124b45e9","observation_id":"e5be9da9-bbf5-43fc-bc21-cd9bc57e4c37","resolution":{"observed_at":"2026-05-15T05:35:05.854183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05118","last_updated":"2018-07-13T15:00:17Z","snapshot_observed_at":"2026-07-06T06:50:03.471843Z","submitted_at":"2018-07-13T15:00:17Z","title":"Tune: A Research Platform for Distributed Model Selection and Training","version":1},"cited_work":{"arxiv_id":"1807.05118","doi":"10.48550/arxiv.1807.05118","metadata_source":"pith","pith_arxiv_id":"1807.05118","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tune: A Research Platform for Distributed Model Selection and Training","venue":"cs.LG","work_id":"379cae97-bf10-4ba3-b943-dffabd369b8b","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1807.05118","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c48901b64158e49e7087040594dabd9404c2e950f90e46687c9431fcf43ef554","observation_id":"19327abc-0266-4a9e-aa21-0ce31e14c3e7","resolution":{"observed_at":"2026-05-15T05:29:48.342984Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00751","last_updated":"2019-06-13T17:48:30Z","snapshot_observed_at":"2026-07-06T07:30:44.870185Z","submitted_at":"2019-02-02T16:29:47Z","title":"Parameter-Efficient Transfer Learning for NLP","version":2},"cited_work":{"arxiv_id":"1902.00751","doi":"10.48550/arxiv.1902.00751","metadata_source":"pith","pith_arxiv_id":"1902.00751","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Parameter-Efficient Transfer Learning for NLP","venue":"cs.LG","work_id":"0689cedf-679e-4185-8360-1049b9a36817","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1902.00751","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:00ff1538bbd574a6c7b31b8cf698f4e1cbc5219a5757d7386157dd395b16ab92","observation_id":"6852d98e-1f86-40f0-a5b8-d20b3798c3bf","resolution":{"observed_at":"2026-05-15T05:29:48.348653Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04366","last_updated":"2022-02-02T16:39:23Z","snapshot_observed_at":"2026-08-06T09:47:33.389391Z","submitted_at":"2021-10-08T20:22:26Z","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","version":3},"cited_work":{"arxiv_id":"2110.04366","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04366","snapshot_observed_at":"2026-07-04T15:59:57.198158Z","title":"Towards a unified view of parameter-efficient transfer learning","venue":null,"work_id":"e758988d-4ae2-44ff-94fc-4417c242b1e4","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2110.04366","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:ed2d413397ce7ebf0e89d5aae855194b0ca69990282a07be5e39590c59c4cce7","observation_id":"65c235a2-fcb9-493b-ad22-26d664d6d103","resolution":{"observed_at":"2026-05-15T05:29:48.337773Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04647","last_updated":"2021-11-27T13:48:40Z","snapshot_observed_at":"2026-08-06T14:23:50.647895Z","submitted_at":"2021-06-08T19:17:04Z","title":"Compacter: Efficient Low-Rank Hypercomplex Adapter Layers","version":2},"cited_work":{"arxiv_id":"2106.04647","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.04647","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"89167f37-0cf7-4e08-92ef-34cdcf335b7d","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2106.04647","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:e5ef181c5ffa700e295bc8333e174cbad096c47f41bd95f1131bc2de581565cd","observation_id":"aaf401b1-736f-4279-ba4e-1b074eeb31f9","resolution":{"observed_at":"2026-05-15T05:29:48.331934Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08691","last_updated":"2021-09-02T17:34:41Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-18T03:19:26Z","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","version":2},"cited_work":{"arxiv_id":"2104.08691","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.08691","snapshot_observed_at":"2026-07-04T14:59:55.372222Z","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","venue":"cs.CL","work_id":"1056ba8e-7b3f-4811-be8e-9a3ed9269acb","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2104.08691","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:ee13290e90f5743d9d8951fe2c65070c7a4b739c318befd2193a81e4d8843d67","observation_id":"8879bd09-3041-444f-b47f-73b507fa2d42","resolution":{"observed_at":"2026-05-15T05:29:48.273185Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2023 , eprint=","venue":null,"work_id":"acf817c5-f746-416c-bbf7-1f58409b6b84","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:6fd778cb354ff47746e170aceb3aa6202135ec5402fd0a67293eaa9239fbb4a3","observation_id":"3c327dc6-6649-43a8-87f1-c71ee4dd8e33","resolution":{"observed_at":"2026-05-15T05:30:05.588709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2023 , eprint=","venue":null,"work_id":"24b1cbc0-6f44-43a7-b4c3-659a70b006d3","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c48fb7d32f82c8c28f8ffea5bcfd77eb6174d59e74a5f8d5b9ed53b2802ef6d8","observation_id":"05b16036-5207-48f3-83da-57a91258305c","resolution":{"observed_at":"2026-05-15T05:30:05.584188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00190","last_updated":"2021-01-01T08:00:36Z","snapshot_observed_at":"2026-07-06T10:29:18.734092Z","submitted_at":"2021-01-01T08:00:36Z","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","version":1},"cited_work":{"arxiv_id":"2101.00190","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.00190","snapshot_observed_at":"2026-07-04T13:29:51.032515Z","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","venue":"cs.CL","work_id":"23ddcedc-909d-4b18-b28a-943a50a8cef7","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2101.00190","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:ab343b8bb74a1b5523d226f196a98a9ad9234c059677efbf1a353e08474206f8","observation_id":"fbf12883-9157-4771-8d8e-b919a6647e4a","resolution":{"observed_at":"2026-05-15T05:29:48.311343Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10512","last_updated":"2023-12-20T20:56:14Z","snapshot_observed_at":"2026-07-06T15:05:16.471478Z","submitted_at":"2023-03-18T22:36:25Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","version":2},"cited_work":{"arxiv_id":"2303.10512","doi":"10.48550/arxiv.2303.10512","metadata_source":"pith","pith_arxiv_id":"2303.10512","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","venue":"cs.CL","work_id":"6fa49657-348b-42dd-b870-8758c71af878","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2303.10512","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c056067433057eef01ee6bc1ccae6b08a9f43f323c5ec5d51bb1ae693b7fdde9","observation_id":"ae785731-b370-4e68-90cc-740aae41a747","resolution":{"observed_at":"2026-05-15T05:29:48.231472Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T17:22:41.990236Z","title":"2023 , eprint=","venue":null,"work_id":"6a6b4b0b-6f73-4794-89c6-b9c18acf5819","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:3492c79369c2778d73be505ec9fc223673bcde64d52763fb3da6dd4cb3836093","observation_id":"edd31531-f2cc-471a-8283-8d54d1ee41d5","resolution":{"observed_at":"2026-05-15T05:35:05.881559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-11T02:57:58.993771Z","title":"2024 , eprint=","venue":null,"work_id":"1522dfc9-43c6-4e68-a79f-f2146f656a77","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2eeccf529edc0d68b9638580aa829c2738ed7f93c99b0e1bc367e6a1ca16cff5","observation_id":"196bf866-9697-4dd1-a957-d68689dd0ffa","resolution":{"observed_at":"2026-05-15T05:35:05.892557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2024 , eprint=","venue":null,"work_id":"3bbbbb38-0fbc-4fe9-b8ee-2f31cf5d5ecb","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:a302327edf5ed654e9aebbb4ef61085f57f333391799752744998f7a76956f1b","observation_id":"b712571e-9a38-4e83-ae64-56d838499dab","resolution":{"observed_at":"2026-05-15T05:30:05.546269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T16:52:40.438257Z","title":"2024 , eprint=","venue":null,"work_id":"1a0d736a-1eb5-4211-b082-574dc09cde9a","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:35f036b51f572fd5eeb02e735b65dbdbaff787f01f089baf4af236b5c51273a0","observation_id":"efb01467-f1b7-4768-a3cb-d37e3c5e5194","resolution":{"observed_at":"2026-05-15T05:30:05.550856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08114","last_updated":"2021-03-29T14:32:58Z","snapshot_observed_at":"2026-07-06T05:52:40.312406Z","submitted_at":"2017-07-25T04:43:47Z","title":"A Survey on Multi-Task Learning","version":3},"cited_work":{"arxiv_id":"1707.08114","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1707.08114","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhang and Q","venue":null,"work_id":"ac195275-b124-4a51-8275-802a545042ac","year":2017},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1707.08114","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:15ba64b52626d7114a2aa2948d479992e7b0b432014bfcfac6cfb67bbc522ee0","observation_id":"f571bc2c-dfdf-4aef-ae9f-647676277528","resolution":{"observed_at":"2026-05-15T05:29:48.254973Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":"1706.05098","doi":"10.48550/arxiv.1706.05098","metadata_source":"pith","pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","venue":"cs.LG","work_id":"2c849184-06ce-40df-8143-ec29eb925f39","year":2017},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2747e23133b425f9a1a9c3ed29445768d264c594fc2c6c130123a3fb9ef6bc09","observation_id":"a9c37416-e8dd-436e-ba44-784b176d85cb","resolution":{"observed_at":"2026-05-15T05:29:48.214862Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-11T15:50:59.119295+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T15:50:59.119295+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management , pages=","venue":null,"work_id":"107e53f6-c29d-4e00-a04c-f737e276dae8","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:d5f462920b3b276d7cd0f9bc233d6b233533269535a134d33cd33d948828270f","observation_id":"f70a7194-adc4-4c90-900c-475e0c217ed4","resolution":{"observed_at":"2026-05-15T05:35:05.901184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06538","last_updated":"2017-01-23T18:10:00Z","snapshot_observed_at":"2026-07-06T05:27:13.416519Z","submitted_at":"2017-01-23T18:10:00Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","version":1},"cited_work":{"arxiv_id":"1701.06538","doi":"10.48550/arxiv.1701.06538","metadata_source":"pith","pith_arxiv_id":"1701.06538","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","venue":"cs.LG","work_id":"2c6b3f6d-54e4-4df7-baa7-475a490799af","year":2017},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1701.06538","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:0f3cd3a071d234cbdfad195bc8d9d5f89fa57e38a72e36a215cb5ccb5b5c4e47","observation_id":"448cb0a3-3fde-4d80-bf17-0ce9bca8c662","resolution":{"observed_at":"2026-05-15T05:29:48.226981Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-01T08:08:24.174744+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T08:08:24.174744+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00770","last_updated":"2020-10-06T18:49:48Z","snapshot_observed_at":"2026-07-06T09:17:05.116595Z","submitted_at":"2020-05-02T09:39:36Z","title":"Exploring and Predicting Transferability across NLP Tasks","version":2},"cited_work":{"arxiv_id":"2005.00770","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.00770","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploring and Predicting Transferability across","venue":null,"work_id":"a340b78e-110b-4727-9f1b-2a4fbc5c8bdd","year":2020},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2005.00770","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:37f14eab3668f02df8e3e0b97af606019d5b6009fcd3fd40105da69cc44ef813","observation_id":"6b8db92d-70d4-441d-8651-99d10ba4a862","resolution":{"observed_at":"2026-05-15T05:29:48.248825Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.11038","last_updated":"2021-01-26T19:18:27Z","snapshot_observed_at":"2026-07-06T10:35:49.568440Z","submitted_at":"2021-01-26T19:18:27Z","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","version":1},"cited_work":{"arxiv_id":"2101.11038","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.11038","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"85da3905-11b4-472f-8ec3-1e22487efb71","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2101.11038","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:92e9f7e2b84996d5593eb6bd941f1210642625da5d88c02e4807beefc6e39bed","observation_id":"92685938-e42e-4555-887f-b7ca99e6e5a5","resolution":{"observed_at":"2026-05-15T05:29:48.267446Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08207","last_updated":"2022-03-17T17:53:01Z","snapshot_observed_at":"2026-07-06T11:58:21.596920Z","submitted_at":"2021-10-15T17:08:57Z","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","version":3},"cited_work":{"arxiv_id":"2110.08207","doi":"10.48550/arxiv.2110.08207","metadata_source":"pith","pith_arxiv_id":"2110.08207","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","venue":"cs.LG","work_id":"1857c952-db2f-4810-9e3c-27a862c8d276","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2110.08207","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:b760a28e761d3a33210f62670d92cc16eb59c7583242e829f2935d18714c0015","observation_id":"08502d98-e185-491d-9670-a3e391a7809b","resolution":{"observed_at":"2026-05-15T05:29:48.319189Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2022 , eprint=","venue":null,"work_id":"96828677-5bfa-4e8b-9a2f-0d62a58390da","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:d5352c7d110faae7a37ffc2a346d3858bd312a87570ab5f3aa978bf202ef27f3","observation_id":"8ab6ca35-5ccb-45bc-8818-f7f38ad81103","resolution":{"observed_at":"2026-05-15T05:30:05.555400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T02:01:49.819364Z","title":"2022 , eprint=","venue":null,"work_id":"7ed00dc4-ab81-4069-ba96-7bfc1dd03a76","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:6436d42777363db1d35fad4617d6a50cb803481426cfe7616d274e834572f406","observation_id":"7bd7b8db-9f04-46bb-ad83-e3a3606aa1df","resolution":{"observed_at":"2026-05-15T05:30:05.525360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.01652","last_updated":"2022-02-08T20:26:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-09-03T17:55:52Z","title":"Finetuned Language Models Are Zero-Shot Learners","version":5},"cited_work":{"arxiv_id":"2109.01652","doi":"10.3030/823782","metadata_source":"pith","pith_arxiv_id":"2109.01652","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Finetuned Language Models Are Zero-Shot Learners","venue":"cs.CL","work_id":"7ed6cdaa-ed67-4db4-aceb-b7e1b0e6e7c4","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2109.01652","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2548e827c1c66b533daef058271570d15291c07f9a186f89a8e592348c719d4e","observation_id":"76df79ff-008e-4ca1-a82c-06ce3256e2ea","resolution":{"observed_at":"2026-05-15T05:29:48.225774Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.12423","last_updated":"2020-11-18T21:32:28Z","snapshot_observed_at":"2026-08-04T09:06:54.483727Z","submitted_at":"2019-11-27T21:07:25Z","title":"AdaShare: Learning What To Share For Efficient Deep Multi-Task Learning","version":2},"cited_work":{"arxiv_id":"1911.12423","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.12423","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"AdaShare: Learning What To Share For Efficient Deep Multi-Task Learning , journal =","venue":null,"work_id":"7bf22b8c-3591-4481-959f-ab1e540ee273","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1911.12423","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:a3c37fb4d6bd63186b519838363e995e7af024edddd8325e0191442b169548e9","observation_id":"3cde81b1-2d40-49e7-bb50-3e8cac0d0e02","resolution":{"observed_at":"2026-05-15T05:29:48.283961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.03539","last_updated":"2016-04-12T19:43:25Z","snapshot_observed_at":"2026-08-05T17:14:52.408260Z","submitted_at":"2016-04-12T19:43:25Z","title":"Cross-stitch Networks for Multi-task Learning","version":1},"cited_work":{"arxiv_id":"1604.03539","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.03539","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cross-stitch Networks for Multi-task Learning","venue":"cs.CV","work_id":"6c3db59d-e94b-4937-8826-e13de8078b51","year":2016},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1604.03539","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:6ac70ca7de7676b479ed5914f8ca27e0c9a893a81b542bb34fbf91a29f75a0a8","observation_id":"9f9ffef3-91f4-4432-b2e8-28b40a749521","resolution":{"observed_at":"2026-05-15T05:29:48.305034Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2023 , eprint=","venue":null,"work_id":"74fd0349-27fb-410e-95e9-c088b40a6e64","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:bc3aa235d5cc320417d048c67fc49e9bc5bd3a5aa885690ae34b19eb08c9e494","observation_id":"7aa0c353-b592-47dc-965d-098389ff9858","resolution":{"observed_at":"2026-05-15T05:30:05.530630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.13461","last_updated":"2019-10-29T18:01:00Z","snapshot_observed_at":"2026-07-06T08:33:12.534026Z","submitted_at":"2019-10-29T18:01:00Z","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","version":1},"cited_work":{"arxiv_id":"1910.13461","doi":"10.48550/arxiv.1910.13461","metadata_source":"pith","pith_arxiv_id":"1910.13461","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","venue":"cs.CL","work_id":"7ab72623-0d1b-41fc-96e9-181246f2ea00","year":2019},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1910.13461","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:1faffe34f3a961b58a6bbc83fe6136c9886e35930fdc8295f06b10ada88d037f","observation_id":"98076630-23d0-43e1-b8be-81e9fae4c866","resolution":{"observed_at":"2026-05-15T05:29:48.307391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00859","last_updated":"2021-09-02T12:21:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-09-02T12:21:06Z","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","version":1},"cited_work":{"arxiv_id":"2109.00859","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.00859","snapshot_observed_at":"2026-07-05T07:20:46.356842Z","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","venue":"cs.CL","work_id":"23c48a40-bc03-438f-b646-a6c8e3058782","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2109.00859","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:6816559e11c8bf8545f18349f00d6a93be86a0dc884558a47bce7ecbbebd7efd","observation_id":"79a0fd01-09e0-461a-b2a6-d3ba87cc48aa","resolution":{"observed_at":"2026-05-15T11:23:26.501953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2024 , eprint=","venue":null,"work_id":"449c92a1-d749-4880-85a3-396d817f0d41","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:aa53c12ef932669deb3d4fb2f49a6d05260422186636652dfd99e2b9264bb79c","observation_id":"da192403-42f0-4e4a-b0ec-556d4446b363","resolution":{"observed_at":"2026-05-15T05:30:05.535326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":"1810.04805","doi":"10.1111/jofi.12885","metadata_source":"pith","pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","venue":"cs.CL","work_id":"ed240a10-5b19-406c-baa5-30803f465785","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:7227316a50d23fe45b2d91fc8b508f4645d7b7d1add99c57d6b390f6e907fd65","observation_id":"2b45da89-2680-4b93-97c2-14b5316ed86b","resolution":{"observed_at":"2026-05-15T05:29:48.134903Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.06146","last_updated":"2018-05-23T09:23:47Z","snapshot_observed_at":"2026-07-06T06:19:16.799773Z","submitted_at":"2018-01-18T17:54:52Z","title":"Universal Language Model Fine-tuning for Text Classification","version":5},"cited_work":{"arxiv_id":"1801.06146","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.06146","snapshot_observed_at":"2026-07-04T07:39:38.353471Z","title":"Universal Language Model Fine-tuning for Text Classification","venue":"cs.CL","work_id":"9990d84d-84b4-4fd4-acb5-da451524d2f4","year":2018},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/1801.06146","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:9fdb1471acac92ad66d7e1cb7ab786a1b15edf2ffbda996f03e3c6069dc08e63","observation_id":"df1e32fb-8323-4175-87ea-f539fbf55711","resolution":{"observed_at":"2026-05-15T05:29:48.179945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2023 , eprint=","venue":null,"work_id":"ac72f819-bf92-4cd8-b006-bec0e9b4f583","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:fe1f6781fb2e6b5c3c232cd1a466aa8e96b27f29761be6bc2e1e6931deed9f05","observation_id":"8e9927f2-4b45-486f-bfef-b6dc56e0b1dd","resolution":{"observed_at":"2026-05-15T05:35:05.841742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00247","last_updated":"2021-01-26T12:54:33Z","snapshot_observed_at":"2026-07-06T09:16:48.444854Z","submitted_at":"2020-05-01T07:03:42Z","title":"AdapterFusion: Non-Destructive Task Composition for Transfer Learning","version":3},"cited_work":{"arxiv_id":"2005.00247","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.00247","snapshot_observed_at":"2026-07-03T10:27:57.011640Z","title":"Adapterfusion: Non-destructive task composition for transfer learning","venue":null,"work_id":"6a99c89c-f015-4ff0-bd9c-9b926cbe99a2","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2005.00247","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:0000ad480ab5361bc47a4d84ed8142bc015f99e704520722ed49b002a120b53d","observation_id":"81b3a40e-865b-4e6f-a23f-781975fb3f57","resolution":{"observed_at":"2026-05-15T05:29:48.161490Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.13586","last_updated":"2021-07-28T18:09:46Z","snapshot_observed_at":"2026-07-06T11:33:25.933445Z","submitted_at":"2021-07-28T18:09:46Z","title":"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing","version":1},"cited_work":{"arxiv_id":"2107.13586","doi":"10.48550/arxiv.2107.13586","metadata_source":"arxiv_reference","pith_arxiv_id":"2107.13586","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2107.13586 , year=","venue":"arXiv (Cornell University)","work_id":"fa3cdd33-21d7-4517-a78c-f06343236da6","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2107.13586","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:a6162ba801cde088f0b672775b108d407694778de1a4af349891a683bc5c83e1","observation_id":"8f72b099-5e5d-4907-bbdc-7e999a5574e1","resolution":{"observed_at":"2026-05-15T05:29:48.186310Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.acl-short.8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"P -Tuning: Prompt Tuning Can Be Comparable to Fine-tuning Across Scales and Tasks","venue":null,"work_id":"b488378f-3373-4997-ae65-5e0486b9492c","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:626ff47f8b69123e590fbae1dbab8baaaabecc6bbc914ec032e93e0ed8978cf2","observation_id":"19f49483-6b2b-411d-a371-a19e93836268","resolution":{"observed_at":"2026-05-15T05:29:46.611252Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-22T10:55:30.054775+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T10:55:30.054775+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07602","last_updated":"2022-03-20T15:13:08Z","snapshot_observed_at":"2026-08-03T22:14:53.516423Z","submitted_at":"2021-10-14T17:58:47Z","title":"P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks","version":3},"cited_work":{"arxiv_id":"2110.07602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.07602","snapshot_observed_at":"2026-07-04T04:19:34.480528Z","title":"P-tuning v2: Prompt tuning can be comparable to fine-tuning universally across scales and tasks","venue":null,"work_id":"ceb357a3-8497-47d1-ae04-4e844ec59db5","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2110.07602","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:2563eaf6d80e8be668432bdce23092f5bcacefc40a7fa921847a12308996899b","observation_id":"14b05ce8-e8a2-436b-a75d-58efe2c1a945","resolution":{"observed_at":"2026-05-15T05:29:48.175330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.06719","last_updated":"2022-04-27T16:49:40Z","snapshot_observed_at":"2026-07-06T12:07:56.233037Z","submitted_at":"2021-11-12T13:39:28Z","title":"On Transferability of Prompt Tuning for Natural Language Processing","version":2},"cited_work":{"arxiv_id":"2111.06719","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.06719","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On Transferability of Prompt Tuning for Natural Language Understanding , journal =","venue":null,"work_id":"2874a8b6-bf80-4788-82f7-31039627c6bf","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2111.06719","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:e5a640cfdbf64373b6f368d12c57f7ee136587205236132ccb65aacbde89e8e7","observation_id":"346c9d01-5d66-4cba-a7e3-f86e99af982f","resolution":{"observed_at":"2026-05-15T05:29:48.117889Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=","venue":null,"work_id":"7b524a1e-f606-4ad9-af78-9520029868fc","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:37341f5c4ad8c1e857b758f174cdba7c845dcd3d17bf7eb24019218a2bf23104","observation_id":"32e873ab-0b1a-4e02-8c3c-19ae2da595f9","resolution":{"observed_at":"2026-05-15T05:30:05.515729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04096","last_updated":"2020-06-07T09:24:33Z","snapshot_observed_at":"2026-07-06T09:26:43.943376Z","submitted_at":"2020-06-07T09:24:33Z","title":"Robust Learning Through Cross-Task Consistency","version":1},"cited_work":{"arxiv_id":"2006.04096","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.04096","snapshot_observed_at":"2026-07-01T22:16:16.368752Z","title":"Zamir and Alexander Sax and Teresa Yeo and Oguzhan Fatih Kar and Nikhil Cheerla and Rohan Suri and Zhangjie Cao and Jitendra Malik and Leonidas J","venue":null,"work_id":"237822b2-eb92-4282-8ca2-e253039b254c","year":2006},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2006.04096","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:725f6bc57b39a7909838a134cfa11df0be5f01504bbdbddee54e690c0bbdd8cf","observation_id":"24af99bc-2093-44da-91a0-cd08af18632e","resolution":{"observed_at":"2026-05-15T05:29:48.356055Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11501","last_updated":"2023-11-20T02:59:18Z","snapshot_observed_at":"2026-07-06T16:49:45.821983Z","submitted_at":"2023-11-20T02:59:18Z","title":"MultiLoRA: Democratizing LoRA for Better Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"2311.11501","doi":"10.48550/arxiv.2311.11501","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.11501","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multilora: Democratiz- ing lora for better multi-task learning","venue":"arXiv (Cornell University)","work_id":"c49cf014-5287-4ebb-8a95-ed6a33f204a3","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2311.11501","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:1d6c4e5fadb5ed406efba82a39c44464bc15623a7be3b32ece93f3a74a5a0764","observation_id":"17a24fec-48bf-4670-8c2f-fc94ad97b185","resolution":{"observed_at":"2026-05-15T05:29:48.232464Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b3059bc7-8203-4cc3-8276-0908fad3eb76","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:cf666aa67b511fe8c40205bfb6acb4c969eb7318a69bc1f4fb1d38c517917b18","observation_id":"d57afa83-30b4-48a3-93b3-c46a7e4c0f0a","resolution":{"observed_at":"2026-05-15T05:30:05.511195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-07-06T14:08:18.855958Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":"2210.11416","doi":"10.48550/arxiv.2210.11416","metadata_source":"pith","pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling Instruction-Finetuned Language Models","venue":"cs.LG","work_id":"8405abb1-7558-4fdf-af24-f4c52fa77a06","year":2022},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:d2c022436230fc85627daf21a76e98f83af6230ece7441311f48e537368d5093","observation_id":"c300e4a2-2927-4ca5-b713-74d45b7261cf","resolution":{"observed_at":"2026-05-15T05:29:46.602811Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=","venue":null,"work_id":"e7ca2636-1ba7-44f8-83da-99f2c10ca020","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:eff44df3353c3a49a3705aab529aab13eec17b16ef1996d4307cb182d9cc9660","observation_id":"d9f2f454-b5d5-44ef-aabd-bf3a7e8348ba","resolution":{"observed_at":"2026-05-15T05:30:05.521468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":"e5ecd36f-2ab8-409f-9305-1c15f2dac178","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:1d50eb64d829472381b458df1fe6e9b814a721c7f4c9b0fb4d00b33673e1b7cd","observation_id":"1223d766-586e-424a-9b20-d14e58672998","resolution":{"observed_at":"2026-05-15T05:30:05.540797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T17:56:26.079913Z","title":"Journal of Machine Learning Research , volume=","venue":null,"work_id":"134e4f8b-e91c-492b-8148-4c1734093094","year":null},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:ccffa956555fe7b35176c28c83947477b9852cc22c72d3d43844936b2597a724","observation_id":"0a1bff3d-6b95-4a84-891e-87077e2f51ab","resolution":{"observed_at":"2026-05-15T05:30:05.506500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":"2309.16609","doi":"10.48550/arxiv.2309.16609","metadata_source":"pith","pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen Technical Report","venue":"cs.CL","work_id":"bb1fd52f-6b2f-437c-9516-37bdf6eb9be8","year":2023},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:0c223d93d5c1ef3ed1cbba1dbd95533fb5f2b5a547265c607b584e066329fc24","observation_id":"098361e4-99da-45fa-b929-13181ec9c9be","resolution":{"observed_at":"2026-05-15T05:29:48.215667Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10360","last_updated":"2022-03-17T11:49:55Z","snapshot_observed_at":"2026-07-06T10:51:12.871009Z","submitted_at":"2021-03-18T16:30:26Z","title":"GLM: General Language Model Pretraining with Autoregressive Blank Infilling","version":2},"cited_work":{"arxiv_id":"2103.10360","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10360","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2103.10360 , year=","venue":null,"work_id":"46d7bb97-b94f-4fe6-8291-6d532f004dfa","year":2021},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2103.10360","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:d270bd4a1c317e893d51ff4835162b9c7c7523eadc255e68589e3f97e135f22e","observation_id":"4787068b-9bbb-47b8-ab4e-e7ae9e99e714","resolution":{"observed_at":"2026-05-15T05:29:48.220645Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:c26ffc652b417d078ce6f0dec7e7c056f24f1d10b3f3c48ee384a5aa7a9d47f8","observation_id":"f6709bc5-7f58-4d67-a99e-2f0cf0165e7c","resolution":{"observed_at":"2026-05-15T05:29:48.289566Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02954","last_updated":"2024-01-05T18:59:13Z","snapshot_observed_at":"2026-08-02T13:11:16.882565Z","submitted_at":"2024-01-05T18:59:13Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","version":1},"cited_work":{"arxiv_id":"2401.02954","doi":"10.48550/arxiv.2401.02954","metadata_source":"pith","pith_arxiv_id":"2401.02954","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","venue":"cs.CL","work_id":"01b10587-025b-499d-8ba3-7a538d24c2d6","year":2024},"citing_paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-05-15T05:25:38.967645Z"},"links":{"cited_paper":"/paper/2401.02954","citing_paper":"/paper/2605.14055"},"observation_digest":"sha256:37d71122ad473360dc21691e031d3fd21e5a1d836fe9a6dfb0a35aa9df0ab214","observation_id":"83316c67-f7bc-4aae-93d2-8d468c4e6cbf","resolution":{"observed_at":"2026-05-15T05:29:48.300010Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.14055","last_updated":"2026-05-13T19:25:56Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-01T07:49:53.576982Z","submitted_at":"2026-05-13T19:25:56Z","title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":0,"metadata_mismatch":19,"parse_uncertain":0,"unresolved":2,"verified_exact":37,"verified_fuzzy":39},"total_outbound_references":97},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2605.14055."}