{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O3Z6TEOYFJCTNFP7H7EFYGBT4E","short_pith_number":"pith:O3Z6TEOY","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"},"canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","source":{"kind":"arxiv","id":"1404.3082","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3082","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3082v4","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3082","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"O3Z6TEOYFJCT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O3Z6TEOYFJCTNFP7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O3Z6TEOY","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O3Z6TEOYFJCTNFP7H7EFYGBT4E","target":"record","payload":{"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"},"canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","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"},"source_kind":"arxiv","source_id":"1404.3082","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcxvWi47qf9F1SxEEBQufNG1XrhOtxAs+yF7mHjjJnIGofaBPKJ2LJbjdHHTcV6O6p74dWVCgniy1pMQtlZ5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:13.469825Z"},"content_sha256":"63af7cfa590e3c9a8789b601d1d506393043a6973eb882c10ab0fa83e691c0d0","schema_version":"1.0","event_id":"sha256:63af7cfa590e3c9a8789b601d1d506393043a6973eb882c10ab0fa83e691c0d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O3Z6TEOYFJCTNFP7H7EFYGBT4E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWv/RmqtUdoe2o8FgQWowSPfSZdAJ3mJJC4SvlKRn9Af9lAMXMcjvXawRRkQr3oEAQyKUv8V7fd6YI4/IZ83Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:23:13.470539Z"},"content_sha256":"36ccae2c9a5593ea8f2c7712cd7893194a94365614afff6b8e35b490ef676116","schema_version":"1.0","event_id":"sha256:36ccae2c9a5593ea8f2c7712cd7893194a94365614afff6b8e35b490ef676116"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/bundle.json","state_url":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:23:13Z","links":{"resolver":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E","bundle":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/bundle.json","state":"https://pith.science/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3Z6TEOYFJCTNFP7H7EFYGBT4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O3Z6TEOYFJCTNFP7H7EFYGBT4E","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":"92d1175920232ac99f1efa824fdce3daa81ddec643711572863a4ffad9b298ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-11T11:50:55Z","title_canon_sha256":"15f462095287def0f2c24ca7988f21dd7eefe9a968ae6ebc28a88ba3eeafeb50"},"schema_version":"1.0","source":{"id":"1404.3082","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3082","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3082v4","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3082","created_at":"2026-05-18T01:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"O3Z6TEOYFJCT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O3Z6TEOYFJCTNFP7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O3Z6TEOY","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:36ccae2c9a5593ea8f2c7712cd7893194a94365614afff6b8e35b490ef676116","target":"graph","created_at":"2026-05-18T01:20:30Z","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":"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","authors_text":"Juho Lauri","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-11T11:50:55Z","title":"Further Hardness Results on Rainbow and Strong Rainbow Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3082","kind":"arxiv","version":4},"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:63af7cfa590e3c9a8789b601d1d506393043a6973eb882c10ab0fa83e691c0d0","target":"record","created_at":"2026-05-18T01:20:30Z","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":"92d1175920232ac99f1efa824fdce3daa81ddec643711572863a4ffad9b298ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-11T11:50:55Z","title_canon_sha256":"15f462095287def0f2c24ca7988f21dd7eefe9a968ae6ebc28a88ba3eeafeb50"},"schema_version":"1.0","source":{"id":"1404.3082","kind":"arxiv","version":4}},"canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76f3e991d82a453695ff3fc85c1833e11455e8c3d014024218353a433d614b63","first_computed_at":"2026-05-18T01:20:30.142371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:30.142371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1wI4cyHU2khVEhdFyC4hlQLwEhAY7KjbbzMMRWOJzTH0EsPGPwMXOQ9T6MKQyqu1lQnjdp91YbkGrmI7iiSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:30.143180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3082","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63af7cfa590e3c9a8789b601d1d506393043a6973eb882c10ab0fa83e691c0d0","sha256:36ccae2c9a5593ea8f2c7712cd7893194a94365614afff6b8e35b490ef676116"],"state_sha256":"cf7840e3095d5e04c1841797da653a2eac9977928f6c92713522e4088f509a08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPAW0k7j6+n+w/hlZbf7OHlSY4LElwO0QTVhfjoSRsIpyliszANs6jxq+Aq1Q1mQt47hp7TsR3bz0SPWJQSxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:23:13.475432Z","bundle_sha256":"50b0a2eb3dd8fd11cdd0bbfa82d282b011eb66c8b922de815e2f4ee755ac7079"}}