{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","short_pith_number":"pith:PD3GHKTJ","canonical_record":{"source":{"id":"1109.5534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b","abstract_canon_sha256":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6"},"schema_version":"1.0"},"canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","source":{"kind":"arxiv","id":"1109.5534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5534v2","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"PD3GHKTJWMXE","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PD3GHKTJWMXEQXMP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PD3GHKTJ","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b","abstract_canon_sha256":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6"},"schema_version":"1.0"},"canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:11.414151Z","signature_b64":"dVrdmEGRsBDbGRqS3/GKNzppsyJllWmnLYgM40QbOwe+Mk6WLDi8Y2Wm2h00QXndPf2iaZUxQFOqfIwwGtEvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","last_reissued_at":"2026-05-18T04:12:11.413665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:11.413665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5534","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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExazlGlC8Bk6NtEazoXH16jy43kLtm/zic8ERxP1wG/2AivAM+fBIsbApxYzbyGDXlk7DUMy3ROVhhrUcUlwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:13.326456Z"},"content_sha256":"db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52","schema_version":"1.0","event_id":"sha256:db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the complexity of deciding the rainbow connectedness for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Shasha Li, Xueliang Li","submitted_at":"2011-09-26T12:21:48Z","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 rainbow (geodesic) path between every pair of vertices. The (strong) rainbow connection number of $G$, denoted by ($scr(G)$, respectively) $rc(G)$, is the smallest number of colors that are needed in order to make $G$ (strongly) rainbow connected. Though for a general graph $G$ it is NP-Complete to decide whether $rc(G)=2$, in this paper, we show that the problem becomes easy when $G$ is a bipartite graph. Moreover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5534","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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+v4e4NvC1eMm0GladGsb2lvW0nXJGo/Z6yrj960WphSs8EqTSdN6Rm/IxR5A8AQ61iri8WEjzRx0xyevPgIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:13.326862Z"},"content_sha256":"e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb","schema_version":"1.0","event_id":"sha256:e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/bundle.json","state_url":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/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-01T15:28:13Z","links":{"resolver":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62","bundle":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/bundle.json","state":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","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":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b"},"schema_version":"1.0","source":{"id":"1109.5534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5534v2","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"PD3GHKTJWMXE","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PD3GHKTJWMXEQXMP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PD3GHKTJ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb","target":"graph","created_at":"2026-05-18T04:12:11Z","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 rainbow (geodesic) path between every pair of vertices. The (strong) rainbow connection number of $G$, denoted by ($scr(G)$, respectively) $rc(G)$, is the smallest number of colors that are needed in order to make $G$ (strongly) rainbow connected. Though for a general graph $G$ it is NP-Complete to decide whether $rc(G)=2$, in this paper, we show that the problem becomes easy when $G$ is a bipartite graph. Moreover","authors_text":"Shasha Li, Xueliang Li","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title":"Note on the complexity of deciding the rainbow connectedness for bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5534","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:db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52","target":"record","created_at":"2026-05-18T04:12:11Z","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":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b"},"schema_version":"1.0","source":{"id":"1109.5534","kind":"arxiv","version":2}},"canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","first_computed_at":"2026-05-18T04:12:11.413665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:11.413665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVrdmEGRsBDbGRqS3/GKNzppsyJllWmnLYgM40QbOwe+Mk6WLDi8Y2Wm2h00QXndPf2iaZUxQFOqfIwwGtEvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:11.414151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52","sha256:e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb"],"state_sha256":"a15eb1d173e5f6bb125bfda5a2c0b747520dc6e9082efd843a3a3a192da1875e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWmzF54ol+Q53CQtRyhjw5tLzP+8BOUF/0enO+MaYs+QfZ3PoeYP/LxSU25wIw/w+0ZlRuv7COCcjFogvTmqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:28:13.328858Z","bundle_sha256":"d2342c4093a53e2cc90502919deb67bee6fc165d1e77aaa34c531bb49770f3f0"}}