{"as_of":"2026-08-18T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:126ca4f1dacff7096ac9655e11e65f3c7fc5a772f9e3023dd784fa2bcbbee0a0","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-18T06:34:40.430872+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-12T18:52:50.680086Z","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-04T22:32:18.196981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.02147","last_updated":"2020-09-04T12:35:42Z","snapshot_observed_at":"2026-07-06T09:52:55.610043Z","submitted_at":"2020-09-04T12:35:42Z","title":"A Practical Incremental Method to Train Deep CTR Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.02147","snapshot_observed_at":"2026-08-12T18:52:50.680086Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.11225","last_updated":"2025-05-06T06:49:00Z","snapshot_observed_at":"2026-08-16T09:39:31.189931Z","submitted_at":"2024-11-18T01:30:34Z","title":"Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T18:52:50.680086Z"},"links":{"cited_paper":"/paper/2009.02147","citing_paper":"/paper/2411.11225"},"observation_digest":"sha256:adc7c1b5cd6775c4ed2807347fc782d09987ae6c468a24230a501034f261e19c","observation_id":"e2b1b9d5-c98c-46cb-95bf-98720113d1e3","resolution":{"observed_at":"2026-08-12T18:52:50.680086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.02147","last_updated":"2020-09-04T12:35:42Z","snapshot_observed_at":"2026-07-06T09:52:55.610043Z","submitted_at":"2020-09-04T12:35:42Z","title":"A Practical Incremental Method to Train Deep CTR Models","version":1},"cited_work":{"arxiv_id":"2009.02147","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.02147","snapshot_observed_at":"2026-08-04T22:32:18.196981Z","title":"A Practical Incremental Method to Train Deep CTR Models","venue":"cs.IR","work_id":"9c11617e-88e1-44a9-9810-8162ccc4d0c3","year":2020},"citing_paper":{"arxiv_id":"2509.07319","last_updated":"2025-09-09T01:35:51Z","snapshot_observed_at":"2026-08-13T05:42:07.547418Z","submitted_at":"2025-09-09T01:35:51Z","title":"MEGG: Replay via Maximally Extreme GGscore in Incremental Learning for Neural Recommendation Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T22:32:17.739272Z"},"links":{"cited_paper":"/paper/2009.02147","citing_paper":"/paper/2509.07319"},"observation_digest":"sha256:c494834e6d89ccca442e557e9d3e9d7686c287486dc7cd37ccc8dd3028ee6c83","observation_id":"8c9c2649-a37c-4bb4-92d8-4f09f6e35edf","resolution":{"observed_at":"2026-08-04T22:32:18.205359Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.02147","last_updated":"2020-09-04T12:35:42Z","snapshot_observed_at":"2026-07-06T09:52:55.610043Z","submitted_at":"2020-09-04T12:35:42Z","title":"A Practical Incremental Method to Train Deep CTR Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.02147","snapshot_observed_at":"2026-08-07T00:14:41.885947Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02738","last_updated":"2026-08-06T05:18:40Z","snapshot_observed_at":"2026-08-09T23:10:04.908200Z","submitted_at":"2026-08-03T18:00:05Z","title":"Knowledge-Geometry Decoupling: Refreshable Pretrained Transfer for Streaming Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:14:41.885947Z"},"links":{"cited_paper":"/paper/2009.02147","citing_paper":"/paper/2608.02738"},"observation_digest":"sha256:7b1e593fec43e0fd0e0722dbdbcae57cf852b05fcdc1d368f9741ef907d2bdac","observation_id":"5f1c7c28-3573-46eb-81c1-35f1d9aa51f4","resolution":{"observed_at":"2026-08-07T00:14:41.885947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.02147/citation-record","integrity":"/paper/2009.02147/integrity","json":"/paper/2009.02147/citation-record.json","paper":"/paper/2009.02147"},"outbound":[],"paper":{"arxiv_id":"2009.02147","last_updated":"2020-09-04T12:35:42Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T09:52:55.610043Z","submitted_at":"2020-09-04T12:35:42Z","title":"A Practical Incremental Method to Train Deep CTR Models"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2009.02147."}