{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AMO4KPYWCIHMMAQCUUQTZ45XKM","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":"0c87dd7287fcd754836197f2ea170f72ea76eceb358d5352d551e324392e5c69","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-22T21:22:33Z","title_canon_sha256":"f4b3541bf108191a28ac334a28fb576ac7e197ef7828c2298b94aeff6ddc833f"},"schema_version":"1.0","source":{"id":"1201.4603","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4603","created_at":"2026-05-18T03:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4603v3","created_at":"2026-05-18T03:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4603","created_at":"2026-05-18T03:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"AMO4KPYWCIHM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AMO4KPYWCIHMMAQC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AMO4KPYW","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:3759f8675826db7549926aa427b75839a16ff4b7ae019c671eb298f0f2674ade","target":"graph","created_at":"2026-05-18T03:44:15Z","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":"An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected.\n  In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold $p=\\frac{\\log n+\\om}{n}$ where $\\om=\\om(n)\\to\\infty$ and ${\\om}=o(\\log{n})$ and of random $r$-regular graphs where $r \\geq 3$ is a fixed integer. Specifically, we prove that the rainbow connectivity $rc(G)","authors_text":"Alan Frieze, Charalampos E. Tsourakakis","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-22T21:22:33Z","title":"Rainbow Connectivity of Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4603","kind":"arxiv","version":3},"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:b3bc8cc8c82f2e07d44e0ee9ce89d047fee2264d1db6500c3fa99721e08c91cc","target":"record","created_at":"2026-05-18T03:44:15Z","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":"0c87dd7287fcd754836197f2ea170f72ea76eceb358d5352d551e324392e5c69","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-22T21:22:33Z","title_canon_sha256":"f4b3541bf108191a28ac334a28fb576ac7e197ef7828c2298b94aeff6ddc833f"},"schema_version":"1.0","source":{"id":"1201.4603","kind":"arxiv","version":3}},"canonical_sha256":"031dc53f16120ec60202a5213cf3b75305d8981a3dc0fdddd619bbba5c0a90ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"031dc53f16120ec60202a5213cf3b75305d8981a3dc0fdddd619bbba5c0a90ee","first_computed_at":"2026-05-18T03:44:15.428338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:15.428338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhrNW2uv9HFF8jl8ZyKMbfFoYiKyx97f+IVJkXmzoVyDBecU62mBffPq+Em2Ul2AY6QFJwpWVFYloKaOAw23AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:15.428739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4603","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3bc8cc8c82f2e07d44e0ee9ce89d047fee2264d1db6500c3fa99721e08c91cc","sha256:3759f8675826db7549926aa427b75839a16ff4b7ae019c671eb298f0f2674ade"],"state_sha256":"aab1e1cfdd8ae92bd7893d94f53e74d78620b256d9aee431b95906350c25a35e"}