{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5NWT4U7RZB2LEN4FMKZITM5OLD","short_pith_number":"pith:5NWT4U7R","canonical_record":{"source":{"id":"1102.5149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T03:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"d9f0a57ad3f2e55feb7f494b108482566fe174db2fcac58759007f4c800ab7a2","abstract_canon_sha256":"36b4a88e29dc6b8a12b0c9200dbe12a7c438e8200cc38557540e63cff99a01c6"},"schema_version":"1.0"},"canonical_sha256":"eb6d3e53f1c874b2378562b289b3ae58e83e1a482c987fb470180dabe326329f","source":{"kind":"arxiv","id":"1102.5149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5149","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5149v2","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5149","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"5NWT4U7RZB2L","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5NWT4U7RZB2LEN4F","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5NWT4U7R","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5NWT4U7RZB2LEN4FMKZITM5OLD","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T03:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"d9f0a57ad3f2e55feb7f494b108482566fe174db2fcac58759007f4c800ab7a2","abstract_canon_sha256":"36b4a88e29dc6b8a12b0c9200dbe12a7c438e8200cc38557540e63cff99a01c6"},"schema_version":"1.0"},"canonical_sha256":"eb6d3e53f1c874b2378562b289b3ae58e83e1a482c987fb470180dabe326329f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:22.534762Z","signature_b64":"/OYgTy58i74WPku4rboox3PEavhvqfQFQILCCh9AMxtsYLb6SUEXzyWnXgh7qOtabfDwkJlL1WfByp0lTEFLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb6d3e53f1c874b2378562b289b3ae58e83e1a482c987fb470180dabe326329f","last_reissued_at":"2026-05-18T04:26:22.534264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:22.534264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5149","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwy8xfmX8vv4EBKTLH81bibSu39eUMAJ18g/Fkyy8HKOfD9bGzRJ10RuEpPHP2utZae2E/8SgIG93ukWCRD8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:03:49.287006Z"},"content_sha256":"1c8d423990136e97c55d4bbc83e7d1daac0335c5acfa3c64b06d7593bf6b459a","schema_version":"1.0","event_id":"sha256:1c8d423990136e97c55d4bbc83e7d1daac0335c5acfa3c64b06d7593bf6b459a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5NWT4U7RZB2LEN4FMKZITM5OLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two rainbow connection numbers and the parameter $\\sigma_k(G)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiuying Dong, Xueliang Li","submitted_at":"2011-02-25T03:53:35Z","abstract_excerpt":"The rainbow connection number $rc(G)$ and the rainbow vertex-connection number $rvc(G)$ of a graph $G$ were introduced by Chartrand et al. and Krivelevich and Yuster, respectively. Good upper bounds in terms of minimum degree $\\delta$ were reported by Chandran et al., Krivelevich and Yuster, and Li and Shi. However, if a graph has a small minimum degree $\\delta$ and a large number of vertices $n$, these upper bounds are very large, linear in $n$. Hence, one may think to look for a good parameter to replace $\\delta$ and decrease the upper bounds significantly. Such a natural parameter is $\\sigm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5149","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:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2glze7hD21OUjKrdN3fB7fHfwsqU1EnL2Uz2QYTzjAKa31aV1Pxy5WN7ZNB1b9sYa6zBLQE7Sc0WynaRQtwgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:03:49.287360Z"},"content_sha256":"e32ff3ef456054db30397f12970278200f62f3474828da8956921b369dd913c9","schema_version":"1.0","event_id":"sha256:e32ff3ef456054db30397f12970278200f62f3474828da8956921b369dd913c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/bundle.json","state_url":"https://pith.science/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/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-01T20:03:49Z","links":{"resolver":"https://pith.science/pith/5NWT4U7RZB2LEN4FMKZITM5OLD","bundle":"https://pith.science/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/bundle.json","state":"https://pith.science/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NWT4U7RZB2LEN4FMKZITM5OLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5NWT4U7RZB2LEN4FMKZITM5OLD","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":"36b4a88e29dc6b8a12b0c9200dbe12a7c438e8200cc38557540e63cff99a01c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T03:53:35Z","title_canon_sha256":"d9f0a57ad3f2e55feb7f494b108482566fe174db2fcac58759007f4c800ab7a2"},"schema_version":"1.0","source":{"id":"1102.5149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5149","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5149v2","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5149","created_at":"2026-05-18T04:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"5NWT4U7RZB2L","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5NWT4U7RZB2LEN4F","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5NWT4U7R","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:e32ff3ef456054db30397f12970278200f62f3474828da8956921b369dd913c9","target":"graph","created_at":"2026-05-18T04:26:22Z","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":"The rainbow connection number $rc(G)$ and the rainbow vertex-connection number $rvc(G)$ of a graph $G$ were introduced by Chartrand et al. and Krivelevich and Yuster, respectively. Good upper bounds in terms of minimum degree $\\delta$ were reported by Chandran et al., Krivelevich and Yuster, and Li and Shi. However, if a graph has a small minimum degree $\\delta$ and a large number of vertices $n$, these upper bounds are very large, linear in $n$. Hence, one may think to look for a good parameter to replace $\\delta$ and decrease the upper bounds significantly. Such a natural parameter is $\\sigm","authors_text":"Jiuying Dong, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T03:53:35Z","title":"Two rainbow connection numbers and the parameter $\\sigma_k(G)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5149","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:1c8d423990136e97c55d4bbc83e7d1daac0335c5acfa3c64b06d7593bf6b459a","target":"record","created_at":"2026-05-18T04:26:22Z","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":"36b4a88e29dc6b8a12b0c9200dbe12a7c438e8200cc38557540e63cff99a01c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-25T03:53:35Z","title_canon_sha256":"d9f0a57ad3f2e55feb7f494b108482566fe174db2fcac58759007f4c800ab7a2"},"schema_version":"1.0","source":{"id":"1102.5149","kind":"arxiv","version":2}},"canonical_sha256":"eb6d3e53f1c874b2378562b289b3ae58e83e1a482c987fb470180dabe326329f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb6d3e53f1c874b2378562b289b3ae58e83e1a482c987fb470180dabe326329f","first_computed_at":"2026-05-18T04:26:22.534264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:22.534264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OYgTy58i74WPku4rboox3PEavhvqfQFQILCCh9AMxtsYLb6SUEXzyWnXgh7qOtabfDwkJlL1WfByp0lTEFLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:22.534762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c8d423990136e97c55d4bbc83e7d1daac0335c5acfa3c64b06d7593bf6b459a","sha256:e32ff3ef456054db30397f12970278200f62f3474828da8956921b369dd913c9"],"state_sha256":"bc300caa2bb0ac452df11ccb3ba599613125a69bf0703ded2db962e2d36eb7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBl5ezVte704ogPkDUCjtNfZslpToQOLDGfzrZs2pqRncHoxhc6ed3ypod8E8YhmFrmJ11SUKqlHXf3ELaSgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:03:49.289337Z","bundle_sha256":"32f148c79de43710056d07ad46d79e900f4eec01a5e70e05210cb40026ea5f25"}}