{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GQHAZ5W6ZXJZ6VRBRAF3NB666L","short_pith_number":"pith:GQHAZ5W6","schema_version":"1.0","canonical_sha256":"340e0cf6decdd39f5621880bb687def2f728ad98c68678ed3a46777606892b5f","source":{"kind":"arxiv","id":"1301.7314","version":1},"attestation_state":"computed","paper":{"title":"Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk","submitted_at":"2013-01-30T18:11:30Z","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^"},"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":"1301.7314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-30T18:11:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"018a7e30f24bb862af49dafcd40264ba1f6f72abe2673ab6fbdfc59f4af4c5e4","abstract_canon_sha256":"1fa45c9963a3540870472d59b6a88fdf66490633dd61303964d5f1c7f9779697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:00.611463Z","signature_b64":"Dq8k4K1r976LtyG8pNQCKgG4Up08qOjHkrpx5Db2+8FKpypOmQT+/gJ37h6evd58mClD3s/oP1GhvZm95p+SBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"340e0cf6decdd39f5621880bb687def2f728ad98c68678ed3a46777606892b5f","last_reissued_at":"2026-05-18T03:35:00.610690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:00.610690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk","submitted_at":"2013-01-30T18:11:30Z","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^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7314","kind":"arxiv","version":1},"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":"1301.7314","created_at":"2026-05-18T03:35:00.610788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7314v1","created_at":"2026-05-18T03:35:00.610788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7314","created_at":"2026-05-18T03:35:00.610788+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQHAZ5W6ZXJZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQHAZ5W6ZXJZ6VRB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQHAZ5W6","created_at":"2026-05-18T12:27:45.050594+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/GQHAZ5W6ZXJZ6VRBRAF3NB666L","json":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L.json","graph_json":"https://pith.science/api/pith-number/GQHAZ5W6ZXJZ6VRBRAF3NB666L/graph.json","events_json":"https://pith.science/api/pith-number/GQHAZ5W6ZXJZ6VRBRAF3NB666L/events.json","paper":"https://pith.science/paper/GQHAZ5W6"},"agent_actions":{"view_html":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L","download_json":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L.json","view_paper":"https://pith.science/paper/GQHAZ5W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7314&json=true","fetch_graph":"https://pith.science/api/pith-number/GQHAZ5W6ZXJZ6VRBRAF3NB666L/graph.json","fetch_events":"https://pith.science/api/pith-number/GQHAZ5W6ZXJZ6VRBRAF3NB666L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L/action/storage_attestation","attest_author":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L/action/author_attestation","sign_citation":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L/action/citation_signature","submit_replication":"https://pith.science/pith/GQHAZ5W6ZXJZ6VRBRAF3NB666L/action/replication_record"}},"created_at":"2026-05-18T03:35:00.610788+00:00","updated_at":"2026-05-18T03:35:00.610788+00:00"}