{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MZGQEP3QOG7OUVZDWSZ6AZXIW3","short_pith_number":"pith:MZGQEP3Q","schema_version":"1.0","canonical_sha256":"664d023f7071beea5723b4b3e066e8b6eb877bee4d20b1e3c901eb3fed499963","source":{"kind":"arxiv","id":"1404.4478","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.4478","created_at":"2026-05-18T02:54:04.241808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4478v1","created_at":"2026-05-18T02:54:04.241808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4478","created_at":"2026-05-18T02:54:04.241808+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZGQEP3QOG7O","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZGQEP3QOG7OUVZD","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZGQEP3Q","created_at":"2026-05-18T12:28:41.024544+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/MZGQEP3QOG7OUVZDWSZ6AZXIW3","json":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3.json","graph_json":"https://pith.science/api/pith-number/MZGQEP3QOG7OUVZDWSZ6AZXIW3/graph.json","events_json":"https://pith.science/api/pith-number/MZGQEP3QOG7OUVZDWSZ6AZXIW3/events.json","paper":"https://pith.science/paper/MZGQEP3Q"},"agent_actions":{"view_html":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3","download_json":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3.json","view_paper":"https://pith.science/paper/MZGQEP3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4478&json=true","fetch_graph":"https://pith.science/api/pith-number/MZGQEP3QOG7OUVZDWSZ6AZXIW3/graph.json","fetch_events":"https://pith.science/api/pith-number/MZGQEP3QOG7OUVZDWSZ6AZXIW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/action/storage_attestation","attest_author":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/action/author_attestation","sign_citation":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/action/citation_signature","submit_replication":"https://pith.science/pith/MZGQEP3QOG7OUVZDWSZ6AZXIW3/action/replication_record"}},"created_at":"2026-05-18T02:54:04.241808+00:00","updated_at":"2026-05-18T02:54:04.241808+00:00"}