{"as_of":"2026-08-19T23:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5aa6dd4cd11de5e586d037675b50ac12e6413b2bf1fbbccb3ab649212019efb","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:16:03.661438Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.11061/citation-record","integrity":"/paper/2608.11061/integrity","json":"/paper/2608.11061/citation-record.json","paper":"/paper/2608.11061"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-08-15T04:53:45.483331Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-12T11:16:03.541664Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.541664Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:baa34bb13ec23b659445c209fc711b89f43c31e9ae9d200a93246c0aa7d67bc5","observation_id":"8da19605-7240-409f-b225-9309c175774e","resolution":{"observed_at":"2026-08-12T11:16:03.541664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.406493Z","title":null,"venue":null,"work_id":"8d1ced83-c336-4517-9864-2e10956dcdcf","year":2018},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.546848Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:89fd074d18f104a75051ee06d1407dd179e1926055935801fc71e3c3eb58310a","observation_id":"c91033ce-d2eb-4570-ab0d-91bf4594eb08","resolution":{"observed_at":"2026-08-12T11:16:04.409841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.395237Z","title":"Curtis, and Jorge Nocedal","venue":null,"work_id":"51ebd746-3d0c-493c-a684-72309275e933","year":2018},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.551532Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:7cf41a17af5e2fdfe9116ab2904ff63c0830d0dede1ac5396744e5874437507c","observation_id":"de141bc5-406a-4239-94c3-4a1e6c0ae32e","resolution":{"observed_at":"2026-08-12T11:16:04.399728Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.380336Z","title":null,"venue":null,"work_id":"44f40f99-f752-44f1-a808-1143cfedeb6c","year":2020},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.555317Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:dfd7b26e38095446104393842d5fe106b201cc11bea95cdb996197422491ca2c","observation_id":"cfd8ceab-d4e7-41a9-b12f-298beb413bb1","resolution":{"observed_at":"2026-08-12T11:16:04.386668Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.559053Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.559053Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:00a8922ba5edcf5c4ed8b438285640813dbe0ca9bf016be2bd2d8cdba5cc7fdf","observation_id":"81d10812-32f0-4922-a12a-c5d6f040d5e1","resolution":{"observed_at":"2026-08-12T11:16:03.559053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.368009Z","title":null,"venue":null,"work_id":"a2d475b8-94bc-47c4-b6db-9c0135db14a9","year":2015},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.563143Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:9e4d404d05a42819faff153b45b44df8319765a5ee3fcac0b9c9ddea4b68e8e1","observation_id":"5664efd2-704b-48cd-80d9-73aa68305afa","resolution":{"observed_at":"2026-08-12T11:16:04.371485Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.567298Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.567298Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:0c521772e46a5710e6dfb65dedd86ecf6d26fd94d19b51990681b2eb40aa66d4","observation_id":"e4038fa4-db6b-438c-b3f3-39cc96d98253","resolution":{"observed_at":"2026-08-12T11:16:03.567298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.570787Z","title":"Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.570787Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:1895e9abf0e3152824ab4851a36e0c0c10e41c9b603df7b42931fff665184bc9","observation_id":"52c96970-5c60-47cb-9ceb-79c6ea21c5de","resolution":{"observed_at":"2026-08-12T11:16:03.570787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09331","last_updated":"2025-07-26T10:37:50Z","snapshot_observed_at":"2026-08-14T11:55:49.208883Z","submitted_at":"2025-07-12T16:16:11Z","title":"Correcting the LogQ Correction: Revisiting Sampled Softmax for Large-Scale Retrieval","version":2},"cited_work":{"arxiv_id":"2507.09331","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.09331","snapshot_observed_at":"2026-08-12T11:16:04.080295Z","title":"Correcting the LogQ Correction: Revisiting Sampled Softmax for Large-Scale Retrieval","venue":"cs.IR","work_id":"bb8e9e9e-9ba1-4119-95c4-fff56f25f4ee","year":2025},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.579452Z"},"links":{"cited_paper":"/paper/2507.09331","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:d2f0a0d433661d8f623ee6f64ec0fb8264518a2f7a20af9c30ca3ec62923bfe7","observation_id":"df3a5c26-a058-4f93-9ed0-5e2347bdf011","resolution":{"observed_at":"2026-08-12T11:16:04.085294Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-12T11:16:03.583633Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.583633Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:e7879870671960db65b9883fe04cc95661abbd8e292fc614d6bdc062b7555f06","observation_id":"7b65467a-1928-4a71-b7b1-374e8814d852","resolution":{"observed_at":"2026-08-12T11:16:03.583633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.587715Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.587715Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:c984aa11240ff5ddf9b0aba5ed252f42f2b9a849b494e15fb6bfadd61f53e6c7","observation_id":"949d50c3-5195-46e4-874e-aa320ba4dada","resolution":{"observed_at":"2026-08-12T11:16:03.587715Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.341956Z","title":null,"venue":null,"work_id":"0255f491-8057-4d5e-bea3-c456402e84b4","year":1967},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.591535Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:0ce242bd1c13d3a39eec4eb28eeffc48fd27082b1feb1bc84925570d4e0a7928","observation_id":"e9f77e18-4ff3-4697-90f9-33fbb2eab39e","resolution":{"observed_at":"2026-08-12T11:16:04.346219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18721","last_updated":"2024-11-30T14:45:05Z","snapshot_observed_at":"2026-08-16T21:04:31.600797Z","submitted_at":"2024-09-27T13:17:59Z","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","version":2},"cited_work":{"arxiv_id":"2409.18721","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.18721","snapshot_observed_at":"2026-08-12T11:16:03.991423Z","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","venue":"cs.IR","work_id":"235f7c3c-5114-44b8-acaf-4200092fcf15","year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.595232Z"},"links":{"cited_paper":"/paper/2409.18721","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:b750daedeaf40c4aba481a6a905cfb637e7986787d0ed990f70d7f9408f17077","observation_id":"4f098561-e292-4fa6-b6e6-955cdf4436bb","resolution":{"observed_at":"2026-08-12T11:16:03.995646Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.599201Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.599201Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:29cec3d39856b6456fad851192334e1203e5fe8b1616c9bd791726f440167260","observation_id":"ee1623c6-dc01-4482-9d4f-5ac8089c084a","resolution":{"observed_at":"2026-08-12T11:16:03.599201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.328395Z","title":"Yu, Ananda Theertha Suresh, and Sanjiv Kumar","venue":null,"work_id":"0475cbce-76f1-4322-b4bd-d72daa97961f","year":2019},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.602825Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:0640fb2f7b305c2bd3faf58f2d3d7ed42eca0348755913b535aaaeacc15f31c8","observation_id":"3b3dadc7-8394-4f47-95eb-d6fa4ab9be8d","resolution":{"observed_at":"2026-08-12T11:16:04.332785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.309393Z","title":null,"venue":null,"work_id":"57f64052-db69-4e0a-9727-0c70a40878dd","year":2026},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.606414Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:05f2c74e76a496a122074858d3c99ac8b782c45b82f611b07655327db30600c5","observation_id":"c001894b-def7-41ce-8eef-40334c0a2f8c","resolution":{"observed_at":"2026-08-12T11:16:04.313442Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.610454Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.610454Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:6914228b99011e81713da2719a4fe1c99c4b0198f4b5c0da5b63157dd198b673","observation_id":"aca1c278-b5f5-498e-bd06-04a8443f8ef9","resolution":{"observed_at":"2026-08-12T11:16:03.610454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.287823Z","title":null,"venue":null,"work_id":"8ff4d6c8-6460-49e3-8de4-0a9a12483f74","year":2013},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.614277Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:e4aa383965386262711bafbbb198b72d93fe351da9ccc667c2713d41a08ebfff","observation_id":"bd915174-f917-45b2-9c0a-9ad158f95d8b","resolution":{"observed_at":"2026-08-12T11:16:04.291855Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.617962Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.617962Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:3d5cde6f32eecb17da5457d52a844b48eee10b6d39c5cc97b5ffb55e4d6c8be6","observation_id":"156e6d05-95ef-4739-9824-d7924d28c5bb","resolution":{"observed_at":"2026-08-12T11:16:03.617962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.258961Z","title":null,"venue":null,"work_id":"1dd522a9-8bf9-42a2-8321-3a6e00bfa541","year":null},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.625835Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:8c9a96bf6557948003de2c2aa270412064f1523b0a7dbbecd7caa16327f57ae2","observation_id":"8bcb0fd8-0025-4a3e-847f-224bcf9ac5fb","resolution":{"observed_at":"2026-08-12T11:16:04.262750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.247785Z","title":null,"venue":null,"work_id":"76d34595-2355-45e9-a949-1a635dbebc44","year":2025},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.633774Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:27013263b78f6a44d2615061b98db3aaa7f905b006d3a923e142df6308b6e325","observation_id":"9930fdf9-13c8-4029-a3bd-32eede044c00","resolution":{"observed_at":"2026-08-12T11:16:04.251675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.236175Z","title":null,"venue":null,"work_id":"e78427f6-74b8-4c37-bb70-8e01e3d63cc0","year":2025},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.637410Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:a752b0c55269dc7a5ab5f4ee2334beea7be888f154006df5561ff2d960a7fdf3","observation_id":"b4bd0551-384f-4a98-a4fb-694d9d0c45eb","resolution":{"observed_at":"2026-08-12T11:16:04.239879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.641203Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.641203Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:64f6c19a15a6826fe9cb61e66a4e4d4aaca30db2251f9304953b7cd40e71b7e6","observation_id":"8bec6f9b-66f3-4b85-82ce-588309590e0a","resolution":{"observed_at":"2026-08-12T11:16:03.641203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.644835Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.644835Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:7b00595ca8965e40c5fdec9f109e84a8b2962a99a041b53ab7496c0818e9c42d","observation_id":"312330a7-52e6-402c-b5e8-271a344ef8c1","resolution":{"observed_at":"2026-08-12T11:16:03.644835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:04.211695Z","title":null,"venue":null,"work_id":"8bce3786-cbb2-424d-b16e-3b9aac31378d","year":2018},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.649413Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:79d179737ff31980a01d5866b0b3303eccdb01568bc2ac826fcd04fc0c058a10","observation_id":"2ebe19f2-e43f-47d8-90be-74d6469d408b","resolution":{"observed_at":"2026-08-12T11:16:04.220635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.652937Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.652937Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:36c20ecfe7321a90b4ec405f046d468b7a1643340c7986a28ab817ba50caa4be","observation_id":"1a1e2510-b6ee-4770-aaeb-10f00ddd1de9","resolution":{"observed_at":"2026-08-12T11:16:03.652937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-17T18:50:15.154907Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"cited_work":{"arxiv_id":"2509.09682","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.09682","snapshot_observed_at":"2026-08-12T11:16:03.828816Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","venue":"cs.IR","work_id":"0e088e2b-1651-4fc8-8b54-bdff255e3c9c","year":2025},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.657257Z"},"links":{"cited_paper":"/paper/2509.09682","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:95f14f207b040e27a385a5b5ae0483177345d503d8d52cace3aab0cf0abd8fe0","observation_id":"678a11b7-5dc9-4027-b1a2-4cb05eac1199","resolution":{"observed_at":"2026-08-12T11:16:03.835449Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.808047Z","title":null,"venue":null,"work_id":"89d9cf3c-fdb6-4eb0-b661-77bd62a62288","year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.661438Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:b96ca92684885acef1e8174270d64b9200a353f527e881ff773889ff57d23859","observation_id":"18900c0c-a0a6-4e89-ad28-969a3a661cb3","resolution":{"observed_at":"2026-08-12T11:16:03.812977Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:16:03.621986Z","title":"InProceedings of the 28th ACM international conference on information and knowledge management","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.621986Z"},"links":{"citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:804a03787c725afd30446402ffbc892a22158684cd0f4f46a3305083e257416d","observation_id":"bd7f0f1d-7f5f-4862-a798-ddefb0431e8d","resolution":{"observed_at":"2026-08-12T11:16:03.621986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-12T11:16:03.575044Z","title":"arXiv:2001.08361 [cs.LG]","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.575044Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:e3b124cbbc20245794cd61fb765803c2c10461b19646bd81e20373864c9ed862","observation_id":"16f95b66-3a85-496a-8998-cc146025f6ac","resolution":{"observed_at":"2026-08-12T11:16:03.575044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15146","last_updated":"2024-03-22T11:57:51Z","snapshot_observed_at":"2026-08-18T04:15:07.350897Z","submitted_at":"2024-03-22T11:57:51Z","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15146","snapshot_observed_at":"2026-08-12T11:16:03.629593Z","title":"arXiv:2403.15146 [cs.LG]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T11:16:03.629593Z"},"links":{"cited_paper":"/paper/2403.15146","citing_paper":"/paper/2608.11061"},"observation_digest":"sha256:1969d53077a17c5dbc71228bb54d39e4229586dc939247601bc8fb5e3cb251d0","observation_id":"0d4e2890-c4f6-498f-9450-be21d2d5fce6","resolution":{"observed_at":"2026-08-12T11:16:03.629593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.11061","last_updated":"2026-08-11T15:29:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T01:28:33.298896Z","submitted_at":"2026-08-11T15:29:01Z","title":"Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":4,"verified_fuzzy":1},"total_outbound_references":31},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2608.11061."}