{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CKIVRZKUIPP6VRBKUB7D4NROZS","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":"333b891933c56e964143911b3c541b9e31aef81c7e9d0a6592e54e7531711b2d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-06-17T13:48:44Z","title_canon_sha256":"a1914b8356170dddce8ac9a0396359148ee4a1a6b8501ba1675b915ead899a1b"},"schema_version":"1.0","source":{"id":"1306.3857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3857","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3857v1","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3857","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"CKIVRZKUIPP6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKIVRZKUIPP6VRBK","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKIVRZKU","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:316b0c548d578f3e8a4f5e1df31b4646c89b098a3383858d01b00d9ff7ea6eff","target":"graph","created_at":"2026-05-18T03:20:46Z","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 connected graph has tree-depth at most $k$ if it is a subgraph of the closure of a rooted tree whose height is at most $k$. We give an algorithm which for a given $n$-vertex graph $G$, in time $\\mathcal{O}(1.9602^n)$ computes the tree-depth of $G$. Our algorithm is based on combinatorial results revealing the structure of minimal rooted trees whose closures contain $G$.","authors_text":"Archontia C. Giannopoulou, Fedor V. Fomin, Micha{\\l} Pilipczuk","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-06-17T13:48:44Z","title":"Computing Tree-depth Faster Than $2^{n}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3857","kind":"arxiv","version":1},"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:0cc6d4c3657d4e7d318bcd9976fd60440147759a2bd4054e8d9935b5c02270ad","target":"record","created_at":"2026-05-18T03:20:46Z","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":"333b891933c56e964143911b3c541b9e31aef81c7e9d0a6592e54e7531711b2d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-06-17T13:48:44Z","title_canon_sha256":"a1914b8356170dddce8ac9a0396359148ee4a1a6b8501ba1675b915ead899a1b"},"schema_version":"1.0","source":{"id":"1306.3857","kind":"arxiv","version":1}},"canonical_sha256":"129158e55443dfeac42aa07e3e362ecca475830e937ad0ce33761989a1180e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"129158e55443dfeac42aa07e3e362ecca475830e937ad0ce33761989a1180e1a","first_computed_at":"2026-05-18T03:20:46.165895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:46.165895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B8GNKk3dLe8krEHviA2FPzJc/nEuzW5TuVCUqeSn6tPinGIXa8YI8eh7vIc7KaF1POxCc9KbkIghYX6q8P+EAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:46.166667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cc6d4c3657d4e7d318bcd9976fd60440147759a2bd4054e8d9935b5c02270ad","sha256:316b0c548d578f3e8a4f5e1df31b4646c89b098a3383858d01b00d9ff7ea6eff"],"state_sha256":"40805ca0e48e5b51e525310c0dc7352479f9865e48bb0749d525edd9fab2371f"}