{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:H6MBV3LTOMJOKRTRNYURAI5JMV","short_pith_number":"pith:H6MBV3LT","canonical_record":{"source":{"id":"1101.3119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T03:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"67aaebc4b36bfe1ca769e25eacce2449e60bb0956ae43d2087e8e2938c369035","abstract_canon_sha256":"81afe66f9ca1c02052df39e1bfd99e3728e48e043f1a9425ca1a2fb9b8472d15"},"schema_version":"1.0"},"canonical_sha256":"3f981aed737312e546716e291023a96578aa9c44bdc730fee8f7f9d836aed8db","source":{"kind":"arxiv","id":"1101.3119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3119","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3119v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3119","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"H6MBV3LTOMJO","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H6MBV3LTOMJOKRTR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H6MBV3LT","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:H6MBV3LTOMJOKRTRNYURAI5JMV","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T03:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"67aaebc4b36bfe1ca769e25eacce2449e60bb0956ae43d2087e8e2938c369035","abstract_canon_sha256":"81afe66f9ca1c02052df39e1bfd99e3728e48e043f1a9425ca1a2fb9b8472d15"},"schema_version":"1.0"},"canonical_sha256":"3f981aed737312e546716e291023a96578aa9c44bdc730fee8f7f9d836aed8db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:30.459884Z","signature_b64":"JId6zm9CJ6fly7LZ+NMaoEyPlZpP/mFajeXq2baMJesc36l2xYYnRNABkqgIx1ndiWYG/ciAlPB2bYg0ve1VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f981aed737312e546716e291023a96578aa9c44bdc730fee8f7f9d836aed8db","last_reissued_at":"2026-05-18T04:31:30.459459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:30.459459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3119","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNw/nQYFWxLMg+5bSdusWOGf5PzIlX61pg1Ix6RF4mZTBeyVzXr5xaS8N0uhpHVzZcg6DjbkwDmq6IsOATGnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:51.052513Z"},"content_sha256":"aa06a6124e0fc6e9a43a7aeb6a31106b5b8c0061a2ce7190d3eca7ec88eeb332","schema_version":"1.0","event_id":"sha256:aa06a6124e0fc6e9a43a7aeb6a31106b5b8c0061a2ce7190d3eca7ec88eeb332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:H6MBV3LTOMJOKRTRNYURAI5JMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds involving parameter $\\sigma_2$ for the rainbow connection","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-01-17T03:47:20Z","abstract_excerpt":"For a graph $G$, we define $\\sigma_2(G)=min \\{d(u)+d(v)| u,v\\in V(G), uv\\not\\in E(G)\\}$, or simply denoted by $\\sigma_2$. A edge-colored graph is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors, which was introduced by Chartrand et al. The rainbow connection of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow edge-connected. We prove that if $G$ is a connected graph of order $n$, then $rc(G)\\leq 6\\frac{n-2}{\\sigma_2+2}+7$. Moreover, the bound is seen to be tight up to add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3119","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvupEjfknNDqmKte5oW/9xD5DVT6d5hyqT+I/I1G1irSVEFv+xVAQKpL3xlXEwGDojpLY/lDI9vGU49HZP2QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:51.052849Z"},"content_sha256":"82e3563d15690777e7fe6ec74a17976a61ec43c7cdd532dcf0c84a072430aadd","schema_version":"1.0","event_id":"sha256:82e3563d15690777e7fe6ec74a17976a61ec43c7cdd532dcf0c84a072430aadd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/bundle.json","state_url":"https://pith.science/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/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:29:51Z","links":{"resolver":"https://pith.science/pith/H6MBV3LTOMJOKRTRNYURAI5JMV","bundle":"https://pith.science/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/bundle.json","state":"https://pith.science/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6MBV3LTOMJOKRTRNYURAI5JMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H6MBV3LTOMJOKRTRNYURAI5JMV","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":"81afe66f9ca1c02052df39e1bfd99e3728e48e043f1a9425ca1a2fb9b8472d15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T03:47:20Z","title_canon_sha256":"67aaebc4b36bfe1ca769e25eacce2449e60bb0956ae43d2087e8e2938c369035"},"schema_version":"1.0","source":{"id":"1101.3119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3119","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3119v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3119","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"H6MBV3LTOMJO","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H6MBV3LTOMJOKRTR","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H6MBV3LT","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:82e3563d15690777e7fe6ec74a17976a61ec43c7cdd532dcf0c84a072430aadd","target":"graph","created_at":"2026-05-18T04:31:30Z","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":"For a graph $G$, we define $\\sigma_2(G)=min \\{d(u)+d(v)| u,v\\in V(G), uv\\not\\in E(G)\\}$, or simply denoted by $\\sigma_2$. A edge-colored graph is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors, which was introduced by Chartrand et al. The rainbow connection of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow edge-connected. We prove that if $G$ is a connected graph of order $n$, then $rc(G)\\leq 6\\frac{n-2}{\\sigma_2+2}+7$. Moreover, the bound is seen to be tight up to add","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-01-17T03:47:20Z","title":"Upper bounds involving parameter $\\sigma_2$ for the rainbow connection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3119","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:aa06a6124e0fc6e9a43a7aeb6a31106b5b8c0061a2ce7190d3eca7ec88eeb332","target":"record","created_at":"2026-05-18T04:31:30Z","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":"81afe66f9ca1c02052df39e1bfd99e3728e48e043f1a9425ca1a2fb9b8472d15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T03:47:20Z","title_canon_sha256":"67aaebc4b36bfe1ca769e25eacce2449e60bb0956ae43d2087e8e2938c369035"},"schema_version":"1.0","source":{"id":"1101.3119","kind":"arxiv","version":1}},"canonical_sha256":"3f981aed737312e546716e291023a96578aa9c44bdc730fee8f7f9d836aed8db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f981aed737312e546716e291023a96578aa9c44bdc730fee8f7f9d836aed8db","first_computed_at":"2026-05-18T04:31:30.459459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:30.459459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JId6zm9CJ6fly7LZ+NMaoEyPlZpP/mFajeXq2baMJesc36l2xYYnRNABkqgIx1ndiWYG/ciAlPB2bYg0ve1VBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:30.459884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa06a6124e0fc6e9a43a7aeb6a31106b5b8c0061a2ce7190d3eca7ec88eeb332","sha256:82e3563d15690777e7fe6ec74a17976a61ec43c7cdd532dcf0c84a072430aadd"],"state_sha256":"4916ea7b520733980ec998043ae6c5907dfb97d32d3e4caeb353771055359899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78UhjfGWoUur64LVUz0fGrzpz6M1qSJJRP+m0uli8eg9eo6AI4OzMDfmGYBOlLvra1/WjbQ3alvrV0YU5asDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:29:51.054666Z","bundle_sha256":"779fb48643320450db66e6a8ae85c8854f91ce0e29a5369d8f2e4366667da26b"}}