{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3QQDUQ3VY25IPJQQNOMZGUOACA","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":"cef3c0248e5119d94f09a0f6eae2517cdbc2fccf66e47b75f5ab156f148cffd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T13:49:28Z","title_canon_sha256":"13126c99f437ebd8fbe0aa72b6664bff82832800fc24508368dfed18fb58e28e"},"schema_version":"1.0","source":{"id":"1610.05616","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05616","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05616v2","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05616","created_at":"2026-05-18T01:01:51Z"},{"alias_kind":"pith_short_12","alias_value":"3QQDUQ3VY25I","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3QQDUQ3VY25IPJQQ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3QQDUQ3V","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:0ed8a3e3b1b8b903f9beef0d810eed787d7aac79f03ed0803a1551b4cc6010e5","target":"graph","created_at":"2026-05-18T01:01:51Z","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 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","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T13:49:28Z","title":"3-Rainbow index and forbidden subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05616","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:6bc30419e5a22447beee5eb7365b0246e883bc926de192b704103b3ee6364be9","target":"record","created_at":"2026-05-18T01:01:51Z","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":"cef3c0248e5119d94f09a0f6eae2517cdbc2fccf66e47b75f5ab156f148cffd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T13:49:28Z","title_canon_sha256":"13126c99f437ebd8fbe0aa72b6664bff82832800fc24508368dfed18fb58e28e"},"schema_version":"1.0","source":{"id":"1610.05616","kind":"arxiv","version":2}},"canonical_sha256":"dc203a4375c6ba87a6106b999351c0102f833ead21d7f964cc71fd0a7d4f18f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc203a4375c6ba87a6106b999351c0102f833ead21d7f964cc71fd0a7d4f18f5","first_computed_at":"2026-05-18T01:01:51.198599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:51.198599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+8k8SzdsgN1nou2OPC4IDMB3aUbC1CboEntLQnS1VFCGVT/O6eSHsX5/JCzHaWfO0fkDD//NCaeCatX59MX3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:51.199513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05616","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bc30419e5a22447beee5eb7365b0246e883bc926de192b704103b3ee6364be9","sha256:0ed8a3e3b1b8b903f9beef0d810eed787d7aac79f03ed0803a1551b4cc6010e5"],"state_sha256":"c9c2228456164b3cc504e3c03eabcd7a981f5284ef2094b2960f68e74631a401"}