{"as_of":"2026-08-05T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a803d89610ddbac6d9389bc0256af82e2f8504d58d27fb2b1c20dba6800c4b24","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-05T06:32:48.257954+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-05-09T19:16:27.774480Z","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-11T15:46:56.227277Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.10847","last_updated":"2019-05-26T17:56:11Z","snapshot_observed_at":"2026-07-06T07:55:34.712383Z","submitted_at":"2019-05-26T17:56:11Z","title":"Simple and Effective Curriculum Pointer-Generator Networks for Reading Comprehension over Long Narratives","version":1},"cited_work":{"arxiv_id":"1905.10847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.10847","snapshot_observed_at":"2026-07-04T23:39:37.561919Z","title":"arXiv preprint arXiv:1905.10847 , year=","venue":null,"work_id":"816a0056-c675-445b-8af6-9394730f2ff6","year":1905},"citing_paper":{"arxiv_id":"2605.00473","last_updated":"2026-05-06T11:29:43Z","snapshot_observed_at":"2026-07-06T23:13:52.304925Z","submitted_at":"2026-05-01T07:22:01Z","title":"Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-09T19:16:27.774480Z"},"links":{"cited_paper":"/paper/1905.10847","citing_paper":"/paper/2605.00473"},"observation_digest":"sha256:3bdeee1b737e824846b7f78fbfe9a06f7e53688e61af607d1ce293d5de5b7f06","observation_id":"f8e93bc3-6e86-4680-836e-1ab13864f024","resolution":{"observed_at":"2026-07-04T23:39:37.561919Z","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/1905.10847/citation-record","integrity":"/paper/1905.10847/integrity","json":"/paper/1905.10847/citation-record.json","paper":"/paper/1905.10847"},"outbound":[],"paper":{"arxiv_id":"1905.10847","last_updated":"2019-05-26T17:56:11Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T07:55:34.712383Z","submitted_at":"2019-05-26T17:56:11Z","title":"Simple and Effective Curriculum Pointer-Generator Networks for Reading Comprehension over Long Narratives"},"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 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1905.10847."}