{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WCFOIEPH6QK3LEHQQOKYS4N6MY","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":"c1775d4df881e984d96e9449ebea3725e9cdc152e6a21dabc7d2d702e0868355","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T15:26:04Z","title_canon_sha256":"7cb58abf43a4ef650207a4aa0bb8f7d36215477b7704c218a6170bc1a96b3d80"},"schema_version":"1.0","source":{"id":"1401.7540","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7540","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7540v4","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7540","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"WCFOIEPH6QK3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WCFOIEPH6QK3LEHQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WCFOIEPH","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e4cfbcdd6717b041027a31b128a8bd9a826a1406f04e9bd50549f120220e5729","target":"graph","created_at":"2026-05-18T02:44:49Z","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":"The width measure \\emph{treedepth}, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. We present an algorithm which---given as input an $n$-vertex graph, a tree decomposition of the graph of width $w$, and an integer $t$---decides Treedepth, i.e. whether the treedepth of the graph is at most $t$, in time $2^{O(wt)} \\cdot n$. If necessary, a witness structure for the treedepth can be constructed in the same running time. In conjunction with previous results we provide a simple algorithm and","authors_text":"Felix Reidl, Fernando Sanchez Villaamil, Peter Rossmanith, Somnath Sikdar","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T15:26:04Z","title":"A Faster Parameterized Algorithm for Treedepth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7540","kind":"arxiv","version":4},"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:9fc5f560e3bab0bedd7a12d00446b77c2b358d2c0885edc4d018ca64922979ab","target":"record","created_at":"2026-05-18T02:44:49Z","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":"c1775d4df881e984d96e9449ebea3725e9cdc152e6a21dabc7d2d702e0868355","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T15:26:04Z","title_canon_sha256":"7cb58abf43a4ef650207a4aa0bb8f7d36215477b7704c218a6170bc1a96b3d80"},"schema_version":"1.0","source":{"id":"1401.7540","kind":"arxiv","version":4}},"canonical_sha256":"b08ae411e7f415b590f083958971be66236cb52d2af2ffbd7cd2d51059767051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b08ae411e7f415b590f083958971be66236cb52d2af2ffbd7cd2d51059767051","first_computed_at":"2026-05-18T02:44:49.722976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:49.722976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4aXT6v9UmSS3mKjfYe6XMtfLMyrhvCz16RfXgs74B+LHYwZ/qCDu84+kmnGJNdv7paqWLiwfWH00DPMdBIN6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:49.723351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7540","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fc5f560e3bab0bedd7a12d00446b77c2b358d2c0885edc4d018ca64922979ab","sha256:e4cfbcdd6717b041027a31b128a8bd9a826a1406f04e9bd50549f120220e5729"],"state_sha256":"e60905dedd963f1310095dc312bd60cab1f7479dcab7648d3c008173d41d5b43"}