{"as_of":"2026-08-23T00:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38d6f19bdded0271b48ff9789ac448fb87999f6322903331252c142b2617a719","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:58:10.321240Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2505.11388/citation-record","integrity":"/paper/2505.11388/integrity","json":"/paper/2505.11388/citation-record.json","paper":"/paper/2505.11388"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:58:10.201780Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.201780Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:8c7c1863b280536c460cd50b18a9a557f3a00b6d9549311ca7e0de60d67ed5e9","observation_id":"4b4e96bc-1424-402d-8021-da1f46ed89e6","resolution":{"observed_at":"2026-08-15T20:58:10.201780Z","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-15T20:58:10.210676Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.210676Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:ab578daa3fdccae436a117f945f995d3a78b72c5f30ad231f436345cc02ec53c","observation_id":"1dec4497-8977-42ba-9b0c-95789af9a4cb","resolution":{"observed_at":"2026-08-15T20:58:10.210676Z","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-15T20:58:10.215138Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.215138Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:8331e5543c091e11c070b962eaea216b70c834cf0837a8c34d5524a576b3eaed","observation_id":"08b60d8e-0e95-4a91-b8e1-ddd8ab9dbb7d","resolution":{"observed_at":"2026-08-15T20:58:10.215138Z","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":"10.1002/nme.1620180804","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:08:47.750906Z","title":null,"venue":"International Journal for Numerical Methods in Engineering","work_id":"507c5cb3-4e0f-4b98-a9db-e8a0ada980b2","year":1982},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.223990Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:09cc63846003712c64b26b70b079f849a6bc31bbee7fb5f8ebcb0b3cea65e4b3","observation_id":"8b2cdf55-1560-439b-9860-2a20a699a141","resolution":{"observed_at":"2026-08-15T20:58:10.359244Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.08600","last_updated":"2023-10-04T13:17:38Z","snapshot_observed_at":"2026-08-21T17:39:12.921162Z","submitted_at":"2023-09-15T17:56:55Z","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.08600","snapshot_observed_at":"2026-08-15T20:58:10.219320Z","title":"arXiv:2309.08600 [cs.LG] https://arxiv.org/abs/2309.08600","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.219320Z"},"links":{"cited_paper":"/paper/2309.08600","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:a5bfdf2025d73ecc61e22e346abc86aaed0363b90c1c0dc5b921f69ec285c866","observation_id":"833bb8ce-b330-47d2-80e7-ad2120bb203c","resolution":{"observed_at":"2026-08-15T20:58:10.219320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02079","last_updated":"2019-11-05T20:43:51Z","snapshot_observed_at":"2026-07-06T08:34:58.548831Z","submitted_at":"2019-11-05T20:43:51Z","title":"Post-Training 4-bit Quantization on Embedding Tables","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02079","snapshot_observed_at":"2026-08-15T20:58:10.233293Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.233293Z"},"links":{"cited_paper":"/paper/1911.02079","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:1c6a0e675ce74f227a2f776cc129b95dcefcf315f634aea685856d05c18fb732","observation_id":"9aedcb0b-527a-4d7a-8ad8-cef7bac06d23","resolution":{"observed_at":"2026-08-15T20:58:10.233293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04093","last_updated":"2024-06-06T14:10:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-06T14:10:12Z","title":"Scaling and evaluating sparse autoencoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04093","snapshot_observed_at":"2026-08-15T20:58:10.228597Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.228597Z"},"links":{"cited_paper":"/paper/2406.04093","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:1d94513a5d407c20659371ab7b0369e6ace4ea1d9d649b4cce95222aaaffc15d","observation_id":"ad8ee3bc-2bea-4c47-87a3-4d022fc2c03e","resolution":{"observed_at":"2026-08-15T20:58:10.228597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13147","last_updated":"2024-02-08T03:21:26Z","snapshot_observed_at":"2026-08-16T16:57:34.407283Z","submitted_at":"2022-05-26T04:33:56Z","title":"Matryoshka Representation Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.13147","snapshot_observed_at":"2026-08-15T20:58:10.241980Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.241980Z"},"links":{"cited_paper":"/paper/2205.13147","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:1d2edf9829036020b26744682402261b33ddf4ed562f47306362e636316b9aa0","observation_id":"ff8c6637-b9b1-45a0-94d8-786784af7ccf","resolution":{"observed_at":"2026-08-15T20:58:10.241980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-15T20:58:10.237491Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.237491Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:d88128558e4d06b1d92d1c3df1560fa77403028747ac824261c54b37c16f4ecd","observation_id":"20923b90-f9b5-41fe-a92d-9635d5eee38f","resolution":{"observed_at":"2026-08-15T20:58:10.237491Z","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-15T20:58:10.751311Z","title":null,"venue":null,"work_id":"f5591f70-8f90-435e-950e-3af58510f518","year":2024},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.250317Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:4e76244457c2987d7eecc0210d355382f35d8dc4932818efad2191a923e41791","observation_id":"14a129c7-7720-46e4-9db8-84eb59ab468d","resolution":{"observed_at":"2026-08-15T20:58:10.756179Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T20:58:10.764867Z","title":null,"venue":null,"work_id":"2de54f9c-c234-4aea-810b-c80c5b84d138","year":2023},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.245853Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:5144575a1a972f2d45f2564128618eedd8c3c2826e3943f3815ff3f9ac28b2b4","observation_id":"ff2a5dcd-f2d7-4713-a95d-192cc1a38e5c","resolution":{"observed_at":"2026-08-15T20:58:10.769079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5663","last_updated":"2014-03-22T17:12:07Z","snapshot_observed_at":"2026-08-19T08:54:08.827507Z","submitted_at":"2013-12-19T17:46:46Z","title":"k-Sparse Autoencoders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5663","snapshot_observed_at":"2026-08-15T20:58:10.258459Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.258459Z"},"links":{"cited_paper":"/paper/1312.5663","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:6e66e92f05c712574c5bc77b1cb940c4363dfc1d82af55ba244918bc6037af5c","observation_id":"3431a073-388a-4c4d-bfc4-85925d0cae9d","resolution":{"observed_at":"2026-08-15T20:58:10.258459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07663","last_updated":"2022-09-27T21:58:20Z","snapshot_observed_at":"2026-08-20T05:53:32.758737Z","submitted_at":"2022-09-16T00:58:16Z","title":"Monolith: Real Time Recommendation System With Collisionless Embedding Table","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.07663","snapshot_observed_at":"2026-08-15T20:58:10.254066Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.254066Z"},"links":{"cited_paper":"/paper/2209.07663","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:b0a1195f297c7c8cd8d2e5109df525bf748050e58e9ec25f3cb3a72455f05510","observation_id":"34806373-5fa6-49f7-840a-926375941e17","resolution":{"observed_at":"2026-08-15T20:58:10.254066Z","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-15T20:58:10.272857Z","title":"Morris, Brandon Duderstadt, and Andriy Mulyar","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.272857Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:ade6dcbebc75d7af26ce8f89fafad089330d9965f6aac919c804405872ea94f4","observation_id":"33cec9db-d465-4d46-82bc-07df8f834c4e","resolution":{"observed_at":"2026-08-15T20:58:10.272857Z","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-15T20:58:10.263959Z","title":"Malkov and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.263959Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:f2dcc2110620db50f20e19d3f2cbdf544d86f46531948b7b9b90bcfe3770ecd7","observation_id":"9c05ca56-f68a-4d5f-af9b-622001d71ccf","resolution":{"observed_at":"2026-08-15T20:58:10.263959Z","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-15T20:58:10.291052Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.291052Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:621da2adfd7487ac839869288bff0d21723eedd870046781d6b6cc6273905561","observation_id":"d19b94e1-cb8f-496a-a37a-40e02ff75beb","resolution":{"observed_at":"2026-08-15T20:58:10.291052Z","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-15T20:58:10.687610Z","title":null,"venue":null,"work_id":"6b2f0747-2008-463a-a23a-d61c13608403","year":2019},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.296261Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:f8ca433074f04a888fc19ba5e7dc35c70456dcb655bd78bee5cf0a7d90d594f4","observation_id":"fd5c8839-3411-4a3a-a114-2a96a67396e1","resolution":{"observed_at":"2026-08-15T20:58:10.694538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-15T20:58:10.301227Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.301227Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:7448dd50257718884afe1bff44b812f9ac37b70117464c1b8c156bbf71514321","observation_id":"ff4a2402-f90a-4ef4-956f-0d724512cf8d","resolution":{"observed_at":"2026-08-15T20:58:10.301227Z","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-15T20:58:10.713103Z","title":null,"venue":null,"work_id":"232f67e5-5157-4403-8a24-9b3844bf80bb","year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.282540Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:d20a8d49e41b336f23849b783d9e1fb423ca9127e6770280b9f4c8cdf8feed2e","observation_id":"2f4b5a17-e754-4669-a765-522d8ccc66df","resolution":{"observed_at":"2026-08-15T20:58:10.717963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T20:58:10.286776Z","title":"In Proceedings of the 18th ACM Conference on Recommender Systems (Bari, Italy) (RecSys ’24)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.286776Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:1d065364611ca2a1ec141d00db2272f75f66fa7b7e441e5f65d5d72a32a23585","observation_id":"d4ed147a-4f67-41c7-a8d4-5adf7e24f43e","resolution":{"observed_at":"2026-08-15T20:58:10.286776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01776","last_updated":"2025-05-20T02:32:33Z","snapshot_observed_at":"2026-08-18T17:14:36.293568Z","submitted_at":"2025-03-03T17:59:48Z","title":"Beyond Matryoshka: Revisiting Sparse Coding for Adaptive Representation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01776","snapshot_observed_at":"2026-08-15T20:58:10.321240Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.321240Z"},"links":{"cited_paper":"/paper/2503.01776","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:6a94450fc08063c9af4706b81349c06a2704c76b7fe3c6830ae403fe47729588","observation_id":"73c192f0-0f11-443b-b03b-f39f6cb76c4f","resolution":{"observed_at":"2026-08-15T20:58:10.321240Z","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-15T20:58:10.673652Z","title":null,"venue":null,"work_id":"6ca95b3a-08d6-4f06-ac8a-ebe9932fe281","year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.305815Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:5383796194e5f0f2d0b9134267793432aa683c30f736aa6d88cb5e8caf8889b7","observation_id":"7ece7991-e31c-4c27-9cc2-7026fbbd4d65","resolution":{"observed_at":"2026-08-15T20:58:10.677752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T20:58:10.660606Z","title":"Transformer Circuits Thread","venue":null,"work_id":"f79282bf-1acd-43ad-a2c4-4fb788ea1f99","year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.310506Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:e7ce21a2464b4d0a2ce07490e1e3926a5a5e9337966bfcf15de4fef2bc49fbe5","observation_id":"5e342e9a-199a-4818-958c-da32325e4238","resolution":{"observed_at":"2026-08-15T20:58:10.664821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T20:58:10.316555Z","title":"Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, Stéfan J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.316555Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:49fc595b352750dc0afa8905bfbf12b6622eb244121854648b2ed1641c98a9bd","observation_id":"dd079e8e-5605-4819-9a1f-d2faf2a4c7c0","resolution":{"observed_at":"2026-08-15T20:58:10.316555Z","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-15T20:58:10.268359Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":836,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.268359Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:211d3e70d31ac83a83082a939cb89e5cc8b97264453d25644081c607b69a4dd1","observation_id":"db1b4dcf-444d-4925-9587-4128d62ed2a7","resolution":{"observed_at":"2026-08-15T20:58:10.268359Z","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-15T20:58:10.206306Z","title":"Transformer Circuits Thread 2 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.206306Z"},"links":{"citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:f512159e1b8d04520bbce65bc70d8edaa45bd3143cc4e9cf926db6375c100091","observation_id":"fa567485-7b91-424b-bc62-b1d7c672918e","resolution":{"observed_at":"2026-08-15T20:58:10.206306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01613","last_updated":"2025-02-03T22:26:56Z","snapshot_observed_at":"2026-08-21T03:10:22.262998Z","submitted_at":"2024-02-02T18:23:18Z","title":"Nomic Embed: Training a Reproducible Long Context Text Embedder","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01613","snapshot_observed_at":"2026-08-15T20:58:10.277293Z","title":"arXiv:2402.01613 [cs.CL]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T20:58:10.277293Z"},"links":{"cited_paper":"/paper/2402.01613","citing_paper":"/paper/2505.11388"},"observation_digest":"sha256:b89429ad9d9a0a9fe5739e9179d93ee8088aabac1a85f52e41014d23f125f2de","observation_id":"e8bbeb9a-4ebb-457d-a889-6b3de7588d6b","resolution":{"observed_at":"2026-08-15T20:58:10.277293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.11388","last_updated":"2025-05-16T15:51:52Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-17T00:00:27.484167Z","submitted_at":"2025-05-16T15:51:52Z","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":27},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.11388."}