{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YRAKMHWQ6H4VCJ33DQEMC6XMF3","short_pith_number":"pith:YRAKMHWQ","schema_version":"1.0","canonical_sha256":"c440a61ed0f1f951277b1c08c17aec2eeb8537f1da9854b64bb6b02f00472719","source":{"kind":"arxiv","id":"1504.07140","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Rainbow Connectivity of Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jes\\'us Alva-Samos, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2015-04-27T15:51:21Z","abstract_excerpt":"An arc-coloured digraph $D$ is said to be \\emph{rainbow connected} if for every two vertices $u$ and $v$ there is an $uv$-path all whose arcs have different colours. The minimun number of colours required to make the digraph rainbow connected is called the \\emph{rainbow connection number} of $D$, denoted $\\stackrel{\\rightarrow}{rc}(D)$. In \\cite{Dorbec} it was showed that if $T$ is a strong tournament with $n\\geq 5$ vertices, then $2\\leq \\stackrel{\\rightarrow}{rc}(T)\\leq n-1$; and that for every $n$ and $k$ such that $3\\leq k\\leq n-1$, there exists a tournament $T$ on $n$ vertices such that $\\"},"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":"1504.07140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T15:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"d0453b5e3a1bff89a3627822b618c71fa794fde4a8c2325c7f369d54fcfe1aef","abstract_canon_sha256":"5071fc965808b2d298f0c3033ca3d50164d018088107bed821a4dd1e2685869d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:43.611403Z","signature_b64":"fY2K5AeUfBGMiwPKgzul8eCGrwWdY+zSIwM5sOMhpolwuKihmpuJfZp+6wJRhZIoAkJXyNsjsYOcPg+CTQQGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c440a61ed0f1f951277b1c08c17aec2eeb8537f1da9854b64bb6b02f00472719","last_reissued_at":"2026-05-18T02:17:43.611018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:43.611018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Rainbow Connectivity of Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jes\\'us Alva-Samos, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2015-04-27T15:51:21Z","abstract_excerpt":"An arc-coloured digraph $D$ is said to be \\emph{rainbow connected} if for every two vertices $u$ and $v$ there is an $uv$-path all whose arcs have different colours. The minimun number of colours required to make the digraph rainbow connected is called the \\emph{rainbow connection number} of $D$, denoted $\\stackrel{\\rightarrow}{rc}(D)$. In \\cite{Dorbec} it was showed that if $T$ is a strong tournament with $n\\geq 5$ vertices, then $2\\leq \\stackrel{\\rightarrow}{rc}(T)\\leq n-1$; and that for every $n$ and $k$ such that $3\\leq k\\leq n-1$, there exists a tournament $T$ on $n$ vertices such that $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07140","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":"1504.07140","created_at":"2026-05-18T02:17:43.611077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07140v1","created_at":"2026-05-18T02:17:43.611077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07140","created_at":"2026-05-18T02:17:43.611077+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRAKMHWQ6H4V","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRAKMHWQ6H4VCJ33","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRAKMHWQ","created_at":"2026-05-18T12:29:50.041715+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/YRAKMHWQ6H4VCJ33DQEMC6XMF3","json":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3.json","graph_json":"https://pith.science/api/pith-number/YRAKMHWQ6H4VCJ33DQEMC6XMF3/graph.json","events_json":"https://pith.science/api/pith-number/YRAKMHWQ6H4VCJ33DQEMC6XMF3/events.json","paper":"https://pith.science/paper/YRAKMHWQ"},"agent_actions":{"view_html":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3","download_json":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3.json","view_paper":"https://pith.science/paper/YRAKMHWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07140&json=true","fetch_graph":"https://pith.science/api/pith-number/YRAKMHWQ6H4VCJ33DQEMC6XMF3/graph.json","fetch_events":"https://pith.science/api/pith-number/YRAKMHWQ6H4VCJ33DQEMC6XMF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3/action/storage_attestation","attest_author":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3/action/author_attestation","sign_citation":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3/action/citation_signature","submit_replication":"https://pith.science/pith/YRAKMHWQ6H4VCJ33DQEMC6XMF3/action/replication_record"}},"created_at":"2026-05-18T02:17:43.611077+00:00","updated_at":"2026-05-18T02:17:43.611077+00:00"}