{"as_of":"2026-08-09T04:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:387fcd07be5155763ae0f13b339d32a385c9a3e9c7719633d05d34b4b09363b0","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-08T06:32:00.761636+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-08-07T13:34:05.534544Z","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-07-03T00:57:30.107990Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.05031","last_updated":"2023-02-10T03:08:37Z","snapshot_observed_at":"2026-07-06T14:50:19.249541Z","submitted_at":"2023-02-10T03:08:37Z","title":"Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05031","snapshot_observed_at":"2026-08-07T13:34:05.534544Z","title":"ISBN 9780974903965","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.21438","last_updated":"2025-05-27T17:13:31Z","snapshot_observed_at":"2026-08-07T13:25:24.025291Z","submitted_at":"2025-05-27T17:13:31Z","title":"Measuring Fine-Grained Relatedness in Multitask Learning via Data Attribution","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T13:34:05.534544Z"},"links":{"cited_paper":"/paper/2302.05031","citing_paper":"/paper/2505.21438"},"observation_digest":"sha256:840b441eb8988f3447ae6e9dd0f536467f386d52c4a6f1c6ff5f3d887241bde6","observation_id":"2599ca78-f547-4267-a051-fea5bc2eb607","resolution":{"observed_at":"2026-08-07T13:34:05.534544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05031","last_updated":"2023-02-10T03:08:37Z","snapshot_observed_at":"2026-07-06T14:50:19.249541Z","submitted_at":"2023-02-10T03:08:37Z","title":"Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System","version":1},"cited_work":{"arxiv_id":"2302.05031","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.05031","snapshot_observed_at":"2026-07-03T00:57:30.107990Z","title":"arXiv:2302.05031 [cs.IR]https://arxiv.org/abs/2302.05031 14 Jiajie Zhu, Yan Wang, Feng Zhu, and Zhu Sun","venue":null,"work_id":"9846f7ae-3afd-4363-b4ab-d936143649e2","year":null},"citing_paper":{"arxiv_id":"2606.10243","last_updated":"2026-06-08T23:13:58Z","snapshot_observed_at":"2026-08-08T13:37:35.818714Z","submitted_at":"2026-06-08T23:13:58Z","title":"DUET -- Dual User Embedding Transformers for Offsite Conversion Prediction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T16:56:12.040446Z"},"links":{"cited_paper":"/paper/2302.05031","citing_paper":"/paper/2606.10243"},"observation_digest":"sha256:e0b110235884440f30da7e5f97fa1f2e374080d1e073daa79b61556eaf8fe794","observation_id":"19c505b4-1bea-404f-a6d1-aaaa24ffb381","resolution":{"observed_at":"2026-07-03T00:57:30.109709Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.05031/citation-record","integrity":"/paper/2302.05031/integrity","json":"/paper/2302.05031/citation-record.json","paper":"/paper/2302.05031"},"outbound":[],"paper":{"arxiv_id":"2302.05031","last_updated":"2023-02-10T03:08:37Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T14:50:19.249541Z","submitted_at":"2023-02-10T03:08:37Z","title":"Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2302.05031."}