{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IPGLXUO26CIAYP5Q2UNUA2KOYP","short_pith_number":"pith:IPGLXUO2","schema_version":"1.0","canonical_sha256":"43ccbbd1daf0900c3fb0d51b40694ec3ee04a1f59eb711633cc597ebaee8a795","source":{"kind":"arxiv","id":"2605.15773","version":1},"attestation_state":"computed","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}"},"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":"2605.15773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T09:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"6bdd44bf0aec25ebdd59bac20325fe70f9517d65dcfe47fd1aaf73939f2e76ab","abstract_canon_sha256":"57b904fcdf2a9b344ce89138794545e4dcc62c55e9e91a8c888e2879536f1dad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:17.564476Z","signature_b64":"vwXLnhZBDsUASxCLSI41b1PkrCyjsJVSK9JXTwUNgup022Liy000OdxWPdfXV3pL+Vap7yFEQ519CNVExhLIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43ccbbd1daf0900c3fb0d51b40694ec3ee04a1f59eb711633cc597ebaee8a795","last_reissued_at":"2026-05-20T00:01:17.563811Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:17.563811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.15773","created_at":"2026-05-20T00:01:17.563931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15773v1","created_at":"2026-05-20T00:01:17.563931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15773","created_at":"2026-05-20T00:01:17.563931+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPGLXUO26CIA","created_at":"2026-05-20T00:01:17.563931+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPGLXUO26CIAYP5Q","created_at":"2026-05-20T00:01:17.563931+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPGLXUO2","created_at":"2026-05-20T00:01:17.563931+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/IPGLXUO26CIAYP5Q2UNUA2KOYP","json":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP.json","graph_json":"https://pith.science/api/pith-number/IPGLXUO26CIAYP5Q2UNUA2KOYP/graph.json","events_json":"https://pith.science/api/pith-number/IPGLXUO26CIAYP5Q2UNUA2KOYP/events.json","paper":"https://pith.science/paper/IPGLXUO2"},"agent_actions":{"view_html":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP","download_json":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP.json","view_paper":"https://pith.science/paper/IPGLXUO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15773&json=true","fetch_graph":"https://pith.science/api/pith-number/IPGLXUO26CIAYP5Q2UNUA2KOYP/graph.json","fetch_events":"https://pith.science/api/pith-number/IPGLXUO26CIAYP5Q2UNUA2KOYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP/action/storage_attestation","attest_author":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP/action/author_attestation","sign_citation":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP/action/citation_signature","submit_replication":"https://pith.science/pith/IPGLXUO26CIAYP5Q2UNUA2KOYP/action/replication_record"}},"created_at":"2026-05-20T00:01:17.563931+00:00","updated_at":"2026-05-20T00:01:17.563931+00:00"}