{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RFA3BMGCYY3OK2DLMBVLWPWZCD","short_pith_number":"pith:RFA3BMGC","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"},"canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","source":{"kind":"arxiv","id":"1803.03998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03998","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03998v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03998","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"RFA3BMGCYY3O","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RFA3BMGCYY3OK2DL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RFA3BMGC","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RFA3BMGCYY3OK2DLMBVLWPWZCD","target":"record","payload":{"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"},"canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","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"},"source_kind":"arxiv","source_id":"1803.03998","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8njMZdLH+sfTcCOnvYexNwj3iUnHa1BFI1loqZHfdo/rnewAkCURepzPrUjptu0QnEYJ6n0R7Xn8Cs+LQsAWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:12.274158Z"},"content_sha256":"8ff848b0edacc528896d1603a2a87af38ebf24ffb5fe7397a16d3f5e740db2f4","schema_version":"1.0","event_id":"sha256:8ff848b0edacc528896d1603a2a87af38ebf24ffb5fe7397a16d3f5e740db2f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RFA3BMGCYY3OK2DLMBVLWPWZCD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LUTnzJWXGMNguy8BqOE31WQYziZyRmLbwdiY8FGxE/okyZMLXEL4KHKf4D0Zw9nGA8ciAXr+9+JMxSI1TCIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:12.274540Z"},"content_sha256":"7de9dedc46fb64981705da6b2f107c9d191b6e1230f9bae7b75fc52512e6fe46","schema_version":"1.0","event_id":"sha256:7de9dedc46fb64981705da6b2f107c9d191b6e1230f9bae7b75fc52512e6fe46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/bundle.json","state_url":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T11:38:12Z","links":{"resolver":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD","bundle":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/bundle.json","state":"https://pith.science/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFA3BMGCYY3OK2DLMBVLWPWZCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RFA3BMGCYY3OK2DLMBVLWPWZCD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dd7a37511871688fc2ed2724dff1d5b43fa1417c47ff04e950e9e2d1b04b4185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T17:58:40Z","title_canon_sha256":"accc63c704066b2fc5054a8de7cd71c58a46952546fb7070a9b5a0cf5f2eebdd"},"schema_version":"1.0","source":{"id":"1803.03998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03998","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03998v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03998","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"RFA3BMGCYY3O","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RFA3BMGCYY3OK2DL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RFA3BMGC","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7de9dedc46fb64981705da6b2f107c9d191b6e1230f9bae7b75fc52512e6fe46","target":"graph","created_at":"2026-05-18T00:21:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Binlong Li, Shenggui Zhang, Yandong Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T17:58:40Z","title":"Kernels by rainbow paths in arc-colored tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03998","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ff848b0edacc528896d1603a2a87af38ebf24ffb5fe7397a16d3f5e740db2f4","target":"record","created_at":"2026-05-18T00:21:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dd7a37511871688fc2ed2724dff1d5b43fa1417c47ff04e950e9e2d1b04b4185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-11T17:58:40Z","title_canon_sha256":"accc63c704066b2fc5054a8de7cd71c58a46952546fb7070a9b5a0cf5f2eebdd"},"schema_version":"1.0","source":{"id":"1803.03998","kind":"arxiv","version":1}},"canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8941b0b0c2c636e5686b606abb3ed910fa89931ac80e4b38b6fb025a7da943b1","first_computed_at":"2026-05-18T00:21:33.231690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:33.231690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33jl7JgqNpFgbv8TpzxmA2a5ccRzetwibH9T/gR9dKWf/8iJNpgB3II9G04vvOSrnr2LDXpSGMkcweQTmJq5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:33.232409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ff848b0edacc528896d1603a2a87af38ebf24ffb5fe7397a16d3f5e740db2f4","sha256:7de9dedc46fb64981705da6b2f107c9d191b6e1230f9bae7b75fc52512e6fe46"],"state_sha256":"48a625dc3bd4fd028bc9331ea63432c55f9cb0605bd06ab97f55b1a0173050f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJnUgjA5xHOoaugEViDTHmCAZXrzfN051bRJyr0DBs4B/eLITlb79pqVNq+HKRbp6pqIZJQBxnXeaMoY6XY1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:38:12.276648Z","bundle_sha256":"5d8877364cf347b25870f6fdc0c056a05fedad47aa529988ffef8dfdda859276"}}