{"as_of":"2026-08-15T20:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d44beb31ca942851727d6c315f06f31e0e7dfbbdfe3633bcb2945b0ea3378489","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:26:40.440383Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T12:19:18.744602Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.02695","last_updated":"2022-03-17T17:47:27Z","snapshot_observed_at":"2026-08-15T18:47:07.042241Z","submitted_at":"2021-06-04T20:15:34Z","title":"Meta-Learning with Fewer Tasks through Task Interpolation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02695","snapshot_observed_at":"2026-08-11T14:26:40.440383Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12030","last_updated":"2024-12-16T17:55:55Z","snapshot_observed_at":"2026-08-15T18:47:48.309157Z","submitted_at":"2024-12-16T17:55:55Z","title":"Memory-Reduced Meta-Learning with Guaranteed Convergence","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T14:26:40.440383Z"},"links":{"cited_paper":"/paper/2106.02695","citing_paper":"/paper/2412.12030"},"observation_digest":"sha256:e90e6c1eb8e4f661beb6dcd9364fe57ba5833122e4e3510636af3516580cf5bc","observation_id":"c52a7b2d-90c5-4761-9fb6-6def63dea35e","resolution":{"observed_at":"2026-08-11T14:26:40.440383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02695","last_updated":"2022-03-17T17:47:27Z","snapshot_observed_at":"2026-08-15T18:47:07.042241Z","submitted_at":"2021-06-04T20:15:34Z","title":"Meta-Learning with Fewer Tasks through Task Interpolation","version":2},"cited_work":{"arxiv_id":"2106.02695","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.02695","snapshot_observed_at":"2026-08-07T12:19:18.744602Z","title":"Meta-Learning with Fewer Tasks through Task Interpolation","venue":"cs.LG","work_id":"640c4f21-4acc-4c4a-997b-52809d860ad8","year":2021},"citing_paper":{"arxiv_id":"2505.24792","last_updated":"2025-05-30T16:54:51Z","snapshot_observed_at":"2026-08-15T18:46:19.835466Z","submitted_at":"2025-05-30T16:54:51Z","title":"Lightweight Relational Embedding in Task-Interpolated Few-Shot Networks for Enhanced Gastrointestinal Disease Classification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:19:18.427734Z"},"links":{"cited_paper":"/paper/2106.02695","citing_paper":"/paper/2505.24792"},"observation_digest":"sha256:c6f6c88f8178a15217e2ff16c4994fd0ac2d22f97239410fdaf417abe3c2b408","observation_id":"95466400-fb06-429a-b834-23774d99dec4","resolution":{"observed_at":"2026-08-07T12:19:18.827074Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.02695/citation-record","integrity":"/paper/2106.02695/integrity","json":"/paper/2106.02695/citation-record.json","paper":"/paper/2106.02695"},"outbound":[],"paper":{"arxiv_id":"2106.02695","last_updated":"2022-03-17T17:47:27Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T18:47:07.042241Z","submitted_at":"2021-06-04T20:15:34Z","title":"Meta-Learning with Fewer Tasks through Task Interpolation"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2106.02695."}