{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K5C6M57RPPEJCWL4GQROTGYLO4","short_pith_number":"pith:K5C6M57R","schema_version":"1.0","canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","source":{"kind":"arxiv","id":"1111.3480","version":2},"attestation_state":"computed","paper":{"title":"Oriented diameter and rainbow connection number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xiaolong Huang, Xueliang Li, Yuefang Sun","submitted_at":"2011-11-15T10:00:55Z","abstract_excerpt":"The oriented diameter of a bridgeless graph $G$ is $\\min\\{diam(H)\\ | H\\ is\\ an orientation\\ of\\ G\\}$. A path in an edge-colored graph $G$, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number $rc(G)$ of $G$ is the smallest integer $k$ for which there exists a $k$-edge-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. In this paper, we obtain upper bounds for the oriented diameter and the rainbow connection number of a graph in terms of $rad(G)$ and $\\eta(G)$, w"},"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":"1111.3480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-15T10:00:55Z","cross_cats_sorted":[],"title_canon_sha256":"19476d2d768b7b7a72dba13e7af52644306fdbe1a7ad0be533afa0c6f9a14f15","abstract_canon_sha256":"abd5f5fb95ff8ca7db5637b11cf96f8e6d1a239fad9b2bb6d4589ac6a301ada9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.046341Z","signature_b64":"tt7pBnd8F+lnltOFEbq5eHEccJorndExpWaYLjIANUkWHkA30gz3aflxxWmij2hgSXacqEYSohNmdblCmYp9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","last_reissued_at":"2026-05-18T04:07:05.045651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.045651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oriented diameter and rainbow connection number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xiaolong Huang, Xueliang Li, Yuefang Sun","submitted_at":"2011-11-15T10:00:55Z","abstract_excerpt":"The oriented diameter of a bridgeless graph $G$ is $\\min\\{diam(H)\\ | H\\ is\\ an orientation\\ of\\ G\\}$. A path in an edge-colored graph $G$, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number $rc(G)$ of $G$ is the smallest integer $k$ for which there exists a $k$-edge-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. In this paper, we obtain upper bounds for the oriented diameter and the rainbow connection number of a graph in terms of $rad(G)$ and $\\eta(G)$, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3480","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":"1111.3480","created_at":"2026-05-18T04:07:05.045756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3480v2","created_at":"2026-05-18T04:07:05.045756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3480","created_at":"2026-05-18T04:07:05.045756+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5C6M57RPPEJ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5C6M57RPPEJCWL4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5C6M57R","created_at":"2026-05-18T12:26:32.869790+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/K5C6M57RPPEJCWL4GQROTGYLO4","json":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4.json","graph_json":"https://pith.science/api/pith-number/K5C6M57RPPEJCWL4GQROTGYLO4/graph.json","events_json":"https://pith.science/api/pith-number/K5C6M57RPPEJCWL4GQROTGYLO4/events.json","paper":"https://pith.science/paper/K5C6M57R"},"agent_actions":{"view_html":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4","download_json":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4.json","view_paper":"https://pith.science/paper/K5C6M57R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3480&json=true","fetch_graph":"https://pith.science/api/pith-number/K5C6M57RPPEJCWL4GQROTGYLO4/graph.json","fetch_events":"https://pith.science/api/pith-number/K5C6M57RPPEJCWL4GQROTGYLO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/action/storage_attestation","attest_author":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/action/author_attestation","sign_citation":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/action/citation_signature","submit_replication":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/action/replication_record"}},"created_at":"2026-05-18T04:07:05.045756+00:00","updated_at":"2026-05-18T04:07:05.045756+00:00"}