{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:62OROKGBRARP6CCAUAE6YJF7UE","short_pith_number":"pith:62OROKGB","schema_version":"1.0","canonical_sha256":"f69d1728c18822ff0840a009ec24bfa11a965e13646677abf9ca542577a50319","source":{"kind":"arxiv","id":"2010.00743","version":4},"attestation_state":"computed","paper":{"title":"Cell Complex Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.AT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ghada Zamzmi, Kyle Istvan, Mustafa Hajij","submitted_at":"2020-10-02T01:38:12Z","abstract_excerpt":"Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a combinatorial formalism that allows the inclusion of complicated relationships of restrictive structures such as graphs and meshes. In this paper, we propose \\textbf{Cell Complexes Neural Networks (CXNs)}, a general, combinatorial and unifying construction for performing neural network-type computations on cell complexes. We introduce an inter-cellular message passing"},"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":"2010.00743","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-02T01:38:12Z","cross_cats_sorted":["cs.CG","cs.CV","math.AT","stat.ML"],"title_canon_sha256":"7b567cc39c0c3d3f084447e546dd8defd86bc6c2ec60d96a43e01172f9b82c9c","abstract_canon_sha256":"e30f176f14bd908ecfb13daf39b02477921fc43d0c0e6c0e076ed946ec3c1cae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:15.494901Z","signature_b64":"T15K7zRLu6b6Agwwwj0CY+Fy1797kTKNHrro7jWiSfU0/hTXo5xvfY3aGdjCI4vwj4BhDRF4+iHTksXLWv5OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f69d1728c18822ff0840a009ec24bfa11a965e13646677abf9ca542577a50319","last_reissued_at":"2026-07-05T02:19:15.494444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:15.494444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cell Complex Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.AT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ghada Zamzmi, Kyle Istvan, Mustafa Hajij","submitted_at":"2020-10-02T01:38:12Z","abstract_excerpt":"Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a combinatorial formalism that allows the inclusion of complicated relationships of restrictive structures such as graphs and meshes. In this paper, we propose \\textbf{Cell Complexes Neural Networks (CXNs)}, a general, combinatorial and unifying construction for performing neural network-type computations on cell complexes. We introduce an inter-cellular message passing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00743","kind":"arxiv","version":4},"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/2010.00743/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":"2010.00743","created_at":"2026-07-05T02:19:15.494501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00743v4","created_at":"2026-07-05T02:19:15.494501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00743","created_at":"2026-07-05T02:19:15.494501+00:00"},{"alias_kind":"pith_short_12","alias_value":"62OROKGBRARP","created_at":"2026-07-05T02:19:15.494501+00:00"},{"alias_kind":"pith_short_16","alias_value":"62OROKGBRARP6CCA","created_at":"2026-07-05T02:19:15.494501+00:00"},{"alias_kind":"pith_short_8","alias_value":"62OROKGB","created_at":"2026-07-05T02:19:15.494501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23517","citing_title":"Collapsed Effective Operators for Higher-order Structures","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":272,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":172,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10091","citing_title":"TopoU-Net: a U-Net architecture for topological domains","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE","json":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE.json","graph_json":"https://pith.science/api/pith-number/62OROKGBRARP6CCAUAE6YJF7UE/graph.json","events_json":"https://pith.science/api/pith-number/62OROKGBRARP6CCAUAE6YJF7UE/events.json","paper":"https://pith.science/paper/62OROKGB"},"agent_actions":{"view_html":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE","download_json":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE.json","view_paper":"https://pith.science/paper/62OROKGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00743&json=true","fetch_graph":"https://pith.science/api/pith-number/62OROKGBRARP6CCAUAE6YJF7UE/graph.json","fetch_events":"https://pith.science/api/pith-number/62OROKGBRARP6CCAUAE6YJF7UE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE/action/storage_attestation","attest_author":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE/action/author_attestation","sign_citation":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE/action/citation_signature","submit_replication":"https://pith.science/pith/62OROKGBRARP6CCAUAE6YJF7UE/action/replication_record"}},"created_at":"2026-07-05T02:19:15.494501+00:00","updated_at":"2026-07-05T02:19:15.494501+00:00"}