{"as_of":"2026-08-22T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f694a4287c3a98db973467f711c2973a962586dcdbbc94f819941ceb6b451d9f","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T06:03:51.481245Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2411.19647/citation-record","integrity":"/paper/2411.19647/integrity","json":"/paper/2411.19647/citation-record.json","paper":"/paper/2411.19647"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.603850Z","title":"A survey of recommendation systems: recommendation models, techniques, and application fields","venue":null,"work_id":"190668f6-3b61-4996-93ec-db9f647ab3fb","year":2022},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.231222Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:b77d80b0e02e6ade0b09a30abd295618a7563343a4095d521ef0ca8440f792ad","observation_id":"8f28ca40-84aa-46ee-9cd3-c3d26a89dbca","resolution":{"observed_at":"2026-08-12T06:04:07.608882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.236218Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.236218Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:36245e7ed1bfb5a3eb050e16b3965e491a47f5e8a23a5ccdd5d3ae3e6b2bb351","observation_id":"747e78eb-e1b1-47a5-87e2-496798497819","resolution":{"observed_at":"2026-08-12T06:03:51.236218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-16T09:25:53.087782Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-12T06:03:51.240668Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.240668Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:54c46979b2f69c238af6ebae941e8b293c2ebb1eb037078627422ef4da0d3d32","observation_id":"584f5865-9668-425e-89a4-29dd090a9eb2","resolution":{"observed_at":"2026-08-12T06:03:51.240668Z","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-12T06:03:51.245263Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.245263Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:6b166e8895d0212cb04283ca92f83f8b0c3b43bd2a0370572df7fb3f95d5c800","observation_id":"d2614edf-da7f-40aa-a7d2-a315eaf96188","resolution":{"observed_at":"2026-08-12T06:03:51.245263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-20T07:04:06.309989Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-12T06:03:51.250813Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.250813Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:69dee7d5f7800817dc49b081b4b6dfd4792c6866dfed192609ab94f4f30c7afb","observation_id":"b58ef85f-0983-46f5-a574-d22b568606ee","resolution":{"observed_at":"2026-08-12T06:03:51.250813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.01160","last_updated":"2021-12-02T12:12:02Z","snapshot_observed_at":"2026-08-19T14:21:59.988311Z","submitted_at":"2021-12-02T12:12:02Z","title":"Learning Robust Recommender from Noisy Implicit Feedback","version":1},"cited_work":{"arxiv_id":"2112.01160","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.01160","snapshot_observed_at":"2026-08-12T06:04:06.916534Z","title":"Learning Robust Recommender from Noisy Implicit Feedback","venue":"cs.IR","work_id":"bc82e8f0-c0bd-40e6-9f7c-3edb3bbd59c1","year":2021},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.255881Z"},"links":{"cited_paper":"/paper/2112.01160","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:cc203d4740d5259189963e306e3a4bb83304d4c26c17b2d1f4cb52e29912d2d0","observation_id":"21f21328-4846-4e05-94a1-ecb18432d134","resolution":{"observed_at":"2026-08-12T06:04:06.922185Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05046","last_updated":"2023-06-08T08:57:06Z","snapshot_observed_at":"2026-08-19T14:22:04.585661Z","submitted_at":"2023-06-08T08:57:06Z","title":"A Gradient-based Approach for Online Robust Deep Neural Network Training with Noisy Labels","version":1},"cited_work":{"arxiv_id":"2306.05046","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.05046","snapshot_observed_at":"2026-08-12T06:04:06.878006Z","title":"A Gradient-based Approach for Online Robust Deep Neural Network Training with Noisy Labels","venue":"cs.LG","work_id":"b1168338-2dd0-44c9-9044-1d10c55df3b9","year":2023},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.261629Z"},"links":{"cited_paper":"/paper/2306.05046","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:cb29696ac723cfa682d8d4daed8c759d18f7c8c92e00fe1c8dd775d9c8eefa7d","observation_id":"13051096-e4dd-4a31-bdaf-6e2567287ce3","resolution":{"observed_at":"2026-08-12T06:04:06.885181Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.271271Z","title":"On the convergence of adam and beyond","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.271271Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:7a5233b79462524485e0c210d6f3dfafdc7de634049039d8992f644a394af991","observation_id":"f4bc754d-48ac-46e4-ba30-7294f5a00109","resolution":{"observed_at":"2026-08-12T06:03:51.271271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-08-17T19:17:06.411141Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-12T06:03:51.276702Z","title":"Very deep convolutional networks for large-scale image recognition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.276702Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:f998156d9be98c125ab0e260cf6b19394b2f7cb8adaf8b5e9a2a43ca90a5ec69","observation_id":"93f36c1a-28da-4669-a4c1-daeae047d574","resolution":{"observed_at":"2026-08-12T06:03:51.276702Z","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-12T06:03:51.281751Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.281751Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:10f66e641bec480d770dd1454782785af35dcb0665191dbaadc9220032610656","observation_id":"c1df9564-64e7-48a5-9c17-c7911d3e6208","resolution":{"observed_at":"2026-08-12T06:03:51.281751Z","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-12T06:03:51.287221Z","title":"Densely connected convolutional networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.287221Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:07575dc3c8e332ca3c56e421b5948693798fb493911c1c56bc6c54ec885b01fa","observation_id":"46489e81-5794-4cb0-be97-e3f1722161a5","resolution":{"observed_at":"2026-08-12T06:03:51.287221Z","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-12T06:03:51.293219Z","title":"Display advertising challenge, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.293219Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:503f3e576b8c6b7e6bc289848fb2d012a2835f61899b1e4efe184fc8bafea8e1","observation_id":"6298fcb6-b52e-448e-a11e-1f278653d7df","resolution":{"observed_at":"2026-08-12T06:03:51.293219Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.514488Z","title":"Open benchmarking for click-through rate prediction","venue":null,"work_id":"0b901658-ac92-426a-9371-141a5f4147e5","year":2021},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.299322Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:f3ca1d91f7ff91f6fe742f1debbdb9e035bc53b84af31829fbf3524e2063dae4","observation_id":"2ffe7d01-865b-46dd-b4e2-7a165d137c20","resolution":{"observed_at":"2026-08-12T06:04:07.522873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.12160","last_updated":"2021-09-27T18:36:16Z","snapshot_observed_at":"2026-08-22T09:34:10.175463Z","submitted_at":"2020-07-23T17:49:04Z","title":"Online Robust and Adaptive Learning from Data Streams","version":2},"cited_work":{"arxiv_id":"2007.12160","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.12160","snapshot_observed_at":"2026-08-12T06:04:06.824839Z","title":"Online Robust and Adaptive Learning from Data Streams","venue":"stat.ML","work_id":"bd515c6e-3ea1-4d22-bd34-c15855602b36","year":2020},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.304754Z"},"links":{"cited_paper":"/paper/2007.12160","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:fe2455278359c83d3da3a419323b1356791f0a1a48ca54747ec420d33f0b786d","observation_id":"91bb9703-3932-4b08-9fb9-268fa1b40ea0","resolution":{"observed_at":"2026-08-12T06:04:06.832474Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.309985Z","title":"Adaptive methods for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.309985Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:fa50bee0d7fee322838f69af09a40e08ee9f50cc962e198af4bb64cb90b93293","observation_id":"07e56a4f-8411-4c3d-95e3-b8a1810d2d1b","resolution":{"observed_at":"2026-08-12T06:03:51.309985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.03265","last_updated":"2021-10-26T02:48:30Z","snapshot_observed_at":"2026-08-19T14:20:48.530093Z","submitted_at":"2019-08-08T20:51:17Z","title":"On the Variance of the Adaptive Learning Rate and Beyond","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.03265","snapshot_observed_at":"2026-08-12T06:03:51.315324Z","title":"On the variance of the adaptive learning rate and beyond","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.315324Z"},"links":{"cited_paper":"/paper/1908.03265","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:1f1b2308bf4f0c4e10134902b56a022b14aedf42a7f8e942ab05e3bbb542efb7","observation_id":"7e4ce5f8-ae17-43a7-a779-efda4c0986a0","resolution":{"observed_at":"2026-08-12T06:03:51.315324Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.494006Z","title":"Adabelief optimizer: Adapting stepsizes by the belief in observed gradients","venue":null,"work_id":"5a32e650-c99a-46b6-8f73-fe830bdb828f","year":2020},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.320323Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:eafb9af6fa4b21800a6839251b67f9dfff5cca7e6b73cc46d98ce59ef2ef6fe7","observation_id":"49e98e4a-baeb-413a-976f-acb49c6382dd","resolution":{"observed_at":"2026-08-12T06:04:07.503415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.04247","last_updated":"2017-03-13T04:55:19Z","snapshot_observed_at":"2026-08-14T23:30:22.779192Z","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04247","snapshot_observed_at":"2026-08-12T06:03:51.324202Z","title":"Deepfm: a factorization-machine based neural network for ctr prediction","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.324202Z"},"links":{"cited_paper":"/paper/1703.04247","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:b29deb39a2b46b9ec4054fb9b1c0036e54e0e32dfba0d6ece5361ce9683a5159","observation_id":"59d06e60-2770-4eed-9603-62a8d38c82a1","resolution":{"observed_at":"2026-08-12T06:03:51.324202Z","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-12T06:03:51.328542Z","title":"Wide & deep learning for recommender systems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.328542Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:487ae2225fea78cae396721f1e7e12c2d06b766b84752fe8ddf40e5510b3e037","observation_id":"c9e0e72e-6fd0-44ef-9f1c-eee3a307d23f","resolution":{"observed_at":"2026-08-12T06:03:51.328542Z","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-12T06:03:51.334248Z","title":"Deep neural networks for youtube recommenda- tions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.334248Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:5f0cd2b376268d757a25d0755477db7a37fac4c5f020e1a3e0ce189fa0dd6869","observation_id":"c8d47ee5-bb60-40ba-8b14-da74863a4e31","resolution":{"observed_at":"2026-08-12T06:03:51.334248Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.448715Z","title":"Product- based neural networks for user response prediction","venue":null,"work_id":"add03779-e818-4296-b983-4003f61d95a2","year":2016},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.339076Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:5a9e78360354793ee3591c333ee88fed5602f920d6df0aa710a1bf2f67a8e8e2","observation_id":"5f000efc-720f-427f-a6ba-9d33a19be70b","resolution":{"observed_at":"2026-08-12T06:04:07.455281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.429857Z","title":"Deep & cross network for ad click predictions","venue":null,"work_id":"6adb0bc2-5acb-48d4-926b-ea2dbd511b1d","year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.344156Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:a9a38be17a41d2c63a66a00e1b5e12a8ea1dc0790373a384be984f6064c9afce","observation_id":"6757b7be-e3b0-4da5-98dc-02609b0dd896","resolution":{"observed_at":"2026-08-12T06:04:07.436485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.413304Z","title":"Symbolic discovery of optimization algorithms","venue":null,"work_id":"5fe2c8ae-4d16-4bb0-b70b-b7d528c8a2f8","year":2023},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.350557Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:f2f86d33461f032c448cfafeeb23fd8c9ff49c5035b9d37f9089c36bf32de6fc","observation_id":"84680a68-ba35-493a-ae38-45cee5cf17ea","resolution":{"observed_at":"2026-08-12T06:04:07.419232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.356024Z","title":"Convergence of adam under relaxed assumptions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.356024Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:39ebb6729165f02dd5399ddc2516b1d3a2c80b1ed834e6a746fbc7f39ee62a3d","observation_id":"fd89be4b-774a-4434-aac6-3c36ad44f258","resolution":{"observed_at":"2026-08-12T06:03:51.356024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15146","last_updated":"2024-03-22T11:57:51Z","snapshot_observed_at":"2026-08-18T04:15:07.350897Z","submitted_at":"2024-03-22T11:57:51Z","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15146","snapshot_observed_at":"2026-08-12T06:03:51.360857Z","title":"On the convergence of adam under non-uniform smoothness: Separability from sgdm and beyond","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.360857Z"},"links":{"cited_paper":"/paper/2403.15146","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:acc96967e9419744025505638af8e917a0c2481d656ea2269fed6e90487b6daa","observation_id":"f8e8244e-3c0e-4b6c-a1f0-08073a55b234","resolution":{"observed_at":"2026-08-12T06:03:51.360857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-12T06:03:51.366567Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.366567Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:2a6c4cc5488a38fb90d9e59ebc36c783041558c8d0b706c91fb7397b77b4e35e","observation_id":"d73c2079-354d-4fab-9443-e29a5692c53d","resolution":{"observed_at":"2026-08-12T06:03:51.366567Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.379276Z","title":"Adaptive methods for nonconvex optimization","venue":null,"work_id":"c80600bf-df85-4482-8581-7018f871010d","year":2018},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.372144Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:0ef563b3e2a4b4724933786e5a2181785d72d63eca60ed7197a85cf7bf01b82e","observation_id":"fc0854fa-53bf-4faa-afb6-d1520b104ee9","resolution":{"observed_at":"2026-08-12T06:04:07.388166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.376064Z","title":"Cautious optimizers: Improving training with one line of code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.376064Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:09f35d5073840fc7cfee48f7270d1384552123e19221f55c993fbc28c10ad97e","observation_id":"b6ca07f7-d128-4cae-9a73-83e8c32cb956","resolution":{"observed_at":"2026-08-12T06:03:51.376064Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.356706Z","title":"Learning under concept drift: A review","venue":null,"work_id":"c6b1f94e-fba0-4eb5-a760-52e983c0af56","year":2018},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.381099Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:dc1589e95c9eaf4c4ca51155b105bd7209e53251c4a4ca14a3bd8e7d50618d77","observation_id":"66029002-2d12-4730-99d5-f31060ddfb41","resolution":{"observed_at":"2026-08-12T06:04:07.362053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.325765Z","title":"Learning from time-changing data with adaptive windowing","venue":null,"work_id":"ce9d7da1-5cb0-4c11-a153-c05c8907387d","year":2007},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.386000Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:9a8a287dd7b0892fd5d518af36c5ce0d0519df84aacb434115205ef3de6561bf","observation_id":"423b2e2b-9ef3-49b1-bc47-1dabf1314280","resolution":{"observed_at":"2026-08-12T06:04:07.342584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.310336Z","title":"A streaming ensemble algorithm (sea) for large-scale classification","venue":null,"work_id":"124a7a57-d06b-4aa3-a9ee-a63466fdb753","year":2001},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.389865Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:5d439a5ee4d2531760ebb7ed9bc02a99b0595e6c89bf7df079a6b633d4324381","observation_id":"0f06b686-15cd-4c7b-9d0f-aeb8c40bc054","resolution":{"observed_at":"2026-08-12T06:04:07.315668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.293016Z","title":"Online convex programming and generalized infinitesimal gradient ascent","venue":null,"work_id":"f7652cf9-45e2-4c7a-856b-200e6842f6f3","year":2003},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.395098Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:f9942e9031d383d97be0694c703d0ecea6462020859038203e13a0a1cb600280","observation_id":"ea3944be-9b14-4478-a853-56c5411a1796","resolution":{"observed_at":"2026-08-12T06:04:07.298534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.400731Z","title":"Model-agnostic meta-learning for fast adap- tation of deep networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.400731Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:c6a111e6fa377d4137761918fd2fb062ed43d769c2706d0602163456a2bc4e6d","observation_id":"54ae3778-54be-4d4a-b6c4-256e44dd2679","resolution":{"observed_at":"2026-08-12T06:03:51.400731Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.262114Z","title":"A case study of batch and incremental recom- mender systems in supermarket data under concept drifts and cold start","venue":null,"work_id":"3f7fcf74-7b22-4351-aa8e-3e3113c40ed1","year":2021},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.404597Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:d3bd0b6aa3f428ecf301556960fa7a2e91708468a3adafe8dfd30d5361764b13","observation_id":"f4f16e56-388f-4c8e-bf00-7b4c9394f83a","resolution":{"observed_at":"2026-08-12T06:04:07.271774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.408755Z","title":"Robust loss functions under label noise for deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.408755Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:3c3d9e88f83dd1dbacbbdc28ec15a0c86077a98923a95d589db234ed00cd7cf5","observation_id":"43f7dac6-6459-45d3-8197-90fcc08ed126","resolution":{"observed_at":"2026-08-12T06:03:51.408755Z","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-12T06:03:51.414650Z","title":"Dropout: a simple way to prevent neural networks from overfitting","venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.414650Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:001cd86018b6bd10fe8589c560f89ce47bc19359a8329cea04b294d1b299f11e","observation_id":"946743d4-623e-470b-a830-9be5654f3c8b","resolution":{"observed_at":"2026-08-12T06:03:51.414650Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.215009Z","title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models","venue":null,"work_id":"86a31208-3928-4f8c-8ba4-124d86fcedab","year":2010},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.419142Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:4ef52a111bef56504db37f000d872da8b991a66281e6e970e26b226e4f36c395","observation_id":"55366247-e0e2-454d-9f0f-1eb6ed5e05bc","resolution":{"observed_at":"2026-08-12T06:04:07.219825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07070","last_updated":"2023-05-26T00:13:52Z","snapshot_observed_at":"2026-08-16T15:33:45.184223Z","submitted_at":"2023-05-11T18:07:57Z","title":"Automated Data Denoising for Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.07070","snapshot_observed_at":"2026-08-12T06:03:51.424478Z","title":"Automated data denoising for recommendation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.424478Z"},"links":{"cited_paper":"/paper/2305.07070","citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:667ae0196732e3edfe61b43dd58227b7c6b126772df268382b4be3ecb7b7febf","observation_id":"19dd41f5-dac6-4496-bdbf-80eed2f12714","resolution":{"observed_at":"2026-08-12T06:03:51.424478Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.200130Z","title":"Dtec: Dual training error based correction approach for recommender systems","venue":null,"work_id":"84df7bd1-4ade-4958-a5ee-80cb86bbb037","year":2021},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.430146Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:b1a940099eb8d30104448aabf68cd5aa8ea43b9d23276a44a0823e687366e68f","observation_id":"81334dc4-a0e4-4762-bcab-3a2166e9f4df","resolution":{"observed_at":"2026-08-12T06:04:07.204721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.182179Z","title":"Improving recommendation quality through outlier removal","venue":null,"work_id":"f9c13519-8f2b-46bd-8482-81a489651190","year":2022},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.435889Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:bd6437f76308af5a9369d563fb939cf5c24829e9dfe7e77642702cb72ebb2976","observation_id":"d4d5c102-5f65-4cf9-a3de-c839486116ef","resolution":{"observed_at":"2026-08-12T06:04:07.187938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.160968Z","title":"A semantic approach to remove incoherent items from a user profile and improve the accuracy of a recommender system","venue":null,"work_id":"f379bac8-8d99-4c67-b8be-4089b8ef95c4","year":2016},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.440370Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:a9073de2ea991d609c5c8a0ed48b7e4a1ee8d14f07dc0863a74d5ac25ffe47d6","observation_id":"63d5073f-4acb-431c-9629-1315f5732ec4","resolution":{"observed_at":"2026-08-12T06:04:07.165847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:03:51.446885Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.446885Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:66b9cd89464676b30702973df5d9c7ba3897470c333b4457855d7a9e2ff5fcba","observation_id":"5b2278e5-dffb-4995-ba6a-0efe31c4a82f","resolution":{"observed_at":"2026-08-12T06:03:51.446885Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.119062Z","title":"Bars: Towards open benchmarking for recommender systems","venue":null,"work_id":"33165c72-6c9a-441e-a796-4ef96eb288cb","year":2022},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.452487Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:620639a896fd8f693d9a928498b9d5f1a04499a460e59429efe12306908e8f60","observation_id":"7c824580-1c40-49da-98cd-be7a4de7f409","resolution":{"observed_at":"2026-08-12T06:04:07.128568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.094588Z","title":"C Additional Experiments C.1 Numerical Experiments Figure 6 illustrate how both optimizers perform in a noise-free environment","venue":null,"work_id":"3a1aa01a-2b00-4346-925e-dc5828dba11b","year":null},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.459935Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:692ddaf136dfb085ab861803809254ed89f8324110050efc10574b5406715779","observation_id":"f0dd7ad7-9224-4abb-a84f-da368ad7ac6d","resolution":{"observed_at":"2026-08-12T06:04:07.103119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.074248Z","title":null,"venue":null,"work_id":"adc2918d-1aca-44ec-a7cb-abc17b32ea95","year":null},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.465060Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:bfefda2d9989f0627f9209ca4a1788d3aa5d15198879ed0dbf37ef6529dff37d","observation_id":"ff0710cb-36c3-41be-af03-aa6f2efa91ba","resolution":{"observed_at":"2026-08-12T06:04:07.079349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.052737Z","title":null,"venue":null,"work_id":"ed208b51-1975-4cd5-af2d-f33b235d6071","year":null},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.469807Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:102b0231ae86c1c517b4fe9109b5f72daa96efd1c53f4383bcec3651044592a7","observation_id":"29851459-4617-451c-9c57-2a181406db33","resolution":{"observed_at":"2026-08-12T06:04:07.059917Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:07.025432Z","title":null,"venue":null,"work_id":"122becc0-f415-41e6-a055-15e35ebb9007","year":null},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.475931Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:9bea5490b5614896581275e61bd0b5b87d331ff99900bd6bb7b20b5500d8c360","observation_id":"e63c8866-8d9f-48ef-9e22-ba7d634722fb","resolution":{"observed_at":"2026-08-12T06:04:07.032250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T06:04:06.999802Z","title":null,"venue":null,"work_id":"dd08b875-91c8-43c1-b34a-ea1d8e9f5fb3","year":null},"citing_paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T06:03:51.481245Z"},"links":{"citing_paper":"/paper/2411.19647"},"observation_digest":"sha256:94bc9d8e89919345cf48dfacbed8bdc3a15509b38c07682ffc85a2ee04381fc3","observation_id":"671c5450-bd7e-47ed-aca9-da21788b1bb6","resolution":{"observed_at":"2026-08-12T06:04:07.008287Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.19647","last_updated":"2025-06-04T14:58:21Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T14:21:31.651985Z","submitted_at":"2024-11-29T12:00:27Z","title":"CAdam: Confidence-Based Optimization for Online Learning"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":18},"total_outbound_references":48},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2411.19647."}