{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:PEWYX4PYLB2JNSCUBQ23E5DQ5V","short_pith_number":"pith:PEWYX4PY","canonical_record":{"source":{"id":"0808.1991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-14T13:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"e37b5ef26f9f63abd2ecc500cfe3bd386aa0793c1449fff59ee10059307fcd89","abstract_canon_sha256":"c59451dd5eb1972066b15f75657fdccce1cefc025aa8ad76a0ba6bfe820f548b"},"schema_version":"1.0"},"canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","source":{"kind":"arxiv","id":"0808.1991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.1991","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"0808.1991v2","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1991","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"PEWYX4PYLB2J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PEWYX4PYLB2JNSCU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PEWYX4PY","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:PEWYX4PYLB2JNSCUBQ23E5DQ5V","target":"record","payload":{"canonical_record":{"source":{"id":"0808.1991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-14T13:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"e37b5ef26f9f63abd2ecc500cfe3bd386aa0793c1449fff59ee10059307fcd89","abstract_canon_sha256":"c59451dd5eb1972066b15f75657fdccce1cefc025aa8ad76a0ba6bfe820f548b"},"schema_version":"1.0"},"canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:57.093214Z","signature_b64":"XOZ8L9ElvgC/mXJ9KTK9eUikUkV9taImTiTgXYJlxeCs1mjcF/RV0/5l3qAbzAlYw/3QF5aj9rw4vqE3W1nAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","last_reissued_at":"2026-05-18T02:24:57.092482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:57.092482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.1991","source_version":2,"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-18T02:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52LAnm3povuxdzj02bCULMJh8a9By+0aXGgf7ZN6drQMtC5TBgFo9Vne9ZWssYBUCdrpL1PiZa5RevsidJGiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:59:58.682791Z"},"content_sha256":"296bc78eb1ff44970d5b4c8dbeaa1398b1a07f5a8019dee5e603847384c19a2a","schema_version":"1.0","event_id":"sha256:296bc78eb1ff44970d5b4c8dbeaa1398b1a07f5a8019dee5e603847384c19a2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:PEWYX4PYLB2JNSCUBQ23E5DQ5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"d-collapsibility is NP-complete for d greater or equal to 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Tancer","submitted_at":"2008-08-14T13:29:59Z","abstract_excerpt":"A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a given simplicial complex is d-collapsible is NP-complete for d greater or equal to 4 and polynomial time solvable for d at most 2. As an intermediate step, we prove that d-collapsibility can be recognized by the greedy algorithm for d at most 2, but the greedy algorithm does not work for d greater or equal 3. A simplicial complex is d-representable if it is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1991","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"},"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-18T02:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Izh/D7t5dYyBwinWx8wUu7x9e9KQc4GD9EtfRX4EkDsLUKZNb0OWGfhVmVYV5RVe9hTpkLBFEGzo/6k27PHPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:59:58.683522Z"},"content_sha256":"c8c135fad2249a775c02ea406ce824a4be5bb85accc7df43e5ecddd4abe8efe5","schema_version":"1.0","event_id":"sha256:c8c135fad2249a775c02ea406ce824a4be5bb85accc7df43e5ecddd4abe8efe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/bundle.json","state_url":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/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-05-27T17:59:58Z","links":{"resolver":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V","bundle":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/bundle.json","state":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:PEWYX4PYLB2JNSCUBQ23E5DQ5V","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":"c59451dd5eb1972066b15f75657fdccce1cefc025aa8ad76a0ba6bfe820f548b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-14T13:29:59Z","title_canon_sha256":"e37b5ef26f9f63abd2ecc500cfe3bd386aa0793c1449fff59ee10059307fcd89"},"schema_version":"1.0","source":{"id":"0808.1991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.1991","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"0808.1991v2","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1991","created_at":"2026-05-18T02:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"PEWYX4PYLB2J","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PEWYX4PYLB2JNSCU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PEWYX4PY","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:c8c135fad2249a775c02ea406ce824a4be5bb85accc7df43e5ecddd4abe8efe5","target":"graph","created_at":"2026-05-18T02:24:57Z","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":"A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a given simplicial complex is d-collapsible is NP-complete for d greater or equal to 4 and polynomial time solvable for d at most 2. As an intermediate step, we prove that d-collapsibility can be recognized by the greedy algorithm for d at most 2, but the greedy algorithm does not work for d greater or equal 3. A simplicial complex is d-representable if it is ","authors_text":"Martin Tancer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-14T13:29:59Z","title":"d-collapsibility is NP-complete for d greater or equal to 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1991","kind":"arxiv","version":2},"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:296bc78eb1ff44970d5b4c8dbeaa1398b1a07f5a8019dee5e603847384c19a2a","target":"record","created_at":"2026-05-18T02:24:57Z","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":"c59451dd5eb1972066b15f75657fdccce1cefc025aa8ad76a0ba6bfe820f548b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-14T13:29:59Z","title_canon_sha256":"e37b5ef26f9f63abd2ecc500cfe3bd386aa0793c1449fff59ee10059307fcd89"},"schema_version":"1.0","source":{"id":"0808.1991","kind":"arxiv","version":2}},"canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","first_computed_at":"2026-05-18T02:24:57.092482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:57.092482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOZ8L9ElvgC/mXJ9KTK9eUikUkV9taImTiTgXYJlxeCs1mjcF/RV0/5l3qAbzAlYw/3QF5aj9rw4vqE3W1nAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:57.093214Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.1991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:296bc78eb1ff44970d5b4c8dbeaa1398b1a07f5a8019dee5e603847384c19a2a","sha256:c8c135fad2249a775c02ea406ce824a4be5bb85accc7df43e5ecddd4abe8efe5"],"state_sha256":"4e4da97cbf4416d88b5a91a6b9b1df58784423283fbcf23798058c39bb4195e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCEniexPP8JRGkuNI4bdAmVmwy79qfyuwo22OonvuxIDu1V55tvmJCdev6chBhrfqRk0noHK1OsVh14+MusnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:59:58.687357Z","bundle_sha256":"61dfa6c305f8f3ad0eb08ffd9acb72b014f1bc42730c4ddca0ef75043bd28902"}}