{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MA2RIMDH3RNQIML3F7KCH6TAX7","short_pith_number":"pith:MA2RIMDH","canonical_record":{"source":{"id":"1310.2353","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"11d26c2c27f88afef1140dfc53dff223cce28658cf0ab7819086a2d5a242f20e","abstract_canon_sha256":"44d7095949be685656579d8b31bfb4c990bac1bad563224410ce6a444d3aae4c"},"schema_version":"1.0"},"canonical_sha256":"6035143067dc5b04317b2fd423fa60bfd3326a22eaac0efe249b805dd3e164bf","source":{"kind":"arxiv","id":"1310.2353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2353","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2353v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2353","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"MA2RIMDH3RNQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MA2RIMDH3RNQIML3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MA2RIMDH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MA2RIMDH3RNQIML3F7KCH6TAX7","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2353","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"11d26c2c27f88afef1140dfc53dff223cce28658cf0ab7819086a2d5a242f20e","abstract_canon_sha256":"44d7095949be685656579d8b31bfb4c990bac1bad563224410ce6a444d3aae4c"},"schema_version":"1.0"},"canonical_sha256":"6035143067dc5b04317b2fd423fa60bfd3326a22eaac0efe249b805dd3e164bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:57.174301Z","signature_b64":"sfsgsaIqjps2tCZu0GDOew8yt6nJbbJe7F8E1/r6XtV1H3bDJhwwiuF9ZJo95QApnIsOerZ5rU2bwFA5lZEAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6035143067dc5b04317b2fd423fa60bfd3326a22eaac0efe249b805dd3e164bf","last_reissued_at":"2026-05-18T03:10:57.173542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:57.173542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2353","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgF2d2Ny5mOK5x48MG+8WM6ef6sk2QG3aqMjGrHn1VUV/JBctjLM00mEZKaHd1D1m0QnlogPfdwdNdeTlq1vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:09.112112Z"},"content_sha256":"ee93b1f4a71530007559fab7c9c43efc51ca9a36833ece5b355237adc66b3361","schema_version":"1.0","event_id":"sha256:ee93b1f4a71530007559fab7c9c43efc51ca9a36833ece5b355237adc66b3361"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MA2RIMDH3RNQIML3F7KCH6TAX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the 3-rainbow index of $K_{2,t}$","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tingting Liu, Yumei Hu","submitted_at":"2013-10-09T05:24:51Z","abstract_excerpt":"A tree $T$, in an edge-colored graph $G$, is called {\\em a rainbow tree} if no two edges of $T$ are assigned the same color. For a vertex subset $S\\in V(G)$, a tree that connects $S$ in $G$ is called an $S$-tree. A {\\em $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 $T$ in $G$. The minimum number of colors needed in a $k$-rainbow coloring of $G$ is the {\\em $k$-rainbow index of $G$}, denoted by $rx_k(G)$. In this paper, we obtain the exact values of $rx_3(K_{2,t})$ for any $t\\geq 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2353","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnjZfIa2T79m2FzPyVsAZGhse/8T3K+ReKWRVvKzrmK7rt2pPNCRN/m1GPZ7TbypB9mWE9EpiJVqH+VikauRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:48:09.112473Z"},"content_sha256":"70e9046c7ee7890fedcb03f13c60036f4c89f9e44f6bb835a0217ac7f7ee089f","schema_version":"1.0","event_id":"sha256:70e9046c7ee7890fedcb03f13c60036f4c89f9e44f6bb835a0217ac7f7ee089f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/bundle.json","state_url":"https://pith.science/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T10:48:09Z","links":{"resolver":"https://pith.science/pith/MA2RIMDH3RNQIML3F7KCH6TAX7","bundle":"https://pith.science/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/bundle.json","state":"https://pith.science/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MA2RIMDH3RNQIML3F7KCH6TAX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MA2RIMDH3RNQIML3F7KCH6TAX7","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":"44d7095949be685656579d8b31bfb4c990bac1bad563224410ce6a444d3aae4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:24:51Z","title_canon_sha256":"11d26c2c27f88afef1140dfc53dff223cce28658cf0ab7819086a2d5a242f20e"},"schema_version":"1.0","source":{"id":"1310.2353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2353","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2353v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2353","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"MA2RIMDH3RNQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"MA2RIMDH3RNQIML3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"MA2RIMDH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:70e9046c7ee7890fedcb03f13c60036f4c89f9e44f6bb835a0217ac7f7ee089f","target":"graph","created_at":"2026-05-18T03:10:57Z","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 $T$, in an edge-colored graph $G$, is called {\\em a rainbow tree} if no two edges of $T$ are assigned the same color. For a vertex subset $S\\in V(G)$, a tree that connects $S$ in $G$ is called an $S$-tree. A {\\em $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 $T$ in $G$. The minimum number of colors needed in a $k$-rainbow coloring of $G$ is the {\\em $k$-rainbow index of $G$}, denoted by $rx_k(G)$. In this paper, we obtain the exact values of $rx_3(K_{2,t})$ for any $t\\geq 1$.","authors_text":"Tingting Liu, Yumei Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:24:51Z","title":"A note on the 3-rainbow index of $K_{2,t}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2353","kind":"arxiv","version":1},"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:ee93b1f4a71530007559fab7c9c43efc51ca9a36833ece5b355237adc66b3361","target":"record","created_at":"2026-05-18T03:10:57Z","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":"44d7095949be685656579d8b31bfb4c990bac1bad563224410ce6a444d3aae4c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:24:51Z","title_canon_sha256":"11d26c2c27f88afef1140dfc53dff223cce28658cf0ab7819086a2d5a242f20e"},"schema_version":"1.0","source":{"id":"1310.2353","kind":"arxiv","version":1}},"canonical_sha256":"6035143067dc5b04317b2fd423fa60bfd3326a22eaac0efe249b805dd3e164bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6035143067dc5b04317b2fd423fa60bfd3326a22eaac0efe249b805dd3e164bf","first_computed_at":"2026-05-18T03:10:57.173542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:57.173542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfsgsaIqjps2tCZu0GDOew8yt6nJbbJe7F8E1/r6XtV1H3bDJhwwiuF9ZJo95QApnIsOerZ5rU2bwFA5lZEAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:57.174301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee93b1f4a71530007559fab7c9c43efc51ca9a36833ece5b355237adc66b3361","sha256:70e9046c7ee7890fedcb03f13c60036f4c89f9e44f6bb835a0217ac7f7ee089f"],"state_sha256":"8b86d5892bb7bb6481947c8599942dcab731fffe20c67bd78aeb298dbe0714a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJ/dMXvLe56104uplKNfyxsDX7m64TbQ2TVeNFuBfSFBaAPygF8SvGX6VKyIpStKZw4X7c4YkEPuMYBjZbsHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:48:09.114410Z","bundle_sha256":"6574612eb03e17483389bf8e107b59df96596bf1bd7360e59b97a20217f60102"}}