{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GQHAZ5W6ZXJZ6VRBRAF3NB666L","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":"1fa45c9963a3540870472d59b6a88fdf66490633dd61303964d5f1c7f9779697","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T18:11:30Z","title_canon_sha256":"018a7e30f24bb862af49dafcd40264ba1f6f72abe2673ab6fbdfc59f4af4c5e4"},"schema_version":"1.0","source":{"id":"1301.7314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7314","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7314v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7314","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"GQHAZ5W6ZXJZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GQHAZ5W6ZXJZ6VRB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GQHAZ5W6","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:1a34c8e742201e79941b3952a39129aaf64763d34b88a9335ca16ef3056274b6","target":"graph","created_at":"2026-05-18T03:35:00Z","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":"Cutwidth of a digraph is a width measure introduced by Chudnovsky, Fradkin, and Seymour [4] in connection with development of a structural theory for tournaments, or more generally, for semi-complete digraphs. In this paper we provide an algorithm with running time 2^{O(\\sqrt{k log k})} * n^{O(1)} that tests whether the cutwidth of a given n-vertex semi-complete digraph is at most k, improving upon the currently fastest algorithm of the second author [18] that works in 2^{O(k)} * n^2 time. As a byproduct, we obtain a new algorithm for Feedback Arc Set in tournaments (FAST) with running time 2^","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T18:11:30Z","title":"Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7314","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:181941683f108cd1269938faac4cdddd3c4c24bd56fe963fd0b4492e1cf08524","target":"record","created_at":"2026-05-18T03:35:00Z","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":"1fa45c9963a3540870472d59b6a88fdf66490633dd61303964d5f1c7f9779697","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T18:11:30Z","title_canon_sha256":"018a7e30f24bb862af49dafcd40264ba1f6f72abe2673ab6fbdfc59f4af4c5e4"},"schema_version":"1.0","source":{"id":"1301.7314","kind":"arxiv","version":1}},"canonical_sha256":"340e0cf6decdd39f5621880bb687def2f728ad98c68678ed3a46777606892b5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"340e0cf6decdd39f5621880bb687def2f728ad98c68678ed3a46777606892b5f","first_computed_at":"2026-05-18T03:35:00.610690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:00.610690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dq8k4K1r976LtyG8pNQCKgG4Up08qOjHkrpx5Db2+8FKpypOmQT+/gJ37h6evd58mClD3s/oP1GhvZm95p+SBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:00.611463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:181941683f108cd1269938faac4cdddd3c4c24bd56fe963fd0b4492e1cf08524","sha256:1a34c8e742201e79941b3952a39129aaf64763d34b88a9335ca16ef3056274b6"],"state_sha256":"d3099161b147af706257f6f6e1dafe3ae84fdc2e19eb52cdf2cc9d618bf5ad2c"}