{"as_of":"2026-08-08T13:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f1feb6d7dabdece2f443ac900b6eafc04d3176ff860861f4ae834194e3a4b6f","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:24:33.508442Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:06:06.809058Z","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-06T19:06:08.680505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"cited_work":{"arxiv_id":"2505.19020","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.19020","snapshot_observed_at":"2026-08-06T19:06:08.680505Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","venue":"cs.IR","work_id":"a6b3d034-7130-4390-90cc-b9c6c1979c32","year":2025},"citing_paper":{"arxiv_id":"2507.06507","last_updated":"2025-07-14T07:46:11Z","snapshot_observed_at":"2026-08-08T04:13:41.618907Z","submitted_at":"2025-07-09T03:13:08Z","title":"GR-LLMs: Recent Advances in Generative Recommendation Based on Large Language Models","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-06T19:06:06.809058Z"},"links":{"cited_paper":"/paper/2505.19020","citing_paper":"/paper/2507.06507"},"observation_digest":"sha256:4de7d7f9de585d8656931f0f0019d9018777bb71238f2e4c9708418bb95d99af","observation_id":"9ccbd0f8-9c3f-416f-845c-ccfb116c5f09","resolution":{"observed_at":"2026-08-06T19:06:08.746586Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19020/citation-record","integrity":"/paper/2505.19020/integrity","json":"/paper/2505.19020/citation-record.json","paper":"/paper/2505.19020"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17811","last_updated":"2025-06-12T00:31:21Z","snapshot_observed_at":"2026-08-07T16:00:08.937952Z","submitted_at":"2025-04-22T18:07:45Z","title":"OmniSage: Large Scale, Multi-Entity Heterogeneous Graph Representation Learning","version":3},"cited_work":{"arxiv_id":"2504.17811","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.17811","snapshot_observed_at":"2026-08-07T14:24:33.697720Z","title":"OmniSage: Large Scale, Multi-Entity Heterogeneous Graph Representation Learning","venue":"cs.IR","work_id":"befd453a-f426-43e4-b469-e5434665a3a6","year":2025},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.265695Z"},"links":{"cited_paper":"/paper/2504.17811","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:b4206fe81a4d3c8ff9a14efc1e3af135611dab3954ecf029dd595164f2f8c0fc","observation_id":"f81d0c60-a899-4344-8010-5faeb73224e5","resolution":{"observed_at":"2026-08-07T14:24:33.724804Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.500699Z","title":"LiGNN: Graph neural networks at LinkedIn","venue":null,"work_id":"74cca64a-4f01-4980-9291-1e22d8bb8cb7","year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.323965Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:c16b23dd7c68e276fa6ddf1195335e4fea75ddb66c177e146548613b860aaad4","observation_id":"bd42604e-5828-40fc-8f60-3ee9eb5c6950","resolution":{"observed_at":"2026-08-07T14:24:37.505221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.486416Z","title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","venue":null,"work_id":"a2ba92a9-a5e9-498a-900c-575c6576a37d","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.442086Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:771c62a170d4c1e9d7c352e73eb39e705ad14c24ff62b56947945bdff02ce931","observation_id":"75d98d97-8234-44ec-bfc8-7e9d7a033fa1","resolution":{"observed_at":"2026-08-07T14:24:37.490863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.471629Z","title":"Macro graph neural networks for online billion-scale recommender systems","venue":null,"work_id":"e1619d40-63d7-4052-93ed-5456b40264b0","year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.489364Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:b6caa66463b2be3abdcdb4af9ab4ae469f75c66e76bf07f1a2b7d41e0d457bff","observation_id":"e6d36ae3-a2d6-4140-85a1-cefc13f31cb9","resolution":{"observed_at":"2026-08-07T14:24:37.476969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.457378Z","title":"Leveraging contrastive learning for enhanced node representations in tokenized graph transformers.Advances in Neural Information Processing Systems, 37:85824–85845, 2024","venue":null,"work_id":"3d2811da-8b32-4f3e-ae1b-88ac807f12ad","year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.572777Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:09ae4be49df54bfc9c413c6012ad0463732cd70b86e5185c2c93610c7aecfdcd","observation_id":"f87874ee-354a-4eff-9635-33d8ab6126d4","resolution":{"observed_at":"2026-08-07T14:24:37.462194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.443038Z","title":"Heteroge- neous graph contrastive learning for recommendation","venue":null,"work_id":"127e32d0-14cd-4e69-b214-ce2bc95e7eb4","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.699699Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:55d97be1ff4dad0cb6bb1a91add37232c626d672caeda5f170dda459f55cf8c3","observation_id":"235c1201-580e-4454-9e3f-942f97cb39bf","resolution":{"observed_at":"2026-08-07T14:24:37.447957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:30.775102Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.775102Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:d789eb91616836d6dedab6bd8663ddb473998484a817ce47fae077d60755a85b","observation_id":"6ecb45c6-8e52-4b92-bbaf-6bf961f151ee","resolution":{"observed_at":"2026-08-07T14:24:30.775102Z","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-07T14:24:30.825253Z","title":"Understanding the difficulty of training deep feedforward neural networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.825253Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:6423f566dec3b00047ad2bb1035985e94f8c7fff06516ee085732be247e418fd","observation_id":"ae6f9049-9058-4587-b753-d7f602b1d509","resolution":{"observed_at":"2026-08-07T14:24:30.825253Z","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-07T14:24:37.413153Z","title":"Architecture matters: Uncovering implicit mechanisms in graph contrastive learning.Advances in Neural Information Processing Systems, 36:28585–28610, 2023","venue":null,"work_id":"efaa8e88-5dcc-4b68-9ef6-00dd6325dfdb","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:30.913918Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:60de8c9732e3d1b7ae60b7f79b77501d75f7175f7472b84d802d53edfda00e68","observation_id":"a12cdba5-e9a7-4d46-ab2e-c6de14b24e5b","resolution":{"observed_at":"2026-08-07T14:24:37.417675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.399186Z","title":"Exploitation of a latent mechanism in graph contrastive learning: Representation scattering","venue":null,"work_id":"5799f62b-caa7-4fe6-9756-71b62b3b847d","year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.038762Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:33f26b24a16031ee4eb6687cbb763ae71abef9e94b30c1c043de31e23584b93e","observation_id":"25028439-d277-448a-a2db-83f52c5029e9","resolution":{"observed_at":"2026-08-07T14:24:37.404070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:31.082511Z","title":"LightGCN: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.082511Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:ba4e34a9646bb616143798b5f0d85a4da27b9f547fc434d812a9065853907f1f","observation_id":"11f2f54d-5e27-4616-bdfa-0ec45ed3dc4c","resolution":{"observed_at":"2026-08-07T14:24:31.082511Z","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-07T14:24:37.377731Z","title":"MixGCF: An improved training method for graph neural network-based recommender systems","venue":null,"work_id":"0d18e76a-e8bb-4555-a940-03bb6d064252","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.117517Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:2f3faa2728913135dde59323d131018d9b187efb28bdcc399c57e5dac22ae9c8","observation_id":"f64a4435-03c6-4583-960a-08e0f07b24a3","resolution":{"observed_at":"2026-08-07T14:24:37.381689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11868","last_updated":"2024-05-20T08:19:10Z","snapshot_observed_at":"2026-07-06T18:16:37.476614Z","submitted_at":"2024-05-20T08:19:10Z","title":"Towards Graph Contrastive Learning: A Survey and Beyond","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11868","snapshot_observed_at":"2026-08-07T14:24:31.185629Z","title":"Towards graph contrastive learning: A survey and beyond.ArXiv preprint arXiv:2405.11868, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.185629Z"},"links":{"cited_paper":"/paper/2405.11868","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:e4a6c8aefa3e8d0c883aa0cb0f6f5cef76c6fac885305faf5385e698fba7bce6","observation_id":"04a4c10b-7596-4fb2-a873-413b5eda3c95","resolution":{"observed_at":"2026-08-07T14:24:31.185629Z","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-07-06T02:11:23.670680Z","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-07T14:24:31.279183Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.279183Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:5695e70694f34063626f76e3ad506e74c486da6c4a0bbfe25c61717081083d6e","observation_id":"b27d895e-cbc2-4622-bf45-e90d42660267","resolution":{"observed_at":"2026-08-07T14:24:31.279183Z","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-07T14:24:37.303157Z","title":"Bootstrapping user and item representations for one-class collaborative filtering","venue":null,"work_id":"f9ea615f-9092-4e3b-92bc-021c007ac55b","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.338136Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:845a3aa732f5ee006df1ab2ec1b692c6159b4e1cdc0b6b2d127f07c67de4b66b","observation_id":"9ead92e5-6703-4f98-b98c-dbab20504cd7","resolution":{"observed_at":"2026-08-07T14:24:37.366120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:37.111650Z","title":"Hierarchical bipartite graph neural networks: Towards large-scale E-commerce applications","venue":null,"work_id":"83d22c12-4bbd-4a05-82e0-504f8aa1a13d","year":2020},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.402725Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:e7bbb10c2b7465a6589b78444f0a824cf93cc77595738a35ddd254281f0360f2","observation_id":"4f24f28c-236c-40b6-aa8e-89f3952e4feb","resolution":{"observed_at":"2026-08-07T14:24:37.199768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:36.845482Z","title":"Variational autoen- coders for collaborative filtering","venue":null,"work_id":"02295b47-64dc-4358-a31b-92553f14e0f5","year":2018},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.497109Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:3960558511cc861444d6e78772315f0068740d29dd0460ed50e6a17e43d726b3","observation_id":"4870fbdb-af96-4d79-a101-69a5d8ada1d0","resolution":{"observed_at":"2026-08-07T14:24:36.896103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:36.696658Z","title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","venue":null,"work_id":"980c7e72-e548-4995-89ee-04075821b897","year":2022},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.621286Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:ed96d20f198baa2ddf5a58e5d09c4c472a3ad07691f35d414b30527f7d257eb5","observation_id":"f1aab98e-1ebd-48f7-908a-4c3e2335edd5","resolution":{"observed_at":"2026-08-07T14:24:36.784154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-07T14:24:31.661493Z","title":"Representation learning with contrastive predictive coding.ArXiv preprint arXiv:1807.03748, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.661493Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:23b5832edf22bc9f192e1275abac707c616d777e84bf71d1e4f7f18c388b3172","observation_id":"3b6c08b8-ae89-4df9-b239-c8e387e3e53c","resolution":{"observed_at":"2026-08-07T14:24:31.661493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2618","last_updated":"2012-05-09T18:25:09Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T18:25:09Z","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2618","snapshot_observed_at":"2026-08-07T14:24:31.713931Z","title":"BPR: Bayesian personalized ranking from implicit feedback.ArXiv preprint arXiv:1205.2618, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.713931Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:32d10d54128b4423cbfd2dac02ef4f1d05f8f4f7f457a63d2b78d380927c18b2","observation_id":"66ece9fb-3cb0-47e8-991f-7ea4bf246e4c","resolution":{"observed_at":"2026-08-07T14:24:31.713931Z","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-07T14:24:36.520161Z","title":"Visualizing data using t-SNE.Journal of Machine Learning Research, 9(11), 2008","venue":null,"work_id":"7405b120-3b7c-48ee-9d01-06ec7706d675","year":2008},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.765962Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:fff4d19763439068da17304c2e097ebab99d80ed24fe45d4f52007f6f659b24b","observation_id":"2be8038d-9129-4f8d-a9ff-6a13e38fbeda","resolution":{"observed_at":"2026-08-07T14:24:36.603289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10341","last_updated":"2018-12-21T15:44:59Z","snapshot_observed_at":"2026-07-06T07:04:37.077852Z","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10341","snapshot_observed_at":"2026-08-07T14:24:31.889674Z","title":"Deep graph infomax.ArXiv preprint arXiv:1809.10341, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.889674Z"},"links":{"cited_paper":"/paper/1809.10341","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:0914269e4eed058d8b825aeb20c5ce468c21d2671c98829b9e9cd9a34c8247cb","observation_id":"65b2072a-cbf2-47f9-a3e3-5742765019e4","resolution":{"observed_at":"2026-08-07T14:24:31.889674Z","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-07T14:24:36.362062Z","title":"Neural graph collabo- rative filtering","venue":null,"work_id":"4a8d237e-c17a-4480-80a1-f9584c9073b3","year":2019},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:31.983461Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:e94710afe6251716e4cd4ffd887ae3bc4c293eda52406603f1158083a217a4a9","observation_id":"2c9e336b-8663-4fe6-903f-d11f7c0dfe87","resolution":{"observed_at":"2026-08-07T14:24:36.468964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:36.209348Z","title":"Self-supervised heterogeneous graph neural network with co-contrastive learning","venue":null,"work_id":"03b9d9af-1d9a-4080-9e78-696f37772810","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.063111Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:6dc4fd4f292d313c3c6138a201d01f04d07dee7b6b3a585f5afb3ae99ec1ece2","observation_id":"ce828d0e-3a2a-4323-9279-7556b6e6a273","resolution":{"observed_at":"2026-08-07T14:24:36.254305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:36.049634Z","title":"Self-supervised graph learning for recommendation","venue":null,"work_id":"4e641a9b-e1a1-4bd2-97d8-5f6ae5ee7f29","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.118516Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:4a21a5004481a5ed44c67ae46432ba650f50ac35c6922d23ddd95e27421cedc4","observation_id":"8a85305e-a8cf-43e6-a6c8-35a3cbdeba34","resolution":{"observed_at":"2026-08-07T14:24:36.149821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:35.840165Z","title":"Representing long-range context for graph neural networks with global attention","venue":null,"work_id":"f60b8a1b-cc57-4da8-9304-1b04cf79cb30","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.226758Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:5d61ef7baec354d6da127221d9c58a699937c9167208487a3e76f73af462cccd","observation_id":"48b9942a-6b45-4e88-9b09-3c0ae2c574e3","resolution":{"observed_at":"2026-08-07T14:24:35.894554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:35.564953Z","title":"Hyper- graph contrastive collaborative filtering","venue":null,"work_id":"1f48c7ec-f61b-4c79-a910-0db9722e0b4d","year":2022},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.314333Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:75974e53fc549dbcf12088fa4c9159e4fb752f748b7a9f1b328c41af1ad35dfb","observation_id":"29a1f2cb-767e-4cad-bfc8-58de3cd9dcd5","resolution":{"observed_at":"2026-08-07T14:24:35.680992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:35.425009Z","title":"Simple and asymmetric graph contrastive learning without augmentations.Advances in Neural Information Processing Systems, 36:16129–16152, 2023","venue":null,"work_id":"71c1001f-199a-499e-8c9a-b109dc786fd8","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.409484Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:c5d332e60b0d564f064e48d951529de8ffb5a8abfe3016ee41722e5e4223003c","observation_id":"08d74116-4861-4d83-8d04-d49b9699be74","resolution":{"observed_at":"2026-08-07T14:24:35.518844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:35.230376Z","title":"InfoGCL: Information-aware graph contrastive learning.Advances in Neural Information Processing Systems, 34:30414–30425, 2021","venue":null,"work_id":"5a530206-2418-4d5f-8095-d754ca332e22","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.470548Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:541e4c64f7cf90647c22de4f2a89f2c133bf2283dbdf198c94ba32447e3346dc","observation_id":"b7eaf8ff-e08d-48b8-afe8-a2ca2868a480","resolution":{"observed_at":"2026-08-07T14:24:35.290025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:35.119252Z","title":"Self-supervised graph- level representation learning with local and global structure","venue":null,"work_id":"8da74fcf-537c-4f8e-847a-ddb741b2462f","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.557612Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:820f259daab6ad9e937e843b4317b76cbca2582e74d7a863005f6bcfd639b209","observation_id":"8577ac8d-530b-41da-b733-e1a4a89d21a3","resolution":{"observed_at":"2026-08-07T14:24:35.175968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.989187Z","title":"Predicting individual irregular mobility via web search-driven bipartite graph neural networks.IEEE Transactions on Knowledge and Data Engineering, 2024","venue":null,"work_id":"9fc7df42-4a91-45b3-8f65-9fd42c4e0f34","year":2024},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.676988Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:37fc6c8cc0aa4aff7d88f00b08d77c0a77371b9a0468ea26c014122cbba00241","observation_id":"37402df5-0add-448f-9c5b-dcce81d714a1","resolution":{"observed_at":"2026-08-07T14:24:35.023326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.917655Z","title":"Hierarchical graph contrastive learning","venue":null,"work_id":"24849bdb-5967-41e3-b00f-617632fafdcd","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.706817Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:025bf7aee991888a7a140258202e4d6bf06260e3e49124fad84a5ea065bdc355","observation_id":"4dc00a1f-949d-44b8-b546-ef78c5cbf318","resolution":{"observed_at":"2026-08-07T14:24:34.949424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.744023Z","title":"An empirical study towards prompt-tuning for graph contrastive pre-training in recommendations.Advances in Neural Information Processing Systems, 36:62853–62868, 2023","venue":null,"work_id":"84e559d6-ab62-465f-b5a0-9a06b6dacdcc","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.745016Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:dbdcb1600dc92ba514f6ec832a7eefac42421b9e4b77a2abb57b4f23ca70d003","observation_id":"333a1d7c-6350-402a-831d-c844e8e1f239","resolution":{"observed_at":"2026-08-07T14:24:34.813405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.653977Z","title":"Self-supervised learning for large-scale item recommendations","venue":null,"work_id":"5ea9b1c5-fa43-42bb-be1a-3c47a0fc317e","year":2021},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.783710Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:f0ff7a6f3a54ebb9e6e3bbd71d9cef081133777c7c3945e18500a35ba8002f8f","observation_id":"32f1bc23-e215-4382-96e0-e9ca68c8e9df","resolution":{"observed_at":"2026-08-07T14:24:34.680802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.531112Z","title":"Graph convolutional neural networks for web-scale recommender systems","venue":null,"work_id":"b63ab4f6-b08e-44ea-862f-a08108621e25","year":2018},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:32.902211Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:f30fc605ea1d8b006bb51ff525ab7166cc614344ef5e673d7840c7f77f025d0d","observation_id":"dd68e346-168c-4ef1-8934-30ac3e393cca","resolution":{"observed_at":"2026-08-07T14:24:34.609620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:33.015892Z","title":"Hierarchical graph representation learning with differentiable pooling.Advances in Neural Information Processing Systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.015892Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:d77476213796e7e07cd05b39af85d50dc80ed4f422f1852a5f41ed4aa7f4da2a","observation_id":"2ca59752-3612-48e8-82b1-7b2270390f38","resolution":{"observed_at":"2026-08-07T14:24:33.015892Z","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-07T14:24:34.407399Z","title":"Graph contrastive learning with augmentations.Advances in Neural Information Processing Systems, 33:5812–5823, 2020","venue":null,"work_id":"d0375a94-00ff-4939-981b-ca7aa004f722","year":2020},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.059973Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:b84c574e8a2025e67e3f695120beea7846f10d0931065895dc2f20f0adb21bfb","observation_id":"2d93999f-3c36-47e1-81a7-87cbd36c5e45","resolution":{"observed_at":"2026-08-07T14:24:34.459864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.293292Z","title":"XSimGCL: Towards extremely simple graph contrastive learning for recommendation.IEEE Transactions on Knowledge and Data Engineering, 36(2):913–926, 2023","venue":null,"work_id":"6ea3feba-c484-4a1a-a0b5-9720d52428f3","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.142592Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:1f550952aa5e87df3a435279682a55b4a059a644e6e3ce7bc8f7bc721d39ee0b","observation_id":"540a010c-6508-455c-9483-f151c3f9929d","resolution":{"observed_at":"2026-08-07T14:24:34.346861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.146047Z","title":"Are graph augmentations necessary? Simple graph contrastive learning for recommendation","venue":null,"work_id":"074c8dda-e202-4cd8-bbad-49f83088fc39","year":2022},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.230616Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:63842c787924e9ae46241e58ee15945dd49c8c61fcb5244622956341399dff79","observation_id":"05c2c8cf-2f57-4614-b2c5-c6c5bb5fff14","resolution":{"observed_at":"2026-08-07T14:24:34.210994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:34.051972Z","title":"Self-supervised learning for recommender systems: A survey.IEEE Transactions on Knowledge and Data Engineering, 36(1):335–355, 2023","venue":null,"work_id":"6d0ff8dd-06a5-4896-8015-b15db7f70b8f","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.319503Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:2402b45e4b5b56c80844e721969f7ed25d232337dc0eb2f2d68cc4866ebac4f6","observation_id":"7f4eeffe-8781-4e41-bee1-bb8e0d56585e","resolution":{"observed_at":"2026-08-07T14:24:34.088700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:33.908088Z","title":"ContextGNN: Beyond two-tower recommendation systems","venue":null,"work_id":"7f093acd-4315-4490-99a2-2ebb303aec45","year":2025},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.381101Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:eccb9d269b53a8465198ca8bdee673513c2a27d0c095a641f224141109204dcd","observation_id":"009ac8de-738b-42bc-80f8-0bf9563a3ab8","resolution":{"observed_at":"2026-08-07T14:24:33.998395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:24:33.785671Z","title":"Long-tail augmented graph con- trastive learning for recommendation","venue":null,"work_id":"ab43b77e-5975-4b8a-bd2f-e8d5c1992597","year":2023},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.428090Z"},"links":{"citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:7784bad16aead2805f882c64a3fcf1299b96ea0e28c095a501a61aa3f941195a","observation_id":"1daf01da-8091-4b75-b137-a4a8f6165021","resolution":{"observed_at":"2026-08-07T14:24:33.840753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-05T13:22:44.473317Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-07T14:24:33.508442Z","title":"Deep graph contrastive representation learning.ArXiv preprint arXiv:2006.04131, 2020","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:33.508442Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2505.19020"},"observation_digest":"sha256:3735bafd43d017ce05a8ac6a1be8242f2fcbf8c3d40b5251bcb17716c0e0d230","observation_id":"a569c23b-4002-4662-9299-e79467170a79","resolution":{"observed_at":"2026-08-07T14:24:33.508442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.19020","last_updated":"2025-05-25T07:56:56Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-08T05:58:51.660768Z","submitted_at":"2025-05-25T07:56:56Z","title":"HGCL: Hierarchical Graph Contrastive Learning for User-Item Recommendation"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":32},"total_outbound_references":43},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 1 inbound Pith citation observation for arXiv:2505.19020."}