{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MQHDNCSNZDEDF26FOF5AS77Q2H","short_pith_number":"pith:MQHDNCSN","canonical_record":{"source":{"id":"2207.11761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T15:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"309c8079e8765c38c45f3d1e473ff8355ef0664f4764870236ccfacf811ae155","abstract_canon_sha256":"1fd2bca43ceb94dfb83c4f4f63cd36c3c030d786d5edb7053d3d8fbc6cdbd67c"},"schema_version":"1.0"},"canonical_sha256":"640e368a4dc8c832ebc5717a097ff0d1e4e05e4894fc99d2ca89947bb3975024","source":{"kind":"arxiv","id":"2207.11761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11761","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11761v1","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11761","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"MQHDNCSNZDED","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_16","alias_value":"MQHDNCSNZDEDF26F","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_8","alias_value":"MQHDNCSN","created_at":"2026-07-05T04:43:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MQHDNCSNZDEDF26FOF5AS77Q2H","target":"record","payload":{"canonical_record":{"source":{"id":"2207.11761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T15:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"309c8079e8765c38c45f3d1e473ff8355ef0664f4764870236ccfacf811ae155","abstract_canon_sha256":"1fd2bca43ceb94dfb83c4f4f63cd36c3c030d786d5edb7053d3d8fbc6cdbd67c"},"schema_version":"1.0"},"canonical_sha256":"640e368a4dc8c832ebc5717a097ff0d1e4e05e4894fc99d2ca89947bb3975024","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:43:09.029769Z","signature_b64":"Ybk6R7ZO8bXOUSrkNJwVC/tnZGmWtuuN0GVK1vokzReUI1UHgbXxrrf6+YxibOZaOJ9OebB/EYp2eDShZ0XeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"640e368a4dc8c832ebc5717a097ff0d1e4e05e4894fc99d2ca89947bb3975024","last_reissued_at":"2026-07-05T04:43:09.029242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:43:09.029242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.11761","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-05T04:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLd4rtyB13zuJVFPF31uTL7bYSv9eFVCjL8YxBJx8frQdBmS393gM4g5e82fN5FZCgu0ADX/ZmYpEgXrFCU6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:31:13.553694Z"},"content_sha256":"e0ccf4b19087e0212b1944b62464ffdadfd79f25afa5abbf6cdecabb84ee7327","schema_version":"1.0","event_id":"sha256:e0ccf4b19087e0212b1944b62464ffdadfd79f25afa5abbf6cdecabb84ee7327"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MQHDNCSNZDEDF26FOF5AS77Q2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SGAT: Simplicial Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feng Ji, See Hian Lee, Wee Peng Tay","submitted_at":"2022-07-24T15:20:41Z","abstract_excerpt":"Heterogeneous graphs have multiple node and edge types and are semantically richer than homogeneous graphs. To learn such complex semantics, many graph neural network approaches for heterogeneous graphs use metapaths to capture multi-hop interactions between nodes. Typically, features from non-target nodes are not incorporated into the learning procedure. However, there can be nonlinear, high-order interactions involving multiple nodes or edges. In this paper, we present Simplicial Graph Attention Network (SGAT), a simplicial complex approach to represent such high-order interactions by placin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11761","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/2207.11761/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-05T04:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtxXZw8aOud2xuceRfmgcbSa2tvDlXSX50wMp2mWhyyrMRocQ8qaYRFnkWdlW0gdGspdrf9AvaDoiZ4x3ri9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:31:13.554172Z"},"content_sha256":"9b4eb75a69aea843080245a952549cad4c1390edcf9c47b9c7d7768332c928f8","schema_version":"1.0","event_id":"sha256:9b4eb75a69aea843080245a952549cad4c1390edcf9c47b9c7d7768332c928f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/bundle.json","state_url":"https://pith.science/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/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-08T23:31:13Z","links":{"resolver":"https://pith.science/pith/MQHDNCSNZDEDF26FOF5AS77Q2H","bundle":"https://pith.science/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/bundle.json","state":"https://pith.science/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQHDNCSNZDEDF26FOF5AS77Q2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MQHDNCSNZDEDF26FOF5AS77Q2H","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":"1fd2bca43ceb94dfb83c4f4f63cd36c3c030d786d5edb7053d3d8fbc6cdbd67c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T15:20:41Z","title_canon_sha256":"309c8079e8765c38c45f3d1e473ff8355ef0664f4764870236ccfacf811ae155"},"schema_version":"1.0","source":{"id":"2207.11761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11761","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11761v1","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11761","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"MQHDNCSNZDED","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_16","alias_value":"MQHDNCSNZDEDF26F","created_at":"2026-07-05T04:43:09Z"},{"alias_kind":"pith_short_8","alias_value":"MQHDNCSN","created_at":"2026-07-05T04:43:09Z"}],"graph_snapshots":[{"event_id":"sha256:9b4eb75a69aea843080245a952549cad4c1390edcf9c47b9c7d7768332c928f8","target":"graph","created_at":"2026-07-05T04:43:09Z","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/2207.11761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Heterogeneous graphs have multiple node and edge types and are semantically richer than homogeneous graphs. To learn such complex semantics, many graph neural network approaches for heterogeneous graphs use metapaths to capture multi-hop interactions between nodes. Typically, features from non-target nodes are not incorporated into the learning procedure. However, there can be nonlinear, high-order interactions involving multiple nodes or edges. In this paper, we present Simplicial Graph Attention Network (SGAT), a simplicial complex approach to represent such high-order interactions by placin","authors_text":"Feng Ji, See Hian Lee, Wee Peng Tay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T15:20:41Z","title":"SGAT: Simplicial Graph Attention Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11761","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:e0ccf4b19087e0212b1944b62464ffdadfd79f25afa5abbf6cdecabb84ee7327","target":"record","created_at":"2026-07-05T04:43:09Z","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":"1fd2bca43ceb94dfb83c4f4f63cd36c3c030d786d5edb7053d3d8fbc6cdbd67c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-24T15:20:41Z","title_canon_sha256":"309c8079e8765c38c45f3d1e473ff8355ef0664f4764870236ccfacf811ae155"},"schema_version":"1.0","source":{"id":"2207.11761","kind":"arxiv","version":1}},"canonical_sha256":"640e368a4dc8c832ebc5717a097ff0d1e4e05e4894fc99d2ca89947bb3975024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"640e368a4dc8c832ebc5717a097ff0d1e4e05e4894fc99d2ca89947bb3975024","first_computed_at":"2026-07-05T04:43:09.029242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:43:09.029242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ybk6R7ZO8bXOUSrkNJwVC/tnZGmWtuuN0GVK1vokzReUI1UHgbXxrrf6+YxibOZaOJ9OebB/EYp2eDShZ0XeAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:43:09.029769Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.11761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ccf4b19087e0212b1944b62464ffdadfd79f25afa5abbf6cdecabb84ee7327","sha256:9b4eb75a69aea843080245a952549cad4c1390edcf9c47b9c7d7768332c928f8"],"state_sha256":"f7bb959616f64d43603d35d2d3537793888ac204e49a4710e6a3fa8ce0bd22ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BU0PJ00nRiQIVHBOVMSS/Xo3q74Sl7ufqFMuq3lnePMznrOMfKbDjdS4/UfqV5JzXx/ePK/TKckgy1YTDVMKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:31:13.557565Z","bundle_sha256":"4ab9a28e20feb4d0b141a13d007e2840cc621664344fbed6d870a8a13161daa0"}}