{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IY33O5NVQFY6RWYOFFII5HYBEA","short_pith_number":"pith:IY33O5NV","schema_version":"1.0","canonical_sha256":"4637b775b58171e8db0e29508e9f01200e256b3382b085787acb571999020995","source":{"kind":"arxiv","id":"1407.4663","version":2},"attestation_state":"computed","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$-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4663","created_at":"2026-05-18T02:47:06.951964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4663v2","created_at":"2026-05-18T02:47:06.951964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4663","created_at":"2026-05-18T02:47:06.951964+00:00"},{"alias_kind":"pith_short_12","alias_value":"IY33O5NVQFY6","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IY33O5NVQFY6RWYO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IY33O5NV","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA","json":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA.json","graph_json":"https://pith.science/api/pith-number/IY33O5NVQFY6RWYOFFII5HYBEA/graph.json","events_json":"https://pith.science/api/pith-number/IY33O5NVQFY6RWYOFFII5HYBEA/events.json","paper":"https://pith.science/paper/IY33O5NV"},"agent_actions":{"view_html":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA","download_json":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA.json","view_paper":"https://pith.science/paper/IY33O5NV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4663&json=true","fetch_graph":"https://pith.science/api/pith-number/IY33O5NVQFY6RWYOFFII5HYBEA/graph.json","fetch_events":"https://pith.science/api/pith-number/IY33O5NVQFY6RWYOFFII5HYBEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/action/storage_attestation","attest_author":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/action/author_attestation","sign_citation":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/action/citation_signature","submit_replication":"https://pith.science/pith/IY33O5NVQFY6RWYOFFII5HYBEA/action/replication_record"}},"created_at":"2026-05-18T02:47:06.951964+00:00","updated_at":"2026-05-18T02:47:06.951964+00:00"}