{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GF3BPVUQOW3RMAXJMEKNUDPTFV","short_pith_number":"pith:GF3BPVUQ","schema_version":"1.0","canonical_sha256":"317617d69075b71602e96114da0df32d6fe47d97d9999454c97290d3b29009a6","source":{"kind":"arxiv","id":"1705.00151","version":2},"attestation_state":"computed","paper":{"title":"Computing the Homology of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Chengyuan Wu, Jie Wu, Shiquan Ren, Stephane Bressan","submitted_at":"2017-04-29T08:07:59Z","abstract_excerpt":"Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to compute the homology of the associated simplicial complexes and the embedded homology of hypergraphs as well as some heuristics for efficient computations."},"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":"1705.00151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2017-04-29T08:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"9111abb5403b5535536b71b02a665b12015ec08cf462129b09d3a65d4e304ead","abstract_canon_sha256":"a3a11702f4a6b333cb2de489b3829fe0b0142ae836c6d0a7ca405878084dc90f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:00.598056Z","signature_b64":"3M8B/eDPWNqKtXvQB/FfxUZUvP/PckbqMe40WRkukVK9hxaljfMFXxSsIQ35Ctza4I8Tos2qOskcl3KGCtXxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317617d69075b71602e96114da0df32d6fe47d97d9999454c97290d3b29009a6","last_reissued_at":"2026-05-18T00:27:00.597379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:00.597379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Homology of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Chengyuan Wu, Jie Wu, Shiquan Ren, Stephane Bressan","submitted_at":"2017-04-29T08:07:59Z","abstract_excerpt":"Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to compute the homology of the associated simplicial complexes and the embedded homology of hypergraphs as well as some heuristics for efficient computations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00151","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1705.00151","created_at":"2026-05-18T00:27:00.597476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00151v2","created_at":"2026-05-18T00:27:00.597476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00151","created_at":"2026-05-18T00:27:00.597476+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF3BPVUQOW3R","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF3BPVUQOW3RMAXJ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF3BPVUQ","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV","json":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV.json","graph_json":"https://pith.science/api/pith-number/GF3BPVUQOW3RMAXJMEKNUDPTFV/graph.json","events_json":"https://pith.science/api/pith-number/GF3BPVUQOW3RMAXJMEKNUDPTFV/events.json","paper":"https://pith.science/paper/GF3BPVUQ"},"agent_actions":{"view_html":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV","download_json":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV.json","view_paper":"https://pith.science/paper/GF3BPVUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00151&json=true","fetch_graph":"https://pith.science/api/pith-number/GF3BPVUQOW3RMAXJMEKNUDPTFV/graph.json","fetch_events":"https://pith.science/api/pith-number/GF3BPVUQOW3RMAXJMEKNUDPTFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV/action/storage_attestation","attest_author":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV/action/author_attestation","sign_citation":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV/action/citation_signature","submit_replication":"https://pith.science/pith/GF3BPVUQOW3RMAXJMEKNUDPTFV/action/replication_record"}},"created_at":"2026-05-18T00:27:00.597476+00:00","updated_at":"2026-05-18T00:27:00.597476+00:00"}