{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C6TOGR3DDIM3IQGSAVEAVKY5C2","short_pith_number":"pith:C6TOGR3D","canonical_record":{"source":{"id":"1105.0979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-05T05:39:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9ebcd31d2319f4fadc2c4da95d7498748be566bba98d2a5ec7a72e547d501ce3","abstract_canon_sha256":"a5fdccd7e42f268261982e1285217b86b9c0ec1794fb16450c812c86ca41498c"},"schema_version":"1.0"},"canonical_sha256":"17a6e347631a19b440d205480aab1d169cf64aed36fd6f1bb8693a90f2cc231c","source":{"kind":"arxiv","id":"1105.0979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0979","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0979v2","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0979","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"C6TOGR3DDIM3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C6TOGR3DDIM3IQGS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C6TOGR3D","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C6TOGR3DDIM3IQGSAVEAVKY5C2","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-05T05:39:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9ebcd31d2319f4fadc2c4da95d7498748be566bba98d2a5ec7a72e547d501ce3","abstract_canon_sha256":"a5fdccd7e42f268261982e1285217b86b9c0ec1794fb16450c812c86ca41498c"},"schema_version":"1.0"},"canonical_sha256":"17a6e347631a19b440d205480aab1d169cf64aed36fd6f1bb8693a90f2cc231c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:31.632862Z","signature_b64":"mwyMoSIGxdNI9VF1DZPYdHDUxM2q31YGFv1yi8TrWWmqiLiSgCA9RC80cDgdumR7uytPNsbeTpF7MQBI3wpRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17a6e347631a19b440d205480aab1d169cf64aed36fd6f1bb8693a90f2cc231c","last_reissued_at":"2026-05-18T04:11:31.632240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:31.632240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0979","source_version":2,"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-18T04:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5TBgbeIg+QR03Sto4X6xxxakrRRTVWyMvkOSKCBdZU3Oq8sC5Vrw7zI0d3uF/2lPW6dXASanQw7e8IERhC4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:09:19.997838Z"},"content_sha256":"cd47778861b4066f302125cf6d405a903ad10319b5fce7b7e7bcb3f93ac1cb94","schema_version":"1.0","event_id":"sha256:cd47778861b4066f302125cf6d405a903ad10319b5fce7b7e7bcb3f93ac1cb94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C6TOGR3DDIM3IQGSAVEAVKY5C2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness and Parameterized Algorithms on Rainbow Connectivity problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Kanthi K Sarpatwar, Meghana Nasre, Prabhanjan Ananth","submitted_at":"2011-05-05T05:39:34Z","abstract_excerpt":"A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0979","kind":"arxiv","version":2},"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-18T04:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLddqLWs31URH2zKv3P9coB37hQj3OOyvxfUz4ei+i+6mjkDyv29KOHrE7cbjKsjJHLI+B+u2rn+MSRLzwBnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:09:19.998178Z"},"content_sha256":"1e54e74a503ea00b4d5f5bc4daf69357c2cfe94cc9cd4f785a82cf522993cdf8","schema_version":"1.0","event_id":"sha256:1e54e74a503ea00b4d5f5bc4daf69357c2cfe94cc9cd4f785a82cf522993cdf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/bundle.json","state_url":"https://pith.science/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/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-06-24T19:09:19Z","links":{"resolver":"https://pith.science/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2","bundle":"https://pith.science/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/bundle.json","state":"https://pith.science/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6TOGR3DDIM3IQGSAVEAVKY5C2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C6TOGR3DDIM3IQGSAVEAVKY5C2","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":"a5fdccd7e42f268261982e1285217b86b9c0ec1794fb16450c812c86ca41498c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-05T05:39:34Z","title_canon_sha256":"9ebcd31d2319f4fadc2c4da95d7498748be566bba98d2a5ec7a72e547d501ce3"},"schema_version":"1.0","source":{"id":"1105.0979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0979","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0979v2","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0979","created_at":"2026-05-18T04:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"C6TOGR3DDIM3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C6TOGR3DDIM3IQGS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C6TOGR3D","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:1e54e74a503ea00b4d5f5bc4daf69357c2cfe94cc9cd4f785a82cf522993cdf8","target":"graph","created_at":"2026-05-18T04:11:31Z","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 said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be sum","authors_text":"Kanthi K Sarpatwar, Meghana Nasre, Prabhanjan Ananth","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-05T05:39:34Z","title":"Hardness and Parameterized Algorithms on Rainbow Connectivity problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0979","kind":"arxiv","version":2},"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:cd47778861b4066f302125cf6d405a903ad10319b5fce7b7e7bcb3f93ac1cb94","target":"record","created_at":"2026-05-18T04:11:31Z","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":"a5fdccd7e42f268261982e1285217b86b9c0ec1794fb16450c812c86ca41498c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-05T05:39:34Z","title_canon_sha256":"9ebcd31d2319f4fadc2c4da95d7498748be566bba98d2a5ec7a72e547d501ce3"},"schema_version":"1.0","source":{"id":"1105.0979","kind":"arxiv","version":2}},"canonical_sha256":"17a6e347631a19b440d205480aab1d169cf64aed36fd6f1bb8693a90f2cc231c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17a6e347631a19b440d205480aab1d169cf64aed36fd6f1bb8693a90f2cc231c","first_computed_at":"2026-05-18T04:11:31.632240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:31.632240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mwyMoSIGxdNI9VF1DZPYdHDUxM2q31YGFv1yi8TrWWmqiLiSgCA9RC80cDgdumR7uytPNsbeTpF7MQBI3wpRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:31.632862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd47778861b4066f302125cf6d405a903ad10319b5fce7b7e7bcb3f93ac1cb94","sha256:1e54e74a503ea00b4d5f5bc4daf69357c2cfe94cc9cd4f785a82cf522993cdf8"],"state_sha256":"c25b29aa446f9b92e273c81cffa4a91c5a1a30613ddc337396ecc12225a6bea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ed2zkfjCbIq8XLkV53i1rJtrDvphTyqVK5olaRrUuK4+bmVwGJXru2WkNss8ricupVM1FU9nt+wEhxn+t2tDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:09:20.000118Z","bundle_sha256":"15beafb23761edf1c523fa42a869f66ac4c17d1cd51fcd5fa781d2888663eacf"}}