{"as_of":"2026-08-20T03:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff7f60c2b1b688443be86f500d37f25399418a483ec8fa80f46d044dc101dbfc","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-20T01:40:56.833946Z","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:aabb7239916acde0e54edc82f2916b19322c65d4607648449a6fa5047d4a19bb","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-20T01:40:56.833946Z","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:57517cc675e26c546e00e0e89788ca98e7281f91cfc9bfc78622065f83abbe04","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-20T01:40:56.833946Z","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:f25f3b36a9facc1edbb03ed8238c70973c4a670a72168901eb0ee190d1f33de2","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-20T01:40:56.833946Z","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:49895089659dad41073e42af6a0205b242fad5ff696af1d4bc79aa53ef12bc2a","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-20T01:40:56.833946Z","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:5e80fafe0a48ddaaadc28101dd4e1976d6a40df414a8364f869aa48a8890fec6","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-20T01:40:56.833946Z","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:fa9dd9c4dfd2044092ecf125dba6df5a599ac727943a3f200c86510c6b426fdb","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-20T01:40:56.833946Z","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:786159f41ce6d7f167180e8490dc45b35b991823fa7614c60a5cb6e7a636ffb4","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-20T01:40:56.833946Z","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:a773f647db8a8ee7b56169a9b42c563937f350df1e27debd237805cbdcad10c9","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-20T01:40:56.833946Z","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:e33777b576135b7e57519098a7b17980324233fa7975e17b17c35e727b8a3713","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-20T01:40:56.833946Z","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:b0e7ae3845b540326c012c061bb79b2a2e89fe0e59ca2d2b76e6905628717e99","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-20T01:40:56.833946Z","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:d584d11f05c8a2f708ec184fb15dbb125c623c48f2bf6632ef6064737447415a","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-20T01:40:56.833946Z","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:2261ee71dd9c2b9a939961a3725b36ae1c37b77ffc1d8589e5c6ca659b0fdefb","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-20T01:40:56.833946Z","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:98ab706b084a00ee955fb7f438945e0b60408dec8981d05ee4914974ea98a021","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-20T01:40:56.833946Z","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:f0ff64a4ae84da0d5eb7916b2ad51dfb07c0109d91f14c4768a1e00b4eed8a00","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-20T01:40:56.833946Z","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:ac6043f48e3cea5073c6bb1b83bdc5a654a911d1816d4cf5b3ede77cbfb74154","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-20T01:40:56.833946Z","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:3b1073b3a3f9ae3f29bca98b70c1160b1ece2c710d133428f4be218cc0765648","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-20T01:40:56.833946Z","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:4208fa90275d11bb7fe2e1ccb7fc6c80644215ff272e2de4747d39ec4703a1e2","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-20T01:40:56.833946Z","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:e3adeedce57ece0c8302014dfb023d1b446b89e575593869c479a09c74fc8ae3","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-20T01:40:56.833946Z","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:c3c2e87e2bef084fdd659157870f49b4be48a1e9c1320c1968364d71e245b569","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-20T01:40:56.833946Z","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:0f33d474403786e1dc54df64341624287453d725bfc486ba0344d5a5ff803ff2","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-20T01:40:56.833946Z","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:4bd46a8e348cf1f742647aca7fba9e4acd260099555562f7137a94f39d41729f","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-20T01:40:56.833946Z","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:b82af17ad19945aa88f4993f1ffa368a4a585e7aa9cb6f02a48841ae68e7e259","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-20T01:40:56.833946Z","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:d53c42dfa7f65b08cf05904799638dbb13b4d75ac425554bfbd515258510d5ae","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-20T01:40:56.833946Z","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:37c65c859314260c72eb35ea16f568be28d10da7826ba8374431210da4e941f1","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-20T01:40:56.833946Z","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:e6a59cbca6dc04f1df0faa44fb8d22afa703e5823a8f4a3c23c7014f2cf817b8","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-20T01:40:56.833946Z","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:482a5a4387443a05d421695327ae5a801b8f0127a04d0bc87a41acd784dbcd2e","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-20T01:40:56.833946Z","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:b879c8340698efa0a856c891596b9fe64a8e5a16b6803e9852ff200760646b00","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-20T01:40:56.833946Z","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:2f594b31fc8e51d0be467b2e12361fa07409fd5056bb9c53261a760966b8c939","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-20T01:40:56.833946Z","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:db64ed238339a83956182cf8b6b20fe685d1b6280a12872e8911d86d01805764","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-20T01:40:56.833946Z","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:4fe2946b623fcfb8fc9ded53d3183fd538c3bb13fd6b7ac9996389cd13a9febf","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-20T01:40:56.833946Z","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:6a8b465a56ab8060e8dcac25b1aa3d0a81a9a33c9399cfe7befe84e5f7ef8405","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-20T01:40:56.833946Z","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 20 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2608.11061."}