{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:B4II57XAXY6GEAWRVELXQAMP4V","short_pith_number":"pith:B4II57XA","schema_version":"1.0","canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","source":{"kind":"arxiv","id":"2012.06010","version":1},"attestation_state":"computed","paper":{"title":"Simplicial 2-Complex Convolutional Neural Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Eric Bunch, Glenn Fung, Qian You, Vikas Singh","submitted_at":"2020-12-10T23:00:13Z","abstract_excerpt":"Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in general do not account for higher order relations between their hyperedges. Simplicial complexes offer a middle ground, with a rich theory to draw on. We develop a convolutional neural network layer on simplicial 2-complexes."},"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":"2012.06010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2020-12-10T23:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"0b71470dfab7c928942805a8146b49c119807eb9ffb2b1f73a3a4bb720b143e1","abstract_canon_sha256":"2e4c818cf6e74c1b87ffff1c404c0634febb5356cd8a6ab8e562aae608bae8a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:46.289641Z","signature_b64":"01irRQVQl0CQ39qhatunjLf5hV7wpdf/+anapfUq9+Npz8HbiwKJ4MXUuLx+Zkd2o37H8QcRoqrjuOsK5auIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","last_reissued_at":"2026-07-05T01:58:46.289082Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:46.289082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial 2-Complex Convolutional Neural Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Eric Bunch, Glenn Fung, Qian You, Vikas Singh","submitted_at":"2020-12-10T23:00:13Z","abstract_excerpt":"Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in general do not account for higher order relations between their hyperedges. Simplicial complexes offer a middle ground, with a rich theory to draw on. We develop a convolutional neural network layer on simplicial 2-complexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06010","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/2012.06010/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":"2012.06010","created_at":"2026-07-05T01:58:46.289149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.06010v1","created_at":"2026-07-05T01:58:46.289149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06010","created_at":"2026-07-05T01:58:46.289149+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4II57XAXY6G","created_at":"2026-07-05T01:58:46.289149+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4II57XAXY6GEAWR","created_at":"2026-07-05T01:58:46.289149+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4II57XA","created_at":"2026-07-05T01:58:46.289149+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V","json":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V.json","graph_json":"https://pith.science/api/pith-number/B4II57XAXY6GEAWRVELXQAMP4V/graph.json","events_json":"https://pith.science/api/pith-number/B4II57XAXY6GEAWRVELXQAMP4V/events.json","paper":"https://pith.science/paper/B4II57XA"},"agent_actions":{"view_html":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V","download_json":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V.json","view_paper":"https://pith.science/paper/B4II57XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.06010&json=true","fetch_graph":"https://pith.science/api/pith-number/B4II57XAXY6GEAWRVELXQAMP4V/graph.json","fetch_events":"https://pith.science/api/pith-number/B4II57XAXY6GEAWRVELXQAMP4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/action/storage_attestation","attest_author":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/action/author_attestation","sign_citation":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/action/citation_signature","submit_replication":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/action/replication_record"}},"created_at":"2026-07-05T01:58:46.289149+00:00","updated_at":"2026-07-05T01:58:46.289149+00:00"}