{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:26JDTL2A6S63XNXKGV2Z73SYFN","short_pith_number":"pith:26JDTL2A","canonical_record":{"source":{"id":"2305.18385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T09:38:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"98d7a39239a84800a1b262d39ae63c5f6759d6487147eb9f96ab69e641c742f8","abstract_canon_sha256":"2a1f1cd20a3a5b5ef6690dd4f4eaa5ba966276e5b4ef1b988d6669df580da77b"},"schema_version":"1.0"},"canonical_sha256":"d79239af40f4bdbbb6ea35759fee582b6069c379a28819de310c40fb87f7e8ec","source":{"kind":"arxiv","id":"2305.18385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18385","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18385v2","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18385","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"26JDTL2A6S63","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"26JDTL2A6S63XNXK","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"26JDTL2A","created_at":"2026-07-05T09:08:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:26JDTL2A6S63XNXKGV2Z73SYFN","target":"record","payload":{"canonical_record":{"source":{"id":"2305.18385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T09:38:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"98d7a39239a84800a1b262d39ae63c5f6759d6487147eb9f96ab69e641c742f8","abstract_canon_sha256":"2a1f1cd20a3a5b5ef6690dd4f4eaa5ba966276e5b4ef1b988d6669df580da77b"},"schema_version":"1.0"},"canonical_sha256":"d79239af40f4bdbbb6ea35759fee582b6069c379a28819de310c40fb87f7e8ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:45.128578Z","signature_b64":"XOBQ8twoqwkXTGpUV4zHWGWRpS+XtReki4/27f/X877sY16uoSH2WTKWng3kTURzpcQqkgAxXa4rwWn345Q5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79239af40f4bdbbb6ea35759fee582b6069c379a28819de310c40fb87f7e8ec","last_reissued_at":"2026-07-05T09:08:45.128008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:45.128008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.18385","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-05T09:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hdu/QXwunUir4xCIkYp8mtGYiyBzfIjDm67bDwPLlXfSmxKxU93dWMGFQ7+BSP6g8/epyOMSJf7lPh5aubFUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:47:50.806349Z"},"content_sha256":"130e424c26c6628ade40e4a67e4045c384cde639e3021237015f959875f11889","schema_version":"1.0","event_id":"sha256:130e424c26c6628ade40e4a67e4045c384cde639e3021237015f959875f11889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:26JDTL2A6S63XNXKGV2Z73SYFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-attention Dual Embedding for Graphs with Heterophily","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Rui Fan, Taiyan Zhang, Yurui Lai","submitted_at":"2023-05-28T09:38:28Z","abstract_excerpt":"Graph Neural Networks (GNNs) have been highly successful for the node classification task. GNNs typically assume graphs are homophilic, i.e. neighboring nodes are likely to belong to the same class. However, a number of real-world graphs are heterophilic, and this leads to much lower classification accuracy using standard GNNs. In this work, we design a novel GNN which is effective for both heterophilic and homophilic graphs. Our work is based on three main observations. First, we show that node features and graph topology provide different amounts of informativeness in different graphs, and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18385","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/2305.18385/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-05T09:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZuRNqv//gE8u90S0YmN82Ozs3kgObKz2uYxw77gUTElFdC79MXr5O86OtWl8VNbMNyxsggrKpi3v087Pw3wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:47:50.806712Z"},"content_sha256":"6677d967b66f5deda2657f0100405477bbf19463de1c60de38f92b48636e5a72","schema_version":"1.0","event_id":"sha256:6677d967b66f5deda2657f0100405477bbf19463de1c60de38f92b48636e5a72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26JDTL2A6S63XNXKGV2Z73SYFN/bundle.json","state_url":"https://pith.science/pith/26JDTL2A6S63XNXKGV2Z73SYFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26JDTL2A6S63XNXKGV2Z73SYFN/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-07-06T20:47:50Z","links":{"resolver":"https://pith.science/pith/26JDTL2A6S63XNXKGV2Z73SYFN","bundle":"https://pith.science/pith/26JDTL2A6S63XNXKGV2Z73SYFN/bundle.json","state":"https://pith.science/pith/26JDTL2A6S63XNXKGV2Z73SYFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26JDTL2A6S63XNXKGV2Z73SYFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:26JDTL2A6S63XNXKGV2Z73SYFN","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":"2a1f1cd20a3a5b5ef6690dd4f4eaa5ba966276e5b4ef1b988d6669df580da77b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T09:38:28Z","title_canon_sha256":"98d7a39239a84800a1b262d39ae63c5f6759d6487147eb9f96ab69e641c742f8"},"schema_version":"1.0","source":{"id":"2305.18385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18385","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18385v2","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18385","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"26JDTL2A6S63","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"26JDTL2A6S63XNXK","created_at":"2026-07-05T09:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"26JDTL2A","created_at":"2026-07-05T09:08:45Z"}],"graph_snapshots":[{"event_id":"sha256:6677d967b66f5deda2657f0100405477bbf19463de1c60de38f92b48636e5a72","target":"graph","created_at":"2026-07-05T09:08:45Z","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/2305.18385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) have been highly successful for the node classification task. GNNs typically assume graphs are homophilic, i.e. neighboring nodes are likely to belong to the same class. However, a number of real-world graphs are heterophilic, and this leads to much lower classification accuracy using standard GNNs. In this work, we design a novel GNN which is effective for both heterophilic and homophilic graphs. Our work is based on three main observations. First, we show that node features and graph topology provide different amounts of informativeness in different graphs, and t","authors_text":"Rui Fan, Taiyan Zhang, Yurui Lai","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T09:38:28Z","title":"Self-attention Dual Embedding for Graphs with Heterophily"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18385","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:130e424c26c6628ade40e4a67e4045c384cde639e3021237015f959875f11889","target":"record","created_at":"2026-07-05T09:08:45Z","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":"2a1f1cd20a3a5b5ef6690dd4f4eaa5ba966276e5b4ef1b988d6669df580da77b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T09:38:28Z","title_canon_sha256":"98d7a39239a84800a1b262d39ae63c5f6759d6487147eb9f96ab69e641c742f8"},"schema_version":"1.0","source":{"id":"2305.18385","kind":"arxiv","version":2}},"canonical_sha256":"d79239af40f4bdbbb6ea35759fee582b6069c379a28819de310c40fb87f7e8ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79239af40f4bdbbb6ea35759fee582b6069c379a28819de310c40fb87f7e8ec","first_computed_at":"2026-07-05T09:08:45.128008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:08:45.128008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOBQ8twoqwkXTGpUV4zHWGWRpS+XtReki4/27f/X877sY16uoSH2WTKWng3kTURzpcQqkgAxXa4rwWn345Q5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:08:45.128578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.18385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:130e424c26c6628ade40e4a67e4045c384cde639e3021237015f959875f11889","sha256:6677d967b66f5deda2657f0100405477bbf19463de1c60de38f92b48636e5a72"],"state_sha256":"7098b7e55c0a19dc495931d9cc55e3f5c84402cdd80808d42d43fd925ffeec29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33NvguPmYI0YO86OLdoW6RX3fQTYuUe4tcUbS9vaO8TwdG2A3SJrhjBtvyCIUXY+VdkXYUwiAixgT7kI0SybAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:47:50.808561Z","bundle_sha256":"8517c07dcaa325b3ca3147a8d9cc9a045523aae2da98a935b9361f04a972974f"}}