{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3GW4DJCNVKME7B7KX4FHRTYSAW","short_pith_number":"pith:3GW4DJCN","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"},"canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","source":{"kind":"arxiv","id":"1510.03614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03614","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03614v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03614","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"3GW4DJCNVKME","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GW4DJCNVKME7B7K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GW4DJCN","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3GW4DJCNVKME7B7KX4FHRTYSAW","target":"record","payload":{"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"},"canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","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"},"source_kind":"arxiv","source_id":"1510.03614","source_version":1,"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:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+tiAv0sGMsUbaisgHBv/+iLTbpiZHrtnD8v12VbjEcyS1KXyVDb/8yXxD2OSySRU1WeOh1uxBEGPKQkKn5iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:01.661326Z"},"content_sha256":"5fb6c5898a9bb6e4f5d6187a9782a3d8fb015281a7fa1eddd0c3ebacdc38b58e","schema_version":"1.0","event_id":"sha256:5fb6c5898a9bb6e4f5d6187a9782a3d8fb015281a7fa1eddd0c3ebacdc38b58e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3GW4DJCNVKME7B7KX4FHRTYSAW","target":"graph","payload":{"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"},"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:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0+hQ6kzuK2EZVgdlSafulVZedbncNUPJAsmXxsIrrNzjtSkDTD0IjkIoi3FqaQL9UM11cGp1KCsohYE4xxvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:01.661986Z"},"content_sha256":"eab07891bd1f6e0b1ec3a81b3ebdf5ca82ee33d2364224b3fc3ea1f23f7705c9","schema_version":"1.0","event_id":"sha256:eab07891bd1f6e0b1ec3a81b3ebdf5ca82ee33d2364224b3fc3ea1f23f7705c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/bundle.json","state_url":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/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-25T10:22:01Z","links":{"resolver":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW","bundle":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/bundle.json","state":"https://pith.science/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GW4DJCNVKME7B7KX4FHRTYSAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3GW4DJCNVKME7B7KX4FHRTYSAW","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":"6280631b2f06fd5d7fd19cdb6777407da73562667c8ff4aacf63ffb85771342f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-13T10:32:34Z","title_canon_sha256":"d1c88208d10828aace0599edf4215b4c81c2dc2563e4ce31254056c6ce2fd026"},"schema_version":"1.0","source":{"id":"1510.03614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03614","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03614v1","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03614","created_at":"2026-05-18T01:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"3GW4DJCNVKME","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GW4DJCNVKME7B7K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GW4DJCN","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:eab07891bd1f6e0b1ec3a81b3ebdf5ca82ee33d2364224b3fc3ea1f23f7705c9","target":"graph","created_at":"2026-05-18T01:30:16Z","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":"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","authors_text":"Eduard Eiben, Juho Lauri, Robert Ganian","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-13T10:32:34Z","title":"On the Complexity of Rainbow Coloring Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03614","kind":"arxiv","version":1},"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:5fb6c5898a9bb6e4f5d6187a9782a3d8fb015281a7fa1eddd0c3ebacdc38b58e","target":"record","created_at":"2026-05-18T01:30:16Z","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":"6280631b2f06fd5d7fd19cdb6777407da73562667c8ff4aacf63ffb85771342f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-13T10:32:34Z","title_canon_sha256":"d1c88208d10828aace0599edf4215b4c81c2dc2563e4ce31254056c6ce2fd026"},"schema_version":"1.0","source":{"id":"1510.03614","kind":"arxiv","version":1}},"canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9adc1a44daa984f87eabf0a78cf12059985397af43f35952a35e1638243ba76","first_computed_at":"2026-05-18T01:30:16.685020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:16.685020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"of9SoUzYbsJnCqVs2N5K5IF+/lfRxYODLi3BGD4BEwfU64T5cjhpsCXF4uc+fwf8iQqpLrhZJ7riq6qGOIz2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:16.685766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fb6c5898a9bb6e4f5d6187a9782a3d8fb015281a7fa1eddd0c3ebacdc38b58e","sha256:eab07891bd1f6e0b1ec3a81b3ebdf5ca82ee33d2364224b3fc3ea1f23f7705c9"],"state_sha256":"b20c0d72182a306edcfa3b13e318a2614d91f1bc3de0d47d084b0429b9662d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0zVB811F3fhc5Ay+g7UhyoXRMtfYZ90JnuTRx9Ps4LmALu7r6uscTW+6UnRX1SgTeI6BNtGLCKikjCzk8g+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:22:01.665082Z","bundle_sha256":"2220a4b9c429f93f4e29d9168efa837206dc29cb2f4e0205ff1994bae2615be4"}}