{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5GCHE2SZ3MXMFAK7C6X43SLLQD","short_pith_number":"pith:5GCHE2SZ","canonical_record":{"source":{"id":"2303.06344","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-11T08:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"cb9138716bbe0bf1e7cf3d8566ff7b39070e7f3960a95c2f16621d1a381a61dc","abstract_canon_sha256":"41712562debcc7f7f6db09f07a740f14ac77709320714efde70b8179fa56d987"},"schema_version":"1.0"},"canonical_sha256":"e984726a59db2ec2815f17afcdc96b80f7ef146901a88659a2c0dbbfe9e7a77a","source":{"kind":"arxiv","id":"2303.06344","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06344","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06344v2","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06344","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"5GCHE2SZ3MXM","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"5GCHE2SZ3MXMFAK7","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"5GCHE2SZ","created_at":"2026-07-05T08:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5GCHE2SZ3MXMFAK7C6X43SLLQD","target":"record","payload":{"canonical_record":{"source":{"id":"2303.06344","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-11T08:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"cb9138716bbe0bf1e7cf3d8566ff7b39070e7f3960a95c2f16621d1a381a61dc","abstract_canon_sha256":"41712562debcc7f7f6db09f07a740f14ac77709320714efde70b8179fa56d987"},"schema_version":"1.0"},"canonical_sha256":"e984726a59db2ec2815f17afcdc96b80f7ef146901a88659a2c0dbbfe9e7a77a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:44.088399Z","signature_b64":"Qq8S5dD67p/Nd0Iq48HplmHJOKrOK2kZcM73t+3wO2oiyTPET9bJLHNrDJp+kuQEO9xZuzYkElhTXbsZloYxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e984726a59db2ec2815f17afcdc96b80f7ef146901a88659a2c0dbbfe9e7a77a","last_reissued_at":"2026-07-05T08:29:44.088035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:44.088035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.06344","source_version":2,"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-05T08:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7wKPdr9rFPd5ou4Tqq3SzLdiSvxQxwq6TWocIlDK+/XzgrsFcVztvIJe14u7VB+480Kxm2OOvUPjQqaVhouCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:41:27.889721Z"},"content_sha256":"0b8092d94bf103961d22078d51e8b15df7d54f08de8a89c317e457a9e74d66d3","schema_version":"1.0","event_id":"sha256:0b8092d94bf103961d22078d51e8b15df7d54f08de8a89c317e457a9e74d66d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5GCHE2SZ3MXMFAK7C6X43SLLQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Contrastive Learning under Heterophily via Graph Filters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Baharan Mirzasoleiman, Wenhan Yang","submitted_at":"2023-03-11T08:32:39Z","abstract_excerpt":"Graph contrastive learning (CL) methods learn node representations in a self-supervised manner by maximizing the similarity between the augmented node representations obtained via a GNN-based encoder. However, CL methods perform poorly on graphs with heterophily, where connected nodes tend to belong to different classes. In this work, we address this problem by proposing an effective graph CL method, namely HLCL, for learning graph representations under heterophily. HLCL first identifies a homophilic and a heterophilic subgraph based on the cosine similarity of node features. It then uses a lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06344","kind":"arxiv","version":2},"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.06344/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-05T08:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpIgeNUc5h9z76tpahhVgIzphx9i4wiDqu3ItxkZOfVaxr3Se4S8UWyaw88guN23q/AGbiSmntqzS+Z6lw5sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:41:27.890364Z"},"content_sha256":"11382bc7473615892ccc0200f7270e1004e2a8ee2326954c17be5c874cd21659","schema_version":"1.0","event_id":"sha256:11382bc7473615892ccc0200f7270e1004e2a8ee2326954c17be5c874cd21659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/bundle.json","state_url":"https://pith.science/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/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-17T12:41:27Z","links":{"resolver":"https://pith.science/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD","bundle":"https://pith.science/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/bundle.json","state":"https://pith.science/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GCHE2SZ3MXMFAK7C6X43SLLQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5GCHE2SZ3MXMFAK7C6X43SLLQD","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":"41712562debcc7f7f6db09f07a740f14ac77709320714efde70b8179fa56d987","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-11T08:32:39Z","title_canon_sha256":"cb9138716bbe0bf1e7cf3d8566ff7b39070e7f3960a95c2f16621d1a381a61dc"},"schema_version":"1.0","source":{"id":"2303.06344","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.06344","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"2303.06344v2","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06344","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"5GCHE2SZ3MXM","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"5GCHE2SZ3MXMFAK7","created_at":"2026-07-05T08:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"5GCHE2SZ","created_at":"2026-07-05T08:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:11382bc7473615892ccc0200f7270e1004e2a8ee2326954c17be5c874cd21659","target":"graph","created_at":"2026-07-05T08:29:44Z","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.06344/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph contrastive learning (CL) methods learn node representations in a self-supervised manner by maximizing the similarity between the augmented node representations obtained via a GNN-based encoder. However, CL methods perform poorly on graphs with heterophily, where connected nodes tend to belong to different classes. In this work, we address this problem by proposing an effective graph CL method, namely HLCL, for learning graph representations under heterophily. HLCL first identifies a homophilic and a heterophilic subgraph based on the cosine similarity of node features. It then uses a lo","authors_text":"Baharan Mirzasoleiman, Wenhan Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-11T08:32:39Z","title":"Graph Contrastive Learning under Heterophily via Graph Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06344","kind":"arxiv","version":2},"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:0b8092d94bf103961d22078d51e8b15df7d54f08de8a89c317e457a9e74d66d3","target":"record","created_at":"2026-07-05T08:29:44Z","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":"41712562debcc7f7f6db09f07a740f14ac77709320714efde70b8179fa56d987","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-11T08:32:39Z","title_canon_sha256":"cb9138716bbe0bf1e7cf3d8566ff7b39070e7f3960a95c2f16621d1a381a61dc"},"schema_version":"1.0","source":{"id":"2303.06344","kind":"arxiv","version":2}},"canonical_sha256":"e984726a59db2ec2815f17afcdc96b80f7ef146901a88659a2c0dbbfe9e7a77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e984726a59db2ec2815f17afcdc96b80f7ef146901a88659a2c0dbbfe9e7a77a","first_computed_at":"2026-07-05T08:29:44.088035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:44.088035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qq8S5dD67p/Nd0Iq48HplmHJOKrOK2kZcM73t+3wO2oiyTPET9bJLHNrDJp+kuQEO9xZuzYkElhTXbsZloYxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:44.088399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.06344","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8092d94bf103961d22078d51e8b15df7d54f08de8a89c317e457a9e74d66d3","sha256:11382bc7473615892ccc0200f7270e1004e2a8ee2326954c17be5c874cd21659"],"state_sha256":"505747140e17cf358c71c70ff99bfe3a44cc65ff343bdd6354534857fec6a5ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DYseb+E9pnhFjw/PsibwHKmwMF8WnBIdwM6eU+sReXKavYREkXj2gAWqXbiQyueQek3JcLaRvas7Pu9VUjOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:41:27.978062Z","bundle_sha256":"0f9fd0522cd7087905ae0db45f81aabae7c7546905e60efc8666d1a024b749fd"}}