{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RFA3BMGCYY3OK2DLMBVLWPWZCD","short_pith_number":"pith:RFA3BMGC","schema_version":"1.0","canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","source":{"kind":"arxiv","id":"1803.03998","version":1},"attestation_state":"computed","paper":{"title":"Kernels by rainbow paths in arc-colored tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Shenggui Zhang, Yandong Bai","submitted_at":"2018-03-11T17:58:40Z","abstract_excerpt":"For an arc-colored digraph $D$, define its {\\em kernel by rainbow paths} to be a set $S$ of vertices such that (i) no two vertices of $S$ are connected by a rainbow path in $D$, and (ii) every vertex outside $S$ can reach $S$ by a rainbow path in $D$. In this paper, we show that it is NP-complete to decide whether an arc-colored tournament has a kernel by rainbow paths, where a {\\em tournament} is an orientation of a complete graph. In addition, we show that every arc-colored $n$-vertex tournament with all its strongly connected $k$-vertex subtournaments, $3\\leq k\\leq n$, colored with at least"},"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":"1803.03998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T17:58:40Z","cross_cats_sorted":[],"title_canon_sha256":"accc63c704066b2fc5054a8de7cd71c58a46952546fb7070a9b5a0cf5f2eebdd","abstract_canon_sha256":"dd7a37511871688fc2ed2724dff1d5b43fa1417c47ff04e950e9e2d1b04b4185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:33.232409Z","signature_b64":"33jl7JgqNpFgbv8TpzxmA2a5ccRzetwibH9T/gR9dKWf/8iJNpgB3II9G04vvOSrnr2LDXpSGMkcweQTmJq5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","last_reissued_at":"2026-05-18T00:21:33.231690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:33.231690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernels by rainbow paths in arc-colored tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Shenggui Zhang, Yandong Bai","submitted_at":"2018-03-11T17:58:40Z","abstract_excerpt":"For an arc-colored digraph $D$, define its {\\em kernel by rainbow paths} to be a set $S$ of vertices such that (i) no two vertices of $S$ are connected by a rainbow path in $D$, and (ii) every vertex outside $S$ can reach $S$ by a rainbow path in $D$. In this paper, we show that it is NP-complete to decide whether an arc-colored tournament has a kernel by rainbow paths, where a {\\em tournament} is an orientation of a complete graph. In addition, we show that every arc-colored $n$-vertex tournament with all its strongly connected $k$-vertex subtournaments, $3\\leq k\\leq n$, colored with at least"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03998","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":"1803.03998","created_at":"2026-05-18T00:21:33.231806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03998v1","created_at":"2026-05-18T00:21:33.231806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03998","created_at":"2026-05-18T00:21:33.231806+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFA3BMGCYY3O","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFA3BMGCYY3OK2DL","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFA3BMGC","created_at":"2026-05-18T12:32:50.500415+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/RFA3BMGCYY3OK2DLMBVLWPWZCD","json":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD.json","graph_json":"https://pith.science/api/pith-number/RFA3BMGCYY3OK2DLMBVLWPWZCD/graph.json","events_json":"https://pith.science/api/pith-number/RFA3BMGCYY3OK2DLMBVLWPWZCD/events.json","paper":"https://pith.science/paper/RFA3BMGC"},"agent_actions":{"view_html":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD","download_json":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD.json","view_paper":"https://pith.science/paper/RFA3BMGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03998&json=true","fetch_graph":"https://pith.science/api/pith-number/RFA3BMGCYY3OK2DLMBVLWPWZCD/graph.json","fetch_events":"https://pith.science/api/pith-number/RFA3BMGCYY3OK2DLMBVLWPWZCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/action/storage_attestation","attest_author":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/action/author_attestation","sign_citation":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/action/citation_signature","submit_replication":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/action/replication_record"}},"created_at":"2026-05-18T00:21:33.231806+00:00","updated_at":"2026-05-18T00:21:33.231806+00:00"}