{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BV6J2IQNQ3ECFH5THG2IC3INIT","short_pith_number":"pith:BV6J2IQN","canonical_record":{"source":{"id":"1310.2355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:32:54Z","cross_cats_sorted":[],"title_canon_sha256":"3bc0abdbe983e28be5306754d0b25f7e5ba055614f1a6ce8e9f697ff2e5daf80","abstract_canon_sha256":"67dc85526e9a81e749811729568950c1c680eb8d5a989603a4ff1cd354b08822"},"schema_version":"1.0"},"canonical_sha256":"0d7c9d220d86c8229fb339b4816d0d44eff92cfde8d66425a4a6208c037fec43","source":{"kind":"arxiv","id":"1310.2355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2355","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2355v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2355","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"BV6J2IQNQ3EC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BV6J2IQNQ3ECFH5T","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BV6J2IQN","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BV6J2IQNQ3ECFH5THG2IC3INIT","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:32:54Z","cross_cats_sorted":[],"title_canon_sha256":"3bc0abdbe983e28be5306754d0b25f7e5ba055614f1a6ce8e9f697ff2e5daf80","abstract_canon_sha256":"67dc85526e9a81e749811729568950c1c680eb8d5a989603a4ff1cd354b08822"},"schema_version":"1.0"},"canonical_sha256":"0d7c9d220d86c8229fb339b4816d0d44eff92cfde8d66425a4a6208c037fec43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:57.151650Z","signature_b64":"9IT08CVF945EofSkc0pW67T0CO964Eeqg4792jBSVx3qYUHtUnvCoPsJsfhNZ+UapQDC0kQ5fHynju3Pud5XAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7c9d220d86c8229fb339b4816d0d44eff92cfde8d66425a4a6208c037fec43","last_reissued_at":"2026-05-18T03:10:57.150900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:57.150900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2355","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":"DNVQXFgtc97x3Vf2zXB6D7PTRNwCHeY0dNmNBCD2AHGgVt7x/1XOuk4gEKgae+dFXLCrsCNSP9BRPZWVQDbLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:15.629671Z"},"content_sha256":"1375ea9595ff526205098d86deac1af01ca6cc626ba61227ea1a4794b6aec5a8","schema_version":"1.0","event_id":"sha256:1375ea9595ff526205098d86deac1af01ca6cc626ba61227ea1a4794b6aec5a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BV6J2IQNQ3ECFH5THG2IC3INIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some upper bounds for 3-rainbow index of graphs","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:32:54Z","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. 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 tree $T$ in $G$ such that $S\\subseteq V(T)$. 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 consider 3-rainbow index $rx_3(G)$ of $G$. We first show that for connected graph $G$ with minimum degree $\\delta(G)\\geq 3$, the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2355","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":"uaN4wxCL3BgdujdhPNGLa2caS+81QQPgrvVhgjYJYwt8ySInvVxSEgGTW4BfP8U2jNZhoidwx5Ef+wHn9TU6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:15.630032Z"},"content_sha256":"c2f919a0d51c29367f054bd282a48937126721f6598813c28afed5dbf71cddaf","schema_version":"1.0","event_id":"sha256:c2f919a0d51c29367f054bd282a48937126721f6598813c28afed5dbf71cddaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/bundle.json","state_url":"https://pith.science/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/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-29T15:09:15Z","links":{"resolver":"https://pith.science/pith/BV6J2IQNQ3ECFH5THG2IC3INIT","bundle":"https://pith.science/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/bundle.json","state":"https://pith.science/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BV6J2IQNQ3ECFH5THG2IC3INIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BV6J2IQNQ3ECFH5THG2IC3INIT","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":"67dc85526e9a81e749811729568950c1c680eb8d5a989603a4ff1cd354b08822","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:32:54Z","title_canon_sha256":"3bc0abdbe983e28be5306754d0b25f7e5ba055614f1a6ce8e9f697ff2e5daf80"},"schema_version":"1.0","source":{"id":"1310.2355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2355","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2355v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2355","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"BV6J2IQNQ3EC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BV6J2IQNQ3ECFH5T","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BV6J2IQN","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:c2f919a0d51c29367f054bd282a48937126721f6598813c28afed5dbf71cddaf","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. 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 tree $T$ in $G$ such that $S\\subseteq V(T)$. 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 consider 3-rainbow index $rx_3(G)$ of $G$. We first show that for connected graph $G$ with minimum degree $\\delta(G)\\geq 3$, the t","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:32:54Z","title":"Some upper bounds for 3-rainbow index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2355","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:1375ea9595ff526205098d86deac1af01ca6cc626ba61227ea1a4794b6aec5a8","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":"67dc85526e9a81e749811729568950c1c680eb8d5a989603a4ff1cd354b08822","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-10-09T05:32:54Z","title_canon_sha256":"3bc0abdbe983e28be5306754d0b25f7e5ba055614f1a6ce8e9f697ff2e5daf80"},"schema_version":"1.0","source":{"id":"1310.2355","kind":"arxiv","version":1}},"canonical_sha256":"0d7c9d220d86c8229fb339b4816d0d44eff92cfde8d66425a4a6208c037fec43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d7c9d220d86c8229fb339b4816d0d44eff92cfde8d66425a4a6208c037fec43","first_computed_at":"2026-05-18T03:10:57.150900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:57.150900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9IT08CVF945EofSkc0pW67T0CO964Eeqg4792jBSVx3qYUHtUnvCoPsJsfhNZ+UapQDC0kQ5fHynju3Pud5XAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:57.151650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1375ea9595ff526205098d86deac1af01ca6cc626ba61227ea1a4794b6aec5a8","sha256:c2f919a0d51c29367f054bd282a48937126721f6598813c28afed5dbf71cddaf"],"state_sha256":"85215e7150714727848a6163514c3b4f72257760ce743e8057262e85f88dfca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EleLbXswrqJrlfda9s3Xh6ut+eAWMkcpeeILvvvc0AKQPszFFgwS8bfqg5ekEjQ/Yf5jbSnyQaKTBJucwdNWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:09:15.632441Z","bundle_sha256":"82f2ae4d4099c7d6ba92231206c55a244f6812b057ea3e4cd9746daa29d739c8"}}