{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QIV73GGMNDWW6ALYCAD62VWTS6","short_pith_number":"pith:QIV73GGM","canonical_record":{"source":{"id":"1205.1670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T12:25:19Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"d1a02375d8911732689904e09c1fb9f6511e23cc25d878d8a7c21afa14b77bfa","abstract_canon_sha256":"e764bf9ef8baaf152f0772c377c4500fab31ccbbf8896c1493d1caca9fff4cca"},"schema_version":"1.0"},"canonical_sha256":"822bfd98cc68ed6f01781007ed56d3978ff0ad1db65ce79f8e897fb6a9f7a632","source":{"kind":"arxiv","id":"1205.1670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1670","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1670v1","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1670","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"QIV73GGMNDWW","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIV73GGMNDWW6ALY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIV73GGM","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QIV73GGMNDWW6ALYCAD62VWTS6","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T12:25:19Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"d1a02375d8911732689904e09c1fb9f6511e23cc25d878d8a7c21afa14b77bfa","abstract_canon_sha256":"e764bf9ef8baaf152f0772c377c4500fab31ccbbf8896c1493d1caca9fff4cca"},"schema_version":"1.0"},"canonical_sha256":"822bfd98cc68ed6f01781007ed56d3978ff0ad1db65ce79f8e897fb6a9f7a632","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:09.492432Z","signature_b64":"UqIbPMfeftgM9Doa7oMvieWVTutHM3lGDQjqkInnoLOUi0Wkj+/DLNetUSRw6WEOuaKpihf9+EaSnfN62yRbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"822bfd98cc68ed6f01781007ed56d3978ff0ad1db65ce79f8e897fb6a9f7a632","last_reissued_at":"2026-05-18T03:56:09.491629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:09.491629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1670","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-18T03:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jns2R0hJ7mYVoBOab4GYmPXsbIxZcMWM8FUMPYZjU04Im8vcyxXKmNktncWEfohjGeDNH9luOzLOw9DeqZerAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:12:54.499483Z"},"content_sha256":"ed3076276f0c3ccddc0abc22a70c51a24e74ee3fe7a208d9cfb976b3479b9984","schema_version":"1.0","event_id":"sha256:ed3076276f0c3ccddc0abc22a70c51a24e74ee3fe7a208d9cfb976b3479b9984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QIV73GGMNDWW6ALYCAD62VWTS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Colouring of Split and Threshold Graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran","submitted_at":"2012-05-08T12:25:19Z","abstract_excerpt":"A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. In this article, we show the following:\n  1. The problem of deciding whether a graph can be rainbow coloured using 3 colours remains NP-complete even when restricted to the class of split graphs. However, any s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1670","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-18T03:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Mw7tJ2kYTf41WMm0gMvQhLzbXyL8cAtiRixHPNGhfU0DBvTAtBGiAgK1b/ydGDbtuICHU15tD6N/3n5wCiMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:12:54.500152Z"},"content_sha256":"8a1d73ce92c70afeff56ae7059243e52a1c1ee1312ce1c2d0e6168b88962cde7","schema_version":"1.0","event_id":"sha256:8a1d73ce92c70afeff56ae7059243e52a1c1ee1312ce1c2d0e6168b88962cde7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIV73GGMNDWW6ALYCAD62VWTS6/bundle.json","state_url":"https://pith.science/pith/QIV73GGMNDWW6ALYCAD62VWTS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIV73GGMNDWW6ALYCAD62VWTS6/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-05-31T22:12:54Z","links":{"resolver":"https://pith.science/pith/QIV73GGMNDWW6ALYCAD62VWTS6","bundle":"https://pith.science/pith/QIV73GGMNDWW6ALYCAD62VWTS6/bundle.json","state":"https://pith.science/pith/QIV73GGMNDWW6ALYCAD62VWTS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIV73GGMNDWW6ALYCAD62VWTS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QIV73GGMNDWW6ALYCAD62VWTS6","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":"e764bf9ef8baaf152f0772c377c4500fab31ccbbf8896c1493d1caca9fff4cca","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T12:25:19Z","title_canon_sha256":"d1a02375d8911732689904e09c1fb9f6511e23cc25d878d8a7c21afa14b77bfa"},"schema_version":"1.0","source":{"id":"1205.1670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1670","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1670v1","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1670","created_at":"2026-05-18T03:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"QIV73GGMNDWW","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIV73GGMNDWW6ALY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIV73GGM","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:8a1d73ce92c70afeff56ae7059243e52a1c1ee1312ce1c2d0e6168b88962cde7","target":"graph","created_at":"2026-05-18T03:56:09Z","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 colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. In this article, we show the following:\n  1. The problem of deciding whether a graph can be rainbow coloured using 3 colours remains NP-complete even when restricted to the class of split graphs. However, any s","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran","cross_cats":["cs.CC","cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T12:25:19Z","title":"Rainbow Colouring of Split and Threshold Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1670","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:ed3076276f0c3ccddc0abc22a70c51a24e74ee3fe7a208d9cfb976b3479b9984","target":"record","created_at":"2026-05-18T03:56:09Z","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":"e764bf9ef8baaf152f0772c377c4500fab31ccbbf8896c1493d1caca9fff4cca","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T12:25:19Z","title_canon_sha256":"d1a02375d8911732689904e09c1fb9f6511e23cc25d878d8a7c21afa14b77bfa"},"schema_version":"1.0","source":{"id":"1205.1670","kind":"arxiv","version":1}},"canonical_sha256":"822bfd98cc68ed6f01781007ed56d3978ff0ad1db65ce79f8e897fb6a9f7a632","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"822bfd98cc68ed6f01781007ed56d3978ff0ad1db65ce79f8e897fb6a9f7a632","first_computed_at":"2026-05-18T03:56:09.491629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:09.491629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UqIbPMfeftgM9Doa7oMvieWVTutHM3lGDQjqkInnoLOUi0Wkj+/DLNetUSRw6WEOuaKpihf9+EaSnfN62yRbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:09.492432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3076276f0c3ccddc0abc22a70c51a24e74ee3fe7a208d9cfb976b3479b9984","sha256:8a1d73ce92c70afeff56ae7059243e52a1c1ee1312ce1c2d0e6168b88962cde7"],"state_sha256":"90e0273686792f22cc331a51a1ddbc5df01473291c835db42ce4b073a7b3914f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GEfAdhx2m10lpCiYj3qbrycTg6tfGYkFxyTDcWYDs7fvmEvL2fRBUa1slpj6Upap/h+1zahAczWyggUgwOxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:12:54.503769Z","bundle_sha256":"0b852ff3d3fe2db08486b1429fac70743f7d41fa630ca8b226f7eadef5898f55"}}