{"as_of":"2026-08-13T19:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a35f73d188287bd0eadf2637eb8f1eb810097f85299b6184ff453f6dd3593e6e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":32,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:57:59.281370Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":101,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-12T15:57:59.281370Z","title":"Efficient few-shot learning without prompts, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.13786","last_updated":"2024-11-21T02:15:52Z","snapshot_observed_at":"2026-08-13T09:28:32.812997Z","submitted_at":"2024-11-21T02:15:52Z","title":"Adaptable Embeddings Network (AEN)","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:57:59.281370Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2411.13786"},"observation_digest":"sha256:0f5fa229bc848ae26b00bf9a7386cf2c3ec82aa8f3158fc17593ca154339647d","observation_id":"1c7fe4ad-22ed-4d23-aa5f-6e4840c8bf4d","resolution":{"observed_at":"2026-08-12T15:57:59.281370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2412.13663","last_updated":"2024-12-19T06:32:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-18T09:39:44Z","title":"Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inference","version":2},"reference_index":190,"source":"arxiv_source","source_observed_at":"2026-05-20T17:46:46.845424Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2412.13663"},"observation_digest":"sha256:8317a74a66eab8d969dd1d07b5d0606ca4d79bbd4cb03cdd5299922d073714f0","observation_id":"9d7f335a-77db-4c0c-976d-7e24fec9d34a","resolution":{"observed_at":"2026-05-20T17:46:46.965362Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-11T15:17:54.623829Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.00017","last_updated":"2025-08-14T12:25:48Z","snapshot_observed_at":"2026-08-11T15:12:28.559970Z","submitted_at":"2024-12-15T12:02:14Z","title":"AI Across Borders: Exploring Perceptions and Interactions in Higher Education","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:17:54.623829Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2501.00017"},"observation_digest":"sha256:b2830dc7da8e47b9d501b6a92c18acdebd796c1f5e39eb576a0ac9d7e42f8855","observation_id":"82c9777d-2a8c-4533-bc1f-48d1fb7c1e51","resolution":{"observed_at":"2026-08-11T15:17:54.623829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-10T17:20:32.471867Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12332","last_updated":"2025-01-21T18:06:54Z","snapshot_observed_at":"2026-08-13T14:47:44.228743Z","submitted_at":"2025-01-21T18:06:54Z","title":"Automatic Labelling with Open-source LLMs using Dynamic Label Schema Integration","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T17:20:32.471867Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2501.12332"},"observation_digest":"sha256:8141bf4f9c09b8b650899abe03dae530b77c9eb3f9c4791be9d1d98adf8f5544","observation_id":"97f35814-ff72-498b-9368-bf566a8b37bd","resolution":{"observed_at":"2026-08-10T17:20:32.471867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-10T13:48:27.099355Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.16111","last_updated":"2025-01-27T15:03:26Z","snapshot_observed_at":"2026-08-12T17:50:44.981992Z","submitted_at":"2025-01-27T15:03:26Z","title":"Options-Aware Dense Retrieval for Multiple-Choice query Answering","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T13:48:27.099355Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2501.16111"},"observation_digest":"sha256:c83034f15e1cff30e4c1ad9c083c41c3a90751e8ca641055e77ebaa9b2f0efa1","observation_id":"ad0559a2-13fd-429a-a924-ff92c298b041","resolution":{"observed_at":"2026-08-10T13:48:27.099355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-07T14:48:04.612158Z","title":"Efficient Few-Shot Learning Without Prompts,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.17632","last_updated":"2025-05-23T08:45:46Z","snapshot_observed_at":"2026-08-08T19:01:21.470738Z","submitted_at":"2025-05-23T08:45:46Z","title":"ReqBrain: Task-Specific Instruction Tuning of LLMs for AI-Assisted Requirements Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:48:04.612158Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2505.17632"},"observation_digest":"sha256:9f091c6b3e27b4b475e003ec1661d97630b44ea99dd05650ba0d3575473de942","observation_id":"81a4cfb5-6edb-41b7-a1ee-8c9f2f1cc0fb","resolution":{"observed_at":"2026-08-07T14:48:04.612158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-07T14:22:24.068661Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19254","last_updated":"2025-05-25T18:23:36Z","snapshot_observed_at":"2026-08-10T10:26:37.518684Z","submitted_at":"2025-05-25T18:23:36Z","title":"Unveiling Dual Quality in Product Reviews: An NLP-Based Approach","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T14:22:24.068661Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2505.19254"},"observation_digest":"sha256:a750710bbb7cdf862e4c1023883c28a2bdec16f4d47b7c0ced18e7e982d03b7b","observation_id":"fbfcf097-954d-4d6b-a474-5cdb1c35ae79","resolution":{"observed_at":"2026-08-07T14:22:24.068661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-07T05:12:42.922777Z","title":"Tunstall, N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.08581","last_updated":"2025-06-10T08:51:21Z","snapshot_observed_at":"2026-08-09T22:51:41.634311Z","submitted_at":"2025-06-10T08:51:21Z","title":"Evaluating the Performance and Efficiency of Sentence-BERT for Code Comment Classification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:12:42.922777Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2506.08581"},"observation_digest":"sha256:53c9098d04f939bde9e366b2579a65d2240c1d97b7cd907aad717ffa458c25d7","observation_id":"aadfd0b1-2428-4dfa-a44b-926680327b6e","resolution":{"observed_at":"2026-08-07T05:12:42.922777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-07T05:04:19.618270Z","title":"Efficient few -shot learning with - out prompts","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.08860","last_updated":"2025-06-11T01:21:02Z","snapshot_observed_at":"2026-08-09T22:51:42.164888Z","submitted_at":"2025-06-10T14:51:20Z","title":"On The Impact of Merge Request Deviations on Code Review Practices","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:04:19.618270Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2506.08860"},"observation_digest":"sha256:c17af19160cc26e6cd9836c3a3fd16ee59cd60638e907a6df6a30898af3ce416","observation_id":"f80c6234-75a5-4f17-8ed7-f292b106d702","resolution":{"observed_at":"2026-08-07T05:04:19.618270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-07T04:56:55.411606Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09259","last_updated":"2025-06-10T21:40:54Z","snapshot_observed_at":"2026-08-10T03:01:29.041893Z","submitted_at":"2025-06-10T21:40:54Z","title":"Self-Anchored Attention Model for Sample-Efficient Classification of Prosocial Text Chat","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T04:56:55.411606Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2506.09259"},"observation_digest":"sha256:0f3abe41aeedacda46f34af64195484765fb415dbe30844eba0f4852924b4316","observation_id":"978ef08b-7efb-47d5-b30d-8d0ac701d596","resolution":{"observed_at":"2026-08-07T04:56:55.411606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-06T18:03:54.940500Z","title":"(2023a, January 26)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09239","last_updated":"2025-07-12T10:19:50Z","snapshot_observed_at":"2026-08-10T05:39:29.384991Z","submitted_at":"2025-07-12T10:19:50Z","title":"The Narrative Construction of Generative AI Efficacy by the Media: A Case Study of the Role of ChatGPT in Higher Education","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:54.940500Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2507.09239"},"observation_digest":"sha256:14e095f000b0bfbfdf1ae6c58c2d3a13ef03594ced6d7c54c752737b88cdc74c","observation_id":"e3648440-0420-432f-8a9f-24dc695e9a86","resolution":{"observed_at":"2026-08-06T18:03:54.940500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T15:09:05.963638Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.20468","last_updated":"2025-08-28T06:39:25Z","snapshot_observed_at":"2026-08-13T16:07:29.621607Z","submitted_at":"2025-08-28T06:39:25Z","title":"ConspirED: A Dataset for Cognitive Traits of Conspiracy Theories and Large Language Model Safety","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-05T15:09:05.963638Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2508.20468"},"observation_digest":"sha256:07cafccc3031d0bca4df67b70f09329b6e283fa9dc26ceece93369ead1adf14d","observation_id":"9e533ad9-00ec-4dea-9be1-2de6295b1220","resolution":{"observed_at":"2026-08-05T15:09:05.963638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T05:21:30.867771Z","title":"Efficient few-shot learning without prompts,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05635","last_updated":"2025-09-06T07:41:47Z","snapshot_observed_at":"2026-08-12T09:14:33.141950Z","submitted_at":"2025-09-06T07:41:47Z","title":"Few-Shot Query Intent Detection via Relation-Aware Prompt Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T05:21:30.867771Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2509.05635"},"observation_digest":"sha256:d9d991b708cc439376e32f03b75308fd967576dd3b546b5cfada4c44f1cb475d","observation_id":"a0c62731-83bc-4780-8e52-00421f36e5f0","resolution":{"observed_at":"2026-08-05T05:21:30.867771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2601.22264","last_updated":"2026-04-04T04:37:18Z","snapshot_observed_at":"2026-08-02T23:44:33.684751Z","submitted_at":"2026-01-29T19:34:34Z","title":"Predicting Intermittent Job Failure Categories for Diagnosis Using Few-Shot Fine-Tuned Language Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-16T09:17:09.823817Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2601.22264"},"observation_digest":"sha256:0c19135b5f7b23f53f9d4b17c72f90db652fa37b7c964a231364ba1ce959d39b","observation_id":"2155b975-3303-40d7-b96b-003197b3556c","resolution":{"observed_at":"2026-05-16T09:17:40.200103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2603.03959","last_updated":"2026-04-15T10:02:53Z","snapshot_observed_at":"2026-08-06T23:30:43.413930Z","submitted_at":"2026-03-04T11:36:32Z","title":"LoRA-MME: Multi-Model Ensemble of LoRA-Tuned Encoders for Code Comment Classification","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T17:03:04.705363Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2603.03959"},"observation_digest":"sha256:ca7dbecb3b20ddb023fae6b0d7cf333e17fb5cbf55fa79773172162a6355d712","observation_id":"e675bdb8-a079-4f4c-b88a-1557aacd1fdd","resolution":{"observed_at":"2026-05-15T17:06:19.249032Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2604.12190","last_updated":"2026-04-14T01:45:22Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-14T01:45:22Z","title":"Characterizing Resource Sharing Practices on Underground Internet Forum Synthetic Non-Consensual Intimate Image Content Creation Communities","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T16:18:03.390618Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2604.12190"},"observation_digest":"sha256:9582fa15969697110dd23ef729a7f768b4137225462b5d72facb48b766975af1","observation_id":"84a90ada-7032-413d-a2fc-41a1e3f0de69","resolution":{"observed_at":"2026-05-11T09:01:00.921663Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2604.13353","last_updated":"2026-05-17T15:44:10Z","snapshot_observed_at":"2026-07-09T23:17:43.287492Z","submitted_at":"2026-04-14T23:23:46Z","title":"Cross-Domain Query Translation for Network Troubleshooting: A Multi-Agent LLM Framework with Privacy Preservation and Self-Reflection","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T13:44:05.443209Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2604.13353"},"observation_digest":"sha256:4c320e5d827f0a85d1a19eb37144aa6d533bf79b42f3e92d729e3b7031f82548","observation_id":"76f86620-4f54-4088-8ef5-96d83e02e508","resolution":{"observed_at":"2026-05-10T13:45:27.721801Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2604.13353","last_updated":"2026-05-17T15:44:10Z","snapshot_observed_at":"2026-07-09T23:17:43.287492Z","submitted_at":"2026-04-14T23:23:46Z","title":"Cross-Domain Query Translation for Network Troubleshooting: A Multi-Agent LLM Framework with Privacy Preservation and Self-Reflection","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T01:06:00.831147Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2604.13353"},"observation_digest":"sha256:684219e0ecfcf53f6dbb0400f1b4dcf0b7388bf1cd21471c3adf1a288831fbfa","observation_id":"81a12d27-4f00-4baa-b85c-9923a1db45a4","resolution":{"observed_at":"2026-05-21T01:09:20.491892Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2604.16301","last_updated":"2026-01-16T12:21:42Z","snapshot_observed_at":"2026-08-10T21:02:11.802158Z","submitted_at":"2026-01-16T12:21:42Z","title":"Domain-Specific Query Understanding for Automotive Applications: A Modular and Scalable Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T13:37:13.043968Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2604.16301"},"observation_digest":"sha256:a514a9d98d877f348093515561712c5018879dc2c39be4808dd05ca468449911","observation_id":"9ba4c14c-2651-4baf-a3f1-d63cf7439336","resolution":{"observed_at":"2026-05-16T13:37:56.645797Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.02798","last_updated":"2026-05-04T16:38:04Z","snapshot_observed_at":"2026-08-13T17:50:39.507462Z","submitted_at":"2026-05-04T16:38:04Z","title":"Measuring Accuracy and Energy-to-Solution of Quantum Fine-Tuning of Foundational AI Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T18:14:03.049005Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.02798"},"observation_digest":"sha256:26798d25d31fb907004737293e23654dcd570417980722e911a1d26b6ae1341f","observation_id":"79a84a26-aa25-43aa-b932-7e339ed4d55e","resolution":{"observed_at":"2026-05-09T06:40:40.398227Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.03450","last_updated":"2026-05-05T07:32:22Z","snapshot_observed_at":"2026-07-06T23:16:20.322265Z","submitted_at":"2026-05-05T07:32:22Z","title":"Retrieving Floods without Floodlights: Topic Models as Binary Classifiers for Extreme Climate Events in German News","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T16:56:18.930883Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.03450"},"observation_digest":"sha256:9c18f5e92bc25493d4391f5e39181f6bc3b9d2a00a26e59b3c93fefe8c911984","observation_id":"38da6f7d-ece7-4d56-be14-76b47c31ac6c","resolution":{"observed_at":"2026-05-12T10:56:30.287165Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.11213","last_updated":"2026-05-11T20:28:03Z","snapshot_observed_at":"2026-08-11T14:57:19.474529Z","submitted_at":"2026-05-11T20:28:03Z","title":"Quantum Parity Representations: Learnable Basis Discovery, Encoders, and Shadow Deployment","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T02:28:34.197942Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.11213"},"observation_digest":"sha256:756f16c2c336c1dd74522725ed746e44f5b4486e9dbc8734e7a9dd86e61b5ba8","observation_id":"8ee93365-5e02-4353-988c-b7114f1c1674","resolution":{"observed_at":"2026-05-13T02:32:06.633566Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.11336","last_updated":"2026-05-29T12:50:13Z","snapshot_observed_at":"2026-08-01T14:17:14.067496Z","submitted_at":"2026-05-11T23:42:00Z","title":"Much of Geospatial Web Search Is Beyond Traditional GIS","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T01:19:26.399524Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.11336"},"observation_digest":"sha256:4fbae9a84a41da6df14a708759efa962782b6b9639ef8ec7b4efc77f2ecc47cc","observation_id":"42170a91-2101-46e7-9f0b-0d9100c39aea","resolution":{"observed_at":"2026-05-13T01:22:00.841815Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.11336","last_updated":"2026-05-29T12:50:13Z","snapshot_observed_at":"2026-08-01T14:17:14.067496Z","submitted_at":"2026-05-11T23:42:00Z","title":"Much of Geospatial Web Search Is Beyond Traditional GIS","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T21:58:45.277252Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.11336"},"observation_digest":"sha256:930c802f93a50bc6cb4d663e3f07784331b6bc410affbe28aeb187d1f7e95b90","observation_id":"e33e246f-554d-42fb-9ea6-db346c716bfb","resolution":{"observed_at":"2026-06-30T22:05:05.184196Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.21609","last_updated":"2026-05-20T18:16:18Z","snapshot_observed_at":"2026-08-13T05:12:01.335342Z","submitted_at":"2026-05-20T18:16:18Z","title":"CR4T: Rewrite-Based Guardrails for Adolescent LLM Safety","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-22T09:21:59.200523Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.21609"},"observation_digest":"sha256:21dab58bc3a54a03131b0d81409858f2c34af3de8445f40fd209b74c80548149","observation_id":"0212eb99-06df-4bce-a854-ced2d675c533","resolution":{"observed_at":"2026-05-22T09:24:45.883483Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2605.29659","last_updated":"2026-05-28T09:21:42Z","snapshot_observed_at":"2026-08-12T14:52:35.122614Z","submitted_at":"2026-05-28T09:21:42Z","title":"Opir: Efficient Multi-Task Safety Classification for Toxicity, Jailbreaks, Hate Speech, and Harmful Content","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T09:11:58.843585Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2605.29659"},"observation_digest":"sha256:9fe211a5cc81976bacd235f74adf042b6d0f24935001d5e6cbdb728bc51245ac","observation_id":"8713978c-3c7f-4b9a-bdd1-09b471688843","resolution":{"observed_at":"2026-06-29T09:13:15.919148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2606.08605","last_updated":"2026-06-07T12:33:43Z","snapshot_observed_at":"2026-08-13T00:36:27.356055Z","submitted_at":"2026-06-07T12:33:43Z","title":"Multilingual Fact-Checking at Scale: Fine-Tuned Compact Models vs LLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T18:58:55.712400Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2606.08605"},"observation_digest":"sha256:665c85c381e4fde586eeb38f2c6caf1de4218f5273c57796ae11fd5a5fe94359","observation_id":"6354a5c9-0603-4df2-83b1-22fb3be1974e","resolution":{"observed_at":"2026-07-02T22:27:25.370613Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":"2209.11055","doi":"10.48550/arxiv.2209.11055","metadata_source":"arxiv_reference","pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":"TUbilio (Technical University of Darmstadt)","work_id":"ef9676ab-cb68-4367-be8b-fbb6f9cec707","year":2022},"citing_paper":{"arxiv_id":"2606.10736","last_updated":"2026-06-09T11:47:04Z","snapshot_observed_at":"2026-08-12T03:57:04.320993Z","submitted_at":"2026-06-09T11:47:04Z","title":"Detecting Knowledge Gaps from Conversational AI Interactions Using Curriculum Prerequisite Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T13:01:51.010436Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2606.10736"},"observation_digest":"sha256:0ae20301826fc6b5970ea76839c1955d3555335ff6be2e1955cfa14789d7a91a","observation_id":"04704132-0917-4749-ae27-fbc841fd1253","resolution":{"observed_at":"2026-07-03T05:47:42.054676Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-07-11T19:05:55.879132Z","title":"Efficient few-shot learning without prompts,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04448","last_updated":"2026-07-05T18:21:36Z","snapshot_observed_at":"2026-08-11T00:01:54.819372Z","submitted_at":"2026-07-05T18:21:36Z","title":"From Regulation to Requirements: An Automated Requirement Derivation and Explanation Pipeline","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T19:05:55.879132Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2607.04448"},"observation_digest":"sha256:89248e4fa09a71315931a846e95e3cca47771149c04033df69a27ec9a90af97b","observation_id":"36cc5858-1f10-4c9f-a812-9e2112770516","resolution":{"observed_at":"2026-07-11T19:05:55.879132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-07-15T07:14:38.560633Z","title":"arXiv preprint arXiv:2209.11055","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.12295","last_updated":"2026-07-14T03:08:47Z","snapshot_observed_at":"2026-08-09T22:51:28.211188Z","submitted_at":"2026-07-14T03:08:47Z","title":"A Longitudinal Analysis of Public Discourse on AI Ethics in Education Using Twitter Data","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-15T07:14:38.560633Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2607.12295"},"observation_digest":"sha256:03b5970d5f1f1c87624dc5abde72e1616135781e97f6b9d143aac94318ac3379","observation_id":"de0d6ba7-5a77-4e59-8924-688866455480","resolution":{"observed_at":"2026-07-15T07:14:38.560633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-01T07:28:34.426364Z","title":"arXiv preprint arXiv:2209.11055 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21453","last_updated":"2026-07-24T02:14:44Z","snapshot_observed_at":"2026-08-03T14:01:50.133228Z","submitted_at":"2026-07-23T15:55:29Z","title":"Test-Time Scaling via Error Localization","version":2},"reference_index":158,"source":"arxiv_source","source_observed_at":"2026-08-01T07:28:34.426364Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2607.21453"},"observation_digest":"sha256:a97f59abe8f3b1beb925de8a7b260cd99e88f4f9b4d0fb3db6fc56d4773aeb55","observation_id":"16630b83-2afd-47c6-acb1-a8ccd58b24cd","resolution":{"observed_at":"2026-08-01T07:28:34.426364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11055","snapshot_observed_at":"2026-08-04T15:22:55.720055Z","title":"Efficient few-shot learning without prompts, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02089","last_updated":"2026-08-03T11:48:39Z","snapshot_observed_at":"2026-08-08T01:52:41.954756Z","submitted_at":"2026-08-03T11:48:39Z","title":"How Much Does a Reasoning Summary Reveal? An Observability Ladder for Large Language Models","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T15:22:55.720055Z"},"links":{"cited_paper":"/paper/2209.11055","citing_paper":"/paper/2608.02089"},"observation_digest":"sha256:b01aad0ec6851aa98f833bbed13bdc8f4d7375da1cf7c9f424503667e90857cb","observation_id":"b31ef1b5-be68-4428-9359-8161787a2b71","resolution":{"observed_at":"2026-08-04T15:22:55.720055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2209.11055/citation-record","integrity":"/paper/2209.11055/integrity","json":"/paper/2209.11055/citation-record.json","paper":"/paper/2209.11055"},"outbound":[],"paper":{"arxiv_id":"2209.11055","last_updated":"2022-09-22T14:48:11Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T14:21:01.371169Z","submitted_at":"2022-09-22T14:48:11Z","title":"Efficient Few-Shot Learning Without Prompts"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 32 inbound Pith citation observations for arXiv:2209.11055."}