{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7PQR5O5S5GNT4EXLQNUFP46TYB","short_pith_number":"pith:7PQR5O5S","schema_version":"1.0","canonical_sha256":"fbe11ebbb2e99b3e12eb836857f3d3c0566d6daa60e8610472fb035775407f2a","source":{"kind":"arxiv","id":"1110.3147","version":2},"attestation_state":"computed","paper":{"title":"Rainbow connections for planar graphs and line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Xiaolong Huang, Xueliang Li, Yongtang Shi","submitted_at":"2011-10-14T08:53:50Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1110.3147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-14T08:53:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8a6d0dbdcbeb2af0347abc80ec0c53bdd5b13d84aaa8c70e237aa0d185732b83","abstract_canon_sha256":"ffb78d9a038a910e1af73398bbe70d6b45f22a049e482fa66939868bbbdb6f05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:23.694791Z","signature_b64":"HMwXA3vUDVREMasZ8zXLB1MkaQxnKMD/vEsdMBG5LWbNjppk8AGv2lg4ULFRlpq6g7V2WUiIKTtndnErwBwVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe11ebbb2e99b3e12eb836857f3d3c0566d6daa60e8610472fb035775407f2a","last_reissued_at":"2026-05-18T04:08:23.694177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:23.694177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow connections for planar graphs and line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Xiaolong Huang, Xueliang Li, Yongtang Shi","submitted_at":"2011-10-14T08:53:50Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3147","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.3147","created_at":"2026-05-18T04:08:23.694254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.3147v2","created_at":"2026-05-18T04:08:23.694254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3147","created_at":"2026-05-18T04:08:23.694254+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PQR5O5S5GNT","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PQR5O5S5GNT4EXL","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PQR5O5S","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB","json":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB.json","graph_json":"https://pith.science/api/pith-number/7PQR5O5S5GNT4EXLQNUFP46TYB/graph.json","events_json":"https://pith.science/api/pith-number/7PQR5O5S5GNT4EXLQNUFP46TYB/events.json","paper":"https://pith.science/paper/7PQR5O5S"},"agent_actions":{"view_html":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB","download_json":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB.json","view_paper":"https://pith.science/paper/7PQR5O5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.3147&json=true","fetch_graph":"https://pith.science/api/pith-number/7PQR5O5S5GNT4EXLQNUFP46TYB/graph.json","fetch_events":"https://pith.science/api/pith-number/7PQR5O5S5GNT4EXLQNUFP46TYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB/action/storage_attestation","attest_author":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB/action/author_attestation","sign_citation":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB/action/citation_signature","submit_replication":"https://pith.science/pith/7PQR5O5S5GNT4EXLQNUFP46TYB/action/replication_record"}},"created_at":"2026-05-18T04:08:23.694254+00:00","updated_at":"2026-05-18T04:08:23.694254+00:00"}