{"paper":{"title":"Arc-disjoint Steiner Cycles in Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuchu Wang, Jie Bai, Shanshan Yu, Yuefang Sun","submitted_at":"2026-05-15T09:27:57Z","abstract_excerpt":"Let $D=(V(D), A(D))$ be a digraph of order $n$ and let $S\\subseteq V(D)$ with $2\\leq |S|\\leq n$. A directed cycle $C$ of $D$ is called a directed $S$-Steiner cycle (or, an $S$-cycle for short) if $S\\subseteq V(C)$. Steiner cycles have applications in reliable designs for telecommunication and transportation networks. Two $S$-cycles are called arc-disjoint if they have no common arcs. We use $\\lambda_{S}^{c}(D)$ to denote the maximum number of pairwise arc-disjoint $S$-cycles in $D$. The directed cycle $k$-arc-connectivity of $D$ is defined as $$\\lambda_{k}^{c} (D)=\\min\\left \\{ \\lambda _{S}^{c}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.15773","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/2605.15773/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.755430Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.935732Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"803aba47e127efbfa856f30ff4e301f570d20f4b8c25b5765b45192da9fb2c93"},"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"}