{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:E6UT37RZAUWBBONUVDN2EPEO7Y","short_pith_number":"pith:E6UT37RZ","schema_version":"1.0","canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","source":{"kind":"arxiv","id":"1112.4523","version":1},"attestation_state":"computed","paper":{"title":"Complexity and Algorithms for Euler Characteristic of Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"primary_cat":"cs.CG","authors_text":"Bjarke Hammersholt Roune, Eduardo S\\'aenz de Cabez\\'on","submitted_at":"2011-12-19T22:51:21Z","abstract_excerpt":"We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler characteristic. The two new algorithms are derived using combinatorial commutative algebra and we also give a second description of them that requires no algebra. We present experiments showing that the two new algorithms can be implemented to be faster than previous Euler characteristic implementations by a large margin."},"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":"1112.4523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-19T22:51:21Z","cross_cats_sorted":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"title_canon_sha256":"d0f20c71d7ac6ed702ee2445c8f434725d49a6accff85dccc71f34b03b11ad37","abstract_canon_sha256":"2077a42c4d0a961ed966dfd2726c824ab5605737002afe4e9210d44e0aea5893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:58.657109Z","signature_b64":"ZdDGEfEZFm9fJMXI21HASpKGFYEFZEKpEFlv/jGCoA0nC+YrNUitg6g08TuNIG0LN5MSMpsJWc3do6R+U4H5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","last_reissued_at":"2026-05-18T04:05:58.656545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:58.656545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Algorithms for Euler Characteristic of Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"primary_cat":"cs.CG","authors_text":"Bjarke Hammersholt Roune, Eduardo S\\'aenz de Cabez\\'on","submitted_at":"2011-12-19T22:51:21Z","abstract_excerpt":"We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler characteristic. The two new algorithms are derived using combinatorial commutative algebra and we also give a second description of them that requires no algebra. We present experiments showing that the two new algorithms can be implemented to be faster than previous Euler characteristic implementations by a large margin."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4523","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":""},"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":"1112.4523","created_at":"2026-05-18T04:05:58.656630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4523v1","created_at":"2026-05-18T04:05:58.656630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4523","created_at":"2026-05-18T04:05:58.656630+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6UT37RZAUWB","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6UT37RZAUWBBONU","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6UT37RZ","created_at":"2026-05-18T12:26:26.731475+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/E6UT37RZAUWBBONUVDN2EPEO7Y","json":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y.json","graph_json":"https://pith.science/api/pith-number/E6UT37RZAUWBBONUVDN2EPEO7Y/graph.json","events_json":"https://pith.science/api/pith-number/E6UT37RZAUWBBONUVDN2EPEO7Y/events.json","paper":"https://pith.science/paper/E6UT37RZ"},"agent_actions":{"view_html":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y","download_json":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y.json","view_paper":"https://pith.science/paper/E6UT37RZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4523&json=true","fetch_graph":"https://pith.science/api/pith-number/E6UT37RZAUWBBONUVDN2EPEO7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/E6UT37RZAUWBBONUVDN2EPEO7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/action/storage_attestation","attest_author":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/action/author_attestation","sign_citation":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/action/citation_signature","submit_replication":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/action/replication_record"}},"created_at":"2026-05-18T04:05:58.656630+00:00","updated_at":"2026-05-18T04:05:58.656630+00:00"}