{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RZAQQNHGZQFEIRUSWTYBGE5YRN","short_pith_number":"pith:RZAQQNHG","schema_version":"1.0","canonical_sha256":"8e410834e6cc0a444692b4f01313b88b7d0dc951e4d2650bb77ee1f2996c8552","source":{"kind":"arxiv","id":"1601.01063","version":3},"attestation_state":"computed","paper":{"title":"On various (strong) rainbow connection numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Jinfeng Liu, Lin Chen, Xueliang Li","submitted_at":"2016-01-06T02:56:13Z","abstract_excerpt":"An edge-coloured path is \\emph{rainbow} if all the edges have distinct colours. For a connected graph $G$, the \\emph{rainbow connection number} $rc(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow path. Similarly, the \\emph{strong rainbow connection number} $src(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow geodesic (i.e., a path of shortest length). These two concepts of connectivity in graphs were introduced by Chartrand et al.~in 2008. Subsequently"},"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":"1601.01063","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-06T02:56:13Z","cross_cats_sorted":[],"title_canon_sha256":"ca0b068cead4f6685fc24f5ba35fea2282dd0d6f43acbb94f169a54e19ff0d04","abstract_canon_sha256":"3dec14ed42ac32dce8ce135007d30febd12371d8e7f41213529a10b839314541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.546084Z","signature_b64":"zzJunr16n6S/nIiIjVa9mwwylxPI1ReqG2DnuKkdObL4kFR4bI+yaD4WwV8RmmUEiD3vxQq6sIdoIUmXZ5b+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e410834e6cc0a444692b4f01313b88b7d0dc951e4d2650bb77ee1f2996c8552","last_reissued_at":"2026-05-18T00:46:04.545692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.545692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On various (strong) rainbow connection numbers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Jinfeng Liu, Lin Chen, Xueliang Li","submitted_at":"2016-01-06T02:56:13Z","abstract_excerpt":"An edge-coloured path is \\emph{rainbow} if all the edges have distinct colours. For a connected graph $G$, the \\emph{rainbow connection number} $rc(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow path. Similarly, the \\emph{strong rainbow connection number} $src(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow geodesic (i.e., a path of shortest length). These two concepts of connectivity in graphs were introduced by Chartrand et al.~in 2008. Subsequently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01063","kind":"arxiv","version":3},"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":"1601.01063","created_at":"2026-05-18T00:46:04.545765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01063v3","created_at":"2026-05-18T00:46:04.545765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01063","created_at":"2026-05-18T00:46:04.545765+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZAQQNHGZQFE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZAQQNHGZQFEIRUS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZAQQNHG","created_at":"2026-05-18T12:30:41.710351+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/RZAQQNHGZQFEIRUSWTYBGE5YRN","json":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN.json","graph_json":"https://pith.science/api/pith-number/RZAQQNHGZQFEIRUSWTYBGE5YRN/graph.json","events_json":"https://pith.science/api/pith-number/RZAQQNHGZQFEIRUSWTYBGE5YRN/events.json","paper":"https://pith.science/paper/RZAQQNHG"},"agent_actions":{"view_html":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN","download_json":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN.json","view_paper":"https://pith.science/paper/RZAQQNHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01063&json=true","fetch_graph":"https://pith.science/api/pith-number/RZAQQNHGZQFEIRUSWTYBGE5YRN/graph.json","fetch_events":"https://pith.science/api/pith-number/RZAQQNHGZQFEIRUSWTYBGE5YRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN/action/storage_attestation","attest_author":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN/action/author_attestation","sign_citation":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN/action/citation_signature","submit_replication":"https://pith.science/pith/RZAQQNHGZQFEIRUSWTYBGE5YRN/action/replication_record"}},"created_at":"2026-05-18T00:46:04.545765+00:00","updated_at":"2026-05-18T00:46:04.545765+00:00"}