{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6GZGIGSA5X2DHGOWYYPJDTFVFP","short_pith_number":"pith:6GZGIGSA","canonical_record":{"source":{"id":"2204.09455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-20T13:41:50Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"3f4473ea1f8dbb7e12ee88b59e8fa614caecc8cfd500071872cc0640f68d359b","abstract_canon_sha256":"0909e2a61ed66e817ca087ff56bc2c6e7d2af9f7de670440e6f80f6c9c0e614d"},"schema_version":"1.0"},"canonical_sha256":"f1b2641a40edf43399d6c61e91ccb52bd676fe09eddd4e46950c9e8e2bc6e8c6","source":{"kind":"arxiv","id":"2204.09455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.09455","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"2204.09455v1","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.09455","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GZGIGSA5X2D","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_16","alias_value":"6GZGIGSA5X2DHGOW","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_8","alias_value":"6GZGIGSA","created_at":"2026-07-05T04:16:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6GZGIGSA5X2DHGOWYYPJDTFVFP","target":"record","payload":{"canonical_record":{"source":{"id":"2204.09455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-20T13:41:50Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"3f4473ea1f8dbb7e12ee88b59e8fa614caecc8cfd500071872cc0640f68d359b","abstract_canon_sha256":"0909e2a61ed66e817ca087ff56bc2c6e7d2af9f7de670440e6f80f6c9c0e614d"},"schema_version":"1.0"},"canonical_sha256":"f1b2641a40edf43399d6c61e91ccb52bd676fe09eddd4e46950c9e8e2bc6e8c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:24.782991Z","signature_b64":"lIgbFa3ADXr6hh2F/NYQG+D4iX2E9EmvEZGmwRIkmxPNW7oqc+vwqNC2jbq/XGODYrdZbpLSVkaDgmOnjNsvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1b2641a40edf43399d6c61e91ccb52bd676fe09eddd4e46950c9e8e2bc6e8c6","last_reissued_at":"2026-07-05T04:16:24.782490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:24.782490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.09455","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:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UO1JlKvMv3fhCMGvQR+w9xHukRxoSF5vqqX3+MosIulx/FlkepAfTpmfVMcB8UgdRPvIz+ZHhvDKDQFxCBFYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:46:07.135061Z"},"content_sha256":"7b27387090857e9b71bf6acfe94560d9dd8a64c8d663b5ea5cfd388a640caadf","schema_version":"1.0","event_id":"sha256:7b27387090857e9b71bf6acfe94560d9dd8a64c8d663b5ea5cfd388a640caadf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6GZGIGSA5X2DHGOWYYPJDTFVFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplicial Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.LG","authors_text":"Christopher Wei Jin Goh, Cristian Bodnar, Pietro Li\\`o","submitted_at":"2022-04-20T13:41:50Z","abstract_excerpt":"Graph representation learning methods have mostly been limited to the modelling of node-wise interactions. Recently, there has been an increased interest in understanding how higher-order structures can be utilised to further enhance the learning abilities of graph neural networks (GNNs) in combinatorial spaces. Simplicial Neural Networks (SNNs) naturally model these interactions by performing message passing on simplicial complexes, higher-dimensional generalisations of graphs. Nonetheless, the computations performed by most existent SNNs are strictly tied to the combinatorial structure of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.09455","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/2204.09455/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:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL4VmeLfddRhSf7AiGahrBU+O3wtmz4tORQZR38UWfBqVXosY4F6UbgoaDCcpy6n+RgyPHzMDVrnXxXIhfZ0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:46:07.135469Z"},"content_sha256":"d9ec6384a8faa87d677801c4733707ea95d03a36198af40b1479c1e1cb9edbf0","schema_version":"1.0","event_id":"sha256:d9ec6384a8faa87d677801c4733707ea95d03a36198af40b1479c1e1cb9edbf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/bundle.json","state_url":"https://pith.science/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/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-07T05:46:07Z","links":{"resolver":"https://pith.science/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP","bundle":"https://pith.science/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/bundle.json","state":"https://pith.science/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GZGIGSA5X2DHGOWYYPJDTFVFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6GZGIGSA5X2DHGOWYYPJDTFVFP","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":"0909e2a61ed66e817ca087ff56bc2c6e7d2af9f7de670440e6f80f6c9c0e614d","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-20T13:41:50Z","title_canon_sha256":"3f4473ea1f8dbb7e12ee88b59e8fa614caecc8cfd500071872cc0640f68d359b"},"schema_version":"1.0","source":{"id":"2204.09455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.09455","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"2204.09455v1","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.09455","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GZGIGSA5X2D","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_16","alias_value":"6GZGIGSA5X2DHGOW","created_at":"2026-07-05T04:16:24Z"},{"alias_kind":"pith_short_8","alias_value":"6GZGIGSA","created_at":"2026-07-05T04:16:24Z"}],"graph_snapshots":[{"event_id":"sha256:d9ec6384a8faa87d677801c4733707ea95d03a36198af40b1479c1e1cb9edbf0","target":"graph","created_at":"2026-07-05T04:16:24Z","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/2204.09455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph representation learning methods have mostly been limited to the modelling of node-wise interactions. Recently, there has been an increased interest in understanding how higher-order structures can be utilised to further enhance the learning abilities of graph neural networks (GNNs) in combinatorial spaces. Simplicial Neural Networks (SNNs) naturally model these interactions by performing message passing on simplicial complexes, higher-dimensional generalisations of graphs. Nonetheless, the computations performed by most existent SNNs are strictly tied to the combinatorial structure of th","authors_text":"Christopher Wei Jin Goh, Cristian Bodnar, Pietro Li\\`o","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-20T13:41:50Z","title":"Simplicial Attention Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.09455","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:7b27387090857e9b71bf6acfe94560d9dd8a64c8d663b5ea5cfd388a640caadf","target":"record","created_at":"2026-07-05T04:16:24Z","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":"0909e2a61ed66e817ca087ff56bc2c6e7d2af9f7de670440e6f80f6c9c0e614d","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-20T13:41:50Z","title_canon_sha256":"3f4473ea1f8dbb7e12ee88b59e8fa614caecc8cfd500071872cc0640f68d359b"},"schema_version":"1.0","source":{"id":"2204.09455","kind":"arxiv","version":1}},"canonical_sha256":"f1b2641a40edf43399d6c61e91ccb52bd676fe09eddd4e46950c9e8e2bc6e8c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1b2641a40edf43399d6c61e91ccb52bd676fe09eddd4e46950c9e8e2bc6e8c6","first_computed_at":"2026-07-05T04:16:24.782490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:24.782490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIgbFa3ADXr6hh2F/NYQG+D4iX2E9EmvEZGmwRIkmxPNW7oqc+vwqNC2jbq/XGODYrdZbpLSVkaDgmOnjNsvDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:24.782991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.09455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b27387090857e9b71bf6acfe94560d9dd8a64c8d663b5ea5cfd388a640caadf","sha256:d9ec6384a8faa87d677801c4733707ea95d03a36198af40b1479c1e1cb9edbf0"],"state_sha256":"b1e10015ab3b2fb87ac4ee3f3f8590b04647712afe4dc6c73efd2891682f48be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6ImqcGnurJSUVIuj2u2tzh/7PN8zmxAaQnR6++5O4CVsEmA47c0w41ANiYUBUV2TWxKa9/a87W7OQBSfA/5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:46:07.137618Z","bundle_sha256":"07e92fc79d7fd9954edd61c601a853f71fffd0fc446bd84d60ffc16026fc9e17"}}