{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YRAKMHWQ6H4VCJ33DQEMC6XMF3","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":"5071fc965808b2d298f0c3033ca3d50164d018088107bed821a4dd1e2685869d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T15:51:21Z","title_canon_sha256":"d0453b5e3a1bff89a3627822b618c71fa794fde4a8c2325c7f369d54fcfe1aef"},"schema_version":"1.0","source":{"id":"1504.07140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07140","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07140v1","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07140","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"YRAKMHWQ6H4V","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YRAKMHWQ6H4VCJ33","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YRAKMHWQ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:6b1f5acc9bef2c91ac1afb868bf2be5353e76e5ebca7d38158bec5c8c1ee73f5","target":"graph","created_at":"2026-05-18T02:17:43Z","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 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 $\\","authors_text":"Jes\\'us Alva-Samos, Juan Jos\\'e Montellano-Ballesteros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T15:51:21Z","title":"A Note on the Rainbow Connectivity of Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07140","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:896950d3e4066da50bae6c0c9f304afff41c8210f4676d5a4e08d08e0355c73f","target":"record","created_at":"2026-05-18T02:17:43Z","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":"5071fc965808b2d298f0c3033ca3d50164d018088107bed821a4dd1e2685869d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-27T15:51:21Z","title_canon_sha256":"d0453b5e3a1bff89a3627822b618c71fa794fde4a8c2325c7f369d54fcfe1aef"},"schema_version":"1.0","source":{"id":"1504.07140","kind":"arxiv","version":1}},"canonical_sha256":"c440a61ed0f1f951277b1c08c17aec2eeb8537f1da9854b64bb6b02f00472719","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c440a61ed0f1f951277b1c08c17aec2eeb8537f1da9854b64bb6b02f00472719","first_computed_at":"2026-05-18T02:17:43.611018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:43.611018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fY2K5AeUfBGMiwPKgzul8eCGrwWdY+zSIwM5sOMhpolwuKihmpuJfZp+6wJRhZIoAkJXyNsjsYOcPg+CTQQGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:43.611403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:896950d3e4066da50bae6c0c9f304afff41c8210f4676d5a4e08d08e0355c73f","sha256:6b1f5acc9bef2c91ac1afb868bf2be5353e76e5ebca7d38158bec5c8c1ee73f5"],"state_sha256":"f9e572e21ed77ab19a13f964a9b4f4970fafd9d6f21b93049bd94d500372ddd8"}