{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PEI3T6H45NHQ5P37G2KKR76FBI","short_pith_number":"pith:PEI3T6H4","schema_version":"1.0","canonical_sha256":"7911b9f8fceb4f0ebf7f3694a8ffc50a2b7668136c5eefa1f6fd295d40c1b554","source":{"kind":"arxiv","id":"2505.23993","version":3},"attestation_state":"computed","paper":{"title":"Cellular Sheaves on Higher-Dimensional Structures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Chuan-Shen Hu","submitted_at":"2025-05-29T20:34:56Z","abstract_excerpt":"Defining cellular sheaves beyond graph structures, such as on simplicial complexes containing higher-dimensional simplices, is an essential and intriguing topic in topological data analysis (TDA) and the development of sheaf neural networks. In this paper, we explore methods for constructing non-trivial cellular sheaves on spaces that include structures of dimension greater than one. This extends the focus from 0- or 1-dimensional components, such as vertices and edges, to elements like triangles, tetrahedra, and other higher-dimensional simplices within a simplicial complex. We develop a unif"},"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":"2505.23993","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.AT","submitted_at":"2025-05-29T20:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"6aead36fde42678302a29e1f6cc828b8dcbc362c971fbecdd341e793d79d8df7","abstract_canon_sha256":"e71020b0e6619099de8e70e650539e6cc69cab46877cebb86a0e0104cb40f1e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:01.223839Z","signature_b64":"W9EV1PTTW7deqLAFY59ZLRa7agDV/+csc3t2fsfMQnVUHy/nsw1VXQLPLz8YcPuVEeMBSCWDUZs6G113WdHcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7911b9f8fceb4f0ebf7f3694a8ffc50a2b7668136c5eefa1f6fd295d40c1b554","last_reissued_at":"2026-07-05T11:30:01.223433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:01.223433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cellular Sheaves on Higher-Dimensional Structures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Chuan-Shen Hu","submitted_at":"2025-05-29T20:34:56Z","abstract_excerpt":"Defining cellular sheaves beyond graph structures, such as on simplicial complexes containing higher-dimensional simplices, is an essential and intriguing topic in topological data analysis (TDA) and the development of sheaf neural networks. In this paper, we explore methods for constructing non-trivial cellular sheaves on spaces that include structures of dimension greater than one. This extends the focus from 0- or 1-dimensional components, such as vertices and edges, to elements like triangles, tetrahedra, and other higher-dimensional simplices within a simplicial complex. We develop a unif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23993","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/2505.23993/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":"2505.23993","created_at":"2026-07-05T11:30:01.223488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23993v3","created_at":"2026-07-05T11:30:01.223488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23993","created_at":"2026-07-05T11:30:01.223488+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEI3T6H45NHQ","created_at":"2026-07-05T11:30:01.223488+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEI3T6H45NHQ5P37","created_at":"2026-07-05T11:30:01.223488+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEI3T6H4","created_at":"2026-07-05T11:30:01.223488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":295,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":194,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI","json":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI.json","graph_json":"https://pith.science/api/pith-number/PEI3T6H45NHQ5P37G2KKR76FBI/graph.json","events_json":"https://pith.science/api/pith-number/PEI3T6H45NHQ5P37G2KKR76FBI/events.json","paper":"https://pith.science/paper/PEI3T6H4"},"agent_actions":{"view_html":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI","download_json":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI.json","view_paper":"https://pith.science/paper/PEI3T6H4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23993&json=true","fetch_graph":"https://pith.science/api/pith-number/PEI3T6H45NHQ5P37G2KKR76FBI/graph.json","fetch_events":"https://pith.science/api/pith-number/PEI3T6H45NHQ5P37G2KKR76FBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI/action/storage_attestation","attest_author":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI/action/author_attestation","sign_citation":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI/action/citation_signature","submit_replication":"https://pith.science/pith/PEI3T6H45NHQ5P37G2KKR76FBI/action/replication_record"}},"created_at":"2026-07-05T11:30:01.223488+00:00","updated_at":"2026-07-05T11:30:01.223488+00:00"}