{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:PEWYX4PYLB2JNSCUBQ23E5DQ5V","short_pith_number":"pith:PEWYX4PY","schema_version":"1.0","canonical_sha256":"792d8bf1f8587496c8540c35b27470ed4d6fabb7aa860ddaad667217c1507c1f","source":{"kind":"arxiv","id":"0808.1991","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0808.1991","created_at":"2026-05-18T02:24:57.092599+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1991v2","created_at":"2026-05-18T02:24:57.092599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1991","created_at":"2026-05-18T02:24:57.092599+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEWYX4PYLB2J","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEWYX4PYLB2JNSCU","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEWYX4PY","created_at":"2026-05-18T12:25:57.157939+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/PEWYX4PYLB2JNSCUBQ23E5DQ5V","json":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V.json","graph_json":"https://pith.science/api/pith-number/PEWYX4PYLB2JNSCUBQ23E5DQ5V/graph.json","events_json":"https://pith.science/api/pith-number/PEWYX4PYLB2JNSCUBQ23E5DQ5V/events.json","paper":"https://pith.science/paper/PEWYX4PY"},"agent_actions":{"view_html":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V","download_json":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V.json","view_paper":"https://pith.science/paper/PEWYX4PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1991&json=true","fetch_graph":"https://pith.science/api/pith-number/PEWYX4PYLB2JNSCUBQ23E5DQ5V/graph.json","fetch_events":"https://pith.science/api/pith-number/PEWYX4PYLB2JNSCUBQ23E5DQ5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/action/storage_attestation","attest_author":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/action/author_attestation","sign_citation":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/action/citation_signature","submit_replication":"https://pith.science/pith/PEWYX4PYLB2JNSCUBQ23E5DQ5V/action/replication_record"}},"created_at":"2026-05-18T02:24:57.092599+00:00","updated_at":"2026-05-18T02:24:57.092599+00:00"}