{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YTG7I3ZSXX6GNIZ3XEBI3455LG","short_pith_number":"pith:YTG7I3ZS","canonical_record":{"source":{"id":"1706.00546","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-02T03:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"b0ef5c6591d27282edafe1f0d36af0adac0ca28dc6a8764bd512a3298181306b","abstract_canon_sha256":"91a4e403b295c81533658a3a99dc1f6946608e77549288d48d6db51871dcc0f5"},"schema_version":"1.0"},"canonical_sha256":"c4cdf46f32bdfc66a33bb9028df3bd599a448e66c5bc0e52ab060255cbba6791","source":{"kind":"arxiv","id":"1706.00546","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00546","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00546v3","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00546","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"YTG7I3ZSXX6G","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YTG7I3ZSXX6GNIZ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YTG7I3ZS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YTG7I3ZSXX6GNIZ3XEBI3455LG","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00546","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-02T03:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"b0ef5c6591d27282edafe1f0d36af0adac0ca28dc6a8764bd512a3298181306b","abstract_canon_sha256":"91a4e403b295c81533658a3a99dc1f6946608e77549288d48d6db51871dcc0f5"},"schema_version":"1.0"},"canonical_sha256":"c4cdf46f32bdfc66a33bb9028df3bd599a448e66c5bc0e52ab060255cbba6791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.995473Z","signature_b64":"0Q4iR2+wXPGgDBQjviphrMOY7BuE5viwZEHPXqGAe8qutesjXQcerLMtXkZce260TJx6TVCXEVQVki/dhy9/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cdf46f32bdfc66a33bb9028df3bd599a448e66c5bc0e52ab060255cbba6791","last_reissued_at":"2026-05-18T00:03:56.994764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.994764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00546","source_version":3,"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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpgMnN+wRmX45rVzlp5w30QkQ1T5FXGeLykWVrqFzZ2UZj9sxMcxxPXHzw2mn1TroxEIIr3haeMhq1tV3kzSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:27:50.969712Z"},"content_sha256":"fda5c7681c73d4f73263b758bdc0a10f7848a8c19b4797af62dbe833a002d108","schema_version":"1.0","event_id":"sha256:fda5c7681c73d4f73263b758bdc0a10f7848a8c19b4797af62dbe833a002d108"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YTG7I3ZSXX6GNIZ3XEBI3455LG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of k-rainbow cycle colouring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianhua Tu, Shasha Li, Yan Zhao, Yongtang Shi","submitted_at":"2017-06-02T03:54:17Z","abstract_excerpt":"An edge-coloured cycle is $rainbow$ if all edges of the cycle have distinct colours. For $k\\geq 1$, let $\\mathcal{F}_{k}$ denote the family of all graphs with the property that any $k$ vertices lie on a cycle. For $G\\in \\mathcal{F}_{k}$, a $k$-$rainbow$ $cycle$ $colouring$ of $G$ is an edge-colouring such that any $k$ vertices of $G$ lie on a rainbow cycle in $G$. The $k$-$rainbow$ $cycle$ $index$ of $G$, denoted by $crx_{k}(G)$, is the minimum number of colours needed in a $k$-rainbow cycle colouring of $G$. In this paper, we restrict our attention to the computational aspects of $k$-rainbow "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00546","kind":"arxiv","version":3},"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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0cmQPIXt13f+A20DRUPSkws7GnSvC/eTQLfaIRrREqove4ykDW50OhK32A2p9Mf2Yq2LxoacDF3s9bFwuyABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:27:50.970049Z"},"content_sha256":"9e102a80be5dc45e5f39ee03aafcc65c5bb7b5302337a23e16a504af5d4129f8","schema_version":"1.0","event_id":"sha256:9e102a80be5dc45e5f39ee03aafcc65c5bb7b5302337a23e16a504af5d4129f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/bundle.json","state_url":"https://pith.science/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/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-27T05:27:50Z","links":{"resolver":"https://pith.science/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG","bundle":"https://pith.science/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/bundle.json","state":"https://pith.science/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTG7I3ZSXX6GNIZ3XEBI3455LG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YTG7I3ZSXX6GNIZ3XEBI3455LG","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":"91a4e403b295c81533658a3a99dc1f6946608e77549288d48d6db51871dcc0f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-02T03:54:17Z","title_canon_sha256":"b0ef5c6591d27282edafe1f0d36af0adac0ca28dc6a8764bd512a3298181306b"},"schema_version":"1.0","source":{"id":"1706.00546","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00546","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00546v3","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00546","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"YTG7I3ZSXX6G","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YTG7I3ZSXX6GNIZ3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YTG7I3ZS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:9e102a80be5dc45e5f39ee03aafcc65c5bb7b5302337a23e16a504af5d4129f8","target":"graph","created_at":"2026-05-18T00:03:56Z","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":"An edge-coloured cycle is $rainbow$ if all edges of the cycle have distinct colours. For $k\\geq 1$, let $\\mathcal{F}_{k}$ denote the family of all graphs with the property that any $k$ vertices lie on a cycle. For $G\\in \\mathcal{F}_{k}$, a $k$-$rainbow$ $cycle$ $colouring$ of $G$ is an edge-colouring such that any $k$ vertices of $G$ lie on a rainbow cycle in $G$. The $k$-$rainbow$ $cycle$ $index$ of $G$, denoted by $crx_{k}(G)$, is the minimum number of colours needed in a $k$-rainbow cycle colouring of $G$. In this paper, we restrict our attention to the computational aspects of $k$-rainbow ","authors_text":"Jianhua Tu, Shasha Li, Yan Zhao, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-02T03:54:17Z","title":"On the complexity of k-rainbow cycle colouring problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00546","kind":"arxiv","version":3},"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:fda5c7681c73d4f73263b758bdc0a10f7848a8c19b4797af62dbe833a002d108","target":"record","created_at":"2026-05-18T00:03:56Z","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":"91a4e403b295c81533658a3a99dc1f6946608e77549288d48d6db51871dcc0f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-02T03:54:17Z","title_canon_sha256":"b0ef5c6591d27282edafe1f0d36af0adac0ca28dc6a8764bd512a3298181306b"},"schema_version":"1.0","source":{"id":"1706.00546","kind":"arxiv","version":3}},"canonical_sha256":"c4cdf46f32bdfc66a33bb9028df3bd599a448e66c5bc0e52ab060255cbba6791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4cdf46f32bdfc66a33bb9028df3bd599a448e66c5bc0e52ab060255cbba6791","first_computed_at":"2026-05-18T00:03:56.994764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.994764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Q4iR2+wXPGgDBQjviphrMOY7BuE5viwZEHPXqGAe8qutesjXQcerLMtXkZce260TJx6TVCXEVQVki/dhy9/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.995473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00546","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fda5c7681c73d4f73263b758bdc0a10f7848a8c19b4797af62dbe833a002d108","sha256:9e102a80be5dc45e5f39ee03aafcc65c5bb7b5302337a23e16a504af5d4129f8"],"state_sha256":"20c3bb3a6939bb064e15b18eebf5e4bda2682cfbf71008421ea2e3e7cb18fc3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"le68/QsM28ng50oDfILLh9NgPItNs6orfBc0Qb6LwG30uQIvDtJN9KjymkkQnI+iW/OXW9dlsUqTmBavYc4FAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:27:50.971947Z","bundle_sha256":"09c9a7009da5113271a25d39cabbc98d1e34431ef29a0e34f6b14726ada5978f"}}