{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AROGF7IPAWKEAMDUZWRZV4JRM6","short_pith_number":"pith:AROGF7IP","canonical_record":{"source":{"id":"2505.24172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-30T03:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"8116fc2d4d29263b0c3a6ba5302239856f13b3be0034e4ec2ed0f0da647a6886","abstract_canon_sha256":"6c12ed530a24e1947178226930950f6600410bf74888f22f2084c87c795471ea"},"schema_version":"1.0"},"canonical_sha256":"045c62fd0f0594403074cda39af13167883b1be0cf8f8b76471c3843a873c27e","source":{"kind":"arxiv","id":"2505.24172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24172","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24172v1","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24172","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"AROGF7IPAWKE","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_16","alias_value":"AROGF7IPAWKEAMDU","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_8","alias_value":"AROGF7IP","created_at":"2026-07-05T11:12:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AROGF7IPAWKEAMDUZWRZV4JRM6","target":"record","payload":{"canonical_record":{"source":{"id":"2505.24172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-30T03:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"8116fc2d4d29263b0c3a6ba5302239856f13b3be0034e4ec2ed0f0da647a6886","abstract_canon_sha256":"6c12ed530a24e1947178226930950f6600410bf74888f22f2084c87c795471ea"},"schema_version":"1.0"},"canonical_sha256":"045c62fd0f0594403074cda39af13167883b1be0cf8f8b76471c3843a873c27e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:43.329706Z","signature_b64":"jhs6Ud3BRC90yTFxWpy7+5nb+GB4SF9qbrhEaSFIZ8GATkAZwQ9NBax/UsS5UvY3Q4DP7BNVm6rL6F9ygPBjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"045c62fd0f0594403074cda39af13167883b1be0cf8f8b76471c3843a873c27e","last_reissued_at":"2026-07-05T11:12:43.329139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:43.329139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.24172","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/Xyaqykn9e3tIY3A6zkjV9cCBKWNCfo9n+hjXzRyHZ0OuMjY0MqRuyGh0HOHkbsTmVP0yH0bYne6MpvS87zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:02:44.742510Z"},"content_sha256":"fc1598023bbc6e28fede7da47b67c518d249414833213a81a481723947817bfc","schema_version":"1.0","event_id":"sha256:fc1598023bbc6e28fede7da47b67c518d249414833213a81a481723947817bfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AROGF7IPAWKEAMDUZWRZV4JRM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Lei Sang, Yiwen Zhang, Yu Wang","submitted_at":"2025-05-30T03:32:26Z","abstract_excerpt":"Heterogeneous graph neural networks (HGNNs) have demonstrated their superiority in exploiting auxiliary information for recommendation tasks. However, graphs constructed using meta-paths in HGNNs are usually too dense and contain a large number of noise edges. The propagation mechanism of HGNNs propagates even small amounts of noise in a graph to distant neighboring nodes, thereby affecting numerous node embeddings. To address this limitation, we introduce a novel model, named Masked Contrastive Learning (MCL), to enhance recommendation robustness to noise. MCL employs a random masking strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24172","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.24172/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIC/gbkiiLDbyWw2WfgP1JKStQZu7FZQgKYvwCXvFY+qzTGAuTGhy+I08et6beFp1uRmUalFCyWN3/LXUpa3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:02:44.743050Z"},"content_sha256":"94c8a83ca61d5ec12e8994b53ddaa42ee8ee5334de4e3d056b378b8aec8d5f5f","schema_version":"1.0","event_id":"sha256:94c8a83ca61d5ec12e8994b53ddaa42ee8ee5334de4e3d056b378b8aec8d5f5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/bundle.json","state_url":"https://pith.science/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T01:02:44Z","links":{"resolver":"https://pith.science/pith/AROGF7IPAWKEAMDUZWRZV4JRM6","bundle":"https://pith.science/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/bundle.json","state":"https://pith.science/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AROGF7IPAWKEAMDUZWRZV4JRM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AROGF7IPAWKEAMDUZWRZV4JRM6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6c12ed530a24e1947178226930950f6600410bf74888f22f2084c87c795471ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-30T03:32:26Z","title_canon_sha256":"8116fc2d4d29263b0c3a6ba5302239856f13b3be0034e4ec2ed0f0da647a6886"},"schema_version":"1.0","source":{"id":"2505.24172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24172","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24172v1","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24172","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"AROGF7IPAWKE","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_16","alias_value":"AROGF7IPAWKEAMDU","created_at":"2026-07-05T11:12:43Z"},{"alias_kind":"pith_short_8","alias_value":"AROGF7IP","created_at":"2026-07-05T11:12:43Z"}],"graph_snapshots":[{"event_id":"sha256:94c8a83ca61d5ec12e8994b53ddaa42ee8ee5334de4e3d056b378b8aec8d5f5f","target":"graph","created_at":"2026-07-05T11:12:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.24172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Heterogeneous graph neural networks (HGNNs) have demonstrated their superiority in exploiting auxiliary information for recommendation tasks. However, graphs constructed using meta-paths in HGNNs are usually too dense and contain a large number of noise edges. The propagation mechanism of HGNNs propagates even small amounts of noise in a graph to distant neighboring nodes, thereby affecting numerous node embeddings. To address this limitation, we introduce a novel model, named Masked Contrastive Learning (MCL), to enhance recommendation robustness to noise. MCL employs a random masking strateg","authors_text":"Lei Sang, Yiwen Zhang, Yu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-30T03:32:26Z","title":"Heterogeneous Graph Masked Contrastive Learning for Robust Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24172","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fc1598023bbc6e28fede7da47b67c518d249414833213a81a481723947817bfc","target":"record","created_at":"2026-07-05T11:12:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6c12ed530a24e1947178226930950f6600410bf74888f22f2084c87c795471ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-05-30T03:32:26Z","title_canon_sha256":"8116fc2d4d29263b0c3a6ba5302239856f13b3be0034e4ec2ed0f0da647a6886"},"schema_version":"1.0","source":{"id":"2505.24172","kind":"arxiv","version":1}},"canonical_sha256":"045c62fd0f0594403074cda39af13167883b1be0cf8f8b76471c3843a873c27e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"045c62fd0f0594403074cda39af13167883b1be0cf8f8b76471c3843a873c27e","first_computed_at":"2026-07-05T11:12:43.329139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:12:43.329139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jhs6Ud3BRC90yTFxWpy7+5nb+GB4SF9qbrhEaSFIZ8GATkAZwQ9NBax/UsS5UvY3Q4DP7BNVm6rL6F9ygPBjDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:12:43.329706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc1598023bbc6e28fede7da47b67c518d249414833213a81a481723947817bfc","sha256:94c8a83ca61d5ec12e8994b53ddaa42ee8ee5334de4e3d056b378b8aec8d5f5f"],"state_sha256":"657c3e8a4674c15539d80ea936ebe9fd64a8ae7ea17157a000bbbf7fcd9b0d02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/YGXRyW4IYXRDfUtnRrNU7FRA7IMByYNSMk4gnpFcPZVSqWkm5j3atm5e5iR/iSCsesoYWxjNebiXSWck7rBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:02:44.746323Z","bundle_sha256":"f0568cdc269b8db2b76c6459ff7a7fad9729d35c33f92b6142b1ab362c21ffda"}}