{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WVHIWBTYY56XJ42WZCCNRQ33CJ","short_pith_number":"pith:WVHIWBTY","canonical_record":{"source":{"id":"1012.2641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-13T06:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"588c24214617b47f2fcfab19e52dad5a36c7a3d64c2dc2f20f14c29b2629c118","abstract_canon_sha256":"b1bf6c3374b90923130601c399a86e58f27b7397f82285d59748679029b23359"},"schema_version":"1.0"},"canonical_sha256":"b54e8b0678c77d74f356c884d8c37b1274b7e0abbb9d870d915657ba5a93fac1","source":{"kind":"arxiv","id":"1012.2641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2641","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2641v2","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2641","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"WVHIWBTYY56X","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WVHIWBTYY56XJ42W","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WVHIWBTY","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WVHIWBTYY56XJ42WZCCNRQ33CJ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-13T06:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"588c24214617b47f2fcfab19e52dad5a36c7a3d64c2dc2f20f14c29b2629c118","abstract_canon_sha256":"b1bf6c3374b90923130601c399a86e58f27b7397f82285d59748679029b23359"},"schema_version":"1.0"},"canonical_sha256":"b54e8b0678c77d74f356c884d8c37b1274b7e0abbb9d870d915657ba5a93fac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:26.571275Z","signature_b64":"WNebwKld2ZAmLmLfcadVLmSIZIRquBnQgVU8+Fu4W2SlA1S9wKFrthxzOa0hCmsQG3vNopH1LxJ7Fwl5RN2bAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b54e8b0678c77d74f356c884d8c37b1274b7e0abbb9d870d915657ba5a93fac1","last_reissued_at":"2026-05-18T04:33:26.570611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:26.570611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2641","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crc/GG8YX8FMnioAgCgH2fICvlPKtKqKh87bRA4rSvQQuw8yzh4zXcVPtYcFfhqo+TSyJS0apirpt2zqf6mPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:23:57.236345Z"},"content_sha256":"34f721ce837a1589c127c88cf1462dc39251e0af1817bc86cd65c5a6f25c1017","schema_version":"1.0","event_id":"sha256:34f721ce837a1589c127c88cf1462dc39251e0af1817bc86cd65c5a6f25c1017"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WVHIWBTYY56XJ42WZCCNRQ33CJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum-type theorem for rainbow connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huishu Lian, Lily Chen, Xueliang Li","submitted_at":"2010-12-13T06:31:28Z","abstract_excerpt":"An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of $G$, denoted $rc(G)$, is the minimum number of colors that are used to make $G$ rainbow connected. In this paper we give a Nordhaus-Gaddum-type result for the rainbow connection number. We prove that if $G$ and $\\bar{G}$ are both connected, then $4\\leq rc(G)+rc(\\bar{G})\\leq n+2$. Examples are given to show that the upper bound is sharp for all $n\\geq 4$, and the lower bound is sharp for all $n\\geq 8$. For the rest small $n=4,5,6,7,$ we al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2641","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXZ6uCkpNJ1ua3dTRI/oXulcdeuHDJopMaPd1CRd4p+dpP0f7LCR0/82J2zoy66kSc1ax02JqAuQIeS9gXPzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:23:57.236697Z"},"content_sha256":"5178e40dd750856c99e4f2997b15202d8531151715ff65b3cc3a850ff336840b","schema_version":"1.0","event_id":"sha256:5178e40dd750856c99e4f2997b15202d8531151715ff65b3cc3a850ff336840b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/bundle.json","state_url":"https://pith.science/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/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-02T04:23:57Z","links":{"resolver":"https://pith.science/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ","bundle":"https://pith.science/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/bundle.json","state":"https://pith.science/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVHIWBTYY56XJ42WZCCNRQ33CJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WVHIWBTYY56XJ42WZCCNRQ33CJ","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":"b1bf6c3374b90923130601c399a86e58f27b7397f82285d59748679029b23359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-13T06:31:28Z","title_canon_sha256":"588c24214617b47f2fcfab19e52dad5a36c7a3d64c2dc2f20f14c29b2629c118"},"schema_version":"1.0","source":{"id":"1012.2641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2641","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2641v2","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2641","created_at":"2026-05-18T04:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"WVHIWBTYY56X","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WVHIWBTYY56XJ42W","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WVHIWBTY","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:5178e40dd750856c99e4f2997b15202d8531151715ff65b3cc3a850ff336840b","target":"graph","created_at":"2026-05-18T04:33:26Z","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$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of $G$, denoted $rc(G)$, is the minimum number of colors that are used to make $G$ rainbow connected. In this paper we give a Nordhaus-Gaddum-type result for the rainbow connection number. We prove that if $G$ and $\\bar{G}$ are both connected, then $4\\leq rc(G)+rc(\\bar{G})\\leq n+2$. Examples are given to show that the upper bound is sharp for all $n\\geq 4$, and the lower bound is sharp for all $n\\geq 8$. For the rest small $n=4,5,6,7,$ we al","authors_text":"Huishu Lian, Lily Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-13T06:31:28Z","title":"Nordhaus-Gaddum-type theorem for rainbow connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2641","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:34f721ce837a1589c127c88cf1462dc39251e0af1817bc86cd65c5a6f25c1017","target":"record","created_at":"2026-05-18T04:33:26Z","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":"b1bf6c3374b90923130601c399a86e58f27b7397f82285d59748679029b23359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-13T06:31:28Z","title_canon_sha256":"588c24214617b47f2fcfab19e52dad5a36c7a3d64c2dc2f20f14c29b2629c118"},"schema_version":"1.0","source":{"id":"1012.2641","kind":"arxiv","version":2}},"canonical_sha256":"b54e8b0678c77d74f356c884d8c37b1274b7e0abbb9d870d915657ba5a93fac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54e8b0678c77d74f356c884d8c37b1274b7e0abbb9d870d915657ba5a93fac1","first_computed_at":"2026-05-18T04:33:26.570611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:26.570611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WNebwKld2ZAmLmLfcadVLmSIZIRquBnQgVU8+Fu4W2SlA1S9wKFrthxzOa0hCmsQG3vNopH1LxJ7Fwl5RN2bAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:26.571275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f721ce837a1589c127c88cf1462dc39251e0af1817bc86cd65c5a6f25c1017","sha256:5178e40dd750856c99e4f2997b15202d8531151715ff65b3cc3a850ff336840b"],"state_sha256":"91ee318855775cfaed53bf8b733446d9481ef47d379cf8d2ea313b2415f45b3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CPwR0Adltx15NSNaiqKzgGOjBoO8RA67Sd4wHkdmitqqkLsrM9NbvheY7IHvlhbZNL1W6RzxnCgwr7wA7iOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:23:57.238658Z","bundle_sha256":"4972dc18fbc6dcd80bf045378b04207843c05b13f9c8c125a2a4c25d0d05c097"}}