{"as_of":"2026-08-08T06:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f725066d098f41cbbeed9f332770a218a0319ea6e7d44e32c2cd91676c3e62fb","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:38:43.625151Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.24172/citation-record","integrity":"/paper/2505.24172/integrity","json":"/paper/2505.24172/citation-record.json","paper":"/paper/2505.24172"},"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-07T12:38:58.360724Z","title":"Item-based collabora- tive filtering recommendation algorithms,","venue":null,"work_id":"aceb384e-d2e1-4a48-93e6-4c3d5783828e","year":2001},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.153477Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:168c97ba7a9124db96f5da6e0c8447c151eeaee98b940511368eb1c696ab43ba","observation_id":"637ceaff-1efb-4ac6-8015-fecec308b708","resolution":{"observed_at":"2026-08-07T12:38:58.480535Z","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-07T12:38:33.248817Z","title":"Matrix factorization techniques for recommender systems,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.248817Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:f7863bd70a174b368f998704a589f9e3664ee850a88c3a65e8a2a26e8a7b960d","observation_id":"d8504c2c-84fe-4097-a169-882dccd7877e","resolution":{"observed_at":"2026-08-07T12:38:33.248817Z","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-07T12:38:58.039079Z","title":"Neural collaborative filtering,","venue":null,"work_id":"6408262a-7473-4d33-a36a-8e13944add29","year":2017},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.401668Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:a1c840c4d99622d8a1aa5b798ebe0272d9d1b78e90ae72569e8c384cbf6e65fe","observation_id":"d8059669-5f0c-461d-89db-b6bf3a864b9e","resolution":{"observed_at":"2026-08-07T12:38:58.184208Z","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-07T12:38:57.763690Z","title":"A survey of heterogeneous information network analysis,","venue":null,"work_id":"9c8e4f53-7e4c-478c-9804-cc623c7334fc","year":2016},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.559188Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:ce81b11e3230c607bae4129bc730e7ecd34c4c29c620615ce9c5d4cde968b7f6","observation_id":"8bf28db8-2768-4ee0-a53e-a93689e9b4d3","resolution":{"observed_at":"2026-08-07T12:38:57.890728Z","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-07T12:38:57.517222Z","title":"A heterogeneous information network based cross domain insurance recommendation system for cold start users,","venue":null,"work_id":"affca03d-4c25-4ea5-93fc-ee0acf9fcedd","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.645065Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:2e5e90282a77a58d669c11fa0928dbfb0e7ca9b12f95a8ebdc1d93d454bdb302","observation_id":"e48582b3-2f6c-4c73-a09b-f885246f73fb","resolution":{"observed_at":"2026-08-07T12:38:57.617223Z","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-07T12:38:57.247532Z","title":"Metapath- guided heterogeneous graph neural network for intent recommendation,","venue":null,"work_id":"1edcaaa3-c037-4b5b-9772-210b0efb260d","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:33.763492Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:0e52769a644ac447c34b6c06bca6e8c9744920f9271c986090301eda4d25cc78","observation_id":"9dbdd899-d02d-4122-b928-0525c4623209","resolution":{"observed_at":"2026-08-07T12:38:57.370124Z","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-07T12:38:56.986971Z","title":"Context- dependent propagating-based video recommendation in multimodal het- erogeneous information networks,","venue":null,"work_id":"fdb6b040-871f-4370-a654-3865ee710313","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:34.051951Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:bd462004dcdcc197a81f29ee6d80bcbfaefa67030a216c0c55d7fc0ebc118b6c","observation_id":"9af1025a-672c-4b2d-9d28-d2fef952ceef","resolution":{"observed_at":"2026-08-07T12:38:57.121893Z","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-07T12:38:56.757423Z","title":"Graph attention networks,","venue":null,"work_id":"7ced3e63-b935-4df6-afb2-fd1d230deedf","year":2017},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:36.782816Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:a68b7c125a0da0f607f4e3a330f5267fe5931cd95ee0b778f8b20e01e0c8ff01","observation_id":"53b9cada-5bbc-4b73-96b9-d335b81d4f36","resolution":{"observed_at":"2026-08-07T12:38:56.867453Z","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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-07T12:38:36.954876Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:36.954876Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:eabdc4621f2afeb89db5d566d791953ee3a0de76c84ea7af1dd4b0032433da80","observation_id":"ad712f2d-0ffe-429d-8287-65c557ab2f21","resolution":{"observed_at":"2026-08-07T12:38:36.954876Z","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-07T12:38:56.438502Z","title":"Graph random neural networks for semi- supervised learning on graphs,","venue":null,"work_id":"8228a7cd-ad77-464d-8c90-853c953ace96","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.112102Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:ee64c167c06eb0a425d999953e24abe965947d1216546ec061effd687c6c6d3c","observation_id":"a9a0c66f-8d9d-4f39-aeac-89dbcc7e63ac","resolution":{"observed_at":"2026-08-07T12:38:56.566315Z","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-07T12:38:56.095898Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommenda- tion,","venue":null,"work_id":"845f0c4d-165a-451a-b122-3e323305b81b","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.276473Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:aacdc898ea6e35c450fcd929127365716d6c6810cea8596e8dee4adbf02defc4","observation_id":"ce794b11-f339-47e2-975e-7dcc37bee496","resolution":{"observed_at":"2026-08-07T12:38:56.274401Z","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-07T12:38:55.858236Z","title":"Neural graph collaborative filtering,","venue":null,"work_id":"77f9a9d4-65c6-4b86-9b18-a5f063f626dc","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.416735Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:4c114a9cf262594461e34fd3c1a21f764fd5c0aecacec50c66286fe330620b3c","observation_id":"2fe01148-503b-4611-8c9e-416b3ac2c8e4","resolution":{"observed_at":"2026-08-07T12:38:55.959017Z","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-07T12:38:37.534532Z","title":"Heterogeneous graph attention network,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.534532Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:f03c4c99ea9076878fd699c2629c7d77406655d3612e2c12bdac14f2d9f368ab","observation_id":"26ed8446-7bc9-4ccb-8297-28758b30710c","resolution":{"observed_at":"2026-08-07T12:38:37.534532Z","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-07T12:38:55.579058Z","title":"Self-supervised heterogeneous graph neural network with co-contrastive learning,","venue":null,"work_id":"41c3a993-3b82-405b-bba4-676a1485a79f","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.678751Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:ccc46de5fb50cc37309801ef756c6979b4cea3405068578c0e1bb826123deb68","observation_id":"4f2a98b7-7c27-4d2c-9553-bf6355f7b769","resolution":{"observed_at":"2026-08-07T12:38:55.688454Z","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-07T12:38:55.327846Z","title":"Robust heterogeneous graph neural networks against adversarial attacks,","venue":null,"work_id":"5bacea99-0e34-4ce2-b229-d519106f371f","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.801707Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:b1a7c8a6563e85931022455543756459d6ecc67869d71c85fbc9df8a2a9decc7","observation_id":"4fb144dc-34b2-4596-9c94-79bdf5f87ee1","resolution":{"observed_at":"2026-08-07T12:38:55.432750Z","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-07T12:38:37.949901Z","title":"A simple framework for contrastive learning of visual representations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:37.949901Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:38c919299e0b0c0d1e992f0839cd5fb94f7bc0178329b168fdc7c5a6cc6b17f7","observation_id":"c0653d9b-b857-471b-8585-359345fed3f8","resolution":{"observed_at":"2026-08-07T12:38:37.949901Z","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-07T12:38:55.066651Z","title":"Bootstrap your own latent-a new approach to self-supervised learning,","venue":null,"work_id":"857434b0-3119-4281-9324-f80570f4a4e0","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.084446Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:4893849983fa7850b0920d4e0157d3fd65e72ec79a67ae5d7c6b7251d1793cfe","observation_id":"2ad41b36-0e7e-4405-8129-08119e34270f","resolution":{"observed_at":"2026-08-07T12:38:55.169763Z","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-07T12:38:54.781841Z","title":"Heterogeneous graph contrastive learning for recommendation,","venue":null,"work_id":"5b5e0d23-86ee-445a-8e65-e44209487f66","year":2023},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.261563Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:b4641d90d8234fd5e0ce90555f9259fe25d71ea3ccdf4851e645448bf0889f96","observation_id":"de481d07-a9e7-4cca-9e09-fa5134801fc0","resolution":{"observed_at":"2026-08-07T12:38:54.928808Z","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-07T12:38:54.494088Z","title":"Self- supervised graph learning for recommendation,","venue":null,"work_id":"2a130b37-065b-4bc3-8578-f9829098c1b1","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.403691Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:241c6a2d24b232cff08615ad36135cd21eb80da1bb9c5dd9def88bccad22b587","observation_id":"b43e12ef-7d8f-4793-b411-571307a90647","resolution":{"observed_at":"2026-08-07T12:38:54.625775Z","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-07T12:38:38.561818Z","title":"Representation learning with contrastive predictive coding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.561818Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:059326728af77625575fabf71570dcda61bf371fb8d54eb10fdb1152b0eae35e","observation_id":"54670e80-83b5-4ee3-a18d-35af8f235f4c","resolution":{"observed_at":"2026-08-07T12:38:38.561818Z","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-07T12:38:54.167174Z","title":"Heterogeneous graph contrastive learning network for personalized micro-video recom- mendation,","venue":null,"work_id":"0587466d-79a6-4fb3-82d4-8e784145065b","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.688931Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:3582f110cb58fd4621fa1d05f6848a8ec3f4929c57b14d59ede05ea85d24821d","observation_id":"d3557914-40a0-4e41-8e5e-cb2015f4319c","resolution":{"observed_at":"2026-08-07T12:38:54.330193Z","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-07T12:38:53.835956Z","title":"Heterogeneous informa- tion network embedding for recommendation,","venue":null,"work_id":"45a581f9-5cde-4124-9924-ecd8e6ca9387","year":2018},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.822101Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:c9a866b1bb77bc79e9d5718444d0ebef60fb40a73f80f935d87ebcd013cb71b3","observation_id":"e3fa71e3-4cf3-44ed-944d-733f65aac549","resolution":{"observed_at":"2026-08-07T12:38:54.002690Z","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-07T12:38:53.597068Z","title":"Social recommendation with self-supervised metagraph informax network,","venue":null,"work_id":"26b47496-b87c-488a-a67c-21849977875d","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:38.948933Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:1ed620f1c07654bceeba843fae74622e18ae4ffb5e616f01c51db2970fdb3c05","observation_id":"a77605f4-048e-488f-b7b1-e0bd864cb77a","resolution":{"observed_at":"2026-08-07T12:38:53.708477Z","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-07T12:38:53.263246Z","title":"Are graph augmentations necessary? simple graph contrastive learning for recommendation,","venue":null,"work_id":"05de3607-4967-41f7-983f-f2234db3e01f","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.064470Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:2da06e26301bd5656204708cb28435e5aa3d917019a2561621510f7adb7b34c6","observation_id":"240816a2-b859-478a-82ab-d735e37dfc2d","resolution":{"observed_at":"2026-08-07T12:38:53.403960Z","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-07T12:38:53.020639Z","title":"Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,","venue":null,"work_id":"043f8fdd-1b07-4ae4-9632-e6bcab8bffb4","year":2011},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.181492Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:fc7dca9a26c405fbd2cd1d35de9ff14bc418a874d50974fe788af1ff6120a10c","observation_id":"0e64c245-fe76-4646-b172-3f4753965dd4","resolution":{"observed_at":"2026-08-07T12:38:53.153972Z","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-07T12:38:52.807779Z","title":"Understanding the difficulty of training deep feedforward neural networks,","venue":null,"work_id":"38f10399-115b-49fa-a1d3-4efff781a7ae","year":2010},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.342717Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:d3294cdea3e3a340fbdbf3d153c9b61ca1e1f5596adb0cfa3e2610bef6886753","observation_id":"14ade10d-ea0b-460f-9683-a9f1b5948bcc","resolution":{"observed_at":"2026-08-07T12:38:52.916437Z","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-07T12:38:52.596147Z","title":"Birds of a feather: Homophily in social networks,","venue":null,"work_id":"ad5e728d-f143-45e2-86f3-6e2c544813ff","year":2001},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.470575Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:0b07a59aa303f66cf6fb40c63f0d644ce095ba8dc8588541de7ddc46bed34fb0","observation_id":"8856f4fb-94cf-4394-80b9-2c310dbccfb1","resolution":{"observed_at":"2026-08-07T12:38:52.705011Z","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":"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-07T12:38:39.577145Z","title":"Bpr: Bayesian personalized ranking from implicit feedback,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.577145Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:511861bff438d3f9b80ec58fd9eb22d5ba55567aa024db98674a69dd995c3cdd","observation_id":"e0813ca9-9b1b-4a37-ab17-5174ad7425ba","resolution":{"observed_at":"2026-08-07T12:38:39.577145Z","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-07T12:38:52.332234Z","title":"Heterogeneous graph trans- former,","venue":null,"work_id":"3c147032-84aa-4cb4-86c0-71a55c12343a","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.721127Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:6911fc87f1e571acab6d8710ef7de8d1f5a84e048046c31b39192ed570e8c5e0","observation_id":"4515ff88-b97f-429c-8875-e07c6695bb1a","resolution":{"observed_at":"2026-08-07T12:38:52.428193Z","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-07T12:38:52.080262Z","title":"Kgat: Knowledge graph attention network for recommendation,","venue":null,"work_id":"d63418e2-10de-4af3-a467-6ac74c5c6842","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:39.857355Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:d554924bb7d7eb4d160da810fc4a3f12023e7882d558873d0cb1aa6636e8f373","observation_id":"bce98896-aa95-45d0-80c8-18efde479c89","resolution":{"observed_at":"2026-08-07T12:38:52.208947Z","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-07T12:38:51.813453Z","title":"Openhgnn: An open source toolkit for heterogeneous graph neural network,","venue":null,"work_id":"b7ca888a-247b-44e5-9bdd-2e59dabfd128","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.006078Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:175944da3f1b67861fc9b1aad03f6275dcaedd535665c128c14765c6d0f08c31","observation_id":"c14e2a4d-5e09-4e15-bdd9-be7968e241c7","resolution":{"observed_at":"2026-08-07T12:38:51.938441Z","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-07T12:38:51.477270Z","title":"Leveraging meta-path based context for top-n recommendation with a neural co-attention model,","venue":null,"work_id":"0a1e10cc-8f56-408b-9562-3c2010bd3df6","year":2018},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.135510Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:37816839a95ed0df8c779b389cffe71f41719ee1786c3fc996cf70caa529da1e","observation_id":"a7411ea3-0926-460a-b5e6-915adcfb92fe","resolution":{"observed_at":"2026-08-07T12:38:51.628733Z","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-07T12:38:51.240124Z","title":"Robust preference-guided based disentangled graph social rec- ommendation,","venue":null,"work_id":"d3592866-578f-4779-ab91-7fae44b47a8c","year":2024},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.287173Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:b236de2ef311a3a8bd8097c4299d5827aa576b3b36f64bc78c91dda417f79023","observation_id":"21cddae6-8fdb-4c73-9c6c-b3d39e4a6d50","resolution":{"observed_at":"2026-08-07T12:38:51.352954Z","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-07T12:38:50.971965Z","title":"Visualizing data using t-sne","venue":null,"work_id":"84f906a4-b74c-47d6-b8e0-046f1d582077","year":2008},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.444342Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:31f228950ca8289ff087181fc8c73adee5320ec200171e6376d46691734d40d7","observation_id":"12251469-7e0b-48b5-8b18-21477c3f037d","resolution":{"observed_at":"2026-08-07T12:38:51.095640Z","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-07T12:38:50.664933Z","title":"Understanding contrastive representation learning through alignment and uniformity on the hypersphere,","venue":null,"work_id":"3f24a908-e94a-4c94-8084-7cd9a5a860c9","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.610072Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:f7dc40959361883a4ee100026f05ffbc12db0e419b724c4ac4acdca6f8bb7434","observation_id":"7df5a08a-1039-4606-ad51-c2e169d1e335","resolution":{"observed_at":"2026-08-07T12:38:50.814202Z","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-07T12:38:50.448069Z","title":"Graph neural networks for social recommendation,","venue":null,"work_id":"3fac37ae-7a0e-4a58-9d37-4cc317d8aad5","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.706672Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:0eff623aa590e8b86b8710b488dde768e85448aea1da5e30833d748a223655af","observation_id":"b175b948-18d0-4611-af29-1742fd07d7bf","resolution":{"observed_at":"2026-08-07T12:38:50.561561Z","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-07T12:38:50.172185Z","title":"Modeling relational data with graph convolutional networks,","venue":null,"work_id":"4c9f3f2f-d032-49f2-bcd5-ef56673c7d66","year":2018},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.846675Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:860d109f5c2eec560ee577adf9bc755c8a97f6e5821babb11d41ef45a011d72b","observation_id":"0405a278-101b-4aa7-a207-18cbe93d9ecd","resolution":{"observed_at":"2026-08-07T12:38:50.318201Z","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-07T12:38:49.812073Z","title":"Graph-refined convolutional network for multimedia recommendation with implicit feedback,","venue":null,"work_id":"c1663ae0-80b1-45e4-be75-661c92e6f4fe","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:40.987685Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:e0a0fb7a27f147b771e09dbeb0432d4ccbe16286d5e1292b7af4086722c928ac","observation_id":"fe951c8a-c844-4079-bd87-047d1de82204","resolution":{"observed_at":"2026-08-07T12:38:49.977221Z","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":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-07T12:38:41.162588Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.162588Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:8b71df99caf3c5d25dc7564cd756d2dd70b0d94203a056d6d9df34435c13ddd9","observation_id":"d842c58f-f9fa-41a2-96b3-d4e022154547","resolution":{"observed_at":"2026-08-07T12:38:41.162588Z","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-07T12:38:49.523632Z","title":"Distributed representations of words and phrases and their composi- tionality,","venue":null,"work_id":"9ecd0f40-16d8-4307-8193-9a687b740abc","year":2013},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.290824Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:b27d110a7a9afae901f01d6dabc94167f187c7dadfa32131ce893e8362ba4f6a","observation_id":"df8a70f2-bf72-4d57-9ada-9db2c3eb036f","resolution":{"observed_at":"2026-08-07T12:38:49.672715Z","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-07T12:38:49.216501Z","title":"Multi-behavior sequential recommendation with temporal graph transformer,","venue":null,"work_id":"86a636d3-4bdd-4389-a371-a6fb3563c75b","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.409499Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:90550f1c496ac726eee1a16cd59425eededdae50d3bb451b446557cc312383a2","observation_id":"2a233589-9113-4de3-98d8-f4f2da36d71e","resolution":{"observed_at":"2026-08-07T12:38:49.356379Z","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-07T12:38:48.887038Z","title":"News recommendation via multi-interest news sequence modelling,","venue":null,"work_id":"54d15b58-acf1-4b10-8077-ba992fefd820","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.537741Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:42f46f8f6471d935bc569114e26293c6f129a497614b2f496b7b220841e83b51","observation_id":"ead63f0e-6f8a-4298-b674-a7c702cb7fef","resolution":{"observed_at":"2026-08-07T12:38:49.039075Z","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-07T12:38:48.574945Z","title":"Heterogeneous network representation learning: A unified framework with survey and benchmark,","venue":null,"work_id":"18405fd4-fcdb-44b0-99ee-d9991e314234","year":2020},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.663557Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:ccacef250485212cf80eaf36f5c11151e7c20ac684e3c8994ce8c4619aec13e1","observation_id":"a04872ba-0d9c-4c4b-b36f-e1e1c6341519","resolution":{"observed_at":"2026-08-07T12:38:48.714222Z","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-07T12:38:48.314521Z","title":"User- context collaboration and tensor factorization for gnn-based social rec- ommendation,","venue":null,"work_id":"a0f1b7fc-d000-4989-ad74-6652a561fb29","year":2023},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.836603Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:789e09c185d4f12627098f8137b6a5133d3a7abbb8bc19def15d5bf60790b643","observation_id":"6378728f-6395-4259-bb0b-c59a7a81b95e","resolution":{"observed_at":"2026-08-07T12:38:48.454950Z","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-07T12:38:48.020516Z","title":"Self-attentive graph convo- lution network with latent group mining and collaborative filtering for personalized recommendation,","venue":null,"work_id":"7159c052-b7e8-4ef0-8937-ff6ecc993c09","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:41.975535Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:641be111f4a1f81f86770daf2f487727fcee87fa90b447b396c38d627618eb18","observation_id":"82cefb50-b278-4713-981a-f549f9cd614b","resolution":{"observed_at":"2026-08-07T12:38:48.143969Z","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-07T12:38:47.718279Z","title":"Meta-path based neighbors for behavioral target generalization in sequential recommendation,","venue":null,"work_id":"506b889f-8f0b-4b25-9797-60be4d2debf5","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.131545Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:2295e0d972d6e4f24f1617ec81a08314c25c44ad8825eaa45f80b52a5c5f5feb","observation_id":"294f4093-1210-4cf0-ac2f-c9a29a1642bf","resolution":{"observed_at":"2026-08-07T12:38:47.860171Z","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-07T12:38:47.405364Z","title":"Heterogeneous graph structure learning for graph neural networks,","venue":null,"work_id":"235420b2-b61f-4f9a-8c62-3da7851ac14d","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.227898Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:11505aff1e277f924e57ab5f866d1bd996b8bc2349172ac6dd46ef1e4d51dba0","observation_id":"6400d51c-102c-4ccb-9dac-cb92bd1a8157","resolution":{"observed_at":"2026-08-07T12:38:47.558210Z","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-07T12:38:47.138837Z","title":"Sparse graph attention networks,","venue":null,"work_id":"9ea7e1a5-b33e-48f2-a265-a90a13e8c0db","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.388174Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:3c0c43ce83f54c122a157dd64e542c0dea815d1f0520c8d5951beda98b3bf3cc","observation_id":"d4ac933b-30c5-48ca-a8f8-58df73c17ff7","resolution":{"observed_at":"2026-08-07T12:38:47.262004Z","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-07T12:38:46.866103Z","title":"Hgate: heterogeneous graph attention auto-encoders,","venue":null,"work_id":"23c478b2-1790-4395-bb1f-a267381c038b","year":2021},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.434349Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:1c15c6d018d3d074552a08a287c9ef5191f8948cb539b9f054db8f37926af032","observation_id":"b737d718-fafe-4df5-8773-858178e7c8dd","resolution":{"observed_at":"2026-08-07T12:38:47.007631Z","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-07T12:38:46.508891Z","title":"Towards robust neural graph col- laborative filtering via structure denoising and embedding perturbation,","venue":null,"work_id":"fc86834f-77f5-4a32-a049-d38aa277a9f0","year":2023},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.563401Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:2628427d493e00925145bcc35c0a49d5a73e99584094b548f5a7cfd0cccf58fb","observation_id":"b3484a78-ccc6-4914-8924-a70f74d6dee0","resolution":{"observed_at":"2026-08-07T12:38:46.705345Z","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-07T12:38:46.136465Z","title":"Fedrecattack: Model poisoning attack to federated recommendation,","venue":null,"work_id":"cffa4897-6f99-4649-808d-347d6a29fab0","year":2022},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.696158Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:760bc4030d1d064ea4a1ed7de02919f6515c3918557dd6af61070c1dc305eb9a","observation_id":"ac34cc83-9c98-4a56-a912-4767f534beca","resolution":{"observed_at":"2026-08-07T12:38:46.347388Z","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-07T12:38:45.863111Z","title":"Revisiting graph- based recommender systems from the perspective of variational auto- encoder,","venue":null,"work_id":"025e1dbb-14f9-43f8-b37f-785f0558dae3","year":2023},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.795705Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:ac8b75021e33ecd922c4602e39e7e5e7e0892cb50f900638e3f30fc9aa246c9b","observation_id":"e13c2dd5-3c19-4e13-9a2e-ad51ee20d97c","resolution":{"observed_at":"2026-08-07T12:38:45.990954Z","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-07T12:38:45.558602Z","title":"Deep matrix factorization with implicit feedback embedding for recommenda- tion system,","venue":null,"work_id":"6784302a-42ba-489d-a719-4e94a8c26ae6","year":2019},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.877881Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:cb4d63fe961031e7d240179aeda394b4592c71f4f91af1064c4d1aca9985275b","observation_id":"86fe7961-12a2-497b-8107-0eaf2e9c061c","resolution":{"observed_at":"2026-08-07T12:38:45.700138Z","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-07T12:38:45.222792Z","title":"Intent-guided heterogeneous graph contrastive learning for recommendation,","venue":null,"work_id":"a6fed98c-c1ff-4422-b2e6-8b6531cc1065","year":1915},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:42.998202Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:33f09b7823c2c18047d40bafc5f005cbd91536b6617e96299019e93c0b8f072b","observation_id":"458916d4-f300-4ad6-b127-94121eff9a6f","resolution":{"observed_at":"2026-08-07T12:38:45.377934Z","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-07T12:38:44.928728Z","title":"Denoising heterogeneous graph pre-training framework for recommendation,","venue":null,"work_id":"b9f029e6-26bc-4838-bf51-c24231b1762c","year":2024},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:43.096525Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:d61f810b26e08077bc064e1de1defcf3dd6cb142692b44125ba7c2507a6241b5","observation_id":"33f53876-f500-4388-9f43-94ea8da20a98","resolution":{"observed_at":"2026-08-07T12:38:45.071811Z","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-07T12:38:44.608380Z","title":"Generative- contrastive heterogeneous graph neural network,","venue":null,"work_id":"eb0cc587-adbd-4328-98fd-d7a9d03befe5","year":2025},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:43.190203Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:a66b737030627bb8454d1619720227e25e39dee99fcafd8ca1545ea80b49a7ab","observation_id":"3efbad86-58dd-403e-a6ed-0984cad16565","resolution":{"observed_at":"2026-08-07T12:38:44.773428Z","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":"2502.03307","last_updated":"2025-04-09T07:21:18Z","snapshot_observed_at":"2026-07-06T20:31:41.231839Z","submitted_at":"2025-02-05T16:08:05Z","title":"Intent Representation Learning with Large Language Model for Recommendation","version":4},"cited_work":{"arxiv_id":"2502.03307","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.03307","snapshot_observed_at":"2026-08-07T12:38:44.080960Z","title":"Intent Representation Learning with Large Language Model for Recommendation","venue":"cs.IR","work_id":"39429bf6-63a8-45ca-b1be-088b0d2738ff","year":2025},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:43.340576Z"},"links":{"cited_paper":"/paper/2502.03307","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:aab738376004744d71ee087ecffb76d0b325de3885f997168ba4d849b83dd93b","observation_id":"1c36bec2-bc86-4c75-b932-4a72101a1988","resolution":{"observed_at":"2026-08-07T12:38:44.176489Z","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-07T12:38:44.371250Z","title":"Simple yet effective heterogeneous graph contrastive learning for recommendation,","venue":null,"work_id":"d364c236-d154-4623-a850-30c4b99e4c4b","year":2025},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:43.442977Z"},"links":{"citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:64e25aa84c51d038b78d8198bc966ca0decd647070d3ca28dd71c844cff0269f","observation_id":"78c66bae-9ad0-42bd-91fa-14c5b9123320","resolution":{"observed_at":"2026-08-07T12:38:44.451280Z","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":"2504.07363","last_updated":"2025-04-23T05:11:59Z","snapshot_observed_at":"2026-08-07T16:07:01.034746Z","submitted_at":"2025-04-10T01:09:30Z","title":"Towards Distribution Matching between Collaborative and Language Spaces for Generative Recommendation","version":2},"cited_work":{"arxiv_id":"2504.07363","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.07363","snapshot_observed_at":"2026-08-07T12:38:43.834437Z","title":"Towards Distribution Matching between Collaborative and Language Spaces for Generative Recommendation","venue":"cs.IR","work_id":"ed304c4c-ef2f-4b6d-8d16-4d6491d736d9","year":2025},"citing_paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T12:38:43.625151Z"},"links":{"cited_paper":"/paper/2504.07363","citing_paper":"/paper/2505.24172"},"observation_digest":"sha256:d6739d3e0913a4ea1757f3de95e941e37177be5baca592a58a664d247c827a80","observation_id":"df95c0e9-f28e-4f2c-beb0-445e2e9e6c17","resolution":{"observed_at":"2026-08-07T12:38:43.955640Z","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"}}],"paper":{"arxiv_id":"2505.24172","last_updated":"2025-05-30T03:32:26Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T12:29:22.890789Z","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":50},"total_outbound_references":59},"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 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2505.24172."}