{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UE2C3Q5FUWCIJJD7I7ZNETLO3Z","short_pith_number":"pith:UE2C3Q5F","schema_version":"1.0","canonical_sha256":"a1342dc3a5a58484a47f47f2d24d6ede7ee44c6ab883bbd4d19e9a00ef18cea7","source":{"kind":"arxiv","id":"2206.00606","version":3},"attestation_state":"computed","paper":{"title":"Topological Deep Learning: Going Beyond Graph Data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CV","cs.SI","math.AT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aldo Guzm\\'an-S\\'aenz, Ghada Zamzmi, Karthikeyan Natesan Ramamurthy, Michael T. Schaub, Mustafa Hajij, Neal Livesay, Nina Miolane, Paul Rosen, Robin Walters, Shreyas N. Samaga, Soham Mukherjee, Tamal K. Dey, Theodore Papamarkou, Tolga Birdal","submitted_at":"2022-06-01T16:21:28Z","abstract_excerpt":"Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many domains encountered in scientific computations. In this paper, we present a unifying deep learning framework built upon a richer data structure that includes widely adopted topological domains.\n  Specifically, we first introduce combinatorial complexes, a novel type of topological domain. Combinatorial complexes can be seen as generalizations of graphs that mai"},"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":"2206.00606","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T16:21:28Z","cross_cats_sorted":["cs.CV","cs.SI","math.AT","stat.ML"],"title_canon_sha256":"3d0c69966aabe60c29117c8bb04179bd47354bb1237d9904332dae541f7e1484","abstract_canon_sha256":"14638bd11fb9a2306f4fc722afb7379dcebc8651eaf9195302438d92551b4828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:55.663423Z","signature_b64":"hdmKX+6wHHQT0urAndUnDwAop6Q0/m1gOAW9d0i7QrYUmJfAX5DUZ3Vl/v+SOz0QOawN7H/VnahOVAgLMN4uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1342dc3a5a58484a47f47f2d24d6ede7ee44c6ab883bbd4d19e9a00ef18cea7","last_reissued_at":"2026-07-05T06:11:55.662934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:55.662934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Deep Learning: Going Beyond Graph Data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CV","cs.SI","math.AT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aldo Guzm\\'an-S\\'aenz, Ghada Zamzmi, Karthikeyan Natesan Ramamurthy, Michael T. Schaub, Mustafa Hajij, Neal Livesay, Nina Miolane, Paul Rosen, Robin Walters, Shreyas N. Samaga, Soham Mukherjee, Tamal K. Dey, Theodore Papamarkou, Tolga Birdal","submitted_at":"2022-06-01T16:21:28Z","abstract_excerpt":"Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many domains encountered in scientific computations. In this paper, we present a unifying deep learning framework built upon a richer data structure that includes widely adopted topological domains.\n  Specifically, we first introduce combinatorial complexes, a novel type of topological domain. Combinatorial complexes can be seen as generalizations of graphs that mai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00606","kind":"arxiv","version":3},"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/2206.00606/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":"2206.00606","created_at":"2026-07-05T06:11:55.662991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.00606v3","created_at":"2026-07-05T06:11:55.662991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00606","created_at":"2026-07-05T06:11:55.662991+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE2C3Q5FUWCI","created_at":"2026-07-05T06:11:55.662991+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE2C3Q5FUWCIJJD7","created_at":"2026-07-05T06:11:55.662991+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE2C3Q5F","created_at":"2026-07-05T06:11:55.662991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":17,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23517","citing_title":"Collapsed Effective Operators for Higher-order Structures","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19860","citing_title":"The Heat Kernel Expansion: Curvature for Shock Detection in Higher-Order Financial Networks","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09806","citing_title":"Topological Neural Operators","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00937","citing_title":"Cellular Sheaf Neural Operators for Structure-Preserving Surrogate Modeling of Constrained PDEs","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13834","citing_title":"Topology-Preserving Neural Operator Learning via Hodge Decomposition","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28864","citing_title":"The Cognitive Categorical Transformer: Category-Theoretic Inductive Biases for Language Modeling","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26833","citing_title":"Periodic Topological Deep Learning for Polymer Design and Discovery","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22853","citing_title":"Topological Signal Processing: An Application-Oriented Tutorial","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2409.08036","citing_title":"Heterogeneous Sheaf Neural Networks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22334","citing_title":"Riemannian geometry meets fMRI: the advantages of modeling correlation manifolds and eigenvector subspaces","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16527","citing_title":"Hypergraph Pattern Machine: Compositional Tokenization for Higher-Order Interactions","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15524","citing_title":"Neural Point-Forms","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13690","citing_title":"The WidthWall: A Strict Expressivity Hierarchy for Hypergraph Neural Networks","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13834","citing_title":"Topology-Preserving Neural Operator Learning via Hodge Decomposition","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27241","citing_title":"Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10091","citing_title":"TopoU-Net: a U-Net architecture for topological domains","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01110","citing_title":"Topological Neural Tangent Kernel","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z","json":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z.json","graph_json":"https://pith.science/api/pith-number/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/graph.json","events_json":"https://pith.science/api/pith-number/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/events.json","paper":"https://pith.science/paper/UE2C3Q5F"},"agent_actions":{"view_html":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z","download_json":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z.json","view_paper":"https://pith.science/paper/UE2C3Q5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.00606&json=true","fetch_graph":"https://pith.science/api/pith-number/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/action/storage_attestation","attest_author":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/action/author_attestation","sign_citation":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/action/citation_signature","submit_replication":"https://pith.science/pith/UE2C3Q5FUWCIJJD7I7ZNETLO3Z/action/replication_record"}},"created_at":"2026-07-05T06:11:55.662991+00:00","updated_at":"2026-07-05T06:11:55.662991+00:00"}