{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M3GL4I67KDQMHATT3UPYWW7JYJ","short_pith_number":"pith:M3GL4I67","schema_version":"1.0","canonical_sha256":"66ccbe23df50e0c38273dd1f8b5be9c262217f93015238b5d6994cf50e9f43b5","source":{"kind":"arxiv","id":"2103.04046","version":6},"attestation_state":"computed","paper":{"title":"Simplicial Complex Representation Learning","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, Mustafa Hajij, Theodore Papamarkou, Vasileios Maroulas, Xuanting Cai","submitted_at":"2021-03-06T06:33:04Z","abstract_excerpt":"Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d simplicial complexes, has witnessed a great attention in recent years. However, there has not been enough effort to extend representation learning to higher dimensional simplicial objects due to the additional complexity these objects hold, especially when it comes to entire-simplicial complex representation learning. In this work, we propose a method for simp"},"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.04046","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-06T06:33:04Z","cross_cats_sorted":["cs.CG","cs.CV","math.AT","stat.ML"],"title_canon_sha256":"f16a8fe861d94b20b4aad31797a58b378690ccafa58a722025ee136e1445ee79","abstract_canon_sha256":"47073c0d9839f22df4cb29209006e51cfdf338678af9bac50a85b2cf6362fd5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:24.954008Z","signature_b64":"P/QsRXVQ4aiapt5z2k9N6g5wYF75sNW0wsqEqMeOymK6m63U5ajj/KJ7pLFhhLJrG7AYhTi8Rd9pSgY8gt0BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ccbe23df50e0c38273dd1f8b5be9c262217f93015238b5d6994cf50e9f43b5","last_reissued_at":"2026-07-05T03:53:24.953555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:24.953555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial Complex Representation Learning","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, Mustafa Hajij, Theodore Papamarkou, Vasileios Maroulas, Xuanting Cai","submitted_at":"2021-03-06T06:33:04Z","abstract_excerpt":"Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d simplicial complexes, has witnessed a great attention in recent years. However, there has not been enough effort to extend representation learning to higher dimensional simplicial objects due to the additional complexity these objects hold, especially when it comes to entire-simplicial complex representation learning. In this work, we propose a method for simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04046","kind":"arxiv","version":6},"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.04046/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.04046","created_at":"2026-07-05T03:53:24.953619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.04046v6","created_at":"2026-07-05T03:53:24.953619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04046","created_at":"2026-07-05T03:53:24.953619+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3GL4I67KDQM","created_at":"2026-07-05T03:53:24.953619+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3GL4I67KDQMHATT","created_at":"2026-07-05T03:53:24.953619+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3GL4I67","created_at":"2026-07-05T03:53:24.953619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01160","citing_title":"Differentiable Lifting for Topological Neural Networks","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ","json":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ.json","graph_json":"https://pith.science/api/pith-number/M3GL4I67KDQMHATT3UPYWW7JYJ/graph.json","events_json":"https://pith.science/api/pith-number/M3GL4I67KDQMHATT3UPYWW7JYJ/events.json","paper":"https://pith.science/paper/M3GL4I67"},"agent_actions":{"view_html":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ","download_json":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ.json","view_paper":"https://pith.science/paper/M3GL4I67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.04046&json=true","fetch_graph":"https://pith.science/api/pith-number/M3GL4I67KDQMHATT3UPYWW7JYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/M3GL4I67KDQMHATT3UPYWW7JYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ/action/storage_attestation","attest_author":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ/action/author_attestation","sign_citation":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ/action/citation_signature","submit_replication":"https://pith.science/pith/M3GL4I67KDQMHATT3UPYWW7JYJ/action/replication_record"}},"created_at":"2026-07-05T03:53:24.953619+00:00","updated_at":"2026-07-05T03:53:24.953619+00:00"}