{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7W7SLHUKS7ONHQ3P3USDPKDE56","short_pith_number":"pith:7W7SLHUK","schema_version":"1.0","canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","source":{"kind":"arxiv","id":"1110.5017","version":1},"attestation_state":"computed","paper":{"title":"Note on two results on the rainbow connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei Li, Xueliang Li","submitted_at":"2011-10-23T04:45:50Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may be colored the same, is rainbow connected if any two vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of a connected graph $G$ is the smallest number of colors that are needed in order to make $G$ rainbow connected. Caro et al. showed an upper bound $rc(G)\\leq n-\\delta$ for a connected graph $G$ of order $n$ with minimum degree $\\delta$ in \"On rainbow connection, Electron. J. Combin. 15(2008), R57\". Recently, Shiermeyer gave it a generalization that $rc(G)\\leq n- \\frac{\\sigma_2} 2"},"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":"1110.5017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T04:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"ce756c004bdcb314811a38a45b7d28c4bed43b17d02b9d7c508f50a3117372bb","abstract_canon_sha256":"715dab49409b7cf0667e01429f80ef238d9aabe026470ace40e5385d84433a46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:24.901165Z","signature_b64":"rsDBzSwPXiWsCqV5evuag3T6rzDfBg3WA3llXzd8o0yNu9lglCCv4L0P7ZVqlyfACOKGQPMSdKHZ4hEU3aKDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","last_reissued_at":"2026-05-18T04:10:24.900557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:24.900557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on two results on the rainbow connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei Li, Xueliang Li","submitted_at":"2011-10-23T04:45:50Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may be colored the same, is rainbow connected if any two vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of a connected graph $G$ is the smallest number of colors that are needed in order to make $G$ rainbow connected. Caro et al. showed an upper bound $rc(G)\\leq n-\\delta$ for a connected graph $G$ of order $n$ with minimum degree $\\delta$ in \"On rainbow connection, Electron. J. Combin. 15(2008), R57\". Recently, Shiermeyer gave it a generalization that $rc(G)\\leq n- \\frac{\\sigma_2} 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5017","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.5017","created_at":"2026-05-18T04:10:24.900649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5017v1","created_at":"2026-05-18T04:10:24.900649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5017","created_at":"2026-05-18T04:10:24.900649+00:00"},{"alias_kind":"pith_short_12","alias_value":"7W7SLHUKS7ON","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7W7SLHUKS7ONHQ3P","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7W7SLHUK","created_at":"2026-05-18T12:26:22.705136+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/7W7SLHUKS7ONHQ3P3USDPKDE56","json":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56.json","graph_json":"https://pith.science/api/pith-number/7W7SLHUKS7ONHQ3P3USDPKDE56/graph.json","events_json":"https://pith.science/api/pith-number/7W7SLHUKS7ONHQ3P3USDPKDE56/events.json","paper":"https://pith.science/paper/7W7SLHUK"},"agent_actions":{"view_html":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56","download_json":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56.json","view_paper":"https://pith.science/paper/7W7SLHUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5017&json=true","fetch_graph":"https://pith.science/api/pith-number/7W7SLHUKS7ONHQ3P3USDPKDE56/graph.json","fetch_events":"https://pith.science/api/pith-number/7W7SLHUKS7ONHQ3P3USDPKDE56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/action/storage_attestation","attest_author":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/action/author_attestation","sign_citation":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/action/citation_signature","submit_replication":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/action/replication_record"}},"created_at":"2026-05-18T04:10:24.900649+00:00","updated_at":"2026-05-18T04:10:24.900649+00:00"}