{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RRDB2CLTY253JSUC62Y342ODPU","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":"2a9bbd5a838caaf28341aaa2d4f3b719c3c7975a57738b6acc90e206ef524f4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:19:39Z","title_canon_sha256":"fff2f597e4fad16dd84ab55b024d562fead247e581b76f68aceeb6d9ab1e6c3c"},"schema_version":"1.0","source":{"id":"1312.3069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3069","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3069v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3069","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"RRDB2CLTY253","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RRDB2CLTY253JSUC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RRDB2CLT","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:493623848f5ff6d60bcde1988ba2a75e16690a1d587f4db0256b20260c1fae6c","target":"graph","created_at":"2026-05-18T03:04:06Z","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":"Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\\rightarrow \\{1,2,\\ldots,q\\},$ $q\\in \\mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is called a $rainbow~tree$ if no two edges of $T$ receive the same color. For a vertex set $S\\subseteq V(G)$, a tree that connects $S$ in $G$ is called an {\\it $S$-tree}. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for every $k$-set $S$ of $V(G)$ is called the {\\it $k$-rainbow index} of $G$, denoted by $rx_k(G)$. Notice that an lower bound and an up","authors_text":"Ingo Schiermeyer, Kang Yang, Xueliang Li, Yan Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:19:39Z","title":"Graphs with $4$-rainbow index $3$ and $n-1$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3069","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:005e9c1346b2a5c3c22683a3b4e2881584eab40fb4358aa426aa8186960f0f47","target":"record","created_at":"2026-05-18T03:04:06Z","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":"2a9bbd5a838caaf28341aaa2d4f3b719c3c7975a57738b6acc90e206ef524f4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:19:39Z","title_canon_sha256":"fff2f597e4fad16dd84ab55b024d562fead247e581b76f68aceeb6d9ab1e6c3c"},"schema_version":"1.0","source":{"id":"1312.3069","kind":"arxiv","version":2}},"canonical_sha256":"8c461d0973c6bbb4ca82f6b1be69c37d17fa8ad81fc221ee4a81306b7c02111a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c461d0973c6bbb4ca82f6b1be69c37d17fa8ad81fc221ee4a81306b7c02111a","first_computed_at":"2026-05-18T03:04:06.088038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.088038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btLJo26XZM39dfuj+nF6urUcDHsVWXQdefgSyVzZMF6RIKzgbhMly18cNINySWv7DPeicyh5E2BgTqUuWoVnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.088462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:005e9c1346b2a5c3c22683a3b4e2881584eab40fb4358aa426aa8186960f0f47","sha256:493623848f5ff6d60bcde1988ba2a75e16690a1d587f4db0256b20260c1fae6c"],"state_sha256":"3e9d4de8238b9909c78b2f38d4fa966eab57cf7ee46c648c237cd0c985e95730"}