{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K5C6M57RPPEJCWL4GQROTGYLO4","short_pith_number":"pith:K5C6M57R","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"},"canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","source":{"kind":"arxiv","id":"1111.3480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3480","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3480v2","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3480","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"K5C6M57RPPEJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K5C6M57RPPEJCWL4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K5C6M57R","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K5C6M57RPPEJCWL4GQROTGYLO4","target":"record","payload":{"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"},"canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","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"},"source_kind":"arxiv","source_id":"1111.3480","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUaihqOZtxsNL/6sJJLvf4bFOPmfOUhkaiKyexM9xLleLNEyUq2vZWA0XAGluqFkxKlYmBHhYfo6IOIbnxe2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:53.289872Z"},"content_sha256":"fd35160e596910078620017a876b0df00f072abf47b31ff9d74eb80393b510db","schema_version":"1.0","event_id":"sha256:fd35160e596910078620017a876b0df00f072abf47b31ff9d74eb80393b510db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K5C6M57RPPEJCWL4GQROTGYLO4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/tmvqGQyYwP6ml59L/fI2ZncVlnKZ4y3F0FUckX6w599pbWW57rLAeXtrdYWWkEc4C6PKAYmeZteTZtI6L4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:53.290216Z"},"content_sha256":"3f4778ead95a7bf5031cc61d70cfb7078d229449196a25f37877c25603d8023f","schema_version":"1.0","event_id":"sha256:3f4778ead95a7bf5031cc61d70cfb7078d229449196a25f37877c25603d8023f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/bundle.json","state_url":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5C6M57RPPEJCWL4GQROTGYLO4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:40:53Z","links":{"resolver":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4","bundle":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/bundle.json","state":"https://pith.science/pith/K5C6M57RPPEJCWL4GQROTGYLO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5C6M57RPPEJCWL4GQROTGYLO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K5C6M57RPPEJCWL4GQROTGYLO4","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":"abd5f5fb95ff8ca7db5637b11cf96f8e6d1a239fad9b2bb6d4589ac6a301ada9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-15T10:00:55Z","title_canon_sha256":"19476d2d768b7b7a72dba13e7af52644306fdbe1a7ad0be533afa0c6f9a14f15"},"schema_version":"1.0","source":{"id":"1111.3480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3480","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3480v2","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3480","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"K5C6M57RPPEJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K5C6M57RPPEJCWL4","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K5C6M57R","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:3f4778ead95a7bf5031cc61d70cfb7078d229449196a25f37877c25603d8023f","target":"graph","created_at":"2026-05-18T04:07:05Z","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":"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","authors_text":"Hengzhe Li, Xiaolong Huang, Xueliang Li, Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-15T10:00:55Z","title":"Oriented diameter and rainbow connection number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3480","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:fd35160e596910078620017a876b0df00f072abf47b31ff9d74eb80393b510db","target":"record","created_at":"2026-05-18T04:07:05Z","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":"abd5f5fb95ff8ca7db5637b11cf96f8e6d1a239fad9b2bb6d4589ac6a301ada9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-15T10:00:55Z","title_canon_sha256":"19476d2d768b7b7a72dba13e7af52644306fdbe1a7ad0be533afa0c6f9a14f15"},"schema_version":"1.0","source":{"id":"1111.3480","kind":"arxiv","version":2}},"canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5745e677f17bc891597c3422e99b0b773212bd85f16b152c05b2fe45b6c44f54","first_computed_at":"2026-05-18T04:07:05.045651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:05.045651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tt7pBnd8F+lnltOFEbq5eHEccJorndExpWaYLjIANUkWHkA30gz3aflxxWmij2hgSXacqEYSohNmdblCmYp9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:05.046341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd35160e596910078620017a876b0df00f072abf47b31ff9d74eb80393b510db","sha256:3f4778ead95a7bf5031cc61d70cfb7078d229449196a25f37877c25603d8023f"],"state_sha256":"10fb065ada6723c95bc2e305729c4dc4e70bfdaa7f925804b4368bad85bb9c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wevxrKRjflwjsth117F8cq5v4OHKxrgAGltnYAY60qlhursrFOSjzW3VxSHyla8qKBctk9zGWKCIcCuOmWyFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:40:53.292195Z","bundle_sha256":"c0d44fad9263b85ebab80e31c5c24c42b30d2b09a999771397b2c6f0454a7989"}}