{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3GW4DJCNVKME7B7KX4FHRTYSAW","short_pith_number":"pith:3GW4DJCN","schema_version":"1.0","canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","source":{"kind":"arxiv","id":"1510.03614","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Rainbow Coloring Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eduard Eiben, Juho Lauri, Robert Ganian","submitted_at":"2015-10-13T10:32:34Z","abstract_excerpt":"An edge-colored graph $G$ is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by $rc(G)$, is the minimum number of colors needed to make $G$ rainbow connected. Along with its variants, which consider vertex colorings and/or so-called strong colorings, the rainbow connection number has been studied from both the algorithmic and graph-theoretic points of view.\n  In this paper we present a range of new results on the computational complexity of computing the four major variants of the rainb"},"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":"1510.03614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-13T10:32:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1c88208d10828aace0599edf4215b4c81c2dc2563e4ce31254056c6ce2fd026","abstract_canon_sha256":"6280631b2f06fd5d7fd19cdb6777407da73562667c8ff4aacf63ffb85771342f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:16.685766Z","signature_b64":"of9SoUzYbsJnCqVs2N5K5IF+/lfRxYODLi3BGD4BEwfU64T5cjhpsCXF4uc+fwf8iQqpLrhZJ7riq6qGOIz2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","last_reissued_at":"2026-05-18T01:30:16.685020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:16.685020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Rainbow Coloring Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eduard Eiben, Juho Lauri, Robert Ganian","submitted_at":"2015-10-13T10:32:34Z","abstract_excerpt":"An edge-colored graph $G$ is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by $rc(G)$, is the minimum number of colors needed to make $G$ rainbow connected. Along with its variants, which consider vertex colorings and/or so-called strong colorings, the rainbow connection number has been studied from both the algorithmic and graph-theoretic points of view.\n  In this paper we present a range of new results on the computational complexity of computing the four major variants of the rainb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03614","kind":"arxiv","version":1},"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":"1510.03614","created_at":"2026-05-18T01:30:16.685132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03614v1","created_at":"2026-05-18T01:30:16.685132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03614","created_at":"2026-05-18T01:30:16.685132+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GW4DJCNVKME","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GW4DJCNVKME7B7K","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GW4DJCN","created_at":"2026-05-18T12:29:02.477457+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/3GW4DJCNVKME7B7KX4FHRTYSAW","json":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW.json","graph_json":"https://pith.science/api/pith-number/3GW4DJCNVKME7B7KX4FHRTYSAW/graph.json","events_json":"https://pith.science/api/pith-number/3GW4DJCNVKME7B7KX4FHRTYSAW/events.json","paper":"https://pith.science/paper/3GW4DJCN"},"agent_actions":{"view_html":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW","download_json":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW.json","view_paper":"https://pith.science/paper/3GW4DJCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03614&json=true","fetch_graph":"https://pith.science/api/pith-number/3GW4DJCNVKME7B7KX4FHRTYSAW/graph.json","fetch_events":"https://pith.science/api/pith-number/3GW4DJCNVKME7B7KX4FHRTYSAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/action/storage_attestation","attest_author":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/action/author_attestation","sign_citation":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/action/citation_signature","submit_replication":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/action/replication_record"}},"created_at":"2026-05-18T01:30:16.685132+00:00","updated_at":"2026-05-18T01:30:16.685132+00:00"}