{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MZGQEP3QOG7OUVZDWSZ6AZXIW3","short_pith_number":"pith:MZGQEP3Q","canonical_record":{"source":{"id":"1404.4478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-17T10:41:32Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"51c556f7261cc72733d236fb30cb15bad9adc185b426f9d5badb695fc7e3aa2d","abstract_canon_sha256":"fb617cdb098aee443fc5571dd4b372f5ea0bb1c570142acb67b972842f3d8600"},"schema_version":"1.0"},"canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","source":{"kind":"arxiv","id":"1404.4478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4478","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4478v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4478","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"MZGQEP3QOG7O","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZGQEP3QOG7OUVZD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZGQEP3Q","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MZGQEP3QOG7OUVZDWSZ6AZXIW3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-17T10:41:32Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"51c556f7261cc72733d236fb30cb15bad9adc185b426f9d5badb695fc7e3aa2d","abstract_canon_sha256":"fb617cdb098aee443fc5571dd4b372f5ea0bb1c570142acb67b972842f3d8600"},"schema_version":"1.0"},"canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:04.242356Z","signature_b64":"UfCIsWlvUNM3EZzUJk+n7KTaVfFNwa8jfsmMAwDIetvY5W5x28iBgH9++67RP7zHgK2rYPSCGlL2OynsWetTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","last_reissued_at":"2026-05-18T02:54:04.241716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:04.241716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4478","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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5iAiwP463LUGPVUKNg+znJx1Di8X7NAZ0oe/pvgTJCqjvVXc/EkdhLGAq6m6sOknksg3GMKpQWLsdch3QwZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:46:01.887031Z"},"content_sha256":"beef6a30d477d29bb834d87719959eadbc35e68a20942e8e8a9be721c6bffbfd","schema_version":"1.0","event_id":"sha256:beef6a30d477d29bb834d87719959eadbc35e68a20942e8e8a9be721c6bffbfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MZGQEP3QOG7OUVZDWSZ6AZXIW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Colouring of Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Marek Tesa\\v{r}","submitted_at":"2014-04-17T10:41:32Z","abstract_excerpt":"A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path. The minimum number of colours required to rainbow colour G is called its rainbow connection number. Between them, Chakraborty et al. [J. Comb. Optim., 2011] and Ananth et al. [FSTTCS, 2012] have shown that for every integer k, k \\geq 2, it is NP-complete to decide whether a given graph can be rainbow coloured using k colours.\n  A split graph is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4478","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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5YO2EYW4VqqjMBNf6mk9h8XWkxB9KWrq2JvKEARqlpE7CyuR9NUOo9nC+eJtCPocmvhcHV24hD3kDsDyYlPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:46:01.887392Z"},"content_sha256":"cc1d023a2870ec8d828da11da6201c1d58c1dccca033e7d8a2e982fb7d769eee","schema_version":"1.0","event_id":"sha256:cc1d023a2870ec8d828da11da6201c1d58c1dccca033e7d8a2e982fb7d769eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/bundle.json","state_url":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/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-01T02:46:01Z","links":{"resolver":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3","bundle":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/bundle.json","state":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MZGQEP3QOG7OUVZDWSZ6AZXIW3","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":"fb617cdb098aee443fc5571dd4b372f5ea0bb1c570142acb67b972842f3d8600","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-17T10:41:32Z","title_canon_sha256":"51c556f7261cc72733d236fb30cb15bad9adc185b426f9d5badb695fc7e3aa2d"},"schema_version":"1.0","source":{"id":"1404.4478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4478","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4478v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4478","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"MZGQEP3QOG7O","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZGQEP3QOG7OUVZD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZGQEP3Q","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:cc1d023a2870ec8d828da11da6201c1d58c1dccca033e7d8a2e982fb7d769eee","target":"graph","created_at":"2026-05-18T02:54:04Z","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":"A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path. The minimum number of colours required to rainbow colour G is called its rainbow connection number. Between them, Chakraborty et al. [J. Comb. Optim., 2011] and Ananth et al. [FSTTCS, 2012] have shown that for every integer k, k \\geq 2, it is NP-complete to decide whether a given graph can be rainbow coloured using k colours.\n  A split graph is ","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Marek Tesa\\v{r}","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-17T10:41:32Z","title":"Rainbow Colouring of Split Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4478","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:beef6a30d477d29bb834d87719959eadbc35e68a20942e8e8a9be721c6bffbfd","target":"record","created_at":"2026-05-18T02:54:04Z","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":"fb617cdb098aee443fc5571dd4b372f5ea0bb1c570142acb67b972842f3d8600","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-17T10:41:32Z","title_canon_sha256":"51c556f7261cc72733d236fb30cb15bad9adc185b426f9d5badb695fc7e3aa2d"},"schema_version":"1.0","source":{"id":"1404.4478","kind":"arxiv","version":1}},"canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","first_computed_at":"2026-05-18T02:54:04.241716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:04.241716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UfCIsWlvUNM3EZzUJk+n7KTaVfFNwa8jfsmMAwDIetvY5W5x28iBgH9++67RP7zHgK2rYPSCGlL2OynsWetTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:04.242356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beef6a30d477d29bb834d87719959eadbc35e68a20942e8e8a9be721c6bffbfd","sha256:cc1d023a2870ec8d828da11da6201c1d58c1dccca033e7d8a2e982fb7d769eee"],"state_sha256":"6acd091817463ea4c32c7a872dabfb2b4e4907a01142df5e334846626ba538cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+Aa/wHp+P9VF032jsD2Cdo1jvAMZp1v0SoLyMRqGp+pU1Clc3HI3ofGQXz3uVUZDsrrcWHByDY5YE9EVV/iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:46:01.889500Z","bundle_sha256":"8c1608d6a9f756df66aa4556cf0d5b8f5bda4cb1d5e02067daa00141928b8217"}}