{"as_of":"2026-08-06T06:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2f110f71aa7975788aaa1bfdea48fc8a029bf38276f553fe2299700f1146643","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-05T06:32:48.257954+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-05-17T09:47:54.977716Z","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-17T09:47:55.143182Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14770","last_updated":"2021-10-27T21:05:00Z","snapshot_observed_at":"2026-07-06T12:02:49.515406Z","submitted_at":"2021-10-27T21:05:00Z","title":"TRAIL: Near-Optimal Imitation Learning with Suboptimal Data","version":1},"cited_work":{"arxiv_id":"2110.14770","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14770","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trail: Near-optimal imitation learning with suboptimal data","venue":null,"work_id":"029c92c3-9fc9-4e37-9534-8ebc63ab8da9","year":2021},"citing_paper":{"arxiv_id":"2310.17596","last_updated":"2023-10-26T17:17:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-26T17:17:31Z","title":"MimicGen: A Data Generation System for Scalable Robot Learning using Human Demonstrations","version":1},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-05-17T09:47:54.977716Z"},"links":{"cited_paper":"/paper/2110.14770","citing_paper":"/paper/2310.17596"},"observation_digest":"sha256:e2c4444e7c2ebf307453a1816b95dab3b7eeca10ad03d03f0dbf3f63eb596110","observation_id":"9fc521cd-03c4-43e0-9000-6b1814af9d79","resolution":{"observed_at":"2026-05-17T09:47:55.145966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14770","last_updated":"2021-10-27T21:05:00Z","snapshot_observed_at":"2026-07-06T12:02:49.515406Z","submitted_at":"2021-10-27T21:05:00Z","title":"TRAIL: Near-Optimal Imitation Learning with Suboptimal Data","version":1},"cited_work":{"arxiv_id":"2110.14770","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14770","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trail: Near-optimal imitation learning with suboptimal data","venue":null,"work_id":"029c92c3-9fc9-4e37-9534-8ebc63ab8da9","year":2021},"citing_paper":{"arxiv_id":"2604.17289","last_updated":"2026-07-01T06:44:29Z","snapshot_observed_at":"2026-07-06T23:04:23.730478Z","submitted_at":"2026-04-19T07:06:35Z","title":"REALM: Reliable Expertise-Aware Language Model Fine-Tuning from Noisy Annotations","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T06:52:11.161442Z"},"links":{"cited_paper":"/paper/2110.14770","citing_paper":"/paper/2604.17289"},"observation_digest":"sha256:344c74d164d478a5245265010636af85597edd0dd0074cac48281c7d74181274","observation_id":"22183939-ea64-4e9e-b944-0555785e3ac2","resolution":{"observed_at":"2026-05-10T06:56:47.725296Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14770/citation-record","integrity":"/paper/2110.14770/integrity","json":"/paper/2110.14770/citation-record.json","paper":"/paper/2110.14770"},"outbound":[],"paper":{"arxiv_id":"2110.14770","last_updated":"2021-10-27T21:05:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:02:49.515406Z","submitted_at":"2021-10-27T21:05:00Z","title":"TRAIL: Near-Optimal Imitation Learning with Suboptimal Data"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.14770."}