{"as_of":"2026-08-04T21:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b5540caca1aee65120234239332203938b4a4a20ff65eaf4a7af4b820569084","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-04T06:34:03.388597+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-06-30T18:12:16.370781Z","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-06-30T18:14:59.794202Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.12031","last_updated":"2019-09-26T11:23:34Z","snapshot_observed_at":"2026-08-04T21:38:06.310976Z","submitted_at":"2019-09-26T11:23:34Z","title":"Towards Understanding the Transferability of Deep Representations","version":1},"cited_work":{"arxiv_id":"1909.12031","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.12031","snapshot_observed_at":"2026-06-30T18:14:59.794202Z","title":null,"venue":null,"work_id":"1c2d1f14-c8b7-42c7-a149-45b2c15f9401","year":1909},"citing_paper":{"arxiv_id":"2605.19145","last_updated":"2026-05-29T03:14:31Z","snapshot_observed_at":"2026-07-06T23:29:57.003383Z","submitted_at":"2026-05-18T21:53:49Z","title":"PMF-CL: Pareto-Minimal-Forgetting Continual Learner for Conflicting Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T11:53:40.636133Z"},"links":{"cited_paper":"/paper/1909.12031","citing_paper":"/paper/2605.19145"},"observation_digest":"sha256:09dc16e616dea2962508fed8b4306dc7f3f2734af66c9026c7d3e756bfbb9594","observation_id":"9a006f72-d9fb-4422-bb81-5833757f4c31","resolution":{"observed_at":"2026-05-20T11:58:15.353737Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12031","last_updated":"2019-09-26T11:23:34Z","snapshot_observed_at":"2026-08-04T21:38:06.310976Z","submitted_at":"2019-09-26T11:23:34Z","title":"Towards Understanding the Transferability of Deep Representations","version":1},"cited_work":{"arxiv_id":"1909.12031","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.12031","snapshot_observed_at":"2026-06-30T18:14:59.794202Z","title":null,"venue":null,"work_id":"1c2d1f14-c8b7-42c7-a149-45b2c15f9401","year":1909},"citing_paper":{"arxiv_id":"2605.19145","last_updated":"2026-05-29T03:14:31Z","snapshot_observed_at":"2026-07-06T23:29:57.003383Z","submitted_at":"2026-05-18T21:53:49Z","title":"PMF-CL: Pareto-Minimal-Forgetting Continual Learner for Conflicting Tasks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T18:12:16.370781Z"},"links":{"cited_paper":"/paper/1909.12031","citing_paper":"/paper/2605.19145"},"observation_digest":"sha256:f5c0ebc745c928a1a129bf29af0f15f0aaa0dfafa75c630b385956eb037127d7","observation_id":"ee23c7cd-7b6e-4a07-8540-cee82f14cfab","resolution":{"observed_at":"2026-06-30T18:14:59.796330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.12031/citation-record","integrity":"/paper/1909.12031/integrity","json":"/paper/1909.12031/citation-record.json","paper":"/paper/1909.12031"},"outbound":[],"paper":{"arxiv_id":"1909.12031","last_updated":"2019-09-26T11:23:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T21:38:06.310976Z","submitted_at":"2019-09-26T11:23:34Z","title":"Towards Understanding the Transferability of Deep Representations"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1909.12031."}