{"as_of":"2026-08-09T07:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3923e53858d85b542c827d8ff00592f86cc1b44c64ed5bc20ce18e17ef51fd16","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:56:55.712151Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T14:43:54.176152Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.09425","snapshot_observed_at":"2026-08-07T22:56:55.712151Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09027","last_updated":"2025-02-22T02:06:55Z","snapshot_observed_at":"2026-08-09T06:46:06.275104Z","submitted_at":"2025-02-13T07:31:34Z","title":"A Contextual-Aware Position Encoding for Sequential Recommendation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T22:56:55.712151Z"},"links":{"cited_paper":"/paper/2411.09425","citing_paper":"/paper/2502.09027"},"observation_digest":"sha256:f5e1103e7d32d907b9bcb52c69a365998998ed1e7f6db0d538f19f26b7c445b6","observation_id":"ad7ab98b-240d-4f33-be96-515d4177c09c","resolution":{"observed_at":"2026-08-07T22:56:55.712151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.09425","snapshot_observed_at":"2026-08-07T20:15:14.083904Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.083904Z"},"links":{"cited_paper":"/paper/2411.09425","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:67f5f1058925ebb8844af265d7ee1f5b060b37cecdc861b26e88809b8c86a12d","observation_id":"8d1f36a4-03dc-4651-952c-3f1473387bbd","resolution":{"observed_at":"2026-08-07T20:15:14.083904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","version":3},"cited_work":{"arxiv_id":"2411.09425","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.09425","snapshot_observed_at":"2026-08-06T14:43:54.176152Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","venue":"cs.IR","work_id":"7773f54c-688e-4046-87e8-b9b6fbeae23e","year":2024},"citing_paper":{"arxiv_id":"2508.05640","last_updated":"2025-08-14T23:38:08Z","snapshot_observed_at":"2026-08-09T06:45:44.249223Z","submitted_at":"2025-07-24T05:56:55Z","title":"Request-Only Optimization for Recommendation Systems","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T14:43:53.824996Z"},"links":{"cited_paper":"/paper/2411.09425","citing_paper":"/paper/2508.05640"},"observation_digest":"sha256:b86e727847e26f2f501e366c567d4099b150922f62bb324094005051f899c88f","observation_id":"c180bad2-4d15-45f4-92b2-f439b5a29df0","resolution":{"observed_at":"2026-08-06T14:43:54.180087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.09425","snapshot_observed_at":"2026-08-02T23:49:56.351551Z","title":"MARM:UnlockingtheFu- ture of Recommendation Systems through Memory Augmentation and Scalable Complexity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12564","last_updated":"2026-07-22T08:22:17Z","snapshot_observed_at":"2026-08-09T06:44:42.491763Z","submitted_at":"2026-02-13T03:23:12Z","title":"CAPTS: Channel-Aware, Preference-Aligned Trigger Selection for Multi-Channel Item-to-Item Retrieval","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T23:49:56.351551Z"},"links":{"cited_paper":"/paper/2411.09425","citing_paper":"/paper/2602.12564"},"observation_digest":"sha256:e7d58920dff4dfc4922ea386e88b52b014e5af8f6c683227050c3feaf9178a3a","observation_id":"362eaa7b-751a-406a-a330-d38e29695d36","resolution":{"observed_at":"2026-08-02T23:49:56.351551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.09425/citation-record","integrity":"/paper/2411.09425/integrity","json":"/paper/2411.09425/citation-record.json","paper":"/paper/2411.09425"},"outbound":[],"paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2411.09425."}