{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HXJ52RNKZERFBTZT2OKGJRH5ED","short_pith_number":"pith:HXJ52RNK","schema_version":"1.0","canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","source":{"kind":"arxiv","id":"2606.29336","version":1},"attestation_state":"computed","paper":{"title":"An FPT algorithm for cycle rank on semi-complete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Myounghwan Lee, O-joung Kwon, Seokbeom Kim","submitted_at":"2026-06-28T11:09:28Z","abstract_excerpt":"Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determining if a given digraph has cycle rank at most $w$ is fixed-parameter tractable parameterized by $w$. We provide such algorithms for semi-complete digraphs, and for digraphs of bounded directed clique-width. Specifically, we show that given an $n$-vertex semi-complete digraph $G$ and an integer $w$, one can in time $\\mathcal{O}(9^{(w+1)4^{w+2}} \\cdot n^2)$ determine whether $G$ has cycle rank at most $w$. The proof i"},"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":"2606.29336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-28T11:09:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a6a2bb88379675f9f965e5e9a8cdbd628417dd6ab9c7b262b14a2855e388b782","abstract_canon_sha256":"0084dc365aa6eeb3b4960895420e87e37f7bd09d59dcee93fc5d7e9cb67a33d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:02.015956Z","signature_b64":"38KLFooj+hwDa4YTK75qDn1tlYBNmADacOTc/IWaugH1Pf62VIW21GKUtYotZYnbOFBX4U2EB5OmYK74tzJ1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd3dd45aac92250cf33d39464c4fd20efaa588e1c0659679003913d9931b718","last_reissued_at":"2026-06-30T01:18:02.015236Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:02.015236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An FPT algorithm for cycle rank on semi-complete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Myounghwan Lee, O-joung Kwon, Seokbeom Kim","submitted_at":"2026-06-28T11:09:28Z","abstract_excerpt":"Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determining if a given digraph has cycle rank at most $w$ is fixed-parameter tractable parameterized by $w$. We provide such algorithms for semi-complete digraphs, and for digraphs of bounded directed clique-width. Specifically, we show that given an $n$-vertex semi-complete digraph $G$ and an integer $w$, one can in time $\\mathcal{O}(9^{(w+1)4^{w+2}} \\cdot n^2)$ determine whether $G$ has cycle rank at most $w$. The proof i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29336","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.29336/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.29336","created_at":"2026-06-30T01:18:02.015353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29336v1","created_at":"2026-06-30T01:18:02.015353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29336","created_at":"2026-06-30T01:18:02.015353+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXJ52RNKZERF","created_at":"2026-06-30T01:18:02.015353+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXJ52RNKZERFBTZT","created_at":"2026-06-30T01:18:02.015353+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXJ52RNK","created_at":"2026-06-30T01:18:02.015353+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/HXJ52RNKZERFBTZT2OKGJRH5ED","json":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED.json","graph_json":"https://pith.science/api/pith-number/HXJ52RNKZERFBTZT2OKGJRH5ED/graph.json","events_json":"https://pith.science/api/pith-number/HXJ52RNKZERFBTZT2OKGJRH5ED/events.json","paper":"https://pith.science/paper/HXJ52RNK"},"agent_actions":{"view_html":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED","download_json":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED.json","view_paper":"https://pith.science/paper/HXJ52RNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29336&json=true","fetch_graph":"https://pith.science/api/pith-number/HXJ52RNKZERFBTZT2OKGJRH5ED/graph.json","fetch_events":"https://pith.science/api/pith-number/HXJ52RNKZERFBTZT2OKGJRH5ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/action/storage_attestation","attest_author":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/action/author_attestation","sign_citation":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/action/citation_signature","submit_replication":"https://pith.science/pith/HXJ52RNKZERFBTZT2OKGJRH5ED/action/replication_record"}},"created_at":"2026-06-30T01:18:02.015353+00:00","updated_at":"2026-06-30T01:18:02.015353+00:00"}