{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2GSDW2N4WIGI7HGGEJWXWYH5TG","short_pith_number":"pith:2GSDW2N4","canonical_record":{"source":{"id":"2211.14065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-25T12:39:41Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"824b2bee3a13b3c16e8ffbc0f9c1a18f8241d7fc458d3e314c34fa25d5aa5b3c","abstract_canon_sha256":"e575b47bc2667a9198ea3498d6f450a486ab700f3ca332277c91380e1247bf9e"},"schema_version":"1.0"},"canonical_sha256":"d1a43b69bcb20c8f9cc6226d7b60fd9987c87f13127b9295ed7ad2f2ada4cd13","source":{"kind":"arxiv","id":"2211.14065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14065","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14065v1","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14065","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_12","alias_value":"2GSDW2N4WIGI","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_16","alias_value":"2GSDW2N4WIGI7HGG","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_8","alias_value":"2GSDW2N4","created_at":"2026-07-05T05:19:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2GSDW2N4WIGI7HGGEJWXWYH5TG","target":"record","payload":{"canonical_record":{"source":{"id":"2211.14065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-25T12:39:41Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"824b2bee3a13b3c16e8ffbc0f9c1a18f8241d7fc458d3e314c34fa25d5aa5b3c","abstract_canon_sha256":"e575b47bc2667a9198ea3498d6f450a486ab700f3ca332277c91380e1247bf9e"},"schema_version":"1.0"},"canonical_sha256":"d1a43b69bcb20c8f9cc6226d7b60fd9987c87f13127b9295ed7ad2f2ada4cd13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:29.267907Z","signature_b64":"jffZM51eh6sOjik4TR0Hh7szC8oAbcsO7CNCVgctXCuslOOYt9JcQJYR6sUxvCNutqL427FW3b1BOEo4PgJtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1a43b69bcb20c8f9cc6226d7b60fd9987c87f13127b9295ed7ad2f2ada4cd13","last_reissued_at":"2026-07-05T05:19:29.267541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:29.267541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.14065","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:19:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7uIe76OUD0kRenkkY4K2Oj+5hEdKdrqJpqb0RJHf82vIESzkNdH2DmGL2/TK1Cs3XJzx6dyTDch6KQ7krvGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T23:02:46.662284Z"},"content_sha256":"83ac76be68753017ebcb2895ede751057995c351b4ff2ce56d10fd766fdfb466","schema_version":"1.0","event_id":"sha256:83ac76be68753017ebcb2895ede751057995c351b4ff2ce56d10fd766fdfb466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2GSDW2N4WIGI7HGGEJWXWYH5TG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Daokun Zhang, Shirui Pan, Vincent CS Lee, Yixin Liu, Yizhen Zheng","submitted_at":"2022-11-25T12:39:41Z","abstract_excerpt":"Unsupervised graph representation learning (UGRL) has drawn increasing research attention and achieved promising results in several graph analytic tasks. Relying on the homophily assumption, existing UGRL methods tend to smooth the learned node representations along all edges, ignoring the existence of heterophilic edges that connect nodes with distinct attributes. As a result, current methods are hard to generalize to heterophilic graphs where dissimilar nodes are widely connected, and also vulnerable to adversarial attacks. To address this issue, we propose a novel unsupervised Graph Represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14065","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/2211.14065/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:19:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzlLKaamvu0wcxQIZCQZOocjX93LCDOHvid+vpu1ejCtq2hDWURd3Jm4Jo5QBfx5my1nEKmJ/zfOyCB+N2CTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T23:02:46.663197Z"},"content_sha256":"c08973b5928522e9922395c218403ec52212c13a6c096e87250062130cdef5f8","schema_version":"1.0","event_id":"sha256:c08973b5928522e9922395c218403ec52212c13a6c096e87250062130cdef5f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/bundle.json","state_url":"https://pith.science/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/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-06T23:02:46Z","links":{"resolver":"https://pith.science/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG","bundle":"https://pith.science/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/bundle.json","state":"https://pith.science/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GSDW2N4WIGI7HGGEJWXWYH5TG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2GSDW2N4WIGI7HGGEJWXWYH5TG","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":"e575b47bc2667a9198ea3498d6f450a486ab700f3ca332277c91380e1247bf9e","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-25T12:39:41Z","title_canon_sha256":"824b2bee3a13b3c16e8ffbc0f9c1a18f8241d7fc458d3e314c34fa25d5aa5b3c"},"schema_version":"1.0","source":{"id":"2211.14065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14065","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14065v1","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14065","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_12","alias_value":"2GSDW2N4WIGI","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_16","alias_value":"2GSDW2N4WIGI7HGG","created_at":"2026-07-05T05:19:29Z"},{"alias_kind":"pith_short_8","alias_value":"2GSDW2N4","created_at":"2026-07-05T05:19:29Z"}],"graph_snapshots":[{"event_id":"sha256:c08973b5928522e9922395c218403ec52212c13a6c096e87250062130cdef5f8","target":"graph","created_at":"2026-07-05T05:19:29Z","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/2211.14065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Unsupervised graph representation learning (UGRL) has drawn increasing research attention and achieved promising results in several graph analytic tasks. Relying on the homophily assumption, existing UGRL methods tend to smooth the learned node representations along all edges, ignoring the existence of heterophilic edges that connect nodes with distinct attributes. As a result, current methods are hard to generalize to heterophilic graphs where dissimilar nodes are widely connected, and also vulnerable to adversarial attacks. To address this issue, we propose a novel unsupervised Graph Represe","authors_text":"Daokun Zhang, Shirui Pan, Vincent CS Lee, Yixin Liu, Yizhen Zheng","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-25T12:39:41Z","title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14065","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:83ac76be68753017ebcb2895ede751057995c351b4ff2ce56d10fd766fdfb466","target":"record","created_at":"2026-07-05T05:19:29Z","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":"e575b47bc2667a9198ea3498d6f450a486ab700f3ca332277c91380e1247bf9e","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-25T12:39:41Z","title_canon_sha256":"824b2bee3a13b3c16e8ffbc0f9c1a18f8241d7fc458d3e314c34fa25d5aa5b3c"},"schema_version":"1.0","source":{"id":"2211.14065","kind":"arxiv","version":1}},"canonical_sha256":"d1a43b69bcb20c8f9cc6226d7b60fd9987c87f13127b9295ed7ad2f2ada4cd13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1a43b69bcb20c8f9cc6226d7b60fd9987c87f13127b9295ed7ad2f2ada4cd13","first_computed_at":"2026-07-05T05:19:29.267541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:19:29.267541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jffZM51eh6sOjik4TR0Hh7szC8oAbcsO7CNCVgctXCuslOOYt9JcQJYR6sUxvCNutqL427FW3b1BOEo4PgJtDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:19:29.267907Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.14065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ac76be68753017ebcb2895ede751057995c351b4ff2ce56d10fd766fdfb466","sha256:c08973b5928522e9922395c218403ec52212c13a6c096e87250062130cdef5f8"],"state_sha256":"c1b7d7d600fe7499e4357a1201b9a34e3871bc0d3d3f335745d949b892e16a5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztSst3b6sCeCaNNsHuxOrpjcXh+5vONRFHnw4CVuYr7jgv6KCkvCBWO1sdwh/QnMjlVjtYwNM43zxnSYYNZZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T23:02:46.669087Z","bundle_sha256":"59627b25e5de6c284c4e0c848fd2e40dde26a3682517f3ebb130369ea1305a58"}}