{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IT56NB44MBVLVSKL77UPKPW3U4","short_pith_number":"pith:IT56NB44","canonical_record":{"source":{"id":"2303.00995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-02T06:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"6302b4919c9d2ece6ea68933c4bc19075c0525211436a5c3b97fd69bf1e5013c","abstract_canon_sha256":"3f91af04a404a99474264fb1392367fe5b51ee7761beadc8d4608ad870aacc62"},"schema_version":"1.0"},"canonical_sha256":"44fbe6879c606abac94bffe8f53edba71b13067eb03fb28ddd1307ecbd5d5777","source":{"kind":"arxiv","id":"2303.00995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00995","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00995v1","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00995","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"IT56NB44MBVL","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_16","alias_value":"IT56NB44MBVLVSKL","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_8","alias_value":"IT56NB44","created_at":"2026-07-05T05:47:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IT56NB44MBVLVSKL77UPKPW3U4","target":"record","payload":{"canonical_record":{"source":{"id":"2303.00995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-02T06:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"6302b4919c9d2ece6ea68933c4bc19075c0525211436a5c3b97fd69bf1e5013c","abstract_canon_sha256":"3f91af04a404a99474264fb1392367fe5b51ee7761beadc8d4608ad870aacc62"},"schema_version":"1.0"},"canonical_sha256":"44fbe6879c606abac94bffe8f53edba71b13067eb03fb28ddd1307ecbd5d5777","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:25.473699Z","signature_b64":"gbF2fGv2F4EcBPrgvWKLvdfImz9fA+gq7Nz5xpIeIij3ZMZ35DIwlKzGmFmfdyeoxAumA+5vRraPPYYZbMXTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44fbe6879c606abac94bffe8f53edba71b13067eb03fb28ddd1307ecbd5d5777","last_reissued_at":"2026-07-05T05:47:25.473201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:25.473201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.00995","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-05T05:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RE60jfV+vwBFnq7xKTnRIGqscEDmF8k0JVf4NdfNIbwSXUrJsd81tglGcZ2ooplxkwrKGC88HJ2lsFqp6+e0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:29:24.945600Z"},"content_sha256":"7fc2f552b238fb3063a41c01b36b109a560555db9e17954683a6a357670674a3","schema_version":"1.0","event_id":"sha256:7fc2f552b238fb3063a41c01b36b109a560555db9e17954683a6a357670674a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IT56NB44MBVLVSKL77UPKPW3U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Graph Contrastive Learning for Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chao Huang, Lianghao Xia, Mengru Chen, Ronghua Luo, Wei Wei, Yong Xu","submitted_at":"2023-03-02T06:07:22Z","abstract_excerpt":"Graph Neural Networks (GNNs) have become powerful tools in modeling graph-structured data in recommender systems. However, real-life recommendation scenarios usually involve heterogeneous relationships (e.g., social-aware user influence, knowledge-aware item dependency) which contains fruitful information to enhance the user preference learning. In this paper, we study the problem of heterogeneous graph-enhanced relational learning for recommendation. Recently, contrastive self-supervised learning has become successful in recommendation. In light of this, we propose a Heterogeneous Graph Contr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00995","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/2303.00995/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-05T05:47:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NsT3wRik8mXxmXKiOcvww8sNqetrbsv9S6khuIXcS6N9DOe7XcnE7PlAojsq1YRBEJjpUZ+PhxJ/FfFHI0FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:29:24.946516Z"},"content_sha256":"47712efe2b7c1917de920eb90c0ecce47158592f528f73f90eeeba826d86591c","schema_version":"1.0","event_id":"sha256:47712efe2b7c1917de920eb90c0ecce47158592f528f73f90eeeba826d86591c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT56NB44MBVLVSKL77UPKPW3U4/bundle.json","state_url":"https://pith.science/pith/IT56NB44MBVLVSKL77UPKPW3U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT56NB44MBVLVSKL77UPKPW3U4/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-11T00:29:24Z","links":{"resolver":"https://pith.science/pith/IT56NB44MBVLVSKL77UPKPW3U4","bundle":"https://pith.science/pith/IT56NB44MBVLVSKL77UPKPW3U4/bundle.json","state":"https://pith.science/pith/IT56NB44MBVLVSKL77UPKPW3U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT56NB44MBVLVSKL77UPKPW3U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IT56NB44MBVLVSKL77UPKPW3U4","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":"3f91af04a404a99474264fb1392367fe5b51ee7761beadc8d4608ad870aacc62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-02T06:07:22Z","title_canon_sha256":"6302b4919c9d2ece6ea68933c4bc19075c0525211436a5c3b97fd69bf1e5013c"},"schema_version":"1.0","source":{"id":"2303.00995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.00995","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"arxiv_version","alias_value":"2303.00995v1","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.00995","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_12","alias_value":"IT56NB44MBVL","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_16","alias_value":"IT56NB44MBVLVSKL","created_at":"2026-07-05T05:47:25Z"},{"alias_kind":"pith_short_8","alias_value":"IT56NB44","created_at":"2026-07-05T05:47:25Z"}],"graph_snapshots":[{"event_id":"sha256:47712efe2b7c1917de920eb90c0ecce47158592f528f73f90eeeba826d86591c","target":"graph","created_at":"2026-07-05T05:47:25Z","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/2303.00995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) have become powerful tools in modeling graph-structured data in recommender systems. However, real-life recommendation scenarios usually involve heterogeneous relationships (e.g., social-aware user influence, knowledge-aware item dependency) which contains fruitful information to enhance the user preference learning. In this paper, we study the problem of heterogeneous graph-enhanced relational learning for recommendation. Recently, contrastive self-supervised learning has become successful in recommendation. In light of this, we propose a Heterogeneous Graph Contr","authors_text":"Chao Huang, Lianghao Xia, Mengru Chen, Ronghua Luo, Wei Wei, Yong Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-02T06:07:22Z","title":"Heterogeneous Graph Contrastive Learning for Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.00995","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:7fc2f552b238fb3063a41c01b36b109a560555db9e17954683a6a357670674a3","target":"record","created_at":"2026-07-05T05:47:25Z","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":"3f91af04a404a99474264fb1392367fe5b51ee7761beadc8d4608ad870aacc62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-03-02T06:07:22Z","title_canon_sha256":"6302b4919c9d2ece6ea68933c4bc19075c0525211436a5c3b97fd69bf1e5013c"},"schema_version":"1.0","source":{"id":"2303.00995","kind":"arxiv","version":1}},"canonical_sha256":"44fbe6879c606abac94bffe8f53edba71b13067eb03fb28ddd1307ecbd5d5777","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44fbe6879c606abac94bffe8f53edba71b13067eb03fb28ddd1307ecbd5d5777","first_computed_at":"2026-07-05T05:47:25.473201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:25.473201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gbF2fGv2F4EcBPrgvWKLvdfImz9fA+gq7Nz5xpIeIij3ZMZ35DIwlKzGmFmfdyeoxAumA+5vRraPPYYZbMXTDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:25.473699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.00995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc2f552b238fb3063a41c01b36b109a560555db9e17954683a6a357670674a3","sha256:47712efe2b7c1917de920eb90c0ecce47158592f528f73f90eeeba826d86591c"],"state_sha256":"2feac188e42c4d8f4a92c1565fc56e2f78c540bf633b9b681abe3e3dd63f8c9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Re9FIiygAG5hTwrqcj6kiZZK+56QB3GO3gtVI0kGBO0ishCemIMNrd6WTbJqOquCoqR83ns8W/Dwdfv5OWwDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T00:29:24.952792Z","bundle_sha256":"05e14f3730589ff976368f68f7257c27d18d3c31804e13e1c1623a3d18f27f0d"}}