{"as_of":"2026-08-07T12:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb32ceacc89ae5e73fe12f4c02c785864c52bf562754bcfdce34588503a5eca8","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":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:12:42.922777Z","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-05T06:29:33.316428Z","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:c7d1053e7739823ec98a101fe0456fd49abd67602904691408c20c8982500dc7","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-07T05:04:37.229259Z","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:8f5cf3f25cf64280c54c058f1e6a52083258f790d66779332056d75f2600892d","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-05T06:29:33.316428Z","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-07T11:16:30.247388Z","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:1b9ff2320036984b5b7402aaba412f302ac1793a4108d9d57a094f4f876a552d","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-05T06:29:33.316428Z","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-07T04:50:44.638660Z","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:e75462b3f1328f143acbdbc99d49a6417c66f05516aaf5c766d5975ff91b8eaa","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-05T06:29:33.316428Z","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-06T17:58:15.563253Z","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:c41a9a58516f6ad90c655c71a347556b405066339a6b1523e17d142d2ad07639","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-05T06:29:33.316428Z","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-05T15:08:49.243390Z","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:a43ddadeaa5f3e8553c638a49d272c8b758e36e2c777bab0e7e79e4e1b53a7aa","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-05T06:29:33.316428Z","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-05T05:21:29.230518Z","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:ebc9fcfceb06492a635d39aaba79c4332f8e187ebae5109ec35855231303ca1b","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-05T06:29:33.316428Z","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:50dfd567a065b4123a4b92dd17c5b4c08b31857532cb0774f55f0ec59cd8c1f5","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:a10bc5a87659b0f7e49429272b207f612c3775ea12ea530991284aaae848b231","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:18392d3b00949a636e9f9807475b1ebc1bb465635c4f88ee393e10c22db24356","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:ce3c295c4d6a7b0b5d53665cd7c12ceb525475886c4d6e982f31230f2706c198","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:19864037f026c0028df92f8b375ad769f21fbeb8bd55aa713418b778103b200d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-04T14:55:20.708073Z","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:7fa13601b42df8544a2eaae0f5b5ba8026a71159c9230350d32a946e08510734","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-07-06T23:15:51.008483Z","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:2fd046796c1b6d8e2d25b2958f6c8fd69545cfc98e2c56f3163773febf4e2af1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:30d76ea9c0c6c6084f3a9e1ea11723536578c413e13cdbc1b810930e047dfb5c","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-07-06T23:23:06.755816Z","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:3c143af65e902c50fea6fdd56ad6df93321516a077f095fe3b16080df5cf3e30","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:ced7e7bfe0f586ec16dfe6af86538cd9d6829532fcca2d6dc3d9f4b6dbf4dbea","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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:21ae2a44cd1edd49cac1c3b085afef3f6053c09abe3e7c0ab661d6b1fd5a63c1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-02T08:48:18.792026Z","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:33d41392d841fc8ff93e0423e1c367029b6d52935ac0e2618a902150262c4af9","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-06T20:43:40.479073Z","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:2a1521b2fa83888b000c99b56eab91e87ac0e6e54758bb5e1b70599e4cc622d5","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-04T08:42:02.795410Z","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:2685905f9b508a31ffc8e81e2855ec95ebe585e8374f77fb6c59c02d4e1eba34","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-05T11:58:44.615537Z","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:250037a630106cf82d644fe25a8d1d657f623302ffcb25e776521707bbd4a6e8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T06:29:33.316428Z","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-07-11T19:05:55.633678Z","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:d5bb78fd6f6ae08e33f4bbc69440b7d0a03db72a1d6dff47be075897414b8145","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-05T06:29:33.316428Z","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-07-17T23:18:30.726014Z","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:acf0ca0605aa20caa5d568facaa32a60b9a89cf7c9559990f6fc44773069fa19","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-05T06:29:33.316428Z","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:3106b700a4dc777b15df421d73fe95c422a4b78ea89dd0a3c8bdb4a820540345","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-05T06:29:33.316428Z","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-06T23:36:52.716922Z","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:cf7dcbbdef58c52f32b24ecf2ac8a3a1a6f9863a0863a907524275031f9ae418","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-05T06:29:33.316428Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 26 inbound Pith citation observations for arXiv:2209.11055."}