{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5WWEW4QLGZB7NDNEBJ766UHS3N","short_pith_number":"pith:5WWEW4QL","schema_version":"1.0","canonical_sha256":"edac4b720b3643f68da40a7fef50f2db594d619e73e8f37509573e57f30a9853","source":{"kind":"arxiv","id":"1404.2377","version":2},"attestation_state":"computed","paper":{"title":"The 3-rainbow index and connected dominating sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qingqiong Cai, Xueliang Li, Yan Zhao","submitted_at":"2014-04-09T06:34:25Z","abstract_excerpt":"A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of $G$ is called 3-rainbow if for any three vertices in $G$, there exists a rainbow tree connecting them. The 3-rainbow index $rx_3(G)$ of $G$ is defined as the minimum number of colors that are needed in a 3-rainbow coloring of $G$. This concept, introduced by Chartrand et al., can be viewed as a generalization of the rainbow connection. In this paper, we study the 3-rainbow index by using connected three-way dominating sets and 3-dominating sets. We shown that for every co"},"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.2377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-09T06:34:25Z","cross_cats_sorted":[],"title_canon_sha256":"078ddab06f2d1389ec311175148dda81599bbbe7d526a3a2c1aa2cc317a031a7","abstract_canon_sha256":"38fbad2864c005b61520b69e6512e20283de67e3defcdcd9ae210430714f0cc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:20.709888Z","signature_b64":"NwKmpon1NsCss4VDevBDvbwjcBgxJrMWAkcO4qnjbx3sE/dLINuQocM01drZx12UCMcXSMPnsFSm0gCHdRa7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edac4b720b3643f68da40a7fef50f2db594d619e73e8f37509573e57f30a9853","last_reissued_at":"2026-05-18T02:54:20.709409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:20.709409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 3-rainbow index and connected dominating sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qingqiong Cai, Xueliang Li, Yan Zhao","submitted_at":"2014-04-09T06:34:25Z","abstract_excerpt":"A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of $G$ is called 3-rainbow if for any three vertices in $G$, there exists a rainbow tree connecting them. The 3-rainbow index $rx_3(G)$ of $G$ is defined as the minimum number of colors that are needed in a 3-rainbow coloring of $G$. This concept, introduced by Chartrand et al., can be viewed as a generalization of the rainbow connection. In this paper, we study the 3-rainbow index by using connected three-way dominating sets and 3-dominating sets. We shown that for every co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2377","kind":"arxiv","version":2},"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.2377","created_at":"2026-05-18T02:54:20.709488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2377v2","created_at":"2026-05-18T02:54:20.709488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2377","created_at":"2026-05-18T02:54:20.709488+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WWEW4QLGZB7","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WWEW4QLGZB7NDNE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WWEW4QL","created_at":"2026-05-18T12:28:16.859392+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/5WWEW4QLGZB7NDNEBJ766UHS3N","json":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N.json","graph_json":"https://pith.science/api/pith-number/5WWEW4QLGZB7NDNEBJ766UHS3N/graph.json","events_json":"https://pith.science/api/pith-number/5WWEW4QLGZB7NDNEBJ766UHS3N/events.json","paper":"https://pith.science/paper/5WWEW4QL"},"agent_actions":{"view_html":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N","download_json":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N.json","view_paper":"https://pith.science/paper/5WWEW4QL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2377&json=true","fetch_graph":"https://pith.science/api/pith-number/5WWEW4QLGZB7NDNEBJ766UHS3N/graph.json","fetch_events":"https://pith.science/api/pith-number/5WWEW4QLGZB7NDNEBJ766UHS3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N/action/storage_attestation","attest_author":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N/action/author_attestation","sign_citation":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N/action/citation_signature","submit_replication":"https://pith.science/pith/5WWEW4QLGZB7NDNEBJ766UHS3N/action/replication_record"}},"created_at":"2026-05-18T02:54:20.709488+00:00","updated_at":"2026-05-18T02:54:20.709488+00:00"}