{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E6UT37RZAUWBBONUVDN2EPEO7Y","short_pith_number":"pith:E6UT37RZ","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"},"canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","source":{"kind":"arxiv","id":"1112.4523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4523","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4523v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4523","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"E6UT37RZAUWB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E6UT37RZAUWBBONU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E6UT37RZ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E6UT37RZAUWBBONUVDN2EPEO7Y","target":"record","payload":{"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"},"canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","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"},"source_kind":"arxiv","source_id":"1112.4523","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-05-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZIB7hIKf2LYWnPcloSjtV9DsVgmPFMuSXtn2i3eeUe7xunLnBhCdtB+qlvx+eG8cDgFzvANb3+FE90q/sO5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:53:49.197616Z"},"content_sha256":"ab0cfbea7bcbd60e207b87497b82163d2867374ee20fe51e33be9759b93315cd","schema_version":"1.0","event_id":"sha256:ab0cfbea7bcbd60e207b87497b82163d2867374ee20fe51e33be9759b93315cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E6UT37RZAUWBBONUVDN2EPEO7Y","target":"graph","payload":{"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"},"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-05-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOKGDzfdsjswO1n6e0+LjGRaq7u4X/YUjmNexw2+G7hrr8k7dHRNNiM52u+XiTDKLZzpfomjeQmrBS0Ib44nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T13:53:49.197972Z"},"content_sha256":"4a81da442f26ab12048908b0e9d328e7a5a0c2c52a1d1ad23e7cf70ec26d944f","schema_version":"1.0","event_id":"sha256:4a81da442f26ab12048908b0e9d328e7a5a0c2c52a1d1ad23e7cf70ec26d944f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/bundle.json","state_url":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/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-06-21T13:53:49Z","links":{"resolver":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y","bundle":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/bundle.json","state":"https://pith.science/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6UT37RZAUWBBONUVDN2EPEO7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E6UT37RZAUWBBONUVDN2EPEO7Y","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":"2077a42c4d0a961ed966dfd2726c824ab5605737002afe4e9210d44e0aea5893","cross_cats_sorted":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-19T22:51:21Z","title_canon_sha256":"d0f20c71d7ac6ed702ee2445c8f434725d49a6accff85dccc71f34b03b11ad37"},"schema_version":"1.0","source":{"id":"1112.4523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4523","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4523v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4523","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"E6UT37RZAUWB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E6UT37RZAUWBBONU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E6UT37RZ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:4a81da442f26ab12048908b0e9d328e7a5a0c2c52a1d1ad23e7cf70ec26d944f","target":"graph","created_at":"2026-05-18T04:05:58Z","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"},"paper":{"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.","authors_text":"Bjarke Hammersholt Roune, Eduardo S\\'aenz de Cabez\\'on","cross_cats":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-19T22:51:21Z","title":"Complexity and Algorithms for Euler Characteristic of Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4523","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:ab0cfbea7bcbd60e207b87497b82163d2867374ee20fe51e33be9759b93315cd","target":"record","created_at":"2026-05-18T04:05:58Z","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":"2077a42c4d0a961ed966dfd2726c824ab5605737002afe4e9210d44e0aea5893","cross_cats_sorted":["cs.CC","cs.DS","cs.MS","cs.SC","math.AC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-19T22:51:21Z","title_canon_sha256":"d0f20c71d7ac6ed702ee2445c8f434725d49a6accff85dccc71f34b03b11ad37"},"schema_version":"1.0","source":{"id":"1112.4523","kind":"arxiv","version":1}},"canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27a93dfe39052c10b9b4a8dba23c8efe25bf32ef80be8c40313eab91a240b2a2","first_computed_at":"2026-05-18T04:05:58.656545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:58.656545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZdDGEfEZFm9fJMXI21HASpKGFYEFZEKpEFlv/jGCoA0nC+YrNUitg6g08TuNIG0LN5MSMpsJWc3do6R+U4H5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:58.657109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab0cfbea7bcbd60e207b87497b82163d2867374ee20fe51e33be9759b93315cd","sha256:4a81da442f26ab12048908b0e9d328e7a5a0c2c52a1d1ad23e7cf70ec26d944f"],"state_sha256":"92910a060978e83e3783f60e20231ab2c1332f8392bff69f2380f35d6e3e452f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nkOoQNrkm8PRC1msqM5YiogOBcQnK0PAL7DTyTmQcVmYAuU7V4LjLSHcsP6PX5Jtc7srnz6wgWQlsjRo1I/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T13:53:49.199911Z","bundle_sha256":"2fb2cc3ba66522cf4a76a15209da8d87266f0aa5a716fe7844dd87a81ee3a6f0"}}