{"as_of":"2026-08-03T08:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84d8bafbad35dff369fd62b1f00013dabeede55519dece30102848e419d8c3e1","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:58:52.846532Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T11:08:02.872421Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.08011","snapshot_observed_at":"2026-08-01T11:08:02.872421Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19987","last_updated":"2026-07-23T07:54:02Z","snapshot_observed_at":"2026-08-02T16:02:02.599617Z","submitted_at":"2026-07-22T10:20:40Z","title":"UniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-01T11:08:02.872421Z"},"links":{"cited_paper":"/paper/2604.08011","citing_paper":"/paper/2607.19987"},"observation_digest":"sha256:90f4ccf641d7a605243b101da819661fb1cca098aa3d6085724c80d6879953fa","observation_id":"9308f7c5-9950-4a18-8c85-0ce45cc19c7f","resolution":{"observed_at":"2026-08-01T11:08:02.872421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.08011/citation-record","integrity":"/paper/2604.08011/integrity","json":"/paper/2604.08011/citation-record.json","paper":"/paper/2604.08011"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1308.3432","last_updated":"2013-08-15T15:19:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-08-15T15:19:34Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","version":1},"cited_work":{"arxiv_id":"1308.3432","doi":"10.48550/arxiv.1308.3432","metadata_source":"pith","pith_arxiv_id":"1308.3432","snapshot_observed_at":"2026-07-11T03:27:46.813463Z","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","venue":"cs.LG","work_id":"1fe8c7c8-aff7-4b94-9096-e549d7e60789","year":2013},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1308.3432","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:94d6ba3a65cbc7e0c60d57aef880db00cde912ce736b39f1095bef049cd98caa","observation_id":"5d85c156-0685-4c3f-8044-85e6b36fd46b","resolution":{"observed_at":"2026-05-11T05:41:04.345764Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-05-19T16:22:27.235199+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-19T16:22:27.235199+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-09T10:06:09.666586Z","title":null,"venue":null,"work_id":"b4ef17eb-b661-4afb-866e-15201a4cc1f5","year":2001},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:a6bb5b410b0aba99abae534ffc19c3df2f0c9d88d63264fce1e8c255269035d2","observation_id":"07fae90a-6cba-48e8-b691-c7efd0f1672c","resolution":{"observed_at":"2026-05-17T07:51:39.783561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f681346e-ba91-48ad-aec9-0b64c9458891","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:0e62f7f591d562fbb99c50a922b4b09bcc74f785ef8e0eac62635811dde3ee6b","observation_id":"9ec06e91-bb98-4bc4-84cf-3cae03449a37","resolution":{"observed_at":"2026-05-17T07:51:39.776129Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-06T23:13:03.640522Z","title":null,"venue":null,"work_id":"2276a040-1de3-4af7-9cca-f0a38c0eb0c7","year":null},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:c3482e1bf98625441e2d0ed94f89497b0b4aaaa3e0d25d51a84f2a00abd78635","observation_id":"e30e838d-1a51-4875-aa69-96468f608177","resolution":{"observed_at":"2026-05-17T07:51:39.771159Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"InProceedings of the 1st workshop on deep learning for recommender systems","venue":null,"work_id":"a72c9bc1-8a45-47ad-9de6-d225c4ed61a4","year":null},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:63cd933f1bb6f0bb8534d4da95c290a991ca186fa71107e44247d6e74e1ba042","observation_id":"dc37843b-e1b5-4adf-89a2-839ff6126c32","resolution":{"observed_at":"2026-05-17T07:51:39.778980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"87ca4f88-a6fd-4076-95ed-23bf04c12ff4","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:d5d8c6d266740dc8d6dd8d534bf83c83a16826f49e0946c9f4c9fe3d009cc135","observation_id":"d285bd25-11e0-47c0-b246-198af9631adc","resolution":{"observed_at":"2026-05-17T07:51:39.768830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10509","last_updated":"2019-04-23T19:29:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-04-23T19:29:47Z","title":"Generating Long Sequences with Sparse Transformers","version":1},"cited_work":{"arxiv_id":"1904.10509","doi":"10.48550/arxiv.1904.10509","metadata_source":"pith","pith_arxiv_id":"1904.10509","snapshot_observed_at":"2026-07-11T03:27:46.891605Z","title":"Generating Long Sequences with Sparse Transformers","venue":"cs.LG","work_id":"c5b81688-45ee-4a9a-b095-e6290f45cb6c","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1904.10509","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:9ec6f4b5f3791452fd260799ef44a84b9bfb6f19a4e25c40dade900e48d644ed","observation_id":"cb3704a4-526c-464c-8333-cccf7bca1903","resolution":{"observed_at":"2026-05-11T05:41:04.267067Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-07-12T21:49:59.71041+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T21:49:59.71041+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"95d1c993-a1d8-4a1d-971c-698fe7e13c15","year":2022},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:1360313adc4d156c0413142f00d4af8996484e1daa81245b8a2da2eb03e6b181","observation_id":"2007bc7a-1ba7-406f-bafd-7e911f8051f3","resolution":{"observed_at":"2026-05-17T07:51:39.785985Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-07-06T06:27:32.857286Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":"1803.03635","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-07-04T10:29:45.051409Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","venue":"cs.LG","work_id":"b2db7960-3633-4685-8697-051ee8d141cc","year":2018},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:6208211d8bab977311763ea88f1d8e981ed07497fced07f3710e281201468c58","observation_id":"b93873df-32f4-4f76-83c9-3df70f5bfc7d","resolution":{"observed_at":"2026-05-11T05:41:04.272078Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e5f927a2-6cf5-454c-a7e3-8ab7e6b337aa","year":null},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:67e4a69e6eee38dbab0e98a1295ea600ee2f43dc505bc6129e29b07c59c57f08","observation_id":"b55440f4-5709-43cd-a4be-0958d6793541","resolution":{"observed_at":"2026-05-17T07:51:39.793469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08850","last_updated":"2019-04-29T07:56:18Z","snapshot_observed_at":"2026-07-06T07:40:42.809424Z","submitted_at":"2019-03-21T07:05:44Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","version":2},"cited_work":{"arxiv_id":"1903.08850","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08850","snapshot_observed_at":"2026-07-02T22:57:26.747620Z","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","venue":"stat.ML","work_id":"ff021bf5-c3c0-46b6-a60d-2234b3df567e","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1903.08850","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:ecae99d5716a09b8cdb9aaa03db7aa156fd67f3b0ea0dac58ad244e0e256a007","observation_id":"90249481-710e-4d4a-889d-74dc6cd8d63e","resolution":{"observed_at":"2026-05-11T05:41:04.304358Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-06T05:33:25.278531Z","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","version":1},"cited_work":{"arxiv_id":"1703.04247","doi":"10.48550/arxiv.1703.04247","metadata_source":"pith","pith_arxiv_id":"1703.04247","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","venue":"cs.IR","work_id":"5e8a841d-dddc-408d-acfd-43e92c3056a0","year":2017},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1703.04247","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:b75a71d65c7d00620247acacf354664a323f6285aa089b96616017346908a0e4","observation_id":"7bd9a8da-c326-47c1-b0db-6da3a189e598","resolution":{"observed_at":"2026-05-11T05:41:04.299951Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"56c5bbad-0e83-41ab-8bd8-e1a51fb88764","year":2024},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:73acd0b7be6ea685b6e5237c263c72f56bdc86c2ad0e9dacd7c2bb6761c16185","observation_id":"f0c251bb-dd55-4ade-acbf-f956204d4241","resolution":{"observed_at":"2026-05-17T07:51:39.754217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":"2203.15556","doi":"10.1098/rsta.2024.0522","metadata_source":"pith","pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Compute-Optimal Large Language Models","venue":"cs.CL","work_id":"b2faf28d-86b7-429c-bc42-469458efc246","year":2022},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:a9e51472757323539c5f8bb02ac3c2c712b25276af57ec93405430625b253785","observation_id":"e322f57e-27b8-4d73-a656-27fd96167be8","resolution":{"observed_at":"2026-05-11T05:41:04.276716Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5c6bcd7f-07d5-4b8c-a1af-963373b65594","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:5ffbdaa6945c4bdae993dc4f3fe26649a52baab687d15b03052c16f3f4c4873b","observation_id":"b25cf001-87d5-4dd3-b76c-c99994a566df","resolution":{"observed_at":"2026-05-17T07:51:39.761520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":"2001.08361","doi":"10.1145/3616855.3635845","metadata_source":"pith","pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Scaling Laws for Neural Language Models","venue":"cs.LG","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:78ca7b70500baaf614542aae131da96aa4bc5ac882c1ccf184417ac5737fce7b","observation_id":"0bf36486-8b67-4987-875f-88084f7ebfff","resolution":{"observed_at":"2026-05-11T05:41:04.286614Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aeed75d4-8c48-4ba7-8dac-b00a602508c1","year":2025},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:eafd0a003fecd77b9500ca795941de2c64323f3df1321e41401be17f3fef2adb","observation_id":"e3803233-faeb-49c4-867d-9bfbee728f76","resolution":{"observed_at":"2026-05-17T07:51:39.764024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"859b84f2-8a4f-4a20-adb0-b4d5b7b2a9a7","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:de50c5c8160da2e20666dfe74916128de9db6b32471d458d649e6600c288286d","observation_id":"bdadd075-73b9-4fd6-ad09-47b5af514e8e","resolution":{"observed_at":"2026-05-17T07:51:39.796080Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4739da0f-8e1c-43a4-a91b-bc0f8bb5b5bf","year":null},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:c3a5f6692dede1c2738ee04d2fdae9a30c9183c37347ade59969e6153b3ee49c","observation_id":"8b608c75-ee71-4e3d-8368-7dab44bbc348","resolution":{"observed_at":"2026-05-17T07:51:39.737039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"InProceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence","venue":null,"work_id":"77afba86-7c0b-4d3d-9639-1bfde47066a4","year":null},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:44295f8408fa65a797cb4f1f35eb0eaf6bd2e35fd98e631d6818bbc7964f0521","observation_id":"37450e6b-805a-4a6d-a6d1-da107024da71","resolution":{"observed_at":"2026-05-17T07:51:39.733881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-07T22:24:11.317337Z","title":null,"venue":null,"work_id":"47e1e9fe-c045-4dce-a947-cddff08ba161","year":2018},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:e0eb19bd24a2a2d0f7ef06b865b7429577673088bda517382dacbde5a4b904d9","observation_id":"421f0c4e-4b9c-40e5-9973-0a400c14ec9c","resolution":{"observed_at":"2026-05-17T07:51:39.773270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00091","last_updated":"2019-05-31T21:51:16Z","snapshot_observed_at":"2026-08-02T13:53:54.252223Z","submitted_at":"2019-05-31T21:51:16Z","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","version":1},"cited_work":{"arxiv_id":"1906.00091","doi":"10.48550/arxiv.1906.00091","metadata_source":"pith","pith_arxiv_id":"1906.00091","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","venue":"cs.IR","work_id":"707a4611-eb4e-4fbf-99b5-fafc0dfcbf01","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/1906.00091","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:749279cb47b60fb8d79aa20e7b2981114488a8c383fcaedb9ea97c43b8ae9bb7","observation_id":"732c80b1-dc99-4311-b2c9-a7c8e6843612","resolution":{"observed_at":"2026-05-11T05:41:04.295305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-07T08:03:30.476635Z","title":null,"venue":null,"work_id":"e9b6943b-19d5-43a9-b526-3915d3006305","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:dfca0e51c9a5cd018252121d987cdbb626bc5e6ca30c258503ba6febd3ae6c46","observation_id":"7c3bc4ea-e949-466f-a20f-fcbfaf500d01","resolution":{"observed_at":"2026-05-17T07:51:39.756808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d27e1c14-63d6-42a9-964a-208d798a2a2f","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:255c0e5b8f1ff0240d1e8820752b96949b71dd2be1636873688d021c75a1f53c","observation_id":"69b966b0-7442-4e73-a641-8dd42f130683","resolution":{"observed_at":"2026-05-17T07:51:39.739980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a575d07c-081a-472c-b238-1af3da78187d","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:1707ed0fd9c7073bd5c3b31e6ed673b6281a0c58d47b287531deb307f4768c27","observation_id":"161770d7-8829-4d61-90c3-34a4fbbd74df","resolution":{"observed_at":"2026-05-17T07:51:39.758984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9f162efa-69b0-4772-b6d1-97b4a38d8949","year":2023},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:73d1fc69dc3fe6c3b36cd49fbc0c520493cd1c577645ee58893215c587eaa5ab","observation_id":"ceb103ea-185d-4ee8-961d-6572af851419","resolution":{"observed_at":"2026-05-17T07:51:39.766469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c464bfb5-7ac2-40df-ad63-c612376affef","year":2014},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:491cda0f407865e5627d9e81665c0ec96b2f6116c792b9c000a463f7a0b0d554","observation_id":"57fd5de9-8fc1-46a8-8910-c657a3be0a43","resolution":{"observed_at":"2026-05-17T07:51:39.781331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-07T22:24:11.339954Z","title":null,"venue":null,"work_id":"5e90d6ca-4947-4b9b-9f43-aa1a36cf9d93","year":2020},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:b5be193e89a916608587390e490f19dd581c48285eabb64fad65745935adf68a","observation_id":"f664993d-7fa9-4ba8-bb7e-f3f170bcf8f2","resolution":{"observed_at":"2026-05-17T07:51:39.788398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-08T05:44:36.444140Z","title":null,"venue":null,"work_id":"a67e1902-8468-4a65-b6d2-a5fea8341e95","year":2021},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:ec1c00868aa0545980b4ea4607568c003588633bb7d69aed54ea6c91cd653507","observation_id":"05fa4083-aeae-4705-a04f-3a4d04fa6f10","resolution":{"observed_at":"2026-05-17T07:51:39.748196Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01128","last_updated":"2025-08-02T00:53:40Z","snapshot_observed_at":"2026-07-06T22:06:38.785781Z","submitted_at":"2025-08-02T00:53:40Z","title":"Towards Bridging Review Sparsity in Recommendation with Textual Edge Graph Representation","version":1},"cited_work":{"arxiv_id":"2508.01128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.01128","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"21c46e43-5f71-4383-8057-61b4cf26e8bd","year":2025},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2508.01128","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:5e0102ad4dadf03793d543fd9c8e6191a14685253be5ef4757c7da2391ec8c09","observation_id":"6780a553-5677-43de-b947-7bc5b0aaa164","resolution":{"observed_at":"2026-05-11T05:41:04.366677Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"248b1087-98a4-4f83-821e-1a03dbcfcb17","year":2021},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:d097a2923eded1a1c74754fcf6e4ff3528f9780ceac9e174d628da1282d4fa03","observation_id":"b4621436-69f2-499b-b05d-41e1d532feb9","resolution":{"observed_at":"2026-05-17T07:51:39.751815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a313ab54-c969-4acb-8ba7-b859d3f70734","year":2024},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:a6a5ab39b8223beb091c99110e6663b527a04744e21c9dc4a4a8c558ed82a90a","observation_id":"544122d4-0f6d-4ba9-b349-b61b98c993d7","resolution":{"observed_at":"2026-05-17T07:51:39.745386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07619","last_updated":"2021-07-26T08:31:31Z","snapshot_observed_at":"2026-07-06T10:41:31.563193Z","submitted_at":"2021-02-09T12:27:49Z","title":"MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Mask","version":2},"cited_work":{"arxiv_id":"2102.07619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07619","snapshot_observed_at":"2026-07-02T11:26:54.268220Z","title":"Masknet: Introducing feature-wise multi- plication to ctr ranking models by instance-guided mask.arXiv preprint arXiv:2102.07619, 2021","venue":null,"work_id":"6c934bd5-b519-4dd1-a197-e01e0c145c86","year":2021},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2102.07619","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:fb0926de3b4cdf604b2aff3e261f4e1821ffcfb2bec07cf0da9c42d6e768d758","observation_id":"550bc437-330c-4f2c-b3ef-2ee5667822b5","resolution":{"observed_at":"2026-05-11T05:41:04.313362Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.06644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T05:47:41.883741Z","title":"Willcock, Suvinay Subramanian, Felix Chern, Alek Andreev, Shreya Pathak, Felix Yu, Prateek Jain, David E","venue":null,"work_id":"79788ae8-cb00-4eb6-9f4d-7795089d1730","year":2025},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:e32cb77471d6bd96747a1a63b93527a9cbed46f6381919520d17ef90cd681b4a","observation_id":"f35a33cb-265e-4875-9baa-b4e658af79dc","resolution":{"observed_at":"2026-05-11T05:41:04.326357Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"13455405-27af-4efe-b278-57727a46fced","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:fe0626b83f27a8a4802259821d5e9e48a73f62ba4accf54573319d1a36688c9a","observation_id":"af09db4f-36bb-4c74-b9f3-101de259c4b1","resolution":{"observed_at":"2026-05-17T07:51:39.790876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02545","last_updated":"2024-06-04T04:29:24Z","snapshot_observed_at":"2026-07-06T17:39:32.800594Z","submitted_at":"2024-03-04T23:40:20Z","title":"Wukong: Towards a Scaling Law for Large-Scale Recommendation","version":4},"cited_work":{"arxiv_id":"2403.02545","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.02545","snapshot_observed_at":"2026-07-04T14:49:56.190893Z","title":"Wukong: Towards a scaling law for large-scale recommendation","venue":null,"work_id":"d612c103-4c36-4cc5-91e6-28654ab21000","year":2024},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2403.02545","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:311b857e46e42a3654bfd855a7662bd8fd5a8848317ded655633143762e95e4e","observation_id":"6eb5d488-2276-4db2-8bd2-607d1ca4724d","resolution":{"observed_at":"2026-05-11T05:41:04.321836Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.10584","last_updated":"2021-04-21T15:25:45Z","snapshot_observed_at":"2026-08-01T19:29:26.652185Z","submitted_at":"2021-04-21T15:25:45Z","title":"Deep Learning for Click-Through Rate Estimation","version":1},"cited_work":{"arxiv_id":"2104.10584","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.10584","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e5ee671f-d7ce-4725-a762-5ea9fe079231","year":2021},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"cited_paper":"/paper/2104.10584","citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:5264474883af1921fa9e6389a4215968d84f930944daf340ad338db319d02fd3","observation_id":"7fefb10c-cc99-418a-bdfb-710fd177134c","resolution":{"observed_at":"2026-05-11T05:41:04.290926Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c99f40be-0766-4487-8e48-3d76a77e51b1","year":2019},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:46c2b18ab238e90f0b1cc45b5d738daa7cbe67410a61005da8905ebf2322d320","observation_id":"3bee0fc1-371e-4394-9714-8f693f40fcad","resolution":{"observed_at":"2026-05-17T07:51:39.739729Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b85b05c3-fbc9-4f0e-b676-534e5209ec6f","year":2025},"citing_paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:52.846532Z"},"links":{"citing_paper":"/paper/2604.08011"},"observation_digest":"sha256:0fa0249bc54aa59defa80b8966c5e7da8a5f169b6640593a2b4b92f222e7564d","observation_id":"fde18a4e-be5a-4e9d-bf8f-502271c8af33","resolution":{"observed_at":"2026-05-17T07:51:39.742639Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.08011","last_updated":"2026-04-22T09:27:44Z","latest_version":4,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:13:21Z","title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":13,"verified_fuzzy":2},"total_outbound_references":39},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 3 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2604.08011."}