{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZV6B2OPZ4A7AMNQPBHLLOAIZRB","short_pith_number":"pith:ZV6B2OPZ","schema_version":"1.0","canonical_sha256":"cd7c1d39f9e03e06360f09d6b701198867ba1a514df77f83fde36436d6b900a6","source":{"kind":"arxiv","id":"2103.03212","version":2},"attestation_state":"computed","paper":{"title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Cristian Bodnar, Fabrizio Frasca, Guido Mont\\'ufar, Michael Bronstein, Nina Otter, Pietro Li\\`o, Yu Guang Wang","submitted_at":"2021-03-04T18:35:24Z","abstract_excerpt":"The pairwise interaction paradigm of graph machine learning has predominantly governed the modelling of relational systems. However, graphs alone cannot capture the multi-level interactions present in many complex systems and the expressive power of such schemes was proven to be limited. To overcome these limitations, we propose Message Passing Simplicial Networks (MPSNs), a class of models that perform message passing on simplicial complexes (SCs). To theoretically analyse the expressivity of our model we introduce a Simplicial Weisfeiler-Lehman (SWL) colouring procedure for distinguishing no"},"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":"2103.03212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-04T18:35:24Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"51e2ac421c62398a4bc0c943d689d23c218129d5592109f2c6f101b847811fcc","abstract_canon_sha256":"aa6b3ea6d410f293654b79ce20165632e35aeb992e9eac9cecebd33867acfb02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:59.852389Z","signature_b64":"VDzycGwOQqX0aSUzIMLa/tEUnT4uUs/s+Q4SHIPNzpUyEI4V+Ghqa9WpKHBL9HKEhyYvWsYtOxRGw0H+7R2ICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd7c1d39f9e03e06360f09d6b701198867ba1a514df77f83fde36436d6b900a6","last_reissued_at":"2026-07-05T02:48:59.851900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:59.851900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Cristian Bodnar, Fabrizio Frasca, Guido Mont\\'ufar, Michael Bronstein, Nina Otter, Pietro Li\\`o, Yu Guang Wang","submitted_at":"2021-03-04T18:35:24Z","abstract_excerpt":"The pairwise interaction paradigm of graph machine learning has predominantly governed the modelling of relational systems. However, graphs alone cannot capture the multi-level interactions present in many complex systems and the expressive power of such schemes was proven to be limited. To overcome these limitations, we propose Message Passing Simplicial Networks (MPSNs), a class of models that perform message passing on simplicial complexes (SCs). To theoretically analyse the expressivity of our model we introduce a Simplicial Weisfeiler-Lehman (SWL) colouring procedure for distinguishing no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03212","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/2103.03212/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":"2103.03212","created_at":"2026-07-05T02:48:59.851957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03212v2","created_at":"2026-07-05T02:48:59.851957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03212","created_at":"2026-07-05T02:48:59.851957+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZV6B2OPZ4A7A","created_at":"2026-07-05T02:48:59.851957+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZV6B2OPZ4A7AMNQP","created_at":"2026-07-05T02:48:59.851957+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZV6B2OPZ","created_at":"2026-07-05T02:48:59.851957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13568","citing_title":"Adjusted Cup-Product Neural Layer","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28864","citing_title":"The Cognitive Categorical Transformer: Category-Theoretic Inductive Biases for Language Modeling","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB","json":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB.json","graph_json":"https://pith.science/api/pith-number/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/graph.json","events_json":"https://pith.science/api/pith-number/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/events.json","paper":"https://pith.science/paper/ZV6B2OPZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB","download_json":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB.json","view_paper":"https://pith.science/paper/ZV6B2OPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03212&json=true","fetch_graph":"https://pith.science/api/pith-number/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/action/storage_attestation","attest_author":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/action/author_attestation","sign_citation":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/action/citation_signature","submit_replication":"https://pith.science/pith/ZV6B2OPZ4A7AMNQPBHLLOAIZRB/action/replication_record"}},"created_at":"2026-07-05T02:48:59.851957+00:00","updated_at":"2026-07-05T02:48:59.851957+00:00"}