{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7W7SLHUKS7ONHQ3P3USDPKDE56","short_pith_number":"pith:7W7SLHUK","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"},"canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","source":{"kind":"arxiv","id":"1110.5017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5017","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5017v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5017","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"7W7SLHUKS7ON","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7W7SLHUKS7ONHQ3P","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7W7SLHUK","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7W7SLHUKS7ONHQ3P3USDPKDE56","target":"record","payload":{"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"},"canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","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"},"source_kind":"arxiv","source_id":"1110.5017","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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoD75oVpSuG92VAf+d//kYtzdgCF5CIICvgMHYHYxlnNU8cqw9HkMgbjM9lCfBIZTeTw0LrfnPegd58BYJfoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:17.116009Z"},"content_sha256":"97ec19acda4ccd02019bece14c6325c309b9806c019753f61521e19dda3fb5fa","schema_version":"1.0","event_id":"sha256:97ec19acda4ccd02019bece14c6325c309b9806c019753f61521e19dda3fb5fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7W7SLHUKS7ONHQ3P3USDPKDE56","target":"graph","payload":{"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"},"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-18T04:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19l2Q2u8rX62IXb9e9JKHZd8er+WL994ULOoUe76VcRrAP96XnmrQImKq15Qx2KagLKY3LRGkbExN8zQ1H9xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:17.116373Z"},"content_sha256":"135c593335c8481c87be9120e7119e308a7814eefec4c07073b86849e31213e3","schema_version":"1.0","event_id":"sha256:135c593335c8481c87be9120e7119e308a7814eefec4c07073b86849e31213e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/bundle.json","state_url":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/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-01T15:55:17Z","links":{"resolver":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56","bundle":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/bundle.json","state":"https://pith.science/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7W7SLHUKS7ONHQ3P3USDPKDE56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7W7SLHUKS7ONHQ3P3USDPKDE56","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":"715dab49409b7cf0667e01429f80ef238d9aabe026470ace40e5385d84433a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T04:45:50Z","title_canon_sha256":"ce756c004bdcb314811a38a45b7d28c4bed43b17d02b9d7c508f50a3117372bb"},"schema_version":"1.0","source":{"id":"1110.5017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5017","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5017v1","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5017","created_at":"2026-05-18T04:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"7W7SLHUKS7ON","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7W7SLHUKS7ONHQ3P","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7W7SLHUK","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:135c593335c8481c87be9120e7119e308a7814eefec4c07073b86849e31213e3","target":"graph","created_at":"2026-05-18T04:10:24Z","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":"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","authors_text":"Wei Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T04:45:50Z","title":"Note on two results on the rainbow connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5017","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:97ec19acda4ccd02019bece14c6325c309b9806c019753f61521e19dda3fb5fa","target":"record","created_at":"2026-05-18T04:10:24Z","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":"715dab49409b7cf0667e01429f80ef238d9aabe026470ace40e5385d84433a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T04:45:50Z","title_canon_sha256":"ce756c004bdcb314811a38a45b7d28c4bed43b17d02b9d7c508f50a3117372bb"},"schema_version":"1.0","source":{"id":"1110.5017","kind":"arxiv","version":1}},"canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdbf259e8a97dcd3c36fdd2437a864ef89b3f39974b30abd91c2de780fd84fe2","first_computed_at":"2026-05-18T04:10:24.900557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:24.900557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rsDBzSwPXiWsCqV5evuag3T6rzDfBg3WA3llXzd8o0yNu9lglCCv4L0P7ZVqlyfACOKGQPMSdKHZ4hEU3aKDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:24.901165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97ec19acda4ccd02019bece14c6325c309b9806c019753f61521e19dda3fb5fa","sha256:135c593335c8481c87be9120e7119e308a7814eefec4c07073b86849e31213e3"],"state_sha256":"874aad65b79c5a4033b9e98f10020b010132a818bbdff45e2654fd2e3ad43d07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtYY+w78Hv0b0HG1jSm/FJ4IpVo6Xfub8U4WAwcGLKSKY3P21OAgDhBuFjkFzJRsL9AAQ6D9iZUvVHvcOzjEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:17.118290Z","bundle_sha256":"c1ba9b77fff16d7b2b4e481ed886416bc4b51d43e5c7ddd451f0817586760cda"}}