{"as_of":"2026-08-08T08:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4601c31e4312a3cca4e5803003a578bfb3e253ffb54f43938d55befdc1c7c36","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:09:34.982317Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T05:34:40.092300Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.00196","last_updated":"2023-05-24T22:27:47Z","snapshot_observed_at":"2026-07-06T14:25:24.844889Z","submitted_at":"2022-12-01T00:53:04Z","title":"Data-Efficient Finetuning Using Cross-Task Nearest Neighbors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00196","snapshot_observed_at":"2026-08-07T15:09:34.982317Z","title":"Data-efficient finetuning using cross-task nearest neighbors.arXiv preprint arXiv:2212.00196, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16066","last_updated":"2025-05-21T22:34:13Z","snapshot_observed_at":"2026-08-07T15:05:27.211434Z","submitted_at":"2025-05-21T22:34:13Z","title":"Merge to Mix: Mixing Datasets via Model Merging","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:09:34.982317Z"},"links":{"cited_paper":"/paper/2212.00196","citing_paper":"/paper/2505.16066"},"observation_digest":"sha256:d1546d2c7321ed49711e002f6c92b100b77a6d397fffd907af4e60e9c2dc5b20","observation_id":"15decaa6-3bf7-424e-a18f-20552597bf02","resolution":{"observed_at":"2026-08-07T15:09:34.982317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00196","last_updated":"2023-05-24T22:27:47Z","snapshot_observed_at":"2026-07-06T14:25:24.844889Z","submitted_at":"2022-12-01T00:53:04Z","title":"Data-Efficient Finetuning Using Cross-Task Nearest Neighbors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00196","snapshot_observed_at":"2026-08-06T12:47:43.563797Z","title":"Smith, Hannaneh Hajishirzi, and Pradeep Dasigi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.21482","last_updated":"2025-07-29T03:51:00Z","snapshot_observed_at":"2026-08-07T22:01:33.492073Z","submitted_at":"2025-07-29T03:51:00Z","title":"Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T12:47:43.563797Z"},"links":{"cited_paper":"/paper/2212.00196","citing_paper":"/paper/2507.21482"},"observation_digest":"sha256:8b09a15c14c6b06412b534accdb64ac5c6a361052d284f87590f7087c94176ce","observation_id":"5b4c75f5-68b9-4e18-9cc6-09033fc2cf0e","resolution":{"observed_at":"2026-08-06T12:47:43.563797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00196","last_updated":"2023-05-24T22:27:47Z","snapshot_observed_at":"2026-07-06T14:25:24.844889Z","submitted_at":"2022-12-01T00:53:04Z","title":"Data-Efficient Finetuning Using Cross-Task Nearest Neighbors","version":2},"cited_work":{"arxiv_id":"2212.00196","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.00196","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2212.00196 , year=","venue":null,"work_id":"146cad0b-87b2-4dfb-a7b4-1bc907cda201","year":null},"citing_paper":{"arxiv_id":"2605.22389","last_updated":"2026-05-21T12:21:41Z","snapshot_observed_at":"2026-07-06T23:32:44.699825Z","submitted_at":"2026-05-21T12:21:41Z","title":"Unified Data Selection for LLM Reasoning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-22T05:33:20.930156Z"},"links":{"cited_paper":"/paper/2212.00196","citing_paper":"/paper/2605.22389"},"observation_digest":"sha256:5a812c1ce05256dfc5a15c3e3d24c6efc8f8ec063a2ac9e5c24ee7a3bac1748b","observation_id":"1994955c-f302-4052-806b-4bb69c806613","resolution":{"observed_at":"2026-05-22T05:34:40.095439Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.00196/citation-record","integrity":"/paper/2212.00196/integrity","json":"/paper/2212.00196/citation-record.json","paper":"/paper/2212.00196"},"outbound":[],"paper":{"arxiv_id":"2212.00196","last_updated":"2023-05-24T22:27:47Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T14:25:24.844889Z","submitted_at":"2022-12-01T00:53:04Z","title":"Data-Efficient Finetuning Using Cross-Task Nearest Neighbors"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2212.00196."}