{"as_of":"2026-08-19T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94278cfa7926bb90047c111cbdcd5fbfee0527a5c5bdbd62d74d786a85bef82f","coverage":[{"denominator":155,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:14:51.481732Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20863/citation-record","integrity":"/paper/2607.20863/integrity","json":"/paper/2607.20863/citation-record.json","paper":"/paper/2607.20863"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:43.575261Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:43.575261Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:afbba28f7c72c00b77dde4af0320415f8d78aa61fee87d7b6a238f351eaaea42","observation_id":"7102421f-02ff-416b-bcda-f798ed878af0","resolution":{"observed_at":"2026-08-01T09:14:43.575261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:43.662292Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:43.662292Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b79bacc2c4bdd800ed6d96fe09d90d14472bc233b388efd37907eb826e4fed56","observation_id":"89ae2444-6192-429c-8a3a-14b8135f5ada","resolution":{"observed_at":"2026-08-01T09:14:43.662292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:43.726604Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:43.726604Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:a4c501028b960726a2fc69cd4614487a5328f82a2cd568cdecdafef82b3691a1","observation_id":"7ffec7bf-6092-4497-b3c9-2e93b9fa3a41","resolution":{"observed_at":"2026-08-01T09:14:43.726604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:43.834239Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:43.834239Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b00d27ef42945124c0ae2aa7ebffefd74c53ed51bc2345e9fd2dc3958c5384be","observation_id":"201708ce-c882-4851-92fb-aa08ff39ee91","resolution":{"observed_at":"2026-08-01T09:14:43.834239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:43.909267Z","title":"Publication quality tables in","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:43.909267Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:68eceff673908ae0cd9caacefb8d305e4e188b21ff4b465c3631003cf4bb48e4","observation_id":"c107ad65-b8a9-45ef-8cc6-a82eb8400f77","resolution":{"observed_at":"2026-08-01T09:14:43.909267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.018759Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.018759Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:4acd08bf31f3e7bebe9e267ef848455957663b0a247be831d5106fc1c23cb090","observation_id":"5bfad1e5-6d78-41c2-8137-6cc03aa54524","resolution":{"observed_at":"2026-08-01T09:14:44.018759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.097658Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.097658Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:3f975b6572d03389702a903fc10c127059d221a73318d9062b0d12e418233f15","observation_id":"8a32fcfe-c74c-4f56-946c-9ddd57c5f239","resolution":{"observed_at":"2026-08-01T09:14:44.097658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.179037Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.179037Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:3794f6c170779464ed489c75f6c9ca93e674f07238513059fb74703a56399bea","observation_id":"e5e95367-dd1b-4067-902f-9a65276ebd85","resolution":{"observed_at":"2026-08-01T09:14:44.179037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.241394Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.241394Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:119215a7885f3e5547583884b7bf44ecf15fbfb5f1f6668390a6d59409ec5b35","observation_id":"7a9672e3-e424-452f-b70e-e5a8d47761d5","resolution":{"observed_at":"2026-08-01T09:14:44.241394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.314739Z","title":"TKDE , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.314739Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0b8a7b717aaa9a67a75f09ff089eac02697107b409581eff12c8137236b36d9b","observation_id":"7de15947-ef9e-46a1-89e0-720222d41643","resolution":{"observed_at":"2026-08-01T09:14:44.314739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.446436Z","title":"CVPR , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.446436Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:365a6daedfcedda9e1279e8aa4f0536f649a86cb257dfd2971a20ffa32add1f4","observation_id":"89af51a1-a43b-414a-99a0-d2b319b0c54b","resolution":{"observed_at":"2026-08-01T09:14:44.446436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.502230Z","title":"KDD , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.502230Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:13f2f88b8891dd5f4ec0abc561423b20f486fe75cb0e259c558537232cabdbac","observation_id":"a1f84d63-6e41-4d97-821f-203b33968c88","resolution":{"observed_at":"2026-08-01T09:14:44.502230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.563902Z","title":"ECCV , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.563902Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:3ce120358c4dcd458eac99f6bb3a0c4ea2a4c29f4df6378190f80d1a5b1808c7","observation_id":"e9acca34-90a1-45f0-ad93-e4bb543edf90","resolution":{"observed_at":"2026-08-01T09:14:44.563902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.621962Z","title":"Joty and Muhammad Imran , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.621962Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:940f44ac8ea478aae1bd3d2a32e88526204a919c1555ecea5a51a51ec39ea0fc","observation_id":"fb20ea81-3552-4e16-aaa9-347cab3bcad5","resolution":{"observed_at":"2026-08-01T09:14:44.621962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.673805Z","title":"SIU , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.673805Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:23ee462ddc910bc4161a3bc88c577a25add27c92f1da15448eee370a56664d88","observation_id":"42f6ccf6-a77d-46a9-8ef9-16c213ad40f7","resolution":{"observed_at":"2026-08-01T09:14:44.673805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.10240","last_updated":"2022-06-15T20:16:03Z","snapshot_observed_at":"2026-08-11T01:12:56.590030Z","submitted_at":"2020-04-21T18:53:42Z","title":"Deep Learning for Time Series Forecasting: Tutorial and Literature Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.10240","snapshot_observed_at":"2026-08-01T09:14:44.734964Z","title":"arXiv preprint arXiv:2004.10240 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.734964Z"},"links":{"cited_paper":"/paper/2004.10240","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:30c5bf37af8ba0ba26ce54b8dec0e03800a4aafed37b82ce3b34e6bf87b42e26","observation_id":"e2f48f18-a0d6-495a-8a99-df6f947266fa","resolution":{"observed_at":"2026-08-01T09:14:44.734964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05264","last_updated":"2019-06-14T09:26:38Z","snapshot_observed_at":"2026-08-19T18:31:17.943138Z","submitted_at":"2019-06-12T17:44:53Z","title":"GluonTS: Probabilistic Time Series Models in Python","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05264","snapshot_observed_at":"2026-08-01T09:14:44.810658Z","title":"arXiv preprint arXiv:1906.05264 , year=","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.810658Z"},"links":{"cited_paper":"/paper/1906.05264","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b0f8ed1455f3e5e7ba7b6f5afc2ae69c8f258ae428726d58aff169f7cea1fdc8","observation_id":"e8ec1bdf-18ae-412f-b7d5-18219c12153d","resolution":{"observed_at":"2026-08-01T09:14:44.810658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:44.899066Z","title":"ICML , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:44.899066Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b44400b4694932dde28dd8e755ef869d45a09057a31f73eec703958bb2dc4751","observation_id":"e2fea9e3-7930-4008-9077-826543bfd735","resolution":{"observed_at":"2026-08-01T09:14:44.899066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.015764Z","title":"RecSys , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.015764Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:1804f3081258fe077063b626a19753971da070fde40e26ac4c4c407b94fa30a5","observation_id":"49a29e7c-7b42-4972-8b40-0c527ff7c020","resolution":{"observed_at":"2026-08-01T09:14:45.015764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.088785Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.088785Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:00f75f372939887c0d6f59e4dd261c62885bc5d8aa28ddfed317d4cfb4a4fda9","observation_id":"69414ae8-c0bb-44c4-bcb7-8a11a0969b00","resolution":{"observed_at":"2026-08-01T09:14:45.088785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.137426Z","title":"Convolutional","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.137426Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:afaba050a056d8322654a3a489943a5b0a6082d0c4fc2672e7578d829d534e17","observation_id":"0c82b40e-f79d-4ea0-9b7e-69b24fd53e3f","resolution":{"observed_at":"2026-08-01T09:14:45.137426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.192468Z","title":"KDD , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.192468Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d109e777956b5aa12a648e409523f01928a13e23578435f35b70a906a5808882","observation_id":"9f4594bd-a31b-4860-97e9-6a71103eb7b3","resolution":{"observed_at":"2026-08-01T09:14:45.192468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.251988Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.251988Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:6a606aac2386abe612095a26e414f0c93d6d4dc2ecd05c37a97a304c238c34e5","observation_id":"e4d82614-c3bb-4a96-97bc-9ac0284043a0","resolution":{"observed_at":"2026-08-01T09:14:45.251988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.362840Z","title":"TDKE , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.362840Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:ab420d0d6d22607369cd494036065993bed74b5a8a9d8d088abe229a93f54d13","observation_id":"d550812d-2c1b-4371-a97a-1500669fbd0f","resolution":{"observed_at":"2026-08-01T09:14:45.362840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.419218Z","title":"CSUR , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.419218Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:69cbec4397bd863ff21b302d0b2927ba4561c642b7f1c94a7cea3cabc1e66816","observation_id":"c7be163e-2ca3-4ada-a10a-05308eba1137","resolution":{"observed_at":"2026-08-01T09:14:45.419218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.483209Z","title":"AAAI StarAI Workshop , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.483209Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:a7354a31a69a82af4eafd7f8f7e0771f2f1a96c72be723709085439aeecef157","observation_id":"77450538-deb7-4de3-879a-f1ec2f138751","resolution":{"observed_at":"2026-08-01T09:14:45.483209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.540864Z","title":"Frontiers in genetics , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.540864Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d6be49f3dedc8550a6719078b568fecb21aa26eb0f850eb69e718bba2bda576d","observation_id":"aab71523-93f3-45e9-935a-443f016e9a63","resolution":{"observed_at":"2026-08-01T09:14:45.540864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.591802Z","title":"ICML , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.591802Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:6b5e8c40505cf16bd8c959e371fde5b49282b51da8b7071861fafce72f6c036c","observation_id":"fa66b114-0ced-448b-a963-80c35b7c49da","resolution":{"observed_at":"2026-08-01T09:14:45.591802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-16T17:15:12.044506Z","submitted_at":"2022-03-11T21:19:31Z","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-01T09:14:45.679640Z","title":"arXiv preprint arXiv:2203.11014 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.679640Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:fc09059e2b79bd187a74e1dada871ff90a3db4f1fa1fff662f871bdd460260ae","observation_id":"5a248ad2-5846-489f-b42d-037b3b6cbfaf","resolution":{"observed_at":"2026-08-01T09:14:45.679640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.746474Z","title":"2017 , school=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.746474Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:038113896713670b48d0719c83a098c9b4f9a445f68bbaa7a9edf5a509f520da","observation_id":"8cad0a6b-7e06-4698-819b-308f73e457fc","resolution":{"observed_at":"2026-08-01T09:14:45.746474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.818614Z","title":"2022 , booktitle=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.818614Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:9da880a0ebfd6c89f6db23e9a402b4b6d7ddbfd430b2661e76680555e2b92aa8","observation_id":"3487ab9c-b774-4bc2-8468-3b30e3d694ac","resolution":{"observed_at":"2026-08-01T09:14:45.818614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.903309Z","title":"Nature medicine , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.903309Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:19abb83452fa620590b503a18de57365db885c8b90968d253b9c1aea85214611","observation_id":"7f2fe757-b214-4ed4-8ce2-e05fbf929d40","resolution":{"observed_at":"2026-08-01T09:14:45.903309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:45.989084Z","title":"Nature medicine , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:45.989084Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:4c1c34852500047c7930dfc11e0e26787db24e30b0eaa313ae1356cc6c504b9e","observation_id":"cb6aceea-b46f-4022-8885-75b0a7aac1f2","resolution":{"observed_at":"2026-08-01T09:14:45.989084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1111.0352","last_updated":"2012-06-14T15:05:55Z","snapshot_observed_at":"2026-08-15T04:30:15.966857Z","submitted_at":"2011-11-02T00:09:18Z","title":"Revisiting k-means: New Algorithms via Bayesian Nonparametrics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.0352","snapshot_observed_at":"2026-08-01T09:14:46.072879Z","title":"arXiv preprint arXiv:1111.0352 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.072879Z"},"links":{"cited_paper":"/paper/1111.0352","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:9778178ce348c589bb28b270c6e688d38ad0801af6d0d73bffb604bf37486701","observation_id":"56558e95-4bc4-449b-84f5-59c76bf7a520","resolution":{"observed_at":"2026-08-01T09:14:46.072879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00091","last_updated":"2019-05-31T21:51:16Z","snapshot_observed_at":"2026-08-14T16:22:46.075072Z","submitted_at":"2019-05-31T21:51:16Z","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00091","snapshot_observed_at":"2026-08-01T09:14:46.160599Z","title":"arXiv preprint arXiv:1906.00091 , year=","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.160599Z"},"links":{"cited_paper":"/paper/1906.00091","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:f87703932d212e73327b79ca43076af4b19585cd55e03c89674b95505203352f","observation_id":"65a1db2b-1bdf-45e9-ab05-22c8a8e0f36f","resolution":{"observed_at":"2026-08-01T09:14:46.160599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.225418Z","title":"Acm transactions on interactive intelligent systems (tiis) , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.225418Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:9b4c8bd6bfad0daab27ce3b526c6474df63e22a2e0690ba619ce9d8c05dcca51","observation_id":"e1acb945-aa9f-4c81-a9a2-3d59ba3a3ba6","resolution":{"observed_at":"2026-08-01T09:14:46.225418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.310567Z","title":"Proceedings of the 26th international conference on world wide web , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.310567Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d7d5a0efa8d7f09c37955da0dffa07e3a5f3d37fdb787b071b2c377589eee677","observation_id":"59515d97-642a-4ff2-be9d-7346e6e7d248","resolution":{"observed_at":"2026-08-01T09:14:46.310567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.396084Z","title":"Computer Speech & Language , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.396084Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:6495082d34bb453b533989f1b725d8c563d0ba652d4e828f77f8573171311a59","observation_id":"77333b2e-eaf8-46b6-9686-6d50b4f9fd1d","resolution":{"observed_at":"2026-08-01T09:14:46.396084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.459943Z","title":"Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.459943Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d63b486177a4249422cd2fd22243b32146e90f2f397f5dfe95715fb68ebb87de","observation_id":"95f37538-0a68-4927-99d3-be9902c4c071","resolution":{"observed_at":"2026-08-01T09:14:46.459943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.538503Z","title":"Relational stacked denoising autoencoder for tag recommendation , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.538503Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:7638f85c9e546bb6cf91168e1a023930f8940005a4e42eec0d08a6ffa9485c69","observation_id":"fcb53333-a764-4f7e-8330-5446caae3d86","resolution":{"observed_at":"2026-08-01T09:14:46.538503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.601007Z","title":"TKDE , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.601007Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:57c55421f2e791ac81a5f07b8c3ad068508e3c2d7207e0c56fa1ae5621fd92d0","observation_id":"f212ed7c-55bd-48c7-a79a-5c07683faa78","resolution":{"observed_at":"2026-08-01T09:14:46.601007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.687385Z","title":"Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.687385Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:bfbcbeb6324ca3557f3e2f9e86d7f5028c6c92a233dc897264215775bd61e99c","observation_id":"15bac448-7686-4d7f-a491-6882a7392020","resolution":{"observed_at":"2026-08-01T09:14:46.687385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.785321Z","title":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.785321Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:3daf61aec1afb7bc36eded01f083c5e707568616ac9f4d3ac712a85bb65f1b91","observation_id":"504896d8-5e47-4de2-9f08-d03d427580f2","resolution":{"observed_at":"2026-08-01T09:14:46.785321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.856838Z","title":"IJCAI , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.856838Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:20c40bc4088a1731c78e4d1f6a4da42a1faa24c012183d8f3363412cab8a99c7","observation_id":"eb23c5af-cae9-430d-b299-307e39fc1c42","resolution":{"observed_at":"2026-08-01T09:14:46.856838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.919341Z","title":"Bell and Chris Volinsky , title =","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.919341Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:1c067455056c7c9a1b3b028a97c20aa6ed19ed11b964dc3298481dc61866e486","observation_id":"85f796c3-9a83-40d5-97c5-fdee37609970","resolution":{"observed_at":"2026-08-01T09:14:46.919341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:46.975655Z","title":"Session-based Recommendations with Recurrent Neural Networks , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:46.975655Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:37e28aa11f38ee3af531e255e623af1fd14c4b1c7b9e2b805c9b1c6cc5cdb49a","observation_id":"53d50aea-174b-4717-a5ea-5b9a1cba1cd7","resolution":{"observed_at":"2026-08-01T09:14:46.975655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.079258Z","title":"KDD , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.079258Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8004ec01e9edbd6e2741eca0f4700c79ca4b0f6e23c8f35686d5fefc2055489c","observation_id":"73babdf7-5f30-4aec-af42-f33bf7776e5b","resolution":{"observed_at":"2026-08-01T09:14:47.079258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.139729Z","title":"Zico Kolter and Vladlen Koltun , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.139729Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:7998461158ada43923d5567ca296ea16c164d4eaa5766dd5bad8d58cef6872d1","observation_id":"04f1f0a4-0b88-41dc-b43a-3ba31e087360","resolution":{"observed_at":"2026-08-01T09:14:47.139729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.193280Z","title":"Proceedings of the VLDB Endowment , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.193280Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:bd5b379d58b133a51d1a7fb1a50ab39d0141bc05b97100d93c0d8dc6d09864b7","observation_id":"9bcebe06-79b2-4eb2-8221-5f7fcd0f4684","resolution":{"observed_at":"2026-08-01T09:14:47.193280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.279982Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.279982Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0b9f0e69f808daabf12c0f51b12843aee3ba8711d5e42f163d70cc956286c920","observation_id":"7e37c1ab-a5a4-4015-98b2-3267c896195b","resolution":{"observed_at":"2026-08-01T09:14:47.279982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.397722Z","title":"Maddix and Jan Gasthaus and Dean Foster and Tim Januschowski , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.397722Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0b4950c50dd4b8b0ab38bdf511a42889626be1539a612efc5cd0770fbb926335","observation_id":"326f6817-0ca6-4b3a-a1d0-280954a3464a","resolution":{"observed_at":"2026-08-01T09:14:47.397722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.450196Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.450196Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8bccc41489546105d4e75515099b48a65f9cd8ae5e4e9889df4c4c80fadb6332","observation_id":"6e4925bc-ad09-4d98-88fc-3394cb9f321f","resolution":{"observed_at":"2026-08-01T09:14:47.450196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.507554Z","title":"IEEE transactions on power systems , volume=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.507554Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:4b1b3608039f2933f36d479d134568ef75ccb313c87e26842009ff45fae6253b","observation_id":"311310d3-9768-418f-879b-f2f2fe04e1c8","resolution":{"observed_at":"2026-08-01T09:14:47.507554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.597345Z","title":"international conference on machine learning , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.597345Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:a725c3e4f3fcb1aba2235e469450b548bc3658768322a19537b4eeb690bf0525","observation_id":"735294d2-9bbe-43a8-853a-d6db643527e6","resolution":{"observed_at":"2026-08-01T09:14:47.597345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.685190Z","title":"Advances in neural information processing systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.685190Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:22f04ac6838d06f16626b8bb99881864e9a60a096d41895756c64345afa82a5e","observation_id":"f135df45-65c9-4bae-adb4-e4d3d3e4bec4","resolution":{"observed_at":"2026-08-01T09:14:47.685190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.741651Z","title":"Natural-Parameter Networks:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.741651Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:cecd1dda66bd098f6f0c8a439606faaa1b4b91cc9659348388d101d61242bc70","observation_id":"435bc91e-193d-4aec-b6dc-fc9955c12ee8","resolution":{"observed_at":"2026-08-01T09:14:47.741651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-01T09:14:47.793978Z","title":"arXiv preprint arXiv:1312.6114 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.793978Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:ac88d7a9867a9991af6a572b6b1601273c5d4ed6c6b4b4672a4ad153c2dd43b9","observation_id":"c26a12c9-b281-4e8a-b1ad-07c240c58132","resolution":{"observed_at":"2026-08-01T09:14:47.793978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.879308Z","title":"2013 , publisher=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.879308Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:77597a008fcdbde23319e97c764eb926c07935fbed2a8ccdc11e35c2bcffcc0e","observation_id":"de044a53-1773-49df-931e-989ffdcf9825","resolution":{"observed_at":"2026-08-01T09:14:47.879308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:47.967661Z","title":"Kingma and Jimmy Ba , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:47.967661Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b04a772e1f978422efece3412dcc427ed625ef9d92367a539dc88d9b81e1d821","observation_id":"8dc2ff36-1bac-4f3e-9ca5-189ca1ea431d","resolution":{"observed_at":"2026-08-01T09:14:47.967661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.074644Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.074644Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0d99b7e83b4fcd4666cd381cca61624379dac48cbae0da085fdf35ecfe0c065b","observation_id":"40dc1c29-0d7b-4ac9-ad08-fd89b0e8e600","resolution":{"observed_at":"2026-08-01T09:14:48.074644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.162576Z","title":"Gordon , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.162576Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:64e348da403ff7dc56adc008feb18faf9355ee66987131c52df9471b45c97228","observation_id":"49fddea9-8e5c-4074-acfe-e7091a2ba77c","resolution":{"observed_at":"2026-08-01T09:14:48.162576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.224245Z","title":"VLDB , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.224245Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:4eac7cdfac6c69e9b34d1d7e8899107a711e99fab999b3f78ac62499ccf7f791","observation_id":"23e93cec-4b85-4f5a-9e35-74c523b91d66","resolution":{"observed_at":"2026-08-01T09:14:48.224245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.280797Z","title":"AAAI , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.280797Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:35e70e6ba18a4dcf7b4d86e7b09452a0bd38c67ded049e12f050d93d8b1f11b6","observation_id":"4a01a87b-b417-402a-a6bc-769593e0fbb7","resolution":{"observed_at":"2026-08-01T09:14:48.280797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.338503Z","title":"Adversarial Multiple Source Domain Adaptation , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.338503Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:5bc8c36a411dcea362cde45e912bdec32fdfde4bb57d3f6aac7afd4a279ae560","observation_id":"05e6fd5e-ebb5-4be4-930f-b108e03fae83","resolution":{"observed_at":"2026-08-01T09:14:48.338503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.424716Z","title":"Castillo and Rama Chellappa , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.424716Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:892e2210b2ba57b0bb07ad8f05fbb6b5aea7e4dd608c94971cf029cfe61b916e","observation_id":"8fe4cb2a-1bbe-46f9-80a9-517af2642fd5","resolution":{"observed_at":"2026-08-01T09:14:48.424716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.500545Z","title":"CVPR , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.500545Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:9c3889856f2cebbae6ddaab94bbaf0ae9dbfa7f915e4e157a453cf8e262f5b5c","observation_id":"1cf07320-a93f-483e-a072-632e79b2ea97","resolution":{"observed_at":"2026-08-01T09:14:48.500545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.570548Z","title":"Jordan , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.570548Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d97f729810dc9ca6508900e05dbf7d7961cdf9dd287d2a55cf50f3426cc488f4","observation_id":"94459d9c-4279-48e3-947f-1e5faf026041","resolution":{"observed_at":"2026-08-01T09:14:48.570548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.622278Z","title":"TKDE , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.622278Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:c303739ba9ae4b6f7573bb347273266372093dc008d736faa368b0c52aa0dfc1","observation_id":"c3e61ee0-d61d-47f5-86bd-b217602d4326","resolution":{"observed_at":"2026-08-01T09:14:48.622278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.677827Z","title":"JAMA , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.677827Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:95d34436cb0854b7fa80cdb8ab54d4a5bb3d3cb850625242457c718d63a72d6f","observation_id":"5b3c251c-7723-4cce-960a-e790024106c7","resolution":{"observed_at":"2026-08-01T09:14:48.677827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.757084Z","title":"JAMA , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.757084Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:97c5b484f329b6917f3131ce2cab0d7c35ccf996f57924e0100db03674f5a648","observation_id":"54a22bf1-e7f0-4b0c-8509-8861f4947e21","resolution":{"observed_at":"2026-08-01T09:14:48.757084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.814773Z","title":"Sleep , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.814773Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:28b7ed01b568325e20fb6586f2c9a87a8e12c4eb1b7d5f8aad1c4d62855798bf","observation_id":"2d7449aa-f3f7-4173-baa9-412ee5df1511","resolution":{"observed_at":"2026-08-01T09:14:48.814773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.872147Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.872147Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0802c3cecf8c8058e53d15faf1d98b52b660a93537da91448975e038bb80ee5d","observation_id":"f15d2607-7391-4b19-8ba8-6a4548524837","resolution":{"observed_at":"2026-08-01T09:14:48.872147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.927051Z","title":"1994 , publisher=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.927051Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8d741e713b17f7fc991d3b4ef1bcd0af65a600cc70bde32b4e19001d4e6d2ae4","observation_id":"7c94f725-8df4-4e18-9f2b-1703e523bf37","resolution":{"observed_at":"2026-08-01T09:14:48.927051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:48.987678Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:48.987678Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:92585cdb25dbb644ac4d0a6a46dbb734a183f6d116f20004bf416ae0bbe92c2f","observation_id":"a7d5cbea-e731-4578-9815-7c2d068ed5bf","resolution":{"observed_at":"2026-08-01T09:14:48.987678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.070440Z","title":"Jaakkola and Matt T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.070440Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:49fe84d50b56a89bb3b048ec5efc69723a9ccc3cdf7c1c70afc9be87eac7c92e","observation_id":"e5e77651-9979-401f-bd96-e896e17763d1","resolution":{"observed_at":"2026-08-01T09:14:49.070440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.127895Z","title":"ICCV workshop on Transferring and Adapting Source Knowledge in Computer Vision (TASK-CV) , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.127895Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:44f5b8b7c0636fcd75510b449da48f0628278294636dfa01c33157d969496afa","observation_id":"9413b0b4-a819-4b4b-adfc-f54f9d5be41c","resolution":{"observed_at":"2026-08-01T09:14:49.127895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.198040Z","title":"Machine learning , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.198040Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:58e7e33e87728bc8f5b32374d76e193876ee8086439f49089f5bdf393e4c7dfd","observation_id":"a4632dbf-39ff-426b-8b74-f34fc82f33cf","resolution":{"observed_at":"2026-08-01T09:14:49.198040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.271453Z","title":"TNN , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.271453Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:3541957f5b6142d79eb0db72ec3949745e693085078a6cbe05a3154752813029","observation_id":"d3fe33c5-52e1-4fea-be3d-6c3fc8f772f0","resolution":{"observed_at":"2026-08-01T09:14:49.271453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3474","last_updated":"2014-12-10T21:20:54Z","snapshot_observed_at":"2026-08-14T23:08:06.157493Z","submitted_at":"2014-12-10T21:20:54Z","title":"Deep Domain Confusion: Maximizing for Domain Invariance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3474","snapshot_observed_at":"2026-08-01T09:14:49.333988Z","title":"arXiv preprint arXiv:1412.3474 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.333988Z"},"links":{"cited_paper":"/paper/1412.3474","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:daff72ff1a74fb4d931bd2ae2a4809e4975ab5c53cd9b1a08202facadb2e6ff9","observation_id":"aa81fd12-f902-4f52-93ed-128a455a8022","resolution":{"observed_at":"2026-08-01T09:14:49.333988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.413173Z","title":"CVPR , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.413173Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8507583ea76244c50d4c70b8b4d218a8b76af2e9f87fbfa66d0ec58f1edf69c2","observation_id":"58db1a45-0799-4cff-86f9-f0a9ebadbf12","resolution":{"observed_at":"2026-08-01T09:14:49.413173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05801","last_updated":"2019-07-22T18:18:17Z","snapshot_observed_at":"2026-08-14T16:47:56.973036Z","submitted_at":"2019-04-11T16:00:10Z","title":"Bridging Theory and Algorithm for Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05801","snapshot_observed_at":"2026-08-01T09:14:49.463952Z","title":"arXiv preprint arXiv:1904.05801 , year=","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.463952Z"},"links":{"cited_paper":"/paper/1904.05801","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:06400a5c5ff5f0d29c145e81183bf04ea21fc0da8b59a4a7e3e78b2928dd54a3","observation_id":"a5eaa36d-dc72-43c5-bc28-bfb168f30cce","resolution":{"observed_at":"2026-08-01T09:14:49.463952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.12751","last_updated":"2018-11-30T12:02:45Z","snapshot_observed_at":"2026-08-14T17:50:39.390002Z","submitted_at":"2018-11-30T12:02:45Z","title":"Domain-Invariant Adversarial Learning for Unsupervised Domain Adaption","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.12751","snapshot_observed_at":"2026-08-01T09:14:49.582292Z","title":"arXiv preprint arXiv:1811.12751 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.582292Z"},"links":{"cited_paper":"/paper/1811.12751","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:5b9cbbe91fee77f70e070aeaf7c23e4e86fcdc1d6d00ec19058884a6b2343033","observation_id":"a09a5e18-0f24-41b1-a2e9-d2a6527a4d0d","resolution":{"observed_at":"2026-08-01T09:14:49.582292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.05374","last_updated":"2017-03-30T15:42:12Z","snapshot_observed_at":"2026-08-14T21:16:00.098867Z","submitted_at":"2017-02-17T15:07:40Z","title":"Domain Adaptation for Visual Applications: A Comprehensive Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.05374","snapshot_observed_at":"2026-08-01T09:14:49.672153Z","title":"arXiv preprint arXiv:1702.05374 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.672153Z"},"links":{"cited_paper":"/paper/1702.05374","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:9d833a63be4c44c41eabf6b6c9191879d82b35ecb0a655bb54c661abea7cfa6b","observation_id":"4a63249b-f368-4c44-ab25-8db5fe325e48","resolution":{"observed_at":"2026-08-01T09:14:49.672153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.754730Z","title":"CVPR , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.754730Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:727ade72ed23917b8dc129357fd9158f12c932e20a24fdc1f9081b6766752667","observation_id":"21de53b0-3cbe-438f-b7e3-769d606f14cc","resolution":{"observed_at":"2026-08-01T09:14:49.754730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.836141Z","title":"JMLR , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.836141Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:c23102995eb9a4fddf45d36430229afb9d5fa7d6df7dd8ab6aa9f9f606aed0a1","observation_id":"6b57b201-f459-48d1-a424-82760c204d05","resolution":{"observed_at":"2026-08-01T09:14:49.836141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.895857Z","title":"NIPS , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.895857Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:13139d7cc0a7561d1230553906f92331839d740a09c6b516c874463874e299b2","observation_id":"b526e42d-a69c-4cc9-be7c-d8047b3ddebf","resolution":{"observed_at":"2026-08-01T09:14:49.895857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:49.979970Z","title":"CVPR , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:49.979970Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:db1d5e9eca0eafe2155f0cc1a4949b0811849db1fbda3e6be90604f0ee3f2145","observation_id":"700ea91b-9bb9-493e-bc9f-af77bf6dcab2","resolution":{"observed_at":"2026-08-01T09:14:49.979970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.043649Z","title":"KDD , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.043649Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:0ae3b8cd8a9f70c2254a5c96735f978931f40f93cdc5740e91414bed3318d242","observation_id":"ac7c09ef-fa58-49e2-90c8-858bc64ba0a5","resolution":{"observed_at":"2026-08-01T09:14:50.043649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.138912Z","title":"CVPR , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.138912Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:48b316b0bab03b547b355814c50c96e7b59800688a81c4dc92c4a11e03b54709","observation_id":"e9d3bcaa-35c3-432b-8595-b756b5786df6","resolution":{"observed_at":"2026-08-01T09:14:50.138912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.301444Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.301444Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8b2fbbed6a6bd02de81c19b80a6b693ea587bbfad7551fcac37efc8b49a114b3","observation_id":"41547fa0-4762-4e13-a368-e5634dd76589","resolution":{"observed_at":"2026-08-01T09:14:50.301444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.11448","last_updated":"2019-11-04T16:39:12Z","snapshot_observed_at":"2026-07-06T08:24:29.472112Z","submitted_at":"2019-09-20T03:43:35Z","title":"Forward-Backward Splitting for Optimal Transport based Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.11448","snapshot_observed_at":"2026-08-01T09:14:50.436764Z","title":"arXiv preprint arXiv:1909.11448 , year=","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.436764Z"},"links":{"cited_paper":"/paper/1909.11448","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:127568da35869656c536d5fb55878265d07c4131cd71dbfeae179e5665d42670","observation_id":"2ecad685-f744-4b8c-a754-d378f0b54ece","resolution":{"observed_at":"2026-08-01T09:14:50.436764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.542946Z","title":"ICRA , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.542946Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:ae5f27af585b90a046b087797e157f62dd8fc2fa5d40f30df8fc6e07cff7d7aa","observation_id":"d173cb5e-21d5-40da-a8c9-eaf25e552297","resolution":{"observed_at":"2026-08-01T09:14:50.542946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.691730Z","title":"TKDE , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.691730Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:fe79781461304ffe84a76160a16bc8c19f04870383503c08580dfc7677dc1727","observation_id":"2354cd28-717d-438a-91d2-979922a6d3c3","resolution":{"observed_at":"2026-08-01T09:14:50.691730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01281","last_updated":"2018-12-04T08:59:03Z","snapshot_observed_at":"2026-08-14T17:48:56.923058Z","submitted_at":"2018-12-04T08:59:03Z","title":"Towards Continuous Domain adaptation for Healthcare","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.01281","snapshot_observed_at":"2026-08-01T09:14:50.770379Z","title":"arXiv preprint arXiv:1812.01281 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.770379Z"},"links":{"cited_paper":"/paper/1812.01281","citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:12c8e720302e7a71ee9fe20b1866e7ffe716a4e01da6f2fe8b20bedec542717f","observation_id":"64e7df2f-bff3-4091-ac47-138cd30acb55","resolution":{"observed_at":"2026-08-01T09:14:50.770379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.869555Z","title":"Geophysical Research Letters , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.869555Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:d3640deb60b8fd64427d4965612690a1a2bbc34e30f57965e7da23590a2061e4","observation_id":"d926e914-bde6-4f90-bc7d-b31ef3263229","resolution":{"observed_at":"2026-08-01T09:14:50.869555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:50.999870Z","title":"Computers & Geosciences , keywords =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:50.999870Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b22e3014d95c1af52e5be7d6414406ad838d1e3123b475732352f6b55efd57e6","observation_id":"513c4c6d-14c4-47a6-b555-e867f58b113b","resolution":{"observed_at":"2026-08-01T09:14:50.999870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:51.170179Z","title":"Geophysical Research Letters , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:51.170179Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:b53ee224b7f013cbca91b81861f9e16939d25ab0906855c61c0a7be3f7f4792a","observation_id":"a2ec4abb-8e6b-4590-92b7-c1a0f9035ea5","resolution":{"observed_at":"2026-08-01T09:14:51.170179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:51.299112Z","title":"2018 IEEE international conference on data mining (ICDM) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:51.299112Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:934b2e968455dff02e796954f1995730e76200325c3c66fa42b94d17c79b3ece","observation_id":"01f3c3a7-68ed-4a01-a09c-d6c6e95bbaa6","resolution":{"observed_at":"2026-08-01T09:14:51.299112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:51.398788Z","title":"I (Still) Can't Believe It's Not Better! NeurIPS 2021 Workshop , year=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:51.398788Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:8c425d42947e283fef99b99d6c1cc243c235d046923e7221295f3ed5fc1cc3da","observation_id":"22294aff-b658-415b-a1ac-bb7667997e68","resolution":{"observed_at":"2026-08-01T09:14:51.398788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:14:51.481732Z","title":"Proceedings of the 17th ACM Conference on Recommender Systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-01T09:14:51.481732Z"},"links":{"citing_paper":"/paper/2607.20863"},"observation_digest":"sha256:a114893124f065a5417ef47cf82298288702f2bf88f088e23d03d9dfb66c0b89","observation_id":"e7563004-f71f-4545-a724-e731c5e3259c","resolution":{"observed_at":"2026-08-01T09:14:51.481732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20863","last_updated":"2026-07-23T02:39:12Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-12T14:59:30.448457Z","submitted_at":"2026-07-23T02:39:12Z","title":"Probabilistic Residual Learning for Online Recommendations"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":155},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 100 of 155 outbound references and 0 inbound Pith citation observations for arXiv:2607.20863."}