{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4AW6FFAGSV3BCOL7DJB3JAHLAU","short_pith_number":"pith:4AW6FFAG","schema_version":"1.0","canonical_sha256":"e02de29406957611397f1a43b480eb052b664ba149341b7f5f096b68e715f32b","source":{"kind":"arxiv","id":"1012.1942","version":2},"attestation_state":"computed","paper":{"title":"On Rainbow-$k$-Connectivity of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hongyu Liang, Jing He","submitted_at":"2010-12-09T08:56:17Z","abstract_excerpt":"A path in an edge-colored graph is called a \\emph{rainbow path} if all edges on it have pairwise distinct colors. For $k\\geq 1$, the \\emph{rainbow-$k$-connectivity} of a graph $G$, denoted $rc_k(G)$, is the minimum number of colors required to color the edges of $G$ in such a way that every two distinct vertices are connected by at least $k$ internally disjoint rainbow paths. In this paper, we study rainbow-$k$-connectivity in the setting of random graphs. We show that for every fixed integer $d\\geq 2$ and every $k\\leq O(\\log n)$, $p=\\frac{(\\log n)^{1/d}}{n^{(d-1)/d}}$ is a sharp threshold fun"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1012.1942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T08:56:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"95e3f0eb806282c039aaebfad6c8fe9f2d860e6436658cc6e972e16b20a618b7","abstract_canon_sha256":"8c7230f460f623e3e37f6aaad88f2543911767681f53c69967dc4e6402c870c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:59.975762Z","signature_b64":"xIrP/j8a2Z4ZhyggKPmwW+JJ8SV0DEFP4rOMp5/UQcXOWV4psl1eH5DwVSWlB90x5o6l7eqSKIr7binZ3unJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02de29406957611397f1a43b480eb052b664ba149341b7f5f096b68e715f32b","last_reissued_at":"2026-05-18T04:00:59.975056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:59.975056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Rainbow-$k$-Connectivity of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hongyu Liang, Jing He","submitted_at":"2010-12-09T08:56:17Z","abstract_excerpt":"A path in an edge-colored graph is called a \\emph{rainbow path} if all edges on it have pairwise distinct colors. For $k\\geq 1$, the \\emph{rainbow-$k$-connectivity} of a graph $G$, denoted $rc_k(G)$, is the minimum number of colors required to color the edges of $G$ in such a way that every two distinct vertices are connected by at least $k$ internally disjoint rainbow paths. In this paper, we study rainbow-$k$-connectivity in the setting of random graphs. We show that for every fixed integer $d\\geq 2$ and every $k\\leq O(\\log n)$, $p=\\frac{(\\log n)^{1/d}}{n^{(d-1)/d}}$ is a sharp threshold fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1942","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1942","created_at":"2026-05-18T04:00:59.975166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1942v2","created_at":"2026-05-18T04:00:59.975166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1942","created_at":"2026-05-18T04:00:59.975166+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AW6FFAGSV3B","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AW6FFAGSV3BCOL7","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AW6FFAG","created_at":"2026-05-18T12:26:03.138858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU","json":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU.json","graph_json":"https://pith.science/api/pith-number/4AW6FFAGSV3BCOL7DJB3JAHLAU/graph.json","events_json":"https://pith.science/api/pith-number/4AW6FFAGSV3BCOL7DJB3JAHLAU/events.json","paper":"https://pith.science/paper/4AW6FFAG"},"agent_actions":{"view_html":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU","download_json":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU.json","view_paper":"https://pith.science/paper/4AW6FFAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1942&json=true","fetch_graph":"https://pith.science/api/pith-number/4AW6FFAGSV3BCOL7DJB3JAHLAU/graph.json","fetch_events":"https://pith.science/api/pith-number/4AW6FFAGSV3BCOL7DJB3JAHLAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU/action/storage_attestation","attest_author":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU/action/author_attestation","sign_citation":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU/action/citation_signature","submit_replication":"https://pith.science/pith/4AW6FFAGSV3BCOL7DJB3JAHLAU/action/replication_record"}},"created_at":"2026-05-18T04:00:59.975166+00:00","updated_at":"2026-05-18T04:00:59.975166+00:00"}