{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2KWJDCPI7BPPA2OAXAJQJUPVP3","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":"2b6892c1ee8fbfa5f10dcd8b665097d72642f34d76018948e6dcf89e5ff2467f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-26T05:26:48Z","title_canon_sha256":"a0de15637bb4301663a8d88a682760287f4d287ba558213f74d70dd9c7879ff9"},"schema_version":"1.0","source":{"id":"1212.6115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6115","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6115v1","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6115","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"2KWJDCPI7BPP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2KWJDCPI7BPPA2OA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2KWJDCPI","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:91d63febc967b6a4a4b0103a09280b73aa2c2434862da8c9ea65b10cc297739b","target":"graph","created_at":"2026-05-18T03:37:42Z","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 $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$ internally vertex-disjoint rainbow paths is called the rainbow $k$-connectivity of the graph $G$, denoted by $rc_k(G)$. For the random graph $G(n,p)$, He and Liang got a sharp threshold function for the property $rc_k(G(n,p))\\leq d$. In this paper, we extend this result to the case of random bipartite graph $G(m,n,p)$.","authors_text":"Huishu Lian, Xiaolin Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-26T05:26:48Z","title":"Rainbow $k$-connectivity of random bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6115","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:04aa8a6472093a9e4210648461665d019385bce65a58854f0f26408db727907f","target":"record","created_at":"2026-05-18T03:37:42Z","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":"2b6892c1ee8fbfa5f10dcd8b665097d72642f34d76018948e6dcf89e5ff2467f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-26T05:26:48Z","title_canon_sha256":"a0de15637bb4301663a8d88a682760287f4d287ba558213f74d70dd9c7879ff9"},"schema_version":"1.0","source":{"id":"1212.6115","kind":"arxiv","version":1}},"canonical_sha256":"d2ac9189e8f85ef069c0b81304d1f57ecbb0437a67cd1534259f69e682c88357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2ac9189e8f85ef069c0b81304d1f57ecbb0437a67cd1534259f69e682c88357","first_computed_at":"2026-05-18T03:37:42.729053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:42.729053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IAY5nRUzQpScNf83dm1yp1m40ukczrmB52wzdEpLTjmvwIy/ug7icHvQ1UGZRlOGJDt3cui4KvL2rHd52BYJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:42.729569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04aa8a6472093a9e4210648461665d019385bce65a58854f0f26408db727907f","sha256:91d63febc967b6a4a4b0103a09280b73aa2c2434862da8c9ea65b10cc297739b"],"state_sha256":"03337f0619ae7748485baa025a128c3c219b52d6ee62912dc3c0b67127485f47"}