{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IY33O5NVQFY6RWYOFFII5HYBEA","short_pith_number":"pith:IY33O5NV","canonical_record":{"source":{"id":"1407.4663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T13:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"6634d2c8148ed1d4f0ac9e8581af0590f98e89eb71b2e57cafc7f22a1bb059ee","abstract_canon_sha256":"556e24ec9047edc84f483939971829275be33213e1f7bc797c1a3794f6d92316"},"schema_version":"1.0"},"canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","source":{"kind":"arxiv","id":"1407.4663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4663","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4663v2","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4663","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"IY33O5NVQFY6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IY33O5NVQFY6RWYO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IY33O5NV","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IY33O5NVQFY6RWYOFFII5HYBEA","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T13:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"6634d2c8148ed1d4f0ac9e8581af0590f98e89eb71b2e57cafc7f22a1bb059ee","abstract_canon_sha256":"556e24ec9047edc84f483939971829275be33213e1f7bc797c1a3794f6d92316"},"schema_version":"1.0"},"canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.952353Z","signature_b64":"EOmCDchus7w2ypZayCgjkz3Pqz9A2WJtqNNxY9vwKvvAm3ADeQSVvb76ZPfnEG5IhRO/Xuaq4WTmh1HMi4AzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","last_reissued_at":"2026-05-18T02:47:06.951900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.951900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4663","source_version":2,"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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBpiJHVcnuSk76hg5rQvFp+/T5U3+QJJ4IUnnMzCBOS8PlS+al3vSWqZcVBTk7eUjqdeNDOp8XlTmTqjVSF/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:16:39.809159Z"},"content_sha256":"1f9767795657775b3bf70ee4fa4ed9c4402da6a9dd5b42d64b001ccc9fbdef8f","schema_version":"1.0","event_id":"sha256:1f9767795657775b3bf70ee4fa4ed9c4402da6a9dd5b42d64b001ccc9fbdef8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IY33O5NVQFY6RWYOFFII5HYBEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the upper bound of the rainbow index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qingqiong Cai, Xueliang Li, Yan Zhao","submitted_at":"2014-07-17T13:24:51Z","abstract_excerpt":"A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of colors that are needed to color the edges of $G$ such that there exists a rainbow path connecting every two vertices of $G$. Similarly, a tree in $G$ is a rainbow~tree if no two edges of it receive the same color. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow tree connecting $S$ for each $k$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4663","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"},"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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lT41p43vVPgOIX4u5PFYP7ulSdpVYLhsz7verSxDtmSclTGuPu78u2MiZRZ/HThpdazTc5kimlMvjg28nHofDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:16:39.809772Z"},"content_sha256":"0208a31d4716902aea7b1109b46df5d7a0fdd747a1f9175198e80caf1b4c7b28","schema_version":"1.0","event_id":"sha256:0208a31d4716902aea7b1109b46df5d7a0fdd747a1f9175198e80caf1b4c7b28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/bundle.json","state_url":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IY33O5NVQFY6RWYOFFII5HYBEA/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-06-01T19:16:39Z","links":{"resolver":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA","bundle":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/bundle.json","state":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IY33O5NVQFY6RWYOFFII5HYBEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IY33O5NVQFY6RWYOFFII5HYBEA","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":"556e24ec9047edc84f483939971829275be33213e1f7bc797c1a3794f6d92316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T13:24:51Z","title_canon_sha256":"6634d2c8148ed1d4f0ac9e8581af0590f98e89eb71b2e57cafc7f22a1bb059ee"},"schema_version":"1.0","source":{"id":"1407.4663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4663","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4663v2","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4663","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"IY33O5NVQFY6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IY33O5NVQFY6RWYO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IY33O5NV","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:0208a31d4716902aea7b1109b46df5d7a0fdd747a1f9175198e80caf1b4c7b28","target":"graph","created_at":"2026-05-18T02:47: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":"A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of colors that are needed to color the edges of $G$ such that there exists a rainbow path connecting every two vertices of $G$. Similarly, a tree in $G$ is a rainbow~tree if no two edges of it receive the same color. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow tree connecting $S$ for each $k$-","authors_text":"Qingqiong Cai, Xueliang Li, Yan Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T13:24:51Z","title":"Note on the upper bound of the rainbow index of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4663","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:1f9767795657775b3bf70ee4fa4ed9c4402da6a9dd5b42d64b001ccc9fbdef8f","target":"record","created_at":"2026-05-18T02:47: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":"556e24ec9047edc84f483939971829275be33213e1f7bc797c1a3794f6d92316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T13:24:51Z","title_canon_sha256":"6634d2c8148ed1d4f0ac9e8581af0590f98e89eb71b2e57cafc7f22a1bb059ee"},"schema_version":"1.0","source":{"id":"1407.4663","kind":"arxiv","version":2}},"canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","first_computed_at":"2026-05-18T02:47:06.951900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.951900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOmCDchus7w2ypZayCgjkz3Pqz9A2WJtqNNxY9vwKvvAm3ADeQSVvb76ZPfnEG5IhRO/Xuaq4WTmh1HMi4AzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.952353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f9767795657775b3bf70ee4fa4ed9c4402da6a9dd5b42d64b001ccc9fbdef8f","sha256:0208a31d4716902aea7b1109b46df5d7a0fdd747a1f9175198e80caf1b4c7b28"],"state_sha256":"02fe274e397c057acbe31d21bdca9bc35bdb0a95581362629b8e5a0557f8971c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77otl//yVBQugn5x35SPGWZYMIWGfHDGToRLo/EcaGc+lO/Cci+n9iV4OJstpJBfAOUcKRIv08wI4L/UjPcNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:16:39.812565Z","bundle_sha256":"44600ddb185a49a6beeb24ea6e9af342afae45b40ba5b6b97b0a3a6fe1cc6c6e"}}