{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7PQR5O5S5GNT4EXLQNUFP46TYB","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":"ffb78d9a038a910e1af73398bbe70d6b45f22a049e482fa66939868bbbdb6f05","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-14T08:53:50Z","title_canon_sha256":"8a6d0dbdcbeb2af0347abc80ec0c53bdd5b13d84aaa8c70e237aa0d185732b83"},"schema_version":"1.0","source":{"id":"1110.3147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3147","created_at":"2026-05-18T04:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3147v2","created_at":"2026-05-18T04:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3147","created_at":"2026-05-18T04:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"7PQR5O5S5GNT","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7PQR5O5S5GNT4EXL","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7PQR5O5S","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:36e372546b8b22a497bc5d6bd50b478e84329f63b9cacc6c42591ea9b6b707eb","target":"graph","created_at":"2026-05-18T04:08:23Z","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 by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. It was proved that computing $rc(G)$ is an NP-Hard problem, as well as that even deciding whether a graph has $rc(G)=2$ is NP-Complete. It is known that deciding whether a given edge-colored graph is rainbow connected is NP-Complete. We will prove that it is still NP-Complete even when the edge-colored graph ","authors_text":"Xiaolong Huang, Xueliang Li, Yongtang Shi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-14T08:53:50Z","title":"Rainbow connections for planar graphs and line graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3147","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:2dc996811dd566d8f0bd0b72e2233799002b81b71bdf09a1e46dd24216cf015c","target":"record","created_at":"2026-05-18T04:08:23Z","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":"ffb78d9a038a910e1af73398bbe70d6b45f22a049e482fa66939868bbbdb6f05","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-14T08:53:50Z","title_canon_sha256":"8a6d0dbdcbeb2af0347abc80ec0c53bdd5b13d84aaa8c70e237aa0d185732b83"},"schema_version":"1.0","source":{"id":"1110.3147","kind":"arxiv","version":2}},"canonical_sha256":"fbe11ebbb2e99b3e12eb836857f3d3c0566d6daa60e8610472fb035775407f2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe11ebbb2e99b3e12eb836857f3d3c0566d6daa60e8610472fb035775407f2a","first_computed_at":"2026-05-18T04:08:23.694177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:23.694177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HMwXA3vUDVREMasZ8zXLB1MkaQxnKMD/vEsdMBG5LWbNjppk8AGv2lg4ULFRlpq6g7V2WUiIKTtndnErwBwVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:23.694791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dc996811dd566d8f0bd0b72e2233799002b81b71bdf09a1e46dd24216cf015c","sha256:36e372546b8b22a497bc5d6bd50b478e84329f63b9cacc6c42591ea9b6b707eb"],"state_sha256":"05f8096d7d7d626187c4fa8eda2b8a51407014adb437235682c01a51567ab1f4"}