{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3QQDUQ3VY25IPJQQNOMZGUOACA","short_pith_number":"pith:3QQDUQ3V","schema_version":"1.0","canonical_sha256":"dc203a4375c6ba87a6106b999351c0102f833ead21d7f964cc71fd0a7d4f18f5","source":{"kind":"arxiv","id":"1610.05616","version":2},"attestation_state":"computed","paper":{"title":"3-Rainbow index and forbidden subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-10-18T13:49:28Z","abstract_excerpt":"A tree in an edge-colored connected graph $G$ is called \\emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset $S\\subseteq V(G)$, a tree is called an \\emph{$S$-tree} if it connects $S$ in $G$. A \\emph{$k$-rainbow coloring} of $G$ is an edge-coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a rainbow $S$-tree in $G$. The minimum number of colors that are needed in a $k$-rainbow coloring of $G$ is the \\emph{$k$-rainbow index} of $G$, denoted by $rx_k(G)$. The \\emph{Steiner distance $d(S)$} of a set $S$ of vertice"},"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":"1610.05616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T13:49:28Z","cross_cats_sorted":[],"title_canon_sha256":"13126c99f437ebd8fbe0aa72b6664bff82832800fc24508368dfed18fb58e28e","abstract_canon_sha256":"cef3c0248e5119d94f09a0f6eae2517cdbc2fccf66e47b75f5ab156f148cffd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:51.199513Z","signature_b64":"+8k8SzdsgN1nou2OPC4IDMB3aUbC1CboEntLQnS1VFCGVT/O6eSHsX5/JCzHaWfO0fkDD//NCaeCatX59MX3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc203a4375c6ba87a6106b999351c0102f833ead21d7f964cc71fd0a7d4f18f5","last_reissued_at":"2026-05-18T01:01:51.198599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:51.198599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-Rainbow index and forbidden subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-10-18T13:49:28Z","abstract_excerpt":"A tree in an edge-colored connected graph $G$ is called \\emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset $S\\subseteq V(G)$, a tree is called an \\emph{$S$-tree} if it connects $S$ in $G$. A \\emph{$k$-rainbow coloring} of $G$ is an edge-coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a rainbow $S$-tree in $G$. The minimum number of colors that are needed in a $k$-rainbow coloring of $G$ is the \\emph{$k$-rainbow index} of $G$, denoted by $rx_k(G)$. The \\emph{Steiner distance $d(S)$} of a set $S$ of vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05616","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":"1610.05616","created_at":"2026-05-18T01:01:51.198722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05616v2","created_at":"2026-05-18T01:01:51.198722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05616","created_at":"2026-05-18T01:01:51.198722+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QQDUQ3VY25I","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QQDUQ3VY25IPJQQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QQDUQ3V","created_at":"2026-05-18T12:29:55.572404+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/3QQDUQ3VY25IPJQQNOMZGUOACA","json":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA.json","graph_json":"https://pith.science/api/pith-number/3QQDUQ3VY25IPJQQNOMZGUOACA/graph.json","events_json":"https://pith.science/api/pith-number/3QQDUQ3VY25IPJQQNOMZGUOACA/events.json","paper":"https://pith.science/paper/3QQDUQ3V"},"agent_actions":{"view_html":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA","download_json":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA.json","view_paper":"https://pith.science/paper/3QQDUQ3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05616&json=true","fetch_graph":"https://pith.science/api/pith-number/3QQDUQ3VY25IPJQQNOMZGUOACA/graph.json","fetch_events":"https://pith.science/api/pith-number/3QQDUQ3VY25IPJQQNOMZGUOACA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA/action/storage_attestation","attest_author":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA/action/author_attestation","sign_citation":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA/action/citation_signature","submit_replication":"https://pith.science/pith/3QQDUQ3VY25IPJQQNOMZGUOACA/action/replication_record"}},"created_at":"2026-05-18T01:01:51.198722+00:00","updated_at":"2026-05-18T01:01:51.198722+00:00"}