{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TCHQOVQ4X6VVYO2KRIFYNU3LFZ","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":"5fbf3a12dfcfb40422921c65f942d39c32566c2b373c64af9ac137c79981959d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:56:27Z","title_canon_sha256":"f266f22347545a2e2d99818dde3a99bbf588873dc5ebb2e66760118c4e26d9c8"},"schema_version":"1.0","source":{"id":"1110.5772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5772","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5772v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5772","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"TCHQOVQ4X6VV","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCHQOVQ4X6VVYO2K","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCHQOVQ4","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:c730bd9abdb266abf651d9fe31f278e6b8abc685cb79fde38421e18a1566e7c6","target":"graph","created_at":"2026-05-18T04:10:11Z","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 a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper we show that $rc(G)\\leq 3$, if $|E(G)|\\geq {{n-2}\\choose 2}+2$, and $rc(G)\\leq 4$, if $|E(G)|\\geq {{n-3}\\choose 2}+3$. These bounds are sharp.","authors_text":"Ingo Schiermeyer, Mengmeng Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:56:27Z","title":"Rainbow connection number of dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5772","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:5677547e4113a855c797d32c981574ddfcba0bd3b65794fac639a4f08dfa22c6","target":"record","created_at":"2026-05-18T04:10:11Z","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":"5fbf3a12dfcfb40422921c65f942d39c32566c2b373c64af9ac137c79981959d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:56:27Z","title_canon_sha256":"f266f22347545a2e2d99818dde3a99bbf588873dc5ebb2e66760118c4e26d9c8"},"schema_version":"1.0","source":{"id":"1110.5772","kind":"arxiv","version":1}},"canonical_sha256":"988f07561cbfab5c3b4a8a0b86d36b2e73a569628666cc34976dab17d739204e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"988f07561cbfab5c3b4a8a0b86d36b2e73a569628666cc34976dab17d739204e","first_computed_at":"2026-05-18T04:10:11.313897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:11.313897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYo3NnIn76/AVo4YUElzmUGfNYYbXbaHaPL6X2r2mntDFIIUooVxdy32Qr0DiX4OINxdTQs1oYkIxSMqodeaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:11.314824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5677547e4113a855c797d32c981574ddfcba0bd3b65794fac639a4f08dfa22c6","sha256:c730bd9abdb266abf651d9fe31f278e6b8abc685cb79fde38421e18a1566e7c6"],"state_sha256":"3292f8cb8c1c1b95ca64968e21dbe2a6aaa113d452cc87501f1a12f81e39bb08"}