{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6C3NW25NDAMOHWFMCVGF5R46LO","short_pith_number":"pith:6C3NW25N","schema_version":"1.0","canonical_sha256":"f0b6db6bad1818e3d8ac154c5ec79e5bab73adf7444f350a6bd4283fdd456fa7","source":{"kind":"arxiv","id":"1711.08436","version":2},"attestation_state":"computed","paper":{"title":"Shellability is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.GT"],"primary_cat":"math.CO","authors_text":"Martin Tancer, Pavel Pat\\'ak, Uli Wagner, Xavier Goaoc, Zuzana Pat\\'akov\\'a","submitted_at":"2017-11-22T18:33:33Z","abstract_excerpt":"We prove that for every $d\\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every $d \\ge 2$ and $k \\ge 0$, deciding if a pure, $d$-dimensional, simplicial complex is $k$-decomposable is NP-hard. For $d \\ge 3$, both problems remain NP-hard when restricted to contractible pure $d$-dimensional complexes. Another simple corollary of our result is that it is NP-hard to decide whether a given poset is CL-shellable."},"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":"1711.08436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-22T18:33:33Z","cross_cats_sorted":["cs.CG","math.GT"],"title_canon_sha256":"7e51e6da70f8aca88bae5d73a40ab01312e9d57ee9e436f973da02395a9eeb97","abstract_canon_sha256":"dc23100eef1b4d569032f4bc1b50e2ba28a561a0d6bf49cee780dae4486d3902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:07.303444Z","signature_b64":"fCBHyzwOceI1/wWO4QEXkkO6kYRmj9uhMhcdKUPpHUrPWN2dDeyZN1fMhqG92JMGT9MzXjVb2UEBAyGB2/+cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0b6db6bad1818e3d8ac154c5ec79e5bab73adf7444f350a6bd4283fdd456fa7","last_reissued_at":"2026-05-18T00:25:07.302858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:07.302858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shellability is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.GT"],"primary_cat":"math.CO","authors_text":"Martin Tancer, Pavel Pat\\'ak, Uli Wagner, Xavier Goaoc, Zuzana Pat\\'akov\\'a","submitted_at":"2017-11-22T18:33:33Z","abstract_excerpt":"We prove that for every $d\\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every $d \\ge 2$ and $k \\ge 0$, deciding if a pure, $d$-dimensional, simplicial complex is $k$-decomposable is NP-hard. For $d \\ge 3$, both problems remain NP-hard when restricted to contractible pure $d$-dimensional complexes. Another simple corollary of our result is that it is NP-hard to decide whether a given poset is CL-shellable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08436","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":"1711.08436","created_at":"2026-05-18T00:25:07.302947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08436v2","created_at":"2026-05-18T00:25:07.302947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08436","created_at":"2026-05-18T00:25:07.302947+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C3NW25NDAMO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C3NW25NDAMOHWFM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C3NW25N","created_at":"2026-05-18T12:31:03.183658+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/6C3NW25NDAMOHWFMCVGF5R46LO","json":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO.json","graph_json":"https://pith.science/api/pith-number/6C3NW25NDAMOHWFMCVGF5R46LO/graph.json","events_json":"https://pith.science/api/pith-number/6C3NW25NDAMOHWFMCVGF5R46LO/events.json","paper":"https://pith.science/paper/6C3NW25N"},"agent_actions":{"view_html":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO","download_json":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO.json","view_paper":"https://pith.science/paper/6C3NW25N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08436&json=true","fetch_graph":"https://pith.science/api/pith-number/6C3NW25NDAMOHWFMCVGF5R46LO/graph.json","fetch_events":"https://pith.science/api/pith-number/6C3NW25NDAMOHWFMCVGF5R46LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO/action/storage_attestation","attest_author":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO/action/author_attestation","sign_citation":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO/action/citation_signature","submit_replication":"https://pith.science/pith/6C3NW25NDAMOHWFMCVGF5R46LO/action/replication_record"}},"created_at":"2026-05-18T00:25:07.302947+00:00","updated_at":"2026-05-18T00:25:07.302947+00:00"}