{"as_of":"2026-08-04T14:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ae7c92e4fc69caca88dc795545c7b8799f5581d45e0218f1b47e5ecd4362fed","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T01:44:44.346732Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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-07-31T14:57:40.679020Z","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.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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.19550","snapshot_observed_at":"2026-07-31T14:57:40.679020Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24439","last_updated":"2026-07-27T13:47:38Z","snapshot_observed_at":"2026-08-03T05:34:53.299119Z","submitted_at":"2026-07-27T13:47:38Z","title":"Unifying Generative Recall and Multi-Objective Ranking in a Single Decoder-Only Sequence","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T14:57:40.679020Z"},"links":{"cited_paper":"/paper/2604.19550","citing_paper":"/paper/2607.24439"},"observation_digest":"sha256:e0468ee44f35706f7d608649ae09ccdfd22814e0669b4aecfead7bf33eb66d27","observation_id":"a861e6b2-90ca-42d8-bcf0-4546f15aa15d","resolution":{"observed_at":"2026-07-31T14:57:40.679020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.19550/citation-record","integrity":"/paper/2604.19550/integrity","json":"/paper/2604.19550/citation-record.json","paper":"/paper/2604.19550"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":"2303.08774","doi":"10.1002/tea.20265","metadata_source":"pith","pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"GPT-4 Technical Report","venue":"cs.CL","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","year":2023},"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":1,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:0106282bb282013a277cbf425adfd8fdc166b71e96860d993ce053e6a220bba0","observation_id":"9a5c048b-fe94-4df8-a290-b80d4abe73a1","resolution":{"observed_at":"2026-05-11T13:26:04.363373Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9100.295919","doi":"10.1145/2959100.2959190","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"URL https://doi.org/10.1145/ 2959100.2959190","venue":null,"work_id":"8a9bd35c-501b-4836-904a-8d4141b5a939","year":2016},"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":2,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:bc310231439058b5bb581993ad28ef4d0eaa407cffc371a2f44e9dd4dbe46d8c","observation_id":"bbd00b1c-1105-4f75-95b9-511b83a97c6c","resolution":{"observed_at":"2026-05-10T01:46:00.044533Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-16T19:51:29.017711+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T19:51:29.017711+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.18091","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T02:49:25.503589Z","title":"Onepiece: Bringing context engineering and reasoning to industrial cascade ranking system.arXiv preprint arXiv:2509.18091","venue":null,"work_id":"a986536b-a0c7-4016-a01e-ab67867166d1","year":2025},"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":3,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:153e27a8eaefe8ef6b13b981579ee288f515b46fd685ddefce528681ac8f58b6","observation_id":"d8b4a1d5-0719-4d99-88bb-6164735651b0","resolution":{"observed_at":"2026-05-11T13:26:04.131632Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03819","last_updated":"2019-03-05T16:46:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-07-10T18:39:15Z","title":"Universal Transformers","version":3},"cited_work":{"arxiv_id":"1807.03819","doi":"10.48550/arxiv.1807.03819","metadata_source":"pith","pith_arxiv_id":"1807.03819","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Universal Transformers","venue":"cs.CL","work_id":"8e5baefe-d209-411c-aefc-5acaa9275c8a","year":2018},"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":4,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/1807.03819","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:01c1bda689baac01884155aa45b31cfbace253993d0c2ed49a8ded48379e2210","observation_id":"78250541-1c19-4e39-8804-9f21fcde31e7","resolution":{"observed_at":"2026-05-13T08:04:31.534239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15647","last_updated":"2025-05-12T03:51:20Z","snapshot_observed_at":"2026-07-06T19:20:55.427960Z","submitted_at":"2024-09-24T01:21:17Z","title":"Looped Transformers for Length Generalization","version":5},"cited_work":{"arxiv_id":"2409.15647","doi":"10.48550/arxiv.2409.15647","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15647","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.15647 , year=","venue":null,"work_id":"004f7149-3198-47ac-ac43-7a5b435a7368","year":2024},"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":5,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2409.15647","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:79e9dd7f0cd110170579ed767a58e2f64b0c72f7c8bd271504c238a8959e5155","observation_id":"43c64a2f-26fa-4b03-b483-e405ee0251e1","resolution":{"observed_at":"2026-05-11T13:26:04.209043Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08983","last_updated":"2017-02-21T16:21:21Z","snapshot_observed_at":"2026-07-06T04:51:04.562947Z","submitted_at":"2016-03-29T22:09:00Z","title":"Adaptive Computation Time for Recurrent Neural Networks","version":6},"cited_work":{"arxiv_id":"1603.08983","doi":"10.48550/arxiv.1603.08983","metadata_source":"pith","pith_arxiv_id":"1603.08983","snapshot_observed_at":"2026-07-11T03:27:46.945810Z","title":"Adaptive Computation Time for Recurrent Neural Networks","venue":"cs.NE","work_id":"75565443-173e-479c-b0e7-d2464e7630be","year":2016},"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":6,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/1603.08983","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:a27ea97cb62e79026289c944e8b8a918b722ba685de9ae949e686cf4ac3a9183","observation_id":"d15b17d2-fa0b-48fe-a9d5-1fb4cb64a383","resolution":{"observed_at":"2026-05-12T11:53:22.734695Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.05884","last_updated":"2023-11-10T05:57:57Z","snapshot_observed_at":"2026-07-06T16:45:36.159896Z","submitted_at":"2023-11-10T05:57:57Z","title":"Hiformer: Heterogeneous Feature Interactions Learning with Transformers for Recommender Systems","version":1},"cited_work":{"arxiv_id":"2311.05884","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.05884","snapshot_observed_at":"2026-06-30T16:54:59.135304Z","title":"Hiformer: Heterogeneous feature interactions learning with transformers for recommender systems","venue":null,"work_id":"cd53eae2-bc6b-408b-9d6d-dd48b105504a","year":2023},"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":7,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2311.05884","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:f957aa6e8651cf8a82654ca9dca386a63741688a4d9a857f61b228b2620e4811","observation_id":"2c930dc5-6381-47fc-a95e-0e74ca6aec39","resolution":{"observed_at":"2026-05-11T13:26:04.224776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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.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":8,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:2ff356a8d5a1bbd7800d87d6938495cc4f8c8489fb1350f4deb40edf4a878ec4","observation_id":"20f75c0f-f3f8-4c7a-880a-ef1d13a00d8e","resolution":{"observed_at":"2026-05-11T13:26:04.157334Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.14110","last_updated":"2026-07-02T03:27:35Z","snapshot_observed_at":"2026-08-02T23:22:45.452307Z","submitted_at":"2026-02-15T11:53:30Z","title":"MixFormer: Co-Scaling Up Dense and Sequence in Industrial Recommenders","version":2},"cited_work":{"arxiv_id":"2602.14110","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.14110","snapshot_observed_at":"2026-07-04T14:59:55.458624Z","title":"Mixformer: Co-scaling up dense and sequence in industrial recommenders","venue":"cs.IR","work_id":"0f1d5199-616f-41f2-b557-2ad20adc5358","year":2026},"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":9,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2602.14110","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:2f2d6465d6662740be7f8a49244e9203d4050e8a4d918659016a4f2e31f45759","observation_id":"32c23a21-3794-4fe3-86aa-17be92763f27","resolution":{"observed_at":"2026-07-03T02:16:49.181066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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.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":10,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:c88d16c0497ed7f907fa3e2503903a82b3bd1996a3da5ddb03e62f4a3984ad1f","observation_id":"0e99b918-560b-4786-b852-eaa3c5a3b305","resolution":{"observed_at":"2026-05-11T13:26:04.176212Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.15994","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T23:47:27.577536Z","title":"Scaling recommender transformers to one billion parameters.arXiv preprint arXiv:2507.15994","venue":null,"work_id":"e1726d26-5e3a-4322-a8e8-a932cb6747bf","year":2025},"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":11,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:fffc86b0c1ed5e510b6c58f615a52e6c5566f8fe28815efd544786a85b807a5d","observation_id":"8fb4c3d8-76b9-4847-ba9c-1c8be401de8c","resolution":{"observed_at":"2026-05-11T13:26:04.338509Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.07358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T13:15:45.633826Z","title":"Encode, think, decode: Scaling test-time reasoning with recursive latent thoughts.CoRR, abs/2510.07358","venue":null,"work_id":"427ccd8e-7f71-4731-a046-a1b724d158d8","year":2025},"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":12,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:ff1491279d87824bb9cf35d2d0ea93c5670fc5618a95fc0932a0436725ad16d4","observation_id":"ef0c1c05-227a-4a0a-bda1-5ecd873c8c9e","resolution":{"observed_at":"2026-05-11T13:26:04.280239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4915.360883","doi":"10.1145/3604915.3608831","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"ISBN 9798400702419","venue":null,"work_id":"84c8514d-7147-44fe-9d58-883509b14477","year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:743b5d149b24c47ae7c34b5e4045fec78be1060881bc1c884120630d7312e3f8","observation_id":"887388f1-be97-463b-a029-3875856c7960","resolution":{"observed_at":"2026-05-10T01:46:00.041501Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3031.335095","doi":"10.1145/3343031.3350950","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"doi: 10.1145/3343031.3350950","venue":null,"work_id":"901a73ab-4078-4d8e-8287-42d29a306267","year":null},"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":14,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:08fea1cc8c345458812ae93e6b6506aa2ed24b8fb90d86f4a6dc96387f554b93","observation_id":"6fd7ca89-4c6b-48b8-ab27-849a3fd7a663","resolution":{"observed_at":"2026-05-10T01:46:00.046997Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Train flat, then compress: Sharpness-aware minimization learns more compressible models","venue":null,"work_id":"81bc4bfb-da15-41b7-8951-dcb3276539b8","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":15,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:00ba1c4a4a0e52a9b2602c728a0e599fec994bba1587062f01b39eafd0e6d1bc","observation_id":"b7f20b49-6beb-45f4-9644-ff8bf277fda2","resolution":{"observed_at":"2026-05-23T02:15:19.029356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2022.findings-emnlp.361","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"doi: 10.18653/v1/2022.findings-emnlp.361","venue":null,"work_id":"5b1248ed-442b-4128-a61b-b5db492a3701","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":16,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:157bafb6e78c4bd4ef0744b60a11c9623d21ed864fb27e6e00eec285052fa598","observation_id":"f5080f27-0995-4a7b-8240-6bb878ad6ad9","resolution":{"observed_at":"2026-05-10T01:46:00.039018Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-03T03:23:56.857266Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"cited_work":{"arxiv_id":"2503.16419","doi":"10.48550/arxiv.2503.16419","metadata_source":"pith","pith_arxiv_id":"2503.16419","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","venue":"cs.CL","work_id":"21afd80d-63a7-472b-800d-3b81161c39d3","year":2025},"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":17,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:b785ac083ef661d967997119c3705d7fced2df65d9ab98d5901af16af23fea7e","observation_id":"43535ffe-f747-47b0-87eb-6c429a4ef336","resolution":{"observed_at":"2026-05-14T01:29:57.879683Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.22675","last_updated":"2025-08-01T16:17:57Z","snapshot_observed_at":"2026-07-06T21:00:27.824615Z","submitted_at":"2025-03-28T17:59:03Z","title":"Think Before Recommend: Unleashing the Latent Reasoning Power for Sequential Recommendation","version":3},"cited_work":{"arxiv_id":"2503.22675","doi":"10.48550/arxiv.2503.22675","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.22675","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Think before recommend: Unleashing the latent reasoning power for sequential recommendation","venue":null,"work_id":"46274eb3-290c-4723-9991-2cb74d8537d4","year":2025},"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":18,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2503.22675","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:49a79fbd4b020b9a8f6ffb8bc0fa66734b9d35f316016b96894574b831978eaa","observation_id":"ee6eec01-4d3f-4f85-8a24-bde7f53fc30e","resolution":{"observed_at":"2026-05-11T13:26:04.218193Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Dcn v2: Improved deep & cross network and practical lessons for web-scale learning to rank systems","venue":null,"work_id":"f8b7fd0f-f0a3-4839-beec-27cb246efde4","year":2021},"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":19,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:ed7b32ce8e75a476665d5df2280a4d1dd90b88daf63374d84529e61210f6c46f","observation_id":"ab8516a7-6fbb-465b-bd8e-260e9e8dbb89","resolution":{"observed_at":"2026-05-23T02:15:19.032162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.24880","last_updated":"2026-01-05T16:51:18Z","snapshot_observed_at":"2026-08-03T01:54:33.526522Z","submitted_at":"2025-12-31T14:16:26Z","title":"mHC: Manifold-Constrained Hyper-Connections","version":2},"cited_work":{"arxiv_id":"2512.24880","doi":"10.48550/arxiv.2512.24880","metadata_source":"pith","pith_arxiv_id":"2512.24880","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"mHC: Manifold-Constrained Hyper-Connections","venue":"cs.CL","work_id":"33e3e022-8d5c-426f-8a95-6e7124e202db","year":2025},"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":20,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2512.24880","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:96a4225bd9ee2676cdf21323b54a692bc4bfeb0a50bc1a0738dd8388181e7697","observation_id":"b244fb65-c3e2-465d-bbd1-915179d4bf64","resolution":{"observed_at":"2026-05-15T12:31:48.157540Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-25T12:53:24.654247+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T12:53:24.654247+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01405","last_updated":"2025-06-05T13:30:23Z","snapshot_observed_at":"2026-07-06T19:25:56.114976Z","submitted_at":"2024-10-02T10:31:17Z","title":"On Expressive Power of Looped Transformers: Theoretical Analysis and Enhancement via Timestep Encoding","version":7},"cited_work":{"arxiv_id":"2410.01405","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01405","snapshot_observed_at":"2026-06-29T08:53:16.101915Z","title":"arXiv preprint arXiv:2410.01405 , year=","venue":null,"work_id":"e956dd7e-c885-4039-ab9c-c01607af7e4d","year":null},"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":21,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2410.01405","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:c9688fd3fb0e766cc00941d8afd36c5f5ec02f72e5120708e1560213376666a2","observation_id":"d73befe2-5ad7-4efd-a8ff-b150fb71da23","resolution":{"observed_at":"2026-05-11T13:26:04.270623Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.20235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T14:49:56.209118Z","title":"Hhft: Hierarchical heterogeneous feature transformer for recommendation systems.arXiv preprint arXiv:2511.20235","venue":null,"work_id":"910832b5-6512-49a7-acb7-0a86a44ba5df","year":2025},"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":22,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:e607a4b8d7f006c7888c16d9e423c067fb458c2afec2a1da455d1503cca4d011","observation_id":"43a430d2-799b-412f-8470-f2994f9d9d96","resolution":{"observed_at":"2026-05-11T13:26:04.309172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6252.376152","doi":"10.1145/3746252.3761527","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"doi: 10.1145/3746252.3761527","venue":null,"work_id":"303c3025-59d4-47c9-83cd-6fb62775128b","year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:2ba240ed89ef22c29a910e22189bea682513bd41cf42a35a3e363ba1add97ba5","observation_id":"5f6ce521-b07a-47cb-9909-d185b7c68f03","resolution":{"observed_at":"2026-05-10T01:46:00.034266Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T12:50:15.089729Z","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-07-10T06:15:00.866473Z","title":"Dhen: A deep and hierarchical ensemble network for large-scale click-through rate prediction","venue":null,"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:1d6de3432c9175565ce2c3b43f04e973892d735abed885ee23fdff2449bf6e99","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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.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":25,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2403.02545","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:47e9e8b13c0fe6a0bebe03d514c593546aa126ac4c7618ac23fa7338ca573748","observation_id":"58b15122-9cb4-4fab-85c9-73622caba7dc","resolution":{"observed_at":"2026-05-11T13:26:04.241119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.21285","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T16:54:59.188655Z","title":"Zenith: Scaling up ranking models for billion-scale livestreaming recommendation.arXiv preprint arXiv:2601.21285","venue":null,"work_id":"5599f18a-bd27-4286-a0cf-aae0a83c1c23","year":2026},"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":26,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:82b7c297ea1960f69747972532ecc2de03b5d43eeb1ec59a24ecc6f0617ac6d1","observation_id":"6f2c0eb7-e310-4a2c-8b19-387c2095b320","resolution":{"observed_at":"2026-05-11T13:26:04.251704Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2729.2023","doi":"10.1109/cvpr52729.2023","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp","venue":null,"work_id":"b9701eca-d05e-4d2e-9045-6761df4ba175","year":2023},"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":27,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:c5969a448d49362bb9c610a84461d8001718c342075d8d9f95abe4e9e99c46d0","observation_id":"283d663a-c7cd-46de-98ee-1c6d3066ec38","resolution":{"observed_at":"2026-05-10T01:46:00.037433Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-12T01:51:17.845486+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T01:51:17.845486+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19606","last_updated":"2025-03-18T10:12:54Z","snapshot_observed_at":"2026-07-06T19:24:03.133851Z","submitted_at":"2024-09-29T07:57:07Z","title":"Hyper-Connections","version":3},"cited_work":{"arxiv_id":"2409.19606","doi":"10.48550/arxiv.2409.19606","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.19606","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hyper-Connections","venue":null,"work_id":"6cfc7245-c5ef-4350-8cb4-4857c9019ca2","year":2024},"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":28,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2409.19606","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:826ec7f6e41c9b75fafdcc495f05e7ed9ad1f72ee476cec07c493d76618a2052","observation_id":"115975ef-9742-467c-be35-f49c73239257","resolution":{"observed_at":"2026-05-11T13:26:04.138897Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-05-25T12:53:26.304381+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T12:53:26.304381+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.25741","last_updated":"2026-07-01T23:25:58Z","snapshot_observed_at":"2026-08-04T07:30:51.188041Z","submitted_at":"2025-10-29T17:45:42Z","title":"Scaling Latent Reasoning via Looped Language Models","version":5},"cited_work":{"arxiv_id":"2510.25741","doi":"10.48550/arxiv.2510.25741","metadata_source":"pith","pith_arxiv_id":"2510.25741","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Scaling Latent Reasoning via Looped Language Models","venue":"cs.CL","work_id":"0c087b6b-1850-498b-9197-a0a85ed89937","year":2025},"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":29,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"cited_paper":"/paper/2510.25741","citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:da9f6ef724b44ae04af75cc574ad4c807b9753850debbe3d7babe3674cfd47c8","observation_id":"9157dc64-f6b7-4bdd-968b-7ad879f737eb","resolution":{"observed_at":"2026-05-15T07:43:12.191103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:19:22.789498+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:19:22.789498+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8719.8713","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4dd77fde-7961-4918-b650-7dc82ac92802","year":2017},"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":30,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:cddf68558683a6ab953ab0058324e296a214c52f845527d45bd9d019dfd15e0f","observation_id":"5199e271-4777-4c77-a514-26f54135f08f","resolution":{"observed_at":"2026-05-11T13:26:04.286918Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"Let Tseq and Tglb denote the number of sequential and global tokens after long-term sequence compression, respectively, and let T= Tseq +T glb","venue":null,"work_id":"4da6d9cd-e18a-4432-b15c-906ca554e422","year":2048},"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":31,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:3834d68b97276fc1082d7c245f17147d4565134b7a3b4a90b22014ba8020f6be","observation_id":"c4f4367a-450b-4da7-8993-213510f9ef63","resolution":{"observed_at":"2026-05-23T02:15:19.043497Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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":"d5abae75-de66-4ccc-a926-a4617b848d8a","year":2024},"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":32,"source":"pdf_text","source_observed_at":"2026-05-10T01:44:44.346732Z"},"links":{"citing_paper":"/paper/2604.19550"},"observation_digest":"sha256:1606ccce1b29bcef392effd0147c2fefe8235f3f19b50503dabf9199cfd7543e","observation_id":"9e0f28db-a93d-421b-8897-7578850c01b3","resolution":{"observed_at":"2026-05-23T02:15:19.034719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.19550","last_updated":"2026-04-21T15:06:59Z","latest_version":1,"primary_category":"cs.IR","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"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":27,"verified_fuzzy":2},"total_outbound_references":32},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 1 inbound Pith citation observation for arXiv:2604.19550."}