{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O3Z6TEOYFJCTNFP7H7EFYGBT4E","short_pith_number":"pith:O3Z6TEOY","schema_version":"1.0","canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","source":{"kind":"arxiv","id":"1404.3082","version":4},"attestation_state":"computed","paper":{"title":"Further Hardness Results on Rainbow and Strong Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Juho Lauri","submitted_at":"2014-04-11T11:50:55Z","abstract_excerpt":"A path in an edge-colored graph is \\textit{rainbow} if no two edges of it are colored the same. The graph is said to be \\textit{rainbow connected} if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph is \\textit{strong rainbow connected}. We consider the complexity of the problem of deciding if a given edge-colored graph is rainbow or strong rainbow connected. These problems are called \\textsc{Rainbow connectivity} and \\textsc{Strong rainbow connectivity}, respectively. We prove both problems remain $\\NP$\\hyp{}c"},"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":"1404.3082","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-11T11:50:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"15f462095287def0f2c24ca7988f21dd7eefe9a968ae6ebc28a88ba3eeafeb50","abstract_canon_sha256":"92d1175920232ac99f1efa824fdce3daa81ddec643711572863a4ffad9b298ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:30.143180Z","signature_b64":"O1wI4cyHU2khVEhdFyC4hlQLwEhAY7KjbbzMMRWOJzTH0EsPGPwMXOQ9T6MKQyqu1lQnjdp91YbkGrmI7iiSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","last_reissued_at":"2026-05-18T01:20:30.142371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:30.142371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Hardness Results on Rainbow and Strong Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Juho Lauri","submitted_at":"2014-04-11T11:50:55Z","abstract_excerpt":"A path in an edge-colored graph is \\textit{rainbow} if no two edges of it are colored the same. The graph is said to be \\textit{rainbow connected} if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph is \\textit{strong rainbow connected}. We consider the complexity of the problem of deciding if a given edge-colored graph is rainbow or strong rainbow connected. These problems are called \\textsc{Rainbow connectivity} and \\textsc{Strong rainbow connectivity}, respectively. We prove both problems remain $\\NP$\\hyp{}c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3082","kind":"arxiv","version":4},"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":"1404.3082","created_at":"2026-05-18T01:20:30.142513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3082v4","created_at":"2026-05-18T01:20:30.142513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3082","created_at":"2026-05-18T01:20:30.142513+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3Z6TEOYFJCT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3Z6TEOYFJCTNFP7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3Z6TEOY","created_at":"2026-05-18T12:28:41.024544+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/O3Z6TEOYFJCTNFP7H7EFYGBT4E","json":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E.json","graph_json":"https://pith.science/api/pith-number/O3Z6TEOYFJCTNFP7H7EFYGBT4E/graph.json","events_json":"https://pith.science/api/pith-number/O3Z6TEOYFJCTNFP7H7EFYGBT4E/events.json","paper":"https://pith.science/paper/O3Z6TEOY"},"agent_actions":{"view_html":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E","download_json":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E.json","view_paper":"https://pith.science/paper/O3Z6TEOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3082&json=true","fetch_graph":"https://pith.science/api/pith-number/O3Z6TEOYFJCTNFP7H7EFYGBT4E/graph.json","fetch_events":"https://pith.science/api/pith-number/O3Z6TEOYFJCTNFP7H7EFYGBT4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/action/storage_attestation","attest_author":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/action/author_attestation","sign_citation":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/action/citation_signature","submit_replication":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/action/replication_record"}},"created_at":"2026-05-18T01:20:30.142513+00:00","updated_at":"2026-05-18T01:20:30.142513+00:00"}