{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GSTLFWJKWLCKOV2WKY5Z53ECI5","short_pith_number":"pith:GSTLFWJK","schema_version":"1.0","canonical_sha256":"34a6b2d92ab2c4a75756563b9eec82477d6447c672b33ffa4b14c98d451c4997","source":{"kind":"arxiv","id":"2305.07100","version":2},"attestation_state":"computed","paper":{"title":"E(n) Equivariant Message Passing Simplicial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Erik Bekkers, Floor Eijkelboom, Rob Hesselink","submitted_at":"2023-05-11T19:10:26Z","abstract_excerpt":"This paper presents $\\mathrm{E}(n)$ Equivariant Message Passing Simplicial Networks (EMPSNs), a novel approach to learning on geometric graphs and point clouds that is equivariant to rotations, translations, and reflections. EMPSNs can learn high-dimensional simplex features in graphs (e.g. triangles), and use the increase of geometric information of higher-dimensional simplices in an $\\mathrm{E}(n)$ equivariant fashion. EMPSNs simultaneously generalize $\\mathrm{E}(n)$ Equivariant Graph Neural Networks to a topologically more elaborate counterpart and provide an approach for including geometri"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.07100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-11T19:10:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0c1070e5c00f9ee91fbe019316d1c8ab8be7a93753c1df2cee4a86b1af54d584","abstract_canon_sha256":"43ee6dcbe924e7e379bd9509b776140011a5563d7c790d20bacaabfda3334c36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:24.295269Z","signature_b64":"2K0rkT9RQFFqMicJa6GA1s7OH05pmPK7hTcft9+FfGvyQemVB2x1WKELbrDafDaI4aqXkDqsVumGiScoIt8KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a6b2d92ab2c4a75756563b9eec82477d6447c672b33ffa4b14c98d451c4997","last_reissued_at":"2026-07-05T07:03:24.294804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:24.294804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"E(n) Equivariant Message Passing Simplicial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Erik Bekkers, Floor Eijkelboom, Rob Hesselink","submitted_at":"2023-05-11T19:10:26Z","abstract_excerpt":"This paper presents $\\mathrm{E}(n)$ Equivariant Message Passing Simplicial Networks (EMPSNs), a novel approach to learning on geometric graphs and point clouds that is equivariant to rotations, translations, and reflections. EMPSNs can learn high-dimensional simplex features in graphs (e.g. triangles), and use the increase of geometric information of higher-dimensional simplices in an $\\mathrm{E}(n)$ equivariant fashion. EMPSNs simultaneously generalize $\\mathrm{E}(n)$ Equivariant Graph Neural Networks to a topologically more elaborate counterpart and provide an approach for including geometri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07100","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.07100/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.07100","created_at":"2026-07-05T07:03:24.294858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.07100v2","created_at":"2026-07-05T07:03:24.294858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07100","created_at":"2026-07-05T07:03:24.294858+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSTLFWJKWLCK","created_at":"2026-07-05T07:03:24.294858+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSTLFWJKWLCKOV2W","created_at":"2026-07-05T07:03:24.294858+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSTLFWJK","created_at":"2026-07-05T07:03:24.294858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27864","citing_title":"A Unified Framework for Vision Transformers Equivariant to Discrete Subgroups of $\\mathrm{O}(2)$","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.27864","citing_title":"A Unified Framework for Vision Transformers Equivariant to Discrete Subgroups of $\\mathrm{O}(2)$","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5","json":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5.json","graph_json":"https://pith.science/api/pith-number/GSTLFWJKWLCKOV2WKY5Z53ECI5/graph.json","events_json":"https://pith.science/api/pith-number/GSTLFWJKWLCKOV2WKY5Z53ECI5/events.json","paper":"https://pith.science/paper/GSTLFWJK"},"agent_actions":{"view_html":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5","download_json":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5.json","view_paper":"https://pith.science/paper/GSTLFWJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.07100&json=true","fetch_graph":"https://pith.science/api/pith-number/GSTLFWJKWLCKOV2WKY5Z53ECI5/graph.json","fetch_events":"https://pith.science/api/pith-number/GSTLFWJKWLCKOV2WKY5Z53ECI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5/action/storage_attestation","attest_author":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5/action/author_attestation","sign_citation":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5/action/citation_signature","submit_replication":"https://pith.science/pith/GSTLFWJKWLCKOV2WKY5Z53ECI5/action/replication_record"}},"created_at":"2026-07-05T07:03:24.294858+00:00","updated_at":"2026-07-05T07:03:24.294858+00:00"}