{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H7SLV5F6V24YFYTEHH2DNWTOL3","short_pith_number":"pith:H7SLV5F6","schema_version":"1.0","canonical_sha256":"3fe4baf4beaeb982e26439f436da6e5ef7774dce0caa7e4a1de2a1103bf38ba4","source":{"kind":"arxiv","id":"1501.00821","version":2},"attestation_state":"computed","paper":{"title":"Some Remarks on Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Michael Krivelevich, Nina Kam\\v{c}ev","submitted_at":"2015-01-05T11:15:09Z","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."},"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":"1501.00821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-05T11:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"ae4244c26219d25a958384b4b72f80542b12e42d56ba4922b43a7e2ed416cfff","abstract_canon_sha256":"0c71d1e5de92ced3620510ea7222906dac8e5560875ba5d98a97fe30494644ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.150531Z","signature_b64":"aQEQABJpWccYi0blaEJ1u1EmpP8ek5XeQ/w5JnbTGgClsj5kkkXIfmMFbyNa6YNGT6aWZye5PWHCZlE3LchxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fe4baf4beaeb982e26439f436da6e5ef7774dce0caa7e4a1de2a1103bf38ba4","last_reissued_at":"2026-05-18T01:01:16.149884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.149884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Remarks on Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Michael Krivelevich, Nina Kam\\v{c}ev","submitted_at":"2015-01-05T11:15:09Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00821","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":"1501.00821","created_at":"2026-05-18T01:01:16.149978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00821v2","created_at":"2026-05-18T01:01:16.149978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00821","created_at":"2026-05-18T01:01:16.149978+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7SLV5F6V24Y","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7SLV5F6V24YFYTE","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7SLV5F6","created_at":"2026-05-18T12:29:22.688609+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/H7SLV5F6V24YFYTEHH2DNWTOL3","json":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3.json","graph_json":"https://pith.science/api/pith-number/H7SLV5F6V24YFYTEHH2DNWTOL3/graph.json","events_json":"https://pith.science/api/pith-number/H7SLV5F6V24YFYTEHH2DNWTOL3/events.json","paper":"https://pith.science/paper/H7SLV5F6"},"agent_actions":{"view_html":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3","download_json":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3.json","view_paper":"https://pith.science/paper/H7SLV5F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00821&json=true","fetch_graph":"https://pith.science/api/pith-number/H7SLV5F6V24YFYTEHH2DNWTOL3/graph.json","fetch_events":"https://pith.science/api/pith-number/H7SLV5F6V24YFYTEHH2DNWTOL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3/action/storage_attestation","attest_author":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3/action/author_attestation","sign_citation":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3/action/citation_signature","submit_replication":"https://pith.science/pith/H7SLV5F6V24YFYTEHH2DNWTOL3/action/replication_record"}},"created_at":"2026-05-18T01:01:16.149978+00:00","updated_at":"2026-05-18T01:01:16.149978+00:00"}