{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5KC5VKE56GZ5RXF4YML4B26O2U","short_pith_number":"pith:5KC5VKE5","canonical_record":{"source":{"id":"1105.4210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"ea281c49cfd7e7858a3184c723ba49fd0a921b6f2f9fe693c3570fe97ae279ed","abstract_canon_sha256":"33183dbd318190e772538f3dd6c8f380e784beffcaf5e2c6068adaec860c3e6d"},"schema_version":"1.0"},"canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","source":{"kind":"arxiv","id":"1105.4210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4210","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4210v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4210","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"5KC5VKE56GZ5","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5KC5VKE56GZ5RXF4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5KC5VKE5","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5KC5VKE56GZ5RXF4YML4B26O2U","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"ea281c49cfd7e7858a3184c723ba49fd0a921b6f2f9fe693c3570fe97ae279ed","abstract_canon_sha256":"33183dbd318190e772538f3dd6c8f380e784beffcaf5e2c6068adaec860c3e6d"},"schema_version":"1.0"},"canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.211463Z","signature_b64":"w8GArMcfQUxMhd1WQF7nE5lpigXYbiefYA4FY/nxyBeGeoLeMeBv79sGhPNi5PdBzHxRWwQTTMRTETkDfrgyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","last_reissued_at":"2026-05-18T04:21:13.210857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.210857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4210","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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sudrIqSb6d3ZJ4UjRF5qb7lR4JmAsynKWpS6NSGSIge8yEnC38tlqCQ9IZUVb7bD7U1SLS3B/lAtzoEGaIJiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:21.318657Z"},"content_sha256":"2167fdc50e5bfb4c737f4cdb14179bbb5a8be6b3f07eb0a3692b9ec4adc6b876","schema_version":"1.0","event_id":"sha256:2167fdc50e5bfb4c737f4cdb14179bbb5a8be6b3f07eb0a3692b9ec4adc6b876"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5KC5VKE56GZ5RXF4YML4B26O2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp upper bound for the rainbow connection numbers of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2011-05-21T03:20:39Z","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. In this paper, we give a sharp upper bound that $rc(G)\\leq\\lceil\\frac{n}{2}\\rceil$ for any 2-connected graph $G$ of order $n$, which improves the results of Caro et al. to best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4210","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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkOiaSlZHTY7KhYrnIQsC6SM6clXlnoXaCvmSi0UxvQKEHFyGoMvzHJhgDSD1naQmK6VQCgh8jNA88gdenoVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:27:21.319000Z"},"content_sha256":"9b5bb802300146cc92ed7a2109c5d0af49224edf7c6d3eabd421ed99ee311adf","schema_version":"1.0","event_id":"sha256:9b5bb802300146cc92ed7a2109c5d0af49224edf7c6d3eabd421ed99ee311adf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/bundle.json","state_url":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KC5VKE56GZ5RXF4YML4B26O2U/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-01T17:27:21Z","links":{"resolver":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U","bundle":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/bundle.json","state":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KC5VKE56GZ5RXF4YML4B26O2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5KC5VKE56GZ5RXF4YML4B26O2U","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":"33183dbd318190e772538f3dd6c8f380e784beffcaf5e2c6068adaec860c3e6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","title_canon_sha256":"ea281c49cfd7e7858a3184c723ba49fd0a921b6f2f9fe693c3570fe97ae279ed"},"schema_version":"1.0","source":{"id":"1105.4210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4210","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4210v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4210","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"5KC5VKE56GZ5","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5KC5VKE56GZ5RXF4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5KC5VKE5","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:9b5bb802300146cc92ed7a2109c5d0af49224edf7c6d3eabd421ed99ee311adf","target":"graph","created_at":"2026-05-18T04:21:13Z","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. In this paper, we give a sharp upper bound that $rc(G)\\leq\\lceil\\frac{n}{2}\\rceil$ for any 2-connected graph $G$ of order $n$, which improves the results of Caro et al. to best possible.","authors_text":"Sujuan Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","title":"Sharp upper bound for the rainbow connection numbers of 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4210","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:2167fdc50e5bfb4c737f4cdb14179bbb5a8be6b3f07eb0a3692b9ec4adc6b876","target":"record","created_at":"2026-05-18T04:21:13Z","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":"33183dbd318190e772538f3dd6c8f380e784beffcaf5e2c6068adaec860c3e6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","title_canon_sha256":"ea281c49cfd7e7858a3184c723ba49fd0a921b6f2f9fe693c3570fe97ae279ed"},"schema_version":"1.0","source":{"id":"1105.4210","kind":"arxiv","version":2}},"canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","first_computed_at":"2026-05-18T04:21:13.210857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:13.210857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w8GArMcfQUxMhd1WQF7nE5lpigXYbiefYA4FY/nxyBeGeoLeMeBv79sGhPNi5PdBzHxRWwQTTMRTETkDfrgyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:13.211463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2167fdc50e5bfb4c737f4cdb14179bbb5a8be6b3f07eb0a3692b9ec4adc6b876","sha256:9b5bb802300146cc92ed7a2109c5d0af49224edf7c6d3eabd421ed99ee311adf"],"state_sha256":"1e75136e1404522995eaf1035a7baddb9f6c41c685ff36ed9413fc5238c174fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcwAWcEEZQNDa8NkuHil5o+sEp53am5XWA3YQuecHZjmIxdwgLprsH7ADZu+ah/eQM2gkcZOQkXD9lZyRCqTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:27:21.320959Z","bundle_sha256":"7ddab60a90a787c229920f726bf7eeb290291f0c7e84c2a893283ce244881ad3"}}