{"as_of":"2026-07-22T19:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e00be5512891279a314d42c55a7d2d7c622e9f8f7de45d0af7c88b4d62cae75c","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-21T14:14:04.500656Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-22T06:31:00.163083+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.10455/citation-record","integrity":"/paper/2602.10455/integrity","json":"/paper/2602.10455/citation-record.json","paper":"/paper/2602.10455"},"outbound":[{"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":"0f7f67d4-81bc-462b-bbe8-bc47f78976e5","year":2021},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:e2263a75237f11f4760482a88e14e910a728250ce4fabe1b51b836544f1e0e34","observation_id":"ad954570-b874-418c-b061-dfb30cc0e66b","resolution":{"observed_at":"2026-05-21T14:14:12.520286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"a1706006-4d47-493d-afb2-519efccba14c","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:523f52d2ce8f2e3a4f0dde98c159aa87fdaa682b14d87054fe2152e2a245e400","observation_id":"5647d7c5-1238-4f9c-85bb-5a3fd5a38f8e","resolution":{"observed_at":"2026-05-21T14:14:12.524774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"6e63adde-24ca-46aa-92af-19692a2388af","year":2022},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:af830fee122ecde874355dfc4fc7a75a58ae98e64ffea9eb3a39cc4a8361185a","observation_id":"b499ac85-aae3-4304-89d3-d3be0f3f01f6","resolution":{"observed_at":"2026-05-21T14:14:12.489298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05523","last_updated":"2025-04-28T11:39:17Z","snapshot_observed_at":"2026-07-06T20:33:15.472157Z","submitted_at":"2025-02-08T11:05:22Z","title":"Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders","version":3},"cited_work":{"arxiv_id":"2502.05523","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05523","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cffd751d-a25c-4fc8-a025-be537e65c2a7","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2502.05523","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:1dfcd8f87daecb041b68c2805cd8d7238adfbf91244f487bcc7b682e4931e86b","observation_id":"5cd61d47-1c4b-4eda-a8cc-2e702b51ff77","resolution":{"observed_at":"2026-05-21T14:14:12.292700Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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.454478Z","title":null,"venue":null,"work_id":"82ce6914-688c-4f2f-93e0-0d085e26582e","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:02f8a83a9303f679a1e04972ba014b5b3484ca7e073b2b84bce72ccfaa473bda","observation_id":"22532d65-d381-4308-8a57-373e9093e5b2","resolution":{"observed_at":"2026-05-21T14:14:12.518297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"eaa6324c-92c2-45b3-852c-6bf136b116bc","year":2021},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:556ec138fa8c3a69ed77414f2ad637df3aefdc7d2b9bf663f93d114af32f8305","observation_id":"69298fc6-57e6-4774-b9ca-0bd3b226bb92","resolution":{"observed_at":"2026-05-21T14:14:12.511177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"ce0f53e4-3be1-4937-b5b4-e5d054c650c4","year":2023},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:78e81b6a7a0dfcc4ebcba5938c0359a78008cb9fe1c87cc4956a95f45994cad5","observation_id":"ef415797-8663-4a29-bd39-eb0c5310df49","resolution":{"observed_at":"2026-05-21T14:14:12.496357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"8d374d34-c5a3-4a3e-85b8-586d25282a87","year":2022},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:c1aeec04ab12bcf22029474a99266209efcf0c95b3e59d9b2ac1edeaf0158aa5","observation_id":"b36ab601-bf7c-431d-bd2d-5396938ce293","resolution":{"observed_at":"2026-05-21T14:14:12.520570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"4dc967c9-aa12-4d88-b315-f8695ca59c7d","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:3538ed93c5de1e25fc7e0dd38b54ab0c0c342a53054f444be5e0ea054f91b460","observation_id":"c4a5a67c-e84c-4209-97e8-e3766fa7359e","resolution":{"observed_at":"2026-05-21T14:14:12.474270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18965","last_updated":"2025-02-26T09:25:10Z","snapshot_observed_at":"2026-07-06T20:42:55.911327Z","submitted_at":"2025-02-26T09:25:10Z","title":"OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment","version":1},"cited_work":{"arxiv_id":"2502.18965","doi":"10.48550/arxiv.2502.18965","metadata_source":"pith","pith_arxiv_id":"2502.18965","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment","venue":"cs.IR","work_id":"d1a07d92-e045-4af2-a79f-c7b0112cf824","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2502.18965","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:2b5ce778b6c9db078f2b83587c41dca233e46597f8794bb7568886aeaaa33648","observation_id":"da0fdf97-6c51-49ff-8bef-b19e934da718","resolution":{"observed_at":"2026-05-21T14:14:12.273699Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.201732+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.201732+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-22T06:30:55.410749+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":"bc8fe257-ab8b-4da7-9831-2e93de273e7e","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:6e56f528cd662d59276e5b485005d99c9ef334872ce3ede75a2235fe3d81f1f9","observation_id":"28e0044b-a188-4dca-95c0-a1c04deae3e2","resolution":{"observed_at":"2026-05-21T14:14:12.515988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"47793b00-6b99-4179-a00a-e80e4be3e1e7","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:01a67a5b765c91d6787609a93be56b6ec0f4ae31bf55572798ebe06de804a006","observation_id":"e0a70c97-6bdc-4fd6-b5e9-60ec48b2ffcc","resolution":{"observed_at":"2026-05-21T14:14:12.506269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"d0406fd8-29fd-4427-af1a-105801311bae","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:9d3409d903fc1812166bccce70867d2afe31a9a8af31fddcb2cfe778f84aae2b","observation_id":"8946f564-e52b-4524-b029-9ea25affb97b","resolution":{"observed_at":"2026-05-21T14:14:12.515790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.06563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T14:59:55.448801Z","title":null,"venue":null,"work_id":"63586574-96f3-458c-81eb-7f07395cb65a","year":2026},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:c9f417fa1ef7daca082e419f3b66f62dee02b50928a70d975cbd97d147cd451b","observation_id":"b90fad7f-cc68-4828-8ffe-3f030246117d","resolution":{"observed_at":"2026-05-21T14:14:12.283198Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09188","last_updated":"2025-05-14T06:39:01Z","snapshot_observed_at":"2026-07-06T21:23:42.895337Z","submitted_at":"2025-05-14T06:39:01Z","title":"Zero-shot Quantization: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.09188","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.09188","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"68e33bcf-7021-44fd-9200-6ccdbbc8ced9","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2505.09188","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:e34b20bdf3c2d9c3f152cf8c731becb59b7ae574d5c374f59e2454e804fab8bb","observation_id":"fc943326-4ff6-44e5-83ad-86896860e62b","resolution":{"observed_at":"2026-05-21T14:14:12.303762Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"ac715d26-1e98-49ea-a1e1-1d3192c55205","year":2019},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:dcefe64becd195b3f3d7f2b3b5d0da68261254d760efd778497330da829eb0e0","observation_id":"7ad1feba-9cd8-49db-af27-65298eaddf2d","resolution":{"observed_at":"2026-05-21T14:14:12.487020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"151f0c27-f93c-4dc8-8d74-8a20bc40065b","year":2024},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:a99e0c3acaf70141a3b1d87254731672a0f74462bdd03c71ae39abf40ad97325","observation_id":"985bb96d-8cf7-401a-b656-0399ded4ef73","resolution":{"observed_at":"2026-05-21T14:14:12.528001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"3e549bc3-8307-42bf-9be0-284f8aa9417d","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:121f9d3cd6a3bddc60b01136eaf77a4cee3a9c0ff66178865aa3bc39a39ad387","observation_id":"8fcab205-56c8-4bf9-ba71-6d715ad34670","resolution":{"observed_at":"2026-05-21T14:14:12.466835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"315ab26c-171f-48b1-bcb2-076fb0e32e3e","year":2020},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:268f8854514367448dead906b31b9b53164e28af72c985713d3210fd1a1b3a67","observation_id":"3c8c884e-03de-463f-a7b0-c8d8bf0ee8e4","resolution":{"observed_at":"2026-05-21T14:14:12.530388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.15286","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":"25bc156f-23b0-47b9-bf2f-908df0feed0d","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:6be6b1cad690ee42f76740eee7cea721c67db3bdde7d103400b36cdeabf1af6a","observation_id":"6615214c-0571-49d8-ba41-88723eee5c4d","resolution":{"observed_at":"2026-05-21T14:14:12.301529Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"d62b94ca-81d4-4b36-827f-69d82f9e460f","year":2024},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:f7d1acdeab198d31f86f540a0a219de3a6eb56a09471b7f1fb352b531ec4e04c","observation_id":"dc216592-0d98-4b2b-a483-b320ceeceac2","resolution":{"observed_at":"2026-05-21T14:14:12.517930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:cb6554f064cc1115ceef92c2ee4c7c78d7a2eab57f187a99926716c3a7d4c6c8","observation_id":"77d820b3-a1e9-484b-b0bc-68fd7313f6b7","resolution":{"observed_at":"2026-05-21T14:14:12.522869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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-09T09:26:09.599187Z","title":null,"venue":null,"work_id":"cc7706e1-24dd-411e-b9a3-4ca23c1fe501","year":2017},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:f92e2e1781477385f0a37c889d54b3fb2245c54c08738b2bee7478daca97fcfd","observation_id":"4a27394f-a3e6-45a5-a7b3-8b695f84545b","resolution":{"observed_at":"2026-05-21T14:14:12.481726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"369c7dcf-5af6-4416-a051-c0cb48f01929","year":2017},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:fa3f8b804c39a184950474e5daf1e0e2b3cc6bc93555f994477a57d4976a72dd","observation_id":"0aeca81a-3211-451c-9926-9efade9daa7f","resolution":{"observed_at":"2026-05-21T14:14:12.505042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.11096","last_updated":"2023-07-12T06:07:53Z","snapshot_observed_at":"2026-07-06T15:56:38.019661Z","submitted_at":"2023-07-12T06:07:53Z","title":"Towards the Better Ranking Consistency: A Multi-task Learning Framework for Early Stage Ads Ranking","version":1},"cited_work":{"arxiv_id":"2307.11096","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.11096","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"256845d6-5dc3-48ec-b60f-197eb17b460d","year":2023},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2307.11096","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:6baa2abdb52b2181d123f42cc8b1cbb2f607ab34918b6bec352d912c549344a9","observation_id":"47991ffe-a1b7-4d39-b273-9d00ddf09572","resolution":{"observed_at":"2026-05-21T14:14:12.279170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"4898b347-cc62-4635-b60e-be7f4a5f5e79","year":2024},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:3528a1b22c82723f1fd7eeef3915297474efd72ac7942de41b034a89e1dca4a7","observation_id":"e43d3a3b-221e-4625-8f95-bd190ea585d8","resolution":{"observed_at":"2026-05-21T14:14:12.503646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"4f475280-ea36-44fa-9f1c-4fe1e1a297c9","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:f409d4291cb6937460e2694cb7d0d19d1814ad1bb0f65f81c4e2478a33b2775f","observation_id":"80bb21bd-6703-4006-b935-c3a485dbdfcb","resolution":{"observed_at":"2026-05-21T14:14:12.525324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.02728","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":"1c13c4ba-cf56-44af-b905-dd64902a325b","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:377fb2ebc8ce32017ff3036e215fd5cf86f54b253defa80177872c77f6632871","observation_id":"3699024b-88b1-4d51-b0d5-eb0372331a90","resolution":{"observed_at":"2026-05-21T14:14:12.297006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:45693f85ac8ee9a0610d6ad45e324cbf81e85b7dbd40529b9c77a47b21805014","observation_id":"e9c71288-5cb1-4275-aaf1-906f0c22d006","resolution":{"observed_at":"2026-05-21T14:14:12.315471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"04307800-0587-44f9-a47b-8a1e17bd4c00","year":2022},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:f2094b7ed1ebeab517eebaa1f4dd501c061a64791b249415d856cfc17198e23c","observation_id":"6e0337f7-91cf-49cf-a5af-fa73fe084a93","resolution":{"observed_at":"2026-05-21T14:14:12.491348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17152","last_updated":"2024-05-06T02:05:45Z","snapshot_observed_at":"2026-07-06T17:35:57.887470Z","submitted_at":"2024-02-27T02:37:37Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","version":3},"cited_work":{"arxiv_id":"2402.17152","doi":"10.48550/arxiv.2402.17152","metadata_source":"pith","pith_arxiv_id":"2402.17152","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","venue":"cs.LG","work_id":"cedb01b6-64b1-4cd7-a797-f157c3dc9930","year":2024},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2402.17152","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:1a0ac12f3465534b5b879b4881ea32adf2152d1b4db1c8659e57e95deb6f34d0","observation_id":"3395b961-a198-41bd-bcc7-42a9bb8d5326","resolution":{"observed_at":"2026-05-21T14:14:12.311116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-06-02T00:57:47.012388+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:57:47.012388+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-22T06:30:55.410749+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":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2403.02545","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:64c6850a708b9c65d123e6f463491677d6d76d4444ed240443ed01daa2701309","observation_id":"617fce3a-384a-4adb-8c59-a4f044f1e296","resolution":{"observed_at":"2026-05-21T14:14:12.309739Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"4bde262d-f127-4158-92b9-7f5070486afe","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:e39887b0dcb561dd79733c3d21bc0cc31491034854052d2ceb6fe7e96529a87f","observation_id":"7b54d69f-9caa-4a14-889e-318d54f8c561","resolution":{"observed_at":"2026-05-21T14:14:12.485903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"abd86382-02bd-4fba-9ee8-46b3c0367dd0","year":2025},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:2787f156f5cefdb65e21ba59373b426bf3009a1ae3ad1aade27388b7d165e377","observation_id":"db84e3db-45bb-4efc-8045-c10cfab667c0","resolution":{"observed_at":"2026-05-21T14:14:12.479521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05625","last_updated":"2021-12-07T06:16:07Z","snapshot_observed_at":"2026-07-06T10:13:35.501573Z","submitted_at":"2020-11-11T08:33:07Z","title":"CAN: Feature Co-Action for Click-Through Rate Prediction","version":3},"cited_work":{"arxiv_id":"2011.05625","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.05625","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3c0ae7f7-4f18-4d21-b255-397529b38782","year":2020},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"cited_paper":"/paper/2011.05625","citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:f62357ebef4af393a6285f334afc537d42a83c14839ef82936887545a351aab9","observation_id":"b8aefc6b-9874-4ff7-89ee-9af58cafd8c9","resolution":{"observed_at":"2026-05-21T14:14:12.315856Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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.488629Z","title":null,"venue":null,"work_id":"2477d679-b3ed-42fa-9744-4d374ef772fc","year":2019},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:142cc3420910c01098f4b09c1d37bc994f92a4d9c0c7f9b5d2db3c229bd27807","observation_id":"eecf80e5-807b-4b9c-9713-58934de83bf6","resolution":{"observed_at":"2026-05-21T14:14:12.491554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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.491835Z","title":null,"venue":null,"work_id":"335c4d78-6f74-48db-96ef-4fe36d8324f2","year":2018},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:28327d36e6bc536d147f33ab336fdaba6e2e003764adf744c44fdc2f1b07c9c5","observation_id":"c393f875-80e3-4dda-9e07-1ed895ec7893","resolution":{"observed_at":"2026-05-21T14:14:12.522344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:bac76c2823d34559ee0d24485474856f5939d316e6fd8af5a4ad65c949240e8d","observation_id":"21276b6b-94e0-4486-80da-395a8d6fd7d5","resolution":{"observed_at":"2026-05-21T14:14:12.513585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+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":"1bc0cb8a-a544-48db-9ea2-051be34683b2","year":2024},"citing_paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T14:14:04.500656Z"},"links":{"citing_paper":"/paper/2602.10455"},"observation_digest":"sha256:108a532e175675607674ecab69a025bd8bc42200f220bdf940e45398973e44e7","observation_id":"69db236f-3c8a-448e-a08f-ab2f144251b2","resolution":{"observed_at":"2026-05-21T14:14:12.462791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-22T06:31:00.163083+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.10455","last_updated":"2026-05-20T08:54:35Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T22:45:25.047172Z","submitted_at":"2026-02-11T02:53:59Z","title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":11,"verified_fuzzy":28},"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-07-22T06:31:00.163083+00:00","source":"crossref"},{"observed_at":"2026-07-22T06:30:55.410749+00:00","source":"retraction_watch"}],"thesis":"As of 22 July 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2602.10455."}