{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:B4II57XAXY6GEAWRVELXQAMP4V","short_pith_number":"pith:B4II57XA","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"},"canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","source":{"kind":"arxiv","id":"2012.06010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06010","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06010v1","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06010","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_12","alias_value":"B4II57XAXY6G","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_16","alias_value":"B4II57XAXY6GEAWR","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_8","alias_value":"B4II57XA","created_at":"2026-07-05T01:58:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:B4II57XAXY6GEAWRVELXQAMP4V","target":"record","payload":{"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"},"canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","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"},"source_kind":"arxiv","source_id":"2012.06010","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:58:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7m4+b4MyOpL18d4XPOLQDKzUA3IU2zjgsI9+sq8EtOLK56RQvjDUIzb1kBzaLUa27UY5FYqiYJ8WrklKVlE9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:08:47.827127Z"},"content_sha256":"b0d852e9659c3801958988ace7f25aad103c9232ed12b6c35969347e572527f7","schema_version":"1.0","event_id":"sha256:b0d852e9659c3801958988ace7f25aad103c9232ed12b6c35969347e572527f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:B4II57XAXY6GEAWRVELXQAMP4V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:58:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5dvKITSgGe5SVFcMVVTL6PpWLLFUS81/5uV6PZQTgms7o5jjFezOOnlKRRN5cfxYIC6rUdWBGZS0YJQaR1cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:08:47.827509Z"},"content_sha256":"bf7a9068cda934d3b2e0e4fa8100f6d1d281f05a475058ed9472b7e0dcbec405","schema_version":"1.0","event_id":"sha256:bf7a9068cda934d3b2e0e4fa8100f6d1d281f05a475058ed9472b7e0dcbec405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/bundle.json","state_url":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4II57XAXY6GEAWRVELXQAMP4V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T23:08:47Z","links":{"resolver":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V","bundle":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/bundle.json","state":"https://pith.science/pith/B4II57XAXY6GEAWRVELXQAMP4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4II57XAXY6GEAWRVELXQAMP4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:B4II57XAXY6GEAWRVELXQAMP4V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e4c818cf6e74c1b87ffff1c404c0634febb5356cd8a6ab8e562aae608bae8a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2020-12-10T23:00:13Z","title_canon_sha256":"0b71470dfab7c928942805a8146b49c119807eb9ffb2b1f73a3a4bb720b143e1"},"schema_version":"1.0","source":{"id":"2012.06010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06010","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06010v1","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06010","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_12","alias_value":"B4II57XAXY6G","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_16","alias_value":"B4II57XAXY6GEAWR","created_at":"2026-07-05T01:58:46Z"},{"alias_kind":"pith_short_8","alias_value":"B4II57XA","created_at":"2026-07-05T01:58:46Z"}],"graph_snapshots":[{"event_id":"sha256:bf7a9068cda934d3b2e0e4fa8100f6d1d281f05a475058ed9472b7e0dcbec405","target":"graph","created_at":"2026-07-05T01:58:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.06010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Eric Bunch, Glenn Fung, Qian You, Vikas Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2020-12-10T23:00:13Z","title":"Simplicial 2-Complex Convolutional Neural Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06010","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0d852e9659c3801958988ace7f25aad103c9232ed12b6c35969347e572527f7","target":"record","created_at":"2026-07-05T01:58:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e4c818cf6e74c1b87ffff1c404c0634febb5356cd8a6ab8e562aae608bae8a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2020-12-10T23:00:13Z","title_canon_sha256":"0b71470dfab7c928942805a8146b49c119807eb9ffb2b1f73a3a4bb720b143e1"},"schema_version":"1.0","source":{"id":"2012.06010","kind":"arxiv","version":1}},"canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f108efee0be3c6202d1a91778018fe54594319c7f64fac297a5b592cc3e0b80","first_computed_at":"2026-07-05T01:58:46.289082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:46.289082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01irRQVQl0CQ39qhatunjLf5hV7wpdf/+anapfUq9+Npz8HbiwKJ4MXUuLx+Zkd2o37H8QcRoqrjuOsK5auIDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:46.289641Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.06010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d852e9659c3801958988ace7f25aad103c9232ed12b6c35969347e572527f7","sha256:bf7a9068cda934d3b2e0e4fa8100f6d1d281f05a475058ed9472b7e0dcbec405"],"state_sha256":"c43bd3718e5a8111bae472736396fc91ad33c1bb3728d87df98c19b92629b8cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M75pkn9fT7+bgfhIZKzcyBBt8IoMHAkb7QJ48cBQ05kzRjjqsPe6cMnM72fSVYAXQu0eBzB3lGTbe/5+PVklAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:08:47.829623Z","bundle_sha256":"8d68df1deb8b8719f96dfd0698ca7238a8eab256f6cbc92ea2b5f1db466f0790"}}