{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ETMKDTLF4CZKKREYFUPUXMAAQW","short_pith_number":"pith:ETMKDTLF","canonical_record":{"source":{"id":"1602.05608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T21:49:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"666e54d80bdc024e47447db5a6aecc71d251a3dd38dc3126191b0813fb450306","abstract_canon_sha256":"c1b72fa2e0299b9973343662b23028d1f0805aa635795f0d02a6be86898f52fe"},"schema_version":"1.0"},"canonical_sha256":"24d8a1cd65e0b2a544982d1f4bb00085aad868adc80f1c714cf6d56df27d8a68","source":{"kind":"arxiv","id":"1602.05608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05608","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05608v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05608","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"ETMKDTLF4CZK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETMKDTLF4CZKKREY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETMKDTLF","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ETMKDTLF4CZKKREYFUPUXMAAQW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T21:49:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"666e54d80bdc024e47447db5a6aecc71d251a3dd38dc3126191b0813fb450306","abstract_canon_sha256":"c1b72fa2e0299b9973343662b23028d1f0805aa635795f0d02a6be86898f52fe"},"schema_version":"1.0"},"canonical_sha256":"24d8a1cd65e0b2a544982d1f4bb00085aad868adc80f1c714cf6d56df27d8a68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:23.680853Z","signature_b64":"BptvFav06YbjyjoGDolAuvBHyVavP98MKSV8xtv/QdV8+1J6fy50z1btpRoRAdEgWhIyL0bxARxUM2rxUlS2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d8a1cd65e0b2a544982d1f4bb00085aad868adc80f1c714cf6d56df27d8a68","last_reissued_at":"2026-05-18T01:20:23.680248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:23.680248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05608","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pANadDH5zw4ULzR/20ICi5nodvrN0G3o+3hz+N687lzHYjH8P0fPZD7AI04hDzZu7+49xn6IXLNDhZRjffzSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:22:03.793036Z"},"content_sha256":"721ee02a530e92fa00ccba9e7141d1a84e09c41679b80d55f23aae5bf2efa634","schema_version":"1.0","event_id":"sha256:721ee02a530e92fa00ccba9e7141d1a84e09c41679b80d55f23aae5bf2efa634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ETMKDTLF4CZKKREYFUPUXMAAQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the fine-grained complexity of rainbow coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, Juho Lauri, {\\L}ukasz Kowalik","submitted_at":"2016-02-17T21:49:16Z","abstract_excerpt":"The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that for any $k\\ge 2$, there is no algorithm for Rainbow k-Coloring running in time $2^{o(n^{3/2})}$, unless ETH fails.\n  Motivated by this negative result we consider two parameterized variants of the problem. In Subset Rainbow k-Coloring problem, introduced by Chakraborty et al. [STACS 2009, J. Comb. Opt. 2009], we are additionally given a set $S$ of pairs of v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05608","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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJaEz2uVF5HwkzdkQtoK4IaXzXJK4AZAtcxBr3AvMwgePsaELgMr+ufeyV1TVuTIY3tiqWeifO8WS6wwkP8MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:22:03.793720Z"},"content_sha256":"44f5c397375fc0b1c99d4debec16492f9994030245739c42e162eaeb9bab86f5","schema_version":"1.0","event_id":"sha256:44f5c397375fc0b1c99d4debec16492f9994030245739c42e162eaeb9bab86f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/bundle.json","state_url":"https://pith.science/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/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-25T21:22:03Z","links":{"resolver":"https://pith.science/pith/ETMKDTLF4CZKKREYFUPUXMAAQW","bundle":"https://pith.science/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/bundle.json","state":"https://pith.science/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETMKDTLF4CZKKREYFUPUXMAAQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ETMKDTLF4CZKKREYFUPUXMAAQW","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":"c1b72fa2e0299b9973343662b23028d1f0805aa635795f0d02a6be86898f52fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T21:49:16Z","title_canon_sha256":"666e54d80bdc024e47447db5a6aecc71d251a3dd38dc3126191b0813fb450306"},"schema_version":"1.0","source":{"id":"1602.05608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05608","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05608v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05608","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"ETMKDTLF4CZK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETMKDTLF4CZKKREY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETMKDTLF","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:44f5c397375fc0b1c99d4debec16492f9994030245739c42e162eaeb9bab86f5","target":"graph","created_at":"2026-05-18T01:20:23Z","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":"The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that for any $k\\ge 2$, there is no algorithm for Rainbow k-Coloring running in time $2^{o(n^{3/2})}$, unless ETH fails.\n  Motivated by this negative result we consider two parameterized variants of the problem. In Subset Rainbow k-Coloring problem, introduced by Chakraborty et al. [STACS 2009, J. Comb. Opt. 2009], we are additionally given a set $S$ of pairs of v","authors_text":"Arkadiusz Soca{\\l}a, Juho Lauri, {\\L}ukasz Kowalik","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T21:49:16Z","title":"On the fine-grained complexity of rainbow coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05608","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:721ee02a530e92fa00ccba9e7141d1a84e09c41679b80d55f23aae5bf2efa634","target":"record","created_at":"2026-05-18T01:20:23Z","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":"c1b72fa2e0299b9973343662b23028d1f0805aa635795f0d02a6be86898f52fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T21:49:16Z","title_canon_sha256":"666e54d80bdc024e47447db5a6aecc71d251a3dd38dc3126191b0813fb450306"},"schema_version":"1.0","source":{"id":"1602.05608","kind":"arxiv","version":1}},"canonical_sha256":"24d8a1cd65e0b2a544982d1f4bb00085aad868adc80f1c714cf6d56df27d8a68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24d8a1cd65e0b2a544982d1f4bb00085aad868adc80f1c714cf6d56df27d8a68","first_computed_at":"2026-05-18T01:20:23.680248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:23.680248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BptvFav06YbjyjoGDolAuvBHyVavP98MKSV8xtv/QdV8+1J6fy50z1btpRoRAdEgWhIyL0bxARxUM2rxUlS2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:23.680853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:721ee02a530e92fa00ccba9e7141d1a84e09c41679b80d55f23aae5bf2efa634","sha256:44f5c397375fc0b1c99d4debec16492f9994030245739c42e162eaeb9bab86f5"],"state_sha256":"47efe603e10687558528f7b8b99b8c72f4a83c0cd72466cc1f5ff4b1e11a7aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKMoJJ1eAUSnjqD3oa1LA48aEGjylDSwDGNzpCpRlGDBb/PxOmBPuIf4UjTu5+oUwZUWnmAt5s9iAiYN1JQKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:22:03.797339Z","bundle_sha256":"d41f4a06ecdd8f550e327202a078002b50679e52f56b8135bd87316ddc79fee2"}}