{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TTV4JXQSCK2EO6INLOY6ROZA3D","short_pith_number":"pith:TTV4JXQS","schema_version":"1.0","canonical_sha256":"9cebc4de1212b447790d5bb1e8bb20d8e96ac58484dabb63230bb74ae87972a7","source":{"kind":"arxiv","id":"1310.2783","version":2},"attestation_state":"computed","paper":{"title":"The $(k,\\ell)$-rainbow index for complete bipartite and multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiangli Song, Qingqiong Cai, Xueliang Li","submitted_at":"2013-10-10T12:10:45Z","abstract_excerpt":"A tree in an edge-colored graph $G$ is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\\ell$ with $k\\geq 3$, the \\emph{$(k,\\ell)$-rainbow index} $rx_{k,\\ell}(G)$ of $G$ is the minimum number of colors needed in an edge-coloring of $G$ such that for any set $S$ of $k$ vertices of $G$, there exist $\\ell$ internally disjoint rainbow trees connecting $S$. This concept was introduced by Chartrand et al., and there have been very few results about it. In this paper, we investigate the $(k,\\ell)$-rainbow index for complete bipartite graphs"},"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":"1310.2783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"d8598dce2a6b85bc0e3f2aa040aa852e94950b2c174abd4e9e132b6a01690548","abstract_canon_sha256":"20c2abb738123f285c4dedcc8ebfd20eee92c435b88e6e45687d99753b63d0cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:02.946560Z","signature_b64":"jgrCIVXg+68BHl262WBTByeEmWzHMMhuMQE8QA6+qy842Cd8BdY1AwvUJFkudT2S80CbidCfzXePJlrff3khDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cebc4de1212b447790d5bb1e8bb20d8e96ac58484dabb63230bb74ae87972a7","last_reissued_at":"2026-05-18T03:10:02.945912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:02.945912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $(k,\\ell)$-rainbow index for complete bipartite and multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiangli Song, Qingqiong Cai, Xueliang Li","submitted_at":"2013-10-10T12:10:45Z","abstract_excerpt":"A tree in an edge-colored graph $G$ is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\\ell$ with $k\\geq 3$, the \\emph{$(k,\\ell)$-rainbow index} $rx_{k,\\ell}(G)$ of $G$ is the minimum number of colors needed in an edge-coloring of $G$ such that for any set $S$ of $k$ vertices of $G$, there exist $\\ell$ internally disjoint rainbow trees connecting $S$. This concept was introduced by Chartrand et al., and there have been very few results about it. In this paper, we investigate the $(k,\\ell)$-rainbow index for complete bipartite graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2783","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":"1310.2783","created_at":"2026-05-18T03:10:02.946003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2783v2","created_at":"2026-05-18T03:10:02.946003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2783","created_at":"2026-05-18T03:10:02.946003+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTV4JXQSCK2E","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTV4JXQSCK2EO6IN","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTV4JXQS","created_at":"2026-05-18T12:28:02.375192+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/TTV4JXQSCK2EO6INLOY6ROZA3D","json":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D.json","graph_json":"https://pith.science/api/pith-number/TTV4JXQSCK2EO6INLOY6ROZA3D/graph.json","events_json":"https://pith.science/api/pith-number/TTV4JXQSCK2EO6INLOY6ROZA3D/events.json","paper":"https://pith.science/paper/TTV4JXQS"},"agent_actions":{"view_html":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D","download_json":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D.json","view_paper":"https://pith.science/paper/TTV4JXQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2783&json=true","fetch_graph":"https://pith.science/api/pith-number/TTV4JXQSCK2EO6INLOY6ROZA3D/graph.json","fetch_events":"https://pith.science/api/pith-number/TTV4JXQSCK2EO6INLOY6ROZA3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D/action/storage_attestation","attest_author":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D/action/author_attestation","sign_citation":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D/action/citation_signature","submit_replication":"https://pith.science/pith/TTV4JXQSCK2EO6INLOY6ROZA3D/action/replication_record"}},"created_at":"2026-05-18T03:10:02.946003+00:00","updated_at":"2026-05-18T03:10:02.946003+00:00"}