{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WCFOIEPH6QK3LEHQQOKYS4N6MY","short_pith_number":"pith:WCFOIEPH","schema_version":"1.0","canonical_sha256":"b08ae411e7f415b590f083958971be66236cb52d2af2ffbd7cd2d51059767051","source":{"kind":"arxiv","id":"1401.7540","version":4},"attestation_state":"computed","paper":{"title":"A Faster Parameterized Algorithm for Treedepth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando Sanchez Villaamil, Peter Rossmanith, Somnath Sikdar","submitted_at":"2014-01-29T15:26:04Z","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"},"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":"1401.7540","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-29T15:26:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7cb58abf43a4ef650207a4aa0bb8f7d36215477b7704c218a6170bc1a96b3d80","abstract_canon_sha256":"c1775d4df881e984d96e9449ebea3725e9cdc152e6a21dabc7d2d702e0868355"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:49.723351Z","signature_b64":"4aXT6v9UmSS3mKjfYe6XMtfLMyrhvCz16RfXgs74B+LHYwZ/qCDu84+kmnGJNdv7paqWLiwfWH00DPMdBIN6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b08ae411e7f415b590f083958971be66236cb52d2af2ffbd7cd2d51059767051","last_reissued_at":"2026-05-18T02:44:49.722976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:49.722976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Parameterized Algorithm for Treedepth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando Sanchez Villaamil, Peter Rossmanith, Somnath Sikdar","submitted_at":"2014-01-29T15:26:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7540","kind":"arxiv","version":4},"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":"1401.7540","created_at":"2026-05-18T02:44:49.723031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7540v4","created_at":"2026-05-18T02:44:49.723031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7540","created_at":"2026-05-18T02:44:49.723031+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCFOIEPH6QK3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCFOIEPH6QK3LEHQ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCFOIEPH","created_at":"2026-05-18T12:28:54.890064+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/WCFOIEPH6QK3LEHQQOKYS4N6MY","json":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY.json","graph_json":"https://pith.science/api/pith-number/WCFOIEPH6QK3LEHQQOKYS4N6MY/graph.json","events_json":"https://pith.science/api/pith-number/WCFOIEPH6QK3LEHQQOKYS4N6MY/events.json","paper":"https://pith.science/paper/WCFOIEPH"},"agent_actions":{"view_html":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY","download_json":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY.json","view_paper":"https://pith.science/paper/WCFOIEPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7540&json=true","fetch_graph":"https://pith.science/api/pith-number/WCFOIEPH6QK3LEHQQOKYS4N6MY/graph.json","fetch_events":"https://pith.science/api/pith-number/WCFOIEPH6QK3LEHQQOKYS4N6MY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY/action/storage_attestation","attest_author":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY/action/author_attestation","sign_citation":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY/action/citation_signature","submit_replication":"https://pith.science/pith/WCFOIEPH6QK3LEHQQOKYS4N6MY/action/replication_record"}},"created_at":"2026-05-18T02:44:49.723031+00:00","updated_at":"2026-05-18T02:44:49.723031+00:00"}