{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TTV4JXQSCK2EO6INLOY6ROZA3D","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":"20c2abb738123f285c4dedcc8ebfd20eee92c435b88e6e45687d99753b63d0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:10:45Z","title_canon_sha256":"d8598dce2a6b85bc0e3f2aa040aa852e94950b2c174abd4e9e132b6a01690548"},"schema_version":"1.0","source":{"id":"1310.2783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2783","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2783v2","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2783","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"TTV4JXQSCK2E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TTV4JXQSCK2EO6IN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TTV4JXQS","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:14503fc94a86264fb963135bde3f3f3fb128fbb300dbc0984457c1de4dcad239","target":"graph","created_at":"2026-05-18T03:10:02Z","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":"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","authors_text":"Jiangli Song, Qingqiong Cai, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:10:45Z","title":"The $(k,\\ell)$-rainbow index for complete bipartite and multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2783","kind":"arxiv","version":2},"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:8e3adb84a919b63dcd6dc9103b9e7433917b2a6e5612446519c3c099cc5adcb2","target":"record","created_at":"2026-05-18T03:10:02Z","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":"20c2abb738123f285c4dedcc8ebfd20eee92c435b88e6e45687d99753b63d0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:10:45Z","title_canon_sha256":"d8598dce2a6b85bc0e3f2aa040aa852e94950b2c174abd4e9e132b6a01690548"},"schema_version":"1.0","source":{"id":"1310.2783","kind":"arxiv","version":2}},"canonical_sha256":"9cebc4de1212b447790d5bb1e8bb20d8e96ac58484dabb63230bb74ae87972a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cebc4de1212b447790d5bb1e8bb20d8e96ac58484dabb63230bb74ae87972a7","first_computed_at":"2026-05-18T03:10:02.945912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:02.945912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jgrCIVXg+68BHl262WBTByeEmWzHMMhuMQE8QA6+qy842Cd8BdY1AwvUJFkudT2S80CbidCfzXePJlrff3khDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:02.946560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e3adb84a919b63dcd6dc9103b9e7433917b2a6e5612446519c3c099cc5adcb2","sha256:14503fc94a86264fb963135bde3f3f3fb128fbb300dbc0984457c1de4dcad239"],"state_sha256":"a9e043eef083565b543650745a827d6f14c0bda04d503c12e82d2dd99f45204b"}