{"as_of":"2026-08-08T19:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9985f2ee9233d37644e2182bde5fa76d3d89e9a243aa17e172561d37b08cdef0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":28,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:32:44.525774Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":8,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2304.11277","last_updated":"2023-09-12T16:28:00Z","snapshot_observed_at":"2026-08-01T19:01:47.393546Z","submitted_at":"2023-04-21T23:52:27Z","title":"PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallel","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-12T04:15:20.027659Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2304.11277"},"observation_digest":"sha256:1a59913e37bdcd9e24c5a19cd875842595a357c67bd36f6a6ac41f354047e2cf","observation_id":"dc522653-2819-45b2-9554-edf99829462f","resolution":{"observed_at":"2026-05-12T04:15:20.057051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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-07T15:32:44.525774Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14959","last_updated":"2025-05-20T22:38:50Z","snapshot_observed_at":"2026-08-08T15:49:38.371821Z","submitted_at":"2025-05-20T22:38:50Z","title":"Privacy Preserving Conversion Modeling in Data Clean Room","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:32:44.525774Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2505.14959"},"observation_digest":"sha256:f0dd78b411ca90c77f4c99c8e3f97646794389d444360690f0e0097eb6187436","observation_id":"104e2642-a9d6-4578-9d3f-315a0a97de2e","resolution":{"observed_at":"2026-08-07T15:32:44.525774Z","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-05T04:18:51.204757Z","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-07T15:03:16.692491Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.692491Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:3e83e63ba15996c27fe5b5c34b04c8863bee380cb8f499ab636130114a9b5b72","observation_id":"71bc7a0a-5d26-4b41-a236-d9602450161a","resolution":{"observed_at":"2026-08-07T15:03:16.692491Z","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-05T04:18:51.204757Z","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-06T21:56:00.452476Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.23060","last_updated":"2025-06-29T02:14:21Z","snapshot_observed_at":"2026-08-08T17:47:56.936331Z","submitted_at":"2025-06-29T02:14:21Z","title":"Synergizing Implicit and Explicit User Interests: A Multi-Embedding Retrieval Framework at Pinterest","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:56:00.452476Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2506.23060"},"observation_digest":"sha256:bbf10d31da46b48a952b5cf4e883f81cc0220bef3f68bf7af752f963e4f47316","observation_id":"0624fc8b-b3fe-4944-a0f3-fbe1e7e78588","resolution":{"observed_at":"2026-08-06T21:56:00.452476Z","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-05T04:18:51.204757Z","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-06T15:35:48.441026Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.15551","last_updated":"2025-07-26T02:01:33Z","snapshot_observed_at":"2026-08-06T15:26:48.151250Z","submitted_at":"2025-07-21T12:28:55Z","title":"RankMixer: Scaling Up Ranking Models in Industrial Recommenders","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:35:48.441026Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2507.15551"},"observation_digest":"sha256:517745c4c590e8b9e8f43ce0e95941eacf48bdb96da9c799d74033667415ac5b","observation_id":"90a8ff7b-10de-42b9-8c5c-f1d1bee4e7b8","resolution":{"observed_at":"2026-08-06T15:35:48.441026Z","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-05T04:18:51.204757Z","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-06T14:43:53.870023Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.05640","last_updated":"2025-08-14T23:38:08Z","snapshot_observed_at":"2026-08-06T14:36:04.201777Z","submitted_at":"2025-07-24T05:56:55Z","title":"Request-Only Optimization for Recommendation Systems","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T14:43:53.870023Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2508.05640"},"observation_digest":"sha256:b7164f5495d94226b325d79a44a2e95a3a210faab5fd5e09e8c1c12983c3aad4","observation_id":"dbd19bde-e3a0-4367-bb8a-bb59510b07b4","resolution":{"observed_at":"2026-08-06T14:43:53.870023Z","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-05T04:18:51.204757Z","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-05T18:30:14.431232Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.14948","last_updated":"2025-08-20T10:18:01Z","snapshot_observed_at":"2026-08-05T18:30:07.186617Z","submitted_at":"2025-08-20T10:18:01Z","title":"Large Foundation Model for Ads Recommendation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T18:30:14.431232Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2508.14948"},"observation_digest":"sha256:800d4932760a587a7edc4761ab6eb4b35ae8003fc0aa4d282d4422a698759d6f","observation_id":"9f1818ed-20dc-448d-b6ca-0aef03c9d922","resolution":{"observed_at":"2026-08-05T18:30:14.431232Z","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-05T04:18:51.204757Z","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-05T10:15:57.729663Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.04337","last_updated":"2025-09-04T15:56:40Z","snapshot_observed_at":"2026-08-05T10:15:57.229795Z","submitted_at":"2025-09-04T15:56:40Z","title":"Decoupled Entity Representation Learning for Pinterest Ads Ranking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T10:15:57.729663Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2509.04337"},"observation_digest":"sha256:dc28cc7cc7ddd4b8856956fa71b3459f97bc42025490fd274e81f3cb63fc9ca6","observation_id":"8b29fd00-6322-4777-9419-fffca9c0a124","resolution":{"observed_at":"2026-08-05T10:15:57.729663Z","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-05T04:18:51.204757Z","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-03T13:45:25.896757Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.23236","last_updated":"2026-07-06T22:18:07Z","snapshot_observed_at":"2026-08-08T15:31:06.724407Z","submitted_at":"2025-12-29T06:31:55Z","title":"KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T13:45:25.896757Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2512.23236"},"observation_digest":"sha256:cf8a3f43438e15d3f871e37948699803230989f5c76c02338a9caa836d9efc85","observation_id":"eab3c915-f0ae-4cf8-86b4-400a17abe466","resolution":{"observed_at":"2026-08-03T13:45:25.896757Z","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-05T04:18:51.204757Z","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-02T23:22:49.137962Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.14110","last_updated":"2026-07-02T03:27:35Z","snapshot_observed_at":"2026-08-07T15:33:08.491030Z","submitted_at":"2026-02-15T11:53:30Z","title":"MixFormer: Co-Scaling Up Dense and Sequence in Industrial Recommenders","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T23:22:49.137962Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2602.14110"},"observation_digest":"sha256:e8cea3dd330bc9d0e9b1fc114340deb0114d7e536ca81bad92854bf1e4586ec8","observation_id":"e26c3e5a-cb7f-4658-97c9-261e223bd95d","resolution":{"observed_at":"2026-08-02T23:22:49.137962Z","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-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2604.04038","last_updated":"2026-04-05T09:41:30Z","snapshot_observed_at":"2026-07-06T22:53:06.517678Z","submitted_at":"2026-04-05T09:41:30Z","title":"FLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-13T17:29:06.884078Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2604.04038"},"observation_digest":"sha256:71ec1f7569b7676cb6e95a1ca646085b9da01dc32026abff885691a7e8302180","observation_id":"5c216a8b-0c70-4a52-ad6a-34377b49b9a5","resolution":{"observed_at":"2026-05-13T17:33:02.537641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2604.04976","last_updated":"2026-04-04T17:05:15Z","snapshot_observed_at":"2026-08-08T18:55:21.950628Z","submitted_at":"2026-04-04T17:05:15Z","title":"Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-13T16:59:06.735742Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2604.04976"},"observation_digest":"sha256:b26272ce6eff6ff8b8b18e0605482b73549cc388c9e3303f68bb67614655c914","observation_id":"ffdc48c1-6836-4191-a3a2-89d9f160e792","resolution":{"observed_at":"2026-05-13T17:03:00.494587Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2604.12110","last_updated":"2026-06-03T23:12:18Z","snapshot_observed_at":"2026-08-01T21:52:30.776967Z","submitted_at":"2026-04-13T22:33:28Z","title":"SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T15:07:57.407247Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2604.12110"},"observation_digest":"sha256:bb0770595c12d6ac50ea2dea85c0f16e1005475ee74b2d3e55c891dc376ccb2c","observation_id":"1e702199-8400-4923-8162-443ad320762e","resolution":{"observed_at":"2026-05-11T11:11:03.253936Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2604.12965","last_updated":"2026-04-14T16:59:03Z","snapshot_observed_at":"2026-08-06T12:38:28.688700Z","submitted_at":"2026-04-14T16:59:03Z","title":"Efficient Retrieval Scaling with Hierarchical Indexing for Large Scale Recommendation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-10T14:25:53.909672Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2604.12965"},"observation_digest":"sha256:54424bd51e051291866b2632590023a9824f06b46bf08b436953c9e8f39e8ba3","observation_id":"d7375e77-d048-4b02-9d4b-2ac0e838123a","resolution":{"observed_at":"2026-05-11T11:36:01.066054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2604.19550","last_updated":"2026-04-21T15:06:59Z","snapshot_observed_at":"2026-07-06T23:06:12.542013Z","submitted_at":"2026-04-21T15:06:59Z","title":"LoopCTR: Unlocking the Loop Scaling Power for Click-Through Rate Prediction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:b974f30c1b64139e67b4064a2bf92c4ffe626b40aeb79c9c1c9528d201f157c2","observation_id":"ddcb6b7b-4725-4835-86c5-5f41088b0259","resolution":{"observed_at":"2026-05-11T13:26:04.190276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2605.10886","last_updated":"2026-07-09T02:30:06Z","snapshot_observed_at":"2026-07-12T23:17:31.243229Z","submitted_at":"2026-05-11T17:32:29Z","title":"LoKA: Low-precision Kernel Applications for Recommendation Models At Scale","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-05-12T04:33:41.411292Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2605.10886"},"observation_digest":"sha256:8947faafa10aac92830707aa9006c6c37ae9dfa01204c3c7d4657ce7cf7fd28b","observation_id":"cc8fe636-d7d3-4079-bd3a-e1beeb0f8c83","resolution":{"observed_at":"2026-05-12T06:06:28.106974Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2605.10886","last_updated":"2026-07-09T02:30:06Z","snapshot_observed_at":"2026-07-12T23:17:31.243229Z","submitted_at":"2026-05-11T17:32:29Z","title":"LoKA: Low-precision Kernel Applications for Recommendation Models At Scale","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-05-15T04:55:01.973832Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2605.10886"},"observation_digest":"sha256:7ccb190a177c7feb84fb8fc12d2b04e905a82e458a6dbe0285d539086af477b5","observation_id":"df69df37-67c9-44ef-a6da-cd11d50f667b","resolution":{"observed_at":"2026-05-15T04:59:46.186085Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2605.24051","last_updated":"2026-05-22T00:12:38Z","snapshot_observed_at":"2026-07-06T23:34:08.786038Z","submitted_at":"2026-05-22T00:12:38Z","title":"Memento: Personalized RAG-Style Long-Retention Data Scaling for META Ads Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T15:22:12.675862Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2605.24051"},"observation_digest":"sha256:a6fba43f87ea0d3dd1e10c07c29161ea56913704a47ae4376bc1a00ca808c8e7","observation_id":"51bca433-7297-4036-b051-9d09d3202d1b","resolution":{"observed_at":"2026-06-30T15:24:49.885805Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2605.29232","last_updated":"2026-05-28T01:48:19Z","snapshot_observed_at":"2026-08-02T01:34:37.024828Z","submitted_at":"2026-05-28T01:48:19Z","title":"On the Practice of Scaling Search Conversion Rate Prediction","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T06:04:05.505743Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2605.29232"},"observation_digest":"sha256:1dbb21a3ef56a71d71a5458ff895bcfdadeecf8bb8c5ba7c879904ef8efe9830","observation_id":"342df981-3cc9-4ef0-b6bd-d6437e86a673","resolution":{"observed_at":"2026-06-29T15:03:31.990765Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2606.11616","last_updated":"2026-06-16T04:07:41Z","snapshot_observed_at":"2026-07-06T23:50:39.386691Z","submitted_at":"2026-06-10T03:28:17Z","title":"DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T10:22:33.710584Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2606.11616"},"observation_digest":"sha256:7e38023866aaa0b9f9ab59f3f2791527de20f097790fe99b40d35f24563688f2","observation_id":"191064db-190f-4c62-ba8a-d81919186185","resolution":{"observed_at":"2026-07-03T09:17:49.016688Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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":"2203.11014","doi":"10.48550/arxiv.2203.11014","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":"arXiv (Cornell University)","work_id":"ddad5535-eaa3-47a2-a069-372ccc48a32c","year":2022},"citing_paper":{"arxiv_id":"2606.31984","last_updated":"2026-06-30T17:22:22Z","snapshot_observed_at":"2026-07-07T00:05:37.068846Z","submitted_at":"2026-06-30T17:22:22Z","title":"GR2 Technical Report","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-01T03:31:42.082743Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2606.31984"},"observation_digest":"sha256:25356dd24a5a720631d7ef2a1081059aebb49af4171d1b67f712adba8661bf51","observation_id":"1cc68f32-4ea2-4195-a9bf-6844f2b0a137","resolution":{"observed_at":"2026-07-01T11:55:43.039554Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T02:38:07.056521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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-07-12T05:54:43.478745Z","title":"Li, Zeliang Chen, Weilin Zhang, Xiaohan Wei, and Ellie Wen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.02945","last_updated":"2026-07-03T04:40:04Z","snapshot_observed_at":"2026-08-04T09:08:21.125052Z","submitted_at":"2026-07-03T04:40:04Z","title":"Optimus: A Generic Operator-Level PyTorch Model Transformation Framework","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-12T05:54:43.478745Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2607.02945"},"observation_digest":"sha256:bdfecf167ef228cdeef62c3ed02915bd3e4360a6b720c4ea6caadcc4dd2c5c28","observation_id":"d87bc0ed-1bfa-48bd-8a51-c95434e0e03a","resolution":{"observed_at":"2026-07-12T05:54:43.478745Z","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-05T04:18:51.204757Z","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-01T11:08:03.432311Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.19987","last_updated":"2026-07-23T07:54:02Z","snapshot_observed_at":"2026-08-06T10:43:59.796759Z","submitted_at":"2026-07-22T10:20:40Z","title":"UniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-01T11:08:03.432311Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2607.19987"},"observation_digest":"sha256:d6183f75e44ed6ff620ae5ad6597982cbacf2fbee41b72210eb48d6d7264f371","observation_id":"3cd656b0-150c-44fc-aaa4-8fc7534c5719","resolution":{"observed_at":"2026-08-01T11:08:03.432311Z","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-05T04:18:51.204757Z","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-08T01:14:22.114838Z","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:e77174ac5c02016a900cc5e838ff013c4fcf1186741d8662c613c6e0e642f9fc","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":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","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-02T08:30:56.786736Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24804","last_updated":"2026-08-03T18:37:22Z","snapshot_observed_at":"2026-08-07T23:09:36.550158Z","submitted_at":"2026-07-06T20:31:38Z","title":"Bumblebee: Interleaved Mixed-Layer Building Blocks for Large-Scale Recommendation Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T08:30:56.786736Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2607.24804"},"observation_digest":"sha256:ee35ee0a2983795fe6c81c83d3155824374918e343d662178dad4e966dc4f6df","observation_id":"410036d6-2d6b-4ada-bdc9-e17d25ebea36","resolution":{"observed_at":"2026-08-02T08:30:56.786736Z","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-05T04:18:51.204757Z","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-01T02:11:17.830756Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27744","last_updated":"2026-07-30T06:33:50Z","snapshot_observed_at":"2026-08-04T10:27:17.545382Z","submitted_at":"2026-07-30T06:33:50Z","title":"ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T02:11:17.830756Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2607.27744"},"observation_digest":"sha256:a70f7b0545e74896a2a865ff298004f0152c4bbda120ce5785d7d975bd68033b","observation_id":"d43a0cbe-3c28-4dfe-85ad-16d007ecd3db","resolution":{"observed_at":"2026-08-01T02:11:17.830756Z","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-05T04:18:51.204757Z","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-04T00:47:02.574185Z","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large- Scale Click-Through Rate Prediction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00325","last_updated":"2026-07-31T22:26:39Z","snapshot_observed_at":"2026-08-07T23:07:00.037151Z","submitted_at":"2026-07-31T22:26:39Z","title":"Triton for MTIA: Bridging the Programming Model Gaps for Custom AI Accelerators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T00:47:02.574185Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2608.00325"},"observation_digest":"sha256:85550694932e0e40adf20237c6183f45966db9f5c3158cd82d05a76557c98522","observation_id":"6418a0d2-93de-4fb6-9838-fa752f8321c6","resolution":{"observed_at":"2026-08-04T00:47:02.574185Z","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-05T04:18:51.204757Z","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-04T00:41:51.969063Z","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00358","last_updated":"2026-08-01T00:14:41Z","snapshot_observed_at":"2026-08-06T23:12:42.361701Z","submitted_at":"2026-08-01T00:14:41Z","title":"HCCL: Collective Communication for Meta Training and Inference Accelerators","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T00:41:51.969063Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2608.00358"},"observation_digest":"sha256:3971b85ba2debaeb7e8f952d1c72bdf1116f2f2ac3d8c97b590215cc796ee0b8","observation_id":"d16bc664-2625-4d9d-bdea-19902e1bb432","resolution":{"observed_at":"2026-08-04T00:41:51.969063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.11014/citation-record","integrity":"/paper/2203.11014/integrity","json":"/paper/2203.11014/citation-record.json","paper":"/paper/2203.11014"},"outbound":[],"paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","submitted_at":"2022-03-11T21:19:31Z","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 28 inbound Pith citation observations for arXiv:2203.11014."}