{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H7SLV5F6V24YFYTEHH2DNWTOL3","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":"0c71d1e5de92ced3620510ea7222906dac8e5560875ba5d98a97fe30494644ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-05T11:15:09Z","title_canon_sha256":"ae4244c26219d25a958384b4b72f80542b12e42d56ba4922b43a7e2ed416cfff"},"schema_version":"1.0","source":{"id":"1501.00821","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00821","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00821v2","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00821","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"H7SLV5F6V24Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H7SLV5F6V24YFYTE","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H7SLV5F6","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:d9d152f55661e3eaffae113c8130325690ef780be93d78ce5f0bfcad7d843bbf","target":"graph","created_at":"2026-05-18T01:01:16Z","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 (vertex) coloured graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colours. Rainbow edge (vertex) connectivity of a graph $G$ is the smallest number of colours needed for a rainbow edge (vertex) colouring of $G$. In this paper we propose a very simple approach to studying rainbow connectivity in graphs. Using this idea, we give a unified proof of several known results, as well as some new ones.","authors_text":"Benny Sudakov, Michael Krivelevich, Nina Kam\\v{c}ev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-05T11:15:09Z","title":"Some Remarks on Rainbow Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00821","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:4f66431a399344585e10d3ae7ac38d34b384332d77c5c4d666a136bc13c49023","target":"record","created_at":"2026-05-18T01:01:16Z","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":"0c71d1e5de92ced3620510ea7222906dac8e5560875ba5d98a97fe30494644ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-05T11:15:09Z","title_canon_sha256":"ae4244c26219d25a958384b4b72f80542b12e42d56ba4922b43a7e2ed416cfff"},"schema_version":"1.0","source":{"id":"1501.00821","kind":"arxiv","version":2}},"canonical_sha256":"3fe4baf4beaeb982e26439f436da6e5ef7774dce0caa7e4a1de2a1103bf38ba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fe4baf4beaeb982e26439f436da6e5ef7774dce0caa7e4a1de2a1103bf38ba4","first_computed_at":"2026-05-18T01:01:16.149884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:16.149884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aQEQABJpWccYi0blaEJ1u1EmpP8ek5XeQ/w5JnbTGgClsj5kkkXIfmMFbyNa6YNGT6aWZye5PWHCZlE3LchxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:16.150531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00821","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f66431a399344585e10d3ae7ac38d34b384332d77c5c4d666a136bc13c49023","sha256:d9d152f55661e3eaffae113c8130325690ef780be93d78ce5f0bfcad7d843bbf"],"state_sha256":"4da7590ab83e9d166245e5dbe8126af32bf8c2dbcf705fb3769ee2a637748811"}