{"as_of":"2026-08-18T05:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b9d3f26f4af1445d93540ab0d5bd9fc734e8d19ab31820a6e606ebdd436b50f","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:50:18.553033Z","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-15T20:50:18.933958Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14057","last_updated":"2021-10-26T22:16:35Z","snapshot_observed_at":"2026-08-16T17:46:17.591481Z","submitted_at":"2021-10-26T22:16:35Z","title":"Meta-learning with an Adaptive Task Scheduler","version":1},"cited_work":{"arxiv_id":"2110.14057","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.14057","snapshot_observed_at":"2026-08-15T20:50:18.933958Z","title":"Meta-learning with an Adaptive Task Scheduler","venue":"cs.LG","work_id":"def3686a-3016-4e21-978b-2932e6a69650","year":2021},"citing_paper":{"arxiv_id":"2505.11878","last_updated":"2025-05-17T07:12:12Z","snapshot_observed_at":"2026-08-15T20:43:31.157412Z","submitted_at":"2025-05-17T07:12:12Z","title":"AdaptMol: Adaptive Fusion from Sequence String to Topological Structure for Few-shot Drug Discovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:50:18.553033Z"},"links":{"cited_paper":"/paper/2110.14057","citing_paper":"/paper/2505.11878"},"observation_digest":"sha256:8ed5f6682c8c2309370559a5a839494dbacd22623aebe95a73fcc98315675b63","observation_id":"d93676d3-8166-4c3e-8ceb-65eadafe2456","resolution":{"observed_at":"2026-08-15T20:50:18.938258Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14057/citation-record","integrity":"/paper/2110.14057/integrity","json":"/paper/2110.14057/citation-record.json","paper":"/paper/2110.14057"},"outbound":[],"paper":{"arxiv_id":"2110.14057","last_updated":"2021-10-26T22:16:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:46:17.591481Z","submitted_at":"2021-10-26T22:16:35Z","title":"Meta-learning with an Adaptive Task Scheduler"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.14057."}