{"as_of":"2026-08-19T22:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad0114785e8e8a5496e347fbd8b7d9d90b0ca3fe3259b13e040692ddbb8cb3c0","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:46:43.606377Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"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/2412.17245/citation-record","integrity":"/paper/2412.17245/integrity","json":"/paper/2412.17245/citation-record.json","paper":"/paper/2412.17245"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:46:44.614595Z","title":null,"venue":null,"work_id":"7e123a31-0b44-4355-89b6-31e63260de97","year":2016},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.346765Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:a641386609b33994ec5060cc908e5f6f79bb3de1a42f983cde7dff29adfa4270","observation_id":"ebdacd8c-4b8c-4a76-8f2c-c99fac8edcb2","resolution":{"observed_at":"2026-08-11T05:46:44.619385Z","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-11T05:46:44.600781Z","title":"C., and Lang, K","venue":null,"work_id":"60a95c96-c63c-404c-85bc-c02f24f85594","year":2006},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.351895Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:33d745c5053260bb1459220c404ea9431e1da64d842c5f03b4fce95ae906ac9d","observation_id":"3392f2e0-b604-425b-b53a-acec3abbc161","resolution":{"observed_at":"2026-08-11T05:46:44.605392Z","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":{"arxiv_id":"1505.03014","last_updated":"2015-05-12T14:11:58Z","snapshot_observed_at":"2026-08-18T04:53:08.874609Z","submitted_at":"2015-05-12T14:11:58Z","title":"Frappe: Understanding the Usage and Perception of Mobile App Recommendations In-The-Wild","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03014","snapshot_observed_at":"2026-08-11T05:46:43.357043Z","title":"Frappe: Under- standing the usage and perception of mobile app recommendations in-the-wild","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.357043Z"},"links":{"cited_paper":"/paper/1505.03014","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:00194d0e9a304359ac2cb72c96a76d747faad71c6dd5c075a31d2bc294ff8e66","observation_id":"f2dc06c6-06c9-4617-920b-d4eaf424d5a7","resolution":{"observed_at":"2026-08-11T05:46:43.357043Z","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-11T05:46:44.586948Z","title":null,"venue":null,"work_id":"206fdff1-45ad-4457-9f74-8091824b4781","year":2007},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.362529Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:f30bdc01d8f9268eb811f0f21e0b67a7e1a484c102fb957bf94a2bec803f0555","observation_id":"efbd077a-c900-4aba-a914-4b3fc626150a","resolution":{"observed_at":"2026-08-11T05:46:44.591152Z","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-11T05:46:44.573525Z","title":"D., Guillaume, J.-L., Lambiotte, R., and Lefebvre, E.Fast unfolding of communities in large networks","venue":null,"work_id":"709d1c48-e711-47e4-9c69-176d8f81fbb7","year":2008},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.367321Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:605f0785058068e39bcb78a013e373ab373403c1680a814bea6bdaac05dd4496","observation_id":"5310ccf3-d343-4975-8b7d-a69b136a7fca","resolution":{"observed_at":"2026-08-11T05:46:44.577812Z","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-11T05:46:44.559356Z","title":"Recommender systems survey","venue":null,"work_id":"aa80ed7a-8b4b-404f-a665-92c978c9b3ec","year":2013},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.371958Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:fbbdd63c8a7192478c6341fdae0d86291f8fb2bb741a3df1478d49d483e03169","observation_id":"b7eff39c-9ca3-4e0c-b9fc-d59a737156f3","resolution":{"observed_at":"2026-08-11T05:46:44.564164Z","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-11T05:46:44.543313Z","title":"Scikit-network: Graph analysis in python","venue":null,"work_id":"b4e193f9-c108-4887-b1d5-045cd5670670","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.377099Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:4023112573f8ddab5fc23603bc06194a7e8451f720ee359c361a6d7983e7c721","observation_id":"a8dc7e1d-75c9-4153-a116-1cb58dc35c3c","resolution":{"observed_at":"2026-08-11T05:46:44.548101Z","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":{"arxiv_id":"physics/0608255","last_updated":"2006-08-30T09:49:23Z","snapshot_observed_at":"2026-08-15T11:05:12.632381Z","submitted_at":"2006-08-25T16:46:12Z","title":"Maximizing Modularity is hard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0608255","snapshot_observed_at":"2026-08-11T05:46:43.381499Z","title":"ArXiv physics/0608255 (2006)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.381499Z"},"links":{"cited_paper":"/paper/physics/0608255","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:d4e8a4d4a6b90c6faca19ef0bbfcf5ea601f87255698d01ecc8d4f3895a7ba7e","observation_id":"7c691cf1-eea6-45dd-bed9-84f4fa0ba3d2","resolution":{"observed_at":"2026-08-11T05:46:43.381499Z","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-11T05:46:44.528188Z","title":"B., Anderson, G., Corrado, G","venue":null,"work_id":"94dff3bd-41a9-420a-be41-0ea52ce18a4b","year":2016},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.386334Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:b62de6c85637acad008b8deaa71c3a18c4f4b3bf912aa8c8970575ae2dae87bb","observation_id":"c46b1a26-2352-4a05-aa67-1f5b0c5a39de","resolution":{"observed_at":"2026-08-11T05:46:44.533605Z","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-11T05:46:44.513157Z","title":"Adaptive factorization network: Learning adaptive-order feature interactions","venue":null,"work_id":"debba01c-be37-4d49-9072-c7f805f36730","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.390915Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:f8e5eb35519d24bdded5159003f6a2fa2526dd3296e42227c6f9653b026f2165","observation_id":"29b16d6c-40e9-4003-9c2c-dd66a14dc855","resolution":{"observed_at":"2026-08-11T05:46:44.517918Z","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-11T05:46:44.498065Z","title":"A., and Leskovec, J","venue":null,"work_id":"ccc2288d-c39f-49e1-ad5a-555b86612456","year":2011},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.395413Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:f6699b72212150ab358f61131552887d3e661019f296bd7bf17c383a884e067c","observation_id":"f644082a-e9da-4f2e-8412-40bdb1c9fb7e","resolution":{"observed_at":"2026-08-11T05:46:44.503275Z","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-11T05:46:44.484545Z","title":"H., and Cheng, D","venue":null,"work_id":"669ee6ac-4f1a-4736-88a5-c8c6e743188f","year":2023},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.399838Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:e1ec97f58df07851c14568db632bdd8460445e94cb278fec80cd1229d184dec7","observation_id":"407076e8-5786-44fc-b6b8-aeb82e72f89a","resolution":{"observed_at":"2026-08-11T05:46:44.488671Z","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-11T05:46:44.469685Z","title":"N., and Barahona, M","venue":null,"work_id":"b1da3fba-8b58-40ef-95ff-2f4b9c6fb65f","year":2008},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.403820Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:ad63267443fb2d4dc445c48903f3466fb873d0bce52b60a2df06273532ce087c","observation_id":"4952e827-5f89-4efb-b071-ff1b64cab7a6","resolution":{"observed_at":"2026-08-11T05:46:44.474955Z","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-11T05:46:44.453995Z","title":null,"venue":null,"work_id":"b69ea013-7961-4ca3-afe4-506b8e8046dd","year":2001},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.407886Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:83eda4b6be7e731a757e0e9a4b2cf53938844103e788904c2c067bd9fb787c88","observation_id":"d9d47959-cd35-45c7-b505-80489f718e17","resolution":{"observed_at":"2026-08-11T05:46:44.458848Z","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":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-08-16T12:38:40.131901Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-08-11T05:46:43.412341Z","title":"From local to global: A graph rag approach to query-focused summarization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.412341Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:8f9d20460eca95c7b80a04a628b6ece1c12d90b2986abce32d18d97d95b731a7","observation_id":"406fbb75-555a-41e5-96bd-b58665c5ddf6","resolution":{"observed_at":"2026-08-11T05:46:43.412341Z","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-11T05:46:44.439019Z","title":"E., Weichert, F., and Leskovec, J","venue":null,"work_id":"a2bfed69-c57d-4820-820d-d759ac1c0057","year":2021},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.416794Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:37de61cd17c814cd0cfce56a91aeab4778514634fe0aa2de0a4fbd93702c07f9","observation_id":"b36f7eb7-1b26-40a3-a1b3-91c43c262953","resolution":{"observed_at":"2026-08-11T05:46:44.443997Z","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-11T05:46:44.423133Z","title":"A survey of graph neural networks for recommender systems: Challenges, methods, and directions","venue":null,"work_id":"0656479a-23d7-456a-8aa7-65783cebb176","year":2021},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.421388Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:e58a67703188d50c52352d59e1309d2249c83cc0231d0b82d75f4fcf66e635e4","observation_id":"c3e4d9e7-35a9-402f-b882-7f5180048fc3","resolution":{"observed_at":"2026-08-11T05:46:44.428675Z","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-11T05:46:44.408026Z","title":"Learning image and user features for recommendation in social networks","venue":null,"work_id":"bc8ac4b5-7bd8-4473-bb0f-1790fdd7edd4","year":2015},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.425779Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:f6e7822e6f536c7a22fbe709f7deb852b232af4bf59b54f4610825d0250b8828","observation_id":"c60157d1-46b0-4e2b-8a62-fd7cf24e0eb2","resolution":{"observed_at":"2026-08-11T05:46:44.413214Z","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":{"arxiv_id":"2203.15837","last_updated":"2022-03-28T06:07:30Z","snapshot_observed_at":"2026-08-16T17:11:24.335698Z","submitted_at":"2022-03-28T06:07:30Z","title":"Learning to Collide: Recommendation System Model Compression with Learned Hash Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15837","snapshot_observed_at":"2026-08-11T05:46:43.430439Z","title":"Learning to collide: Recommendation system model compression with learned hash functions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.430439Z"},"links":{"cited_paper":"/paper/2203.15837","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:32e5bf0b1a5109e7017b836b2684e3dff8c6d94d6be889653105b3cd97a73e37","observation_id":"28167539-f7ab-41e4-a95c-3f9bfcef8e9b","resolution":{"observed_at":"2026-08-11T05:46:43.430439Z","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-11T05:46:44.393876Z","title":"S., Riley, P","venue":null,"work_id":"bc34c7e8-2abc-479e-b261-66af1f2dde8f","year":2017},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.436268Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:9763329ecb806ece75ec2c5887a411c0765e9a706b2c254376abfb6825ba894e","observation_id":"710cb5da-b6f3-4e4d-9fdc-e17be89e108e","resolution":{"observed_at":"2026-08-11T05:46:44.398024Z","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":{"arxiv_id":"1703.04247","last_updated":"2017-03-13T04:55:19Z","snapshot_observed_at":"2026-08-14T23:30:22.779192Z","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04247","snapshot_observed_at":"2026-08-11T05:46:43.440761Z","title":"Deepfm: A factorization-machine based neural network for ctr prediction","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.440761Z"},"links":{"cited_paper":"/paper/1703.04247","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:5fc096083bbcd29a597f035c7c33e839a812d63524d3c151f21aa9bc63cbb202","observation_id":"29fb04f7-f125-4d64-95c3-8a7daff6576a","resolution":{"observed_at":"2026-08-11T05:46:43.440761Z","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-11T05:46:44.380579Z","title":"V., Shah, N., and Zhao, T","venue":null,"work_id":"10871194-2f18-483a-9bed-66c23a253c7a","year":2023},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.445518Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:93ed900a8dcf2f20fc5eeb35cdc08d301325f20884a617f0bb001c6a0d56d301","observation_id":"43cc0795-2af8-4fb6-b8e5-6cb84edea3f9","resolution":{"observed_at":"2026-08-11T05:46:44.385241Z","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-11T05:46:44.365358Z","title":"M., Cot- tel, B., Hazelwood, K","venue":null,"work_id":"a04b28f1-f052-41f0-aff0-d4f829bd76f0","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.450223Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:507bed60b93d8abb8eb6287f8f85de19e3a70ad6438f92008bc52c0184e15cbd","observation_id":"1117e3d4-e718-471e-8321-342ccdf51c51","resolution":{"observed_at":"2026-08-11T05:46:44.370142Z","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":{"arxiv_id":"2210.00102","last_updated":"2023-04-08T05:54:15Z","snapshot_observed_at":"2026-08-17T03:23:40.870682Z","submitted_at":"2022-09-30T21:33:51Z","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00102","snapshot_observed_at":"2026-08-11T05:46:43.454778Z","title":"Mlpinit: Embarrassingly simple gnn training acceleration with mlp initialization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.454778Z"},"links":{"cited_paper":"/paper/2210.00102","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:8e0722d7e8177cab17e516afd62681d47070c511415cc463b58c22e6af642d28","observation_id":"645e76e7-1e24-4b45-a95d-62765a91f77a","resolution":{"observed_at":"2026-08-11T05:46:43.454778Z","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-11T05:46:44.350280Z","title":"M., Konstan, J","venue":null,"work_id":"956b84c2-a70b-459b-9cbc-8cdd187c249d","year":2016},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.459570Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:d2d82aba1932f58b78f2c1c3ad03127c901abbd363ac0540a92b1c8cf492d0e2","observation_id":"f425effe-dabd-4e94-9f68-6a39f161e9d9","resolution":{"observed_at":"2026-08-11T05:46:44.355101Z","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-11T05:46:44.335329Z","title":"In WWW (2016)","venue":null,"work_id":"d90071c8-2d68-4f34-967e-93a38df97450","year":2016},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.464833Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:b4bc077a324b9a8fae8ea252de8d5315a031282842986e1581e52b11c24a5dac","observation_id":"c8975f83-67b7-4d07-8bad-de22fbfd26ef","resolution":{"observed_at":"2026-08-11T05:46:44.340105Z","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-11T05:46:44.320030Z","title":"In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval (2020)","venue":null,"work_id":"d8664c41-4d14-4439-997d-d5bccd193a36","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.469432Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:5249879cd06d76759e4b08ada47514d465e2d7b82d0c21eb253c1b191ed5bdb4","observation_id":"4c2163fa-ed26-4c8a-837d-b28de5f299ad","resolution":{"observed_at":"2026-08-11T05:46:44.325295Z","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-11T05:46:44.306460Z","title":"Neural collaborative filtering, 2017","venue":null,"work_id":"12dcf2ed-59f9-4367-a350-de446a4854eb","year":2017},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.474372Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:2bedef19997a2fd814d4f015b4549bfc13ef3be21824a4809f04a753a40040cb","observation_id":"560b5ac4-a3c2-4503-a06a-8fe86c35bff9","resolution":{"observed_at":"2026-08-11T05:46:44.310720Z","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-11T05:46:44.290969Z","title":"Collaborative filtering for implicit feedback datasets","venue":null,"work_id":"23c15ee2-7f00-4678-91ab-c735acf76993","year":2008},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.478575Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:cec1be4147ecb6b255bdd963e90b98f043a65c0f3277d7f0236934a67967d8ef","observation_id":"8b75bc63-e262-46ce-bcb5-20cbb2a577d9","resolution":{"observed_at":"2026-08-11T05:46:44.295947Z","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-11T05:46:44.274973Z","title":"How does message passing improve collaborative filtering? In NeurIPS (2024)","venue":null,"work_id":"cf6f2f5d-4ad7-4e57-b37c-0fe693c4d271","year":2024},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.482938Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:0f1a9515521143316fd473309df8bed5c90d067851717ac72a2d6782dfa5e232","observation_id":"82730bcc-ea4e-4089-b0d6-c9bf652d6d2e","resolution":{"observed_at":"2026-08-11T05:46:44.280885Z","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-11T05:46:44.258989Z","title":"Z., Y ao, T., Yi, X., Chen, T.-L., Hong, L., and Chi, E","venue":null,"work_id":"cb249bac-2b96-4f8f-aefe-3f5569a6628d","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.486989Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:7747089a5d433cfcfde4e85b9e1611c60d11dcf974aecce448b68fab1446ccaa","observation_id":"6c4da2a1-821d-4bda-8d62-37c276f5a4ae","resolution":{"observed_at":"2026-08-11T05:46:44.264111Z","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":{"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-11T05:46:43.490851Z","title":"P., and Ba, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.490851Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:3ccf4e1f8811928753cee2729c5e1b8a6acc01d09d23195cc98d0eb10e808686","observation_id":"4a1012e1-0904-4cbe-bc1e-0f2b8909319c","resolution":{"observed_at":"2026-08-11T05:46:43.490851Z","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-11T05:46:44.244702Z","title":"N., and Welling, M","venue":null,"work_id":"0c290784-41bb-473e-832f-48b79cb81c03","year":2017},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.495140Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:6747bcad44e6ed792cb3629a83d84edd0ab8f8437cf2649b962df9b3820036bc","observation_id":"0a152515-13eb-4ae7-873f-cc609b7fe906","resolution":{"observed_at":"2026-08-11T05:46:44.249253Z","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-11T05:46:44.229268Z","title":"M., and Volinsky, C","venue":null,"work_id":"715d55a6-a7f4-4b8e-967b-a247b80c50cc","year":2009},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.499499Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:e0fba5edd971ce47c10c1be489403eef24ab1fd9c56e39405a848e33d470efa5","observation_id":"cdb874a7-8f29-41c4-af47-aa29f4beced5","resolution":{"observed_at":"2026-08-11T05:46:44.234162Z","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":{"arxiv_id":"0812.1770","last_updated":"2009-10-09T13:35:32Z","snapshot_observed_at":"2026-08-15T05:59:42.887472Z","submitted_at":"2008-12-09T18:48:21Z","title":"Laplacian Dynamics and Multiscale Modular Structure in Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0812.1770","snapshot_observed_at":"2026-08-11T05:46:43.504790Z","title":"Laplacian dynamics and multiscale modular structure in networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.504790Z"},"links":{"cited_paper":"/paper/0812.1770","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:5b37bb15087c20ab45bbd618b03295b98661c4ac3c40d0c3c0ba5b0466f43ee6","observation_id":"d8de7bfd-e3d4-4684-9210-4066e77b67a8","resolution":{"observed_at":"2026-08-11T05:46:43.504790Z","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-11T05:46:44.214254Z","title":"In SIGIR (2024)","venue":null,"work_id":"e932c2e2-bc3d-456c-a303-f198c8046e90","year":2024},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.509828Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:bc2ff928c893468b20df59c9ebac36b1d3e1d89332d22a9e82c9aa769c494822","observation_id":"4e393e03-5383-4f7e-9985-99d4e1ad4627","resolution":{"observed_at":"2026-08-11T05:46:44.219237Z","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-11T05:46:44.099061Z","title":"ArXiv (2022)","venue":null,"work_id":"1c3234f1-bee2-4266-9b8c-2d9862f13f33","year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.514447Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:7839cdc82179188ccc5ea9d37d31b0c7e30201b515feeedc21299b9beb19b6dc","observation_id":"c2dcf0cd-c7d4-4771-af63-7f9e37cfde3f","resolution":{"observed_at":"2026-08-11T05:46:44.103532Z","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":{"arxiv_id":"2003.09518","last_updated":"2020-08-18T06:22:42Z","snapshot_observed_at":"2026-08-13T14:41:09.892477Z","submitted_at":"2020-03-20T22:18:35Z","title":"Deep Learning Training in Facebook Data Centers: Design of Scale-up and Scale-out Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.09518","snapshot_observed_at":"2026-08-11T05:46:43.519106Z","title":"Deep learning training in facebook data centers: Design of scale-up and scale-out systems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.519106Z"},"links":{"cited_paper":"/paper/2003.09518","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:febe3dd72790f7488b590efcd39b194bc63d0beff58a359c537bab0be763a5d9","observation_id":"6e9d85f5-e85c-466c-bfcd-99844b334235","resolution":{"observed_at":"2026-08-11T05:46:43.519106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00091","last_updated":"2019-05-31T21:51:16Z","snapshot_observed_at":"2026-08-14T16:22:46.075072Z","submitted_at":"2019-05-31T21:51:16Z","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00091","snapshot_observed_at":"2026-08-11T05:46:43.523899Z","title":"M., Huang, J., Sundaraman, N., Park, J., Wang, X., Gupta, U., Wu, C., Azzolini, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.523899Z"},"links":{"cited_paper":"/paper/1906.00091","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:dda73ab3098d698f7f7784f615fae2d4fce967f3ccc239ee4aaad004db3682bc","observation_id":"9ab22b6b-c5d5-4292-84ba-b7318c71debf","resolution":{"observed_at":"2026-08-11T05:46:43.523899Z","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-11T05:46:44.083401Z","title":null,"venue":null,"work_id":"0365ddab-6ba6-4ddb-b104-f642963f2f92","year":2006},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.528297Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:8d33d927728e84eed5aeb9b4d462b90172e86e6148c06f600902ed51442c04fe","observation_id":"4eddc645-9f5f-4bcb-80d4-29487f06c566","resolution":{"observed_at":"2026-08-11T05:46:44.088675Z","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-11T05:46:44.068461Z","title":"I., and Weiss, Y","venue":null,"work_id":"c6cf208d-17c9-4fe0-b546-5565f08f8193","year":2001},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.532602Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:952372e1cb6753c34fff08a69325f9d11eea894bd7c1499cdd7c59ca6bbeba1d","observation_id":"87cdb713-1a25-42ab-8f67-8505373cbf9a","resolution":{"observed_at":"2026-08-11T05:46:44.073072Z","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-11T05:46:44.052181Z","title":"Graph neural networks exponentially lose expressive power for node classification","venue":null,"work_id":"2aeb9f0d-4d5a-4147-b195-7f7a1340a272","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.536902Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:fb61f7288749c8451019df28c0a1aa172d4747f8ecf98578b0a52f12617f5d90","observation_id":"8707ba64-8966-4466-99b4-cb5e7e0dd119","resolution":{"observed_at":"2026-08-11T05:46:44.057581Z","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-11T05:46:44.036742Z","title":"Bpr: Bayesian personalized ranking from implicit feedback","venue":null,"work_id":"257ebfad-d5fb-40bd-b360-8a93e2e4f376","year":2009},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.541287Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:13a867795410870b572b02d6f580c0acc42dd955a3e113764d0804f11157b157","observation_id":"d3a2c1c7-0fd7-4e37-89f6-208b45acea33","resolution":{"observed_at":"2026-08-11T05:46:44.042066Z","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-11T05:46:44.021535Z","title":"T.Maps of random walks on complex networks reveal community structure","venue":null,"work_id":"5dd9e524-2a26-4139-b1d9-f0e23e25c53f","year":2007},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.545874Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:14567443774d02ccc87869ba9f02938b87a5ed414cf42162f574337678a0eaaa","observation_id":"318f463c-88d9-43d1-b742-891226b4a76e","resolution":{"observed_at":"2026-08-11T05:46:44.026698Z","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":{"arxiv_id":"2403.18280","last_updated":"2024-03-27T06:16:14Z","snapshot_observed_at":"2026-08-17T05:57:43.177793Z","submitted_at":"2024-03-27T06:16:14Z","title":"Improving Out-of-Vocabulary Handling in Recommendation Systems","version":1},"cited_work":{"arxiv_id":"2403.18280","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.18280","snapshot_observed_at":"2026-08-11T05:46:43.644358Z","title":"Improving Out-of-Vocabulary Handling in Recommendation Systems","venue":"cs.IR","work_id":"c3fbd47a-710f-44fe-ab7d-01070841ad5c","year":2024},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.550499Z"},"links":{"cited_paper":"/paper/2403.18280","citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:078b063183cfbf36302f4303cd5537472eda423ece5d3694b65b2f66ed014548","observation_id":"ce7b365a-ae15-4597-8bc7-e73a0d226ffa","resolution":{"observed_at":"2026-08-11T05:46:43.651988Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-11T05:46:44.005287Z","title":"Graph attention networks","venue":null,"work_id":"12cc63ee-0406-4911-b8b3-75d88b4d3c94","year":2018},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.554920Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:b037a0e1c45206b436d3cca5cd5a856f319adbad2df0bccbcc8331409cbf89c3","observation_id":"08109aa2-174b-4b7f-b1b3-fb9bff7f4690","resolution":{"observed_at":"2026-08-11T05:46:44.010625Z","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-11T05:46:43.990871Z","title":"Towards representation alignment and uniformity in collaborative filtering","venue":null,"work_id":"7f9a21d2-021a-4c88-a9f7-a24399c53e6b","year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.558788Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:32f91e8373aa9ae5a488ea2ff84f7432f311333aab48f2c51c87c142a1e7d6c9","observation_id":"99a043b3-ad58-44ec-aa6c-804ffa1b2bf4","resolution":{"observed_at":"2026-08-11T05:46:43.995857Z","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-11T05:46:43.973407Z","title":"Z., Jain, S., Lin, D., Hong, L., and Chi, E","venue":null,"work_id":"f6566b61-5437-4593-829f-fc3eeff9912f","year":2021},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.562872Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:9a1afee74a602bee455373aeced920e493b1295493b32078493e9cde3e84e33c","observation_id":"86b330a7-beeb-45fb-a892-fb062251a68b","resolution":{"observed_at":"2026-08-11T05:46:43.978405Z","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-11T05:46:43.956430Z","title":"In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval (2019)","venue":null,"work_id":"8f7f6de0-091e-4d7c-9902-76a23dda5548","year":2019},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.567259Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:04fb521beb59ee8813b396d099924ef3ee77a95e59b1bc63c47052f295bc099f","observation_id":"dbc80dbc-4d6d-4129-81e1-4f7018fe0b8e","resolution":{"observed_at":"2026-08-11T05:46:43.961871Z","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-11T05:46:43.941396Z","title":"Q., Dasgupta, A., Attenberg, J., Langford, J., and Smola, A","venue":null,"work_id":"79736f2f-aa9a-46a1-aece-bad846986405","year":2009},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.571323Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:4a2251281e6c300b0bd710f32cd60094c886679d0fd500c995dc5eae209b30f4","observation_id":"9ff157f4-9566-416a-b274-535a17e8ef98","resolution":{"observed_at":"2026-08-11T05:46:43.945956Z","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-11T05:46:43.925481Z","title":"Demystifying oversmoothing in attention-based graph neural networks","venue":null,"work_id":"974af64c-c751-4241-9348-fcb7c969bcac","year":2023},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.575614Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:451cc3f5feed2369aed337d5d0b460db873fcffd49186670eff65cc7a949735b","observation_id":"b0506ccb-f6f4-41a6-b122-5e7422763f22","resolution":{"observed_at":"2026-08-11T05:46:43.930582Z","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-11T05:46:43.910125Z","title":"In ICLR (2023)","venue":null,"work_id":"28b96d07-8ba8-449f-a5f8-1a54028e81e8","year":2023},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.579922Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:1674f8d2baf45049fed5f06a9315dc7ede7e0851464c7f61e02a6e33bb9dc594","observation_id":"39dffac3-e552-4c8c-a90f-415106ba800e","resolution":{"observed_at":"2026-08-11T05:46:43.915329Z","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-11T05:46:43.891456Z","title":"In 2022 IEEE International Conference on Data Mining (ICDM) (2022), pp","venue":null,"work_id":"458d08f5-591c-4dfb-8923-8e924945c255","year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.584271Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:6ed5cf65fde3037ca1c9e6d811d2c319a0b16b7f50d919e17c4bb21dcf0f572a","observation_id":"ce99f6ee-48e8-4b4c-a3f3-c42b0e9643b7","resolution":{"observed_at":"2026-08-11T05:46:43.897578Z","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-11T05:46:43.875063Z","title":"How powerful are graph neural networks? In ICLR (2019)","venue":null,"work_id":"d343ffc4-32b4-4b1a-8045-6e654dbe7880","year":2019},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.588711Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:227f4a67dbc9edf08c0bc3bcd5aa7a770957ee0b968acb24d808de26ea257c59","observation_id":"53c512af-f16d-4c3b-9b7d-f9818b565868","resolution":{"observed_at":"2026-08-11T05:46:43.879720Z","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-11T05:46:43.861291Z","title":"I., Tejani, A., Gupta, A., Myana, P","venue":null,"work_id":"82b0f70f-d37e-46f4-85f9-ac3c37c2f783","year":2020},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.593130Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:544bd36bb37d65a5cbde056ea3a251970cd720a4623456efd81466318e439b31","observation_id":"246be617-76ef-49f0-861b-4b4602b16b7c","resolution":{"observed_at":"2026-08-11T05:46:43.865306Z","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-11T05:46:43.847066Z","title":"Graph-less neural networks: Teach- ing old mlps new tricks via distillation","venue":null,"work_id":"da3b19e7-4345-4fae-920b-efbaaca8f0aa","year":2022},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.597563Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:cb9331b3988060f04de6f6bf266e5a0f0c1f5ae6c397a56334d44a1b8da61bdc","observation_id":"7c79bcce-0ad8-4c4c-b064-48e2035e162b","resolution":{"observed_at":"2026-08-11T05:46:43.851780Z","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-11T05:46:43.831575Z","title":"Deep learning based recommender system: A survey and new perspectives","venue":null,"work_id":"6599ed24-4eac-4cfa-a361-aa6c213faf05","year":2019},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.602109Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:0db125b578487cb73d97391a59f250b3e6f6d2a05b6a0f62e5e6ce9903566812","observation_id":"ff050a8a-5ff7-4cd6-a93b-f9042a1f0535","resolution":{"observed_at":"2026-08-11T05:46:43.836562Z","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-11T05:46:43.815197Z","title":"Learning from graphs beyond message passing neural networks","venue":null,"work_id":"225abd35-13b2-45f1-bbc1-0d1608d76a6e","year":2024},"citing_paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T05:46:43.606377Z"},"links":{"citing_paper":"/paper/2412.17245"},"observation_digest":"sha256:156096e210ad5c6fbd686a323f7a3239c6c355bd99e6881cc8e072300690119d","observation_id":"f33328aa-6a48-46fe-abf7-55286f27f59e","resolution":{"observed_at":"2026-08-11T05:46:43.820400Z","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"}}],"paper":{"arxiv_id":"2412.17245","last_updated":"2025-02-08T05:54:48Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-18T17:20:53.819896Z","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":58},"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 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2412.17245."}