{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V2TZKIXJFFOMXBN7Q53I52J4FI","short_pith_number":"pith:V2TZKIXJ","schema_version":"1.0","canonical_sha256":"aea79522e9295ccb85bf87768ee93c2a0eeb15c7ebc94aa3fddefe8401426ee0","source":{"kind":"arxiv","id":"1109.5004","version":2},"attestation_state":"computed","paper":{"title":"On a question on graphs with rainbow connection number 2","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-09-23T05:48:07Z","abstract_excerpt":"For a connected graph $G$, the \\emph{rainbow connection number $rc(G)$} of a graph $G$ was introduced by Chartrand et al. In \"Chakraborty et al., Hardness and algorithms for rainbow connection, J. Combin. Optim. 21(2011), 330--347\", Chakraborty et al. proved that for a graph $G$ with diameter 2, to determine $rc(G)$ is NP-Complete, and they left 4 open questions at the end, the last one of which is the following: Suppose that we are given a graph $G$ for which we are told that $rc(G)=2$. Can we rainbow-color it in polynomial time with $o(n)$ colors ? In this paper, we settle down this question"},"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":"1109.5004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-23T05:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"16d81b36017b53d31756cdca438a52439e44aa2925c04d1ea08ec52c971b912a","abstract_canon_sha256":"7669d41c577d514867420dbf185aa2c9305b6762c0285a96119c96b26c346e53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:20.468880Z","signature_b64":"4Ye1Ioz7/9htwZjvtfzZoOybUF/Oe0br4HdJ0g2gJGOdf0NDLjOp+/G8EVAcdZZQy66Y2sV4qDd6LHGQ4ZHOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea79522e9295ccb85bf87768ee93c2a0eeb15c7ebc94aa3fddefe8401426ee0","last_reissued_at":"2026-05-18T04:12:20.465771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:20.465771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a question on graphs with rainbow connection number 2","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-09-23T05:48:07Z","abstract_excerpt":"For a connected graph $G$, the \\emph{rainbow connection number $rc(G)$} of a graph $G$ was introduced by Chartrand et al. In \"Chakraborty et al., Hardness and algorithms for rainbow connection, J. Combin. Optim. 21(2011), 330--347\", Chakraborty et al. proved that for a graph $G$ with diameter 2, to determine $rc(G)$ is NP-Complete, and they left 4 open questions at the end, the last one of which is the following: Suppose that we are given a graph $G$ for which we are told that $rc(G)=2$. Can we rainbow-color it in polynomial time with $o(n)$ colors ? In this paper, we settle down this question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5004","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":"1109.5004","created_at":"2026-05-18T04:12:20.467775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5004v2","created_at":"2026-05-18T04:12:20.467775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5004","created_at":"2026-05-18T04:12:20.467775+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2TZKIXJFFOM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2TZKIXJFFOMXBN7","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2TZKIXJ","created_at":"2026-05-18T12:26:42.757692+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/V2TZKIXJFFOMXBN7Q53I52J4FI","json":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI.json","graph_json":"https://pith.science/api/pith-number/V2TZKIXJFFOMXBN7Q53I52J4FI/graph.json","events_json":"https://pith.science/api/pith-number/V2TZKIXJFFOMXBN7Q53I52J4FI/events.json","paper":"https://pith.science/paper/V2TZKIXJ"},"agent_actions":{"view_html":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI","download_json":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI.json","view_paper":"https://pith.science/paper/V2TZKIXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5004&json=true","fetch_graph":"https://pith.science/api/pith-number/V2TZKIXJFFOMXBN7Q53I52J4FI/graph.json","fetch_events":"https://pith.science/api/pith-number/V2TZKIXJFFOMXBN7Q53I52J4FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI/action/storage_attestation","attest_author":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI/action/author_attestation","sign_citation":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI/action/citation_signature","submit_replication":"https://pith.science/pith/V2TZKIXJFFOMXBN7Q53I52J4FI/action/replication_record"}},"created_at":"2026-05-18T04:12:20.467775+00:00","updated_at":"2026-05-18T04:12:20.467775+00:00"}