{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:G63AJDD54KEDGEBJ3OH6BGN52O","short_pith_number":"pith:G63AJDD5","canonical_record":{"source":{"id":"1104.0426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-03T20:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"16d9e2899158775fa9b1e619e9280c0a63a76874fb10ac7de8e72d036d2bc8bf","abstract_canon_sha256":"c994d58d1942a8417c452fce7c73320c3fafe6be893d8406b0556ce779a305f9"},"schema_version":"1.0"},"canonical_sha256":"37b6048c7de288331029db8fe099bdd3b265bd0cb28412dc8251cf97c24cc891","source":{"kind":"arxiv","id":"1104.0426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0426","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0426v1","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0426","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"G63AJDD54KED","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"G63AJDD54KEDGEBJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"G63AJDD5","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:G63AJDD54KEDGEBJ3OH6BGN52O","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-03T20:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"16d9e2899158775fa9b1e619e9280c0a63a76874fb10ac7de8e72d036d2bc8bf","abstract_canon_sha256":"c994d58d1942a8417c452fce7c73320c3fafe6be893d8406b0556ce779a305f9"},"schema_version":"1.0"},"canonical_sha256":"37b6048c7de288331029db8fe099bdd3b265bd0cb28412dc8251cf97c24cc891","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:04.044094Z","signature_b64":"uaovQ+PUcRKU25U4dIvSXPR9hLOJf0FuDlvSj2ELxIwY0TcPX6/QIvArFfkIZ0X+3oZWDkp+t267K52U6JiLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b6048c7de288331029db8fe099bdd3b265bd0cb28412dc8251cf97c24cc891","last_reissued_at":"2026-05-18T04:25:04.043691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:04.043691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0426","source_version":1,"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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTIMFpHzL4QjACrT+dHxknCKD1klVBXW7Ed26jgs2SBeEgoK1ngdoULy/MEdFDU34P5B1npziAy9DyO7+R6GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:03:52.387491Z"},"content_sha256":"27402bfc61dd83b9289c356b56ce079ea0a36c3441ca28936545cfd7ee4ebedf","schema_version":"1.0","event_id":"sha256:27402bfc61dd83b9289c356b56ce079ea0a36c3441ca28936545cfd7ee4ebedf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:G63AJDD54KEDGEBJ3OH6BGN52O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Randic index and the diameter of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Yiting Yang","submitted_at":"2011-04-03T20:29:31Z","abstract_excerpt":"The {\\it Randi\\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is connected. Aouchiche-Hansen-Zheng conjectured that among all connected graphs $G$ on $n$ vertices the path $P_n$ achieves the minimum values for both $R(G)/D(G)$ and $R(G)- D(G)$. We prove this conjecture completely. In fact, we prove a stronger theorem: If $G$ is a connected graph, then $R(G)-(1/2)D(G)\\geq \\sqrt{2}-1$, with equality if and only if $G$ is a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0426","kind":"arxiv","version":1},"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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pe27gyQ8aapYAjEA00P6qnmrOTzzD+9C5hDCm8WwtnHCUNeiZ/ppJS2xMwWqk6CokNqK/bcCDzs3NmH2JzAQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:03:52.387856Z"},"content_sha256":"1d9c1cd7bd1f27041d48eeedb8f624318726c9c7bc6819436501c32c43118b7e","schema_version":"1.0","event_id":"sha256:1d9c1cd7bd1f27041d48eeedb8f624318726c9c7bc6819436501c32c43118b7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G63AJDD54KEDGEBJ3OH6BGN52O/bundle.json","state_url":"https://pith.science/pith/G63AJDD54KEDGEBJ3OH6BGN52O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G63AJDD54KEDGEBJ3OH6BGN52O/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-28T17:03:52Z","links":{"resolver":"https://pith.science/pith/G63AJDD54KEDGEBJ3OH6BGN52O","bundle":"https://pith.science/pith/G63AJDD54KEDGEBJ3OH6BGN52O/bundle.json","state":"https://pith.science/pith/G63AJDD54KEDGEBJ3OH6BGN52O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G63AJDD54KEDGEBJ3OH6BGN52O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:G63AJDD54KEDGEBJ3OH6BGN52O","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":"c994d58d1942a8417c452fce7c73320c3fafe6be893d8406b0556ce779a305f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-03T20:29:31Z","title_canon_sha256":"16d9e2899158775fa9b1e619e9280c0a63a76874fb10ac7de8e72d036d2bc8bf"},"schema_version":"1.0","source":{"id":"1104.0426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0426","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0426v1","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0426","created_at":"2026-05-18T04:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"G63AJDD54KED","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"G63AJDD54KEDGEBJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"G63AJDD5","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:1d9c1cd7bd1f27041d48eeedb8f624318726c9c7bc6819436501c32c43118b7e","target":"graph","created_at":"2026-05-18T04:25:04Z","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 {\\it Randi\\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is connected. Aouchiche-Hansen-Zheng conjectured that among all connected graphs $G$ on $n$ vertices the path $P_n$ achieves the minimum values for both $R(G)/D(G)$ and $R(G)- D(G)$. We prove this conjecture completely. In fact, we prove a stronger theorem: If $G$ is a connected graph, then $R(G)-(1/2)D(G)\\geq \\sqrt{2}-1$, with equality if and only if $G$ is a p","authors_text":"Linyuan Lu, Yiting Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-03T20:29:31Z","title":"The Randic index and the diameter of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0426","kind":"arxiv","version":1},"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:27402bfc61dd83b9289c356b56ce079ea0a36c3441ca28936545cfd7ee4ebedf","target":"record","created_at":"2026-05-18T04:25:04Z","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":"c994d58d1942a8417c452fce7c73320c3fafe6be893d8406b0556ce779a305f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-03T20:29:31Z","title_canon_sha256":"16d9e2899158775fa9b1e619e9280c0a63a76874fb10ac7de8e72d036d2bc8bf"},"schema_version":"1.0","source":{"id":"1104.0426","kind":"arxiv","version":1}},"canonical_sha256":"37b6048c7de288331029db8fe099bdd3b265bd0cb28412dc8251cf97c24cc891","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37b6048c7de288331029db8fe099bdd3b265bd0cb28412dc8251cf97c24cc891","first_computed_at":"2026-05-18T04:25:04.043691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:04.043691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uaovQ+PUcRKU25U4dIvSXPR9hLOJf0FuDlvSj2ELxIwY0TcPX6/QIvArFfkIZ0X+3oZWDkp+t267K52U6JiLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:04.044094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27402bfc61dd83b9289c356b56ce079ea0a36c3441ca28936545cfd7ee4ebedf","sha256:1d9c1cd7bd1f27041d48eeedb8f624318726c9c7bc6819436501c32c43118b7e"],"state_sha256":"c62b316ed0cd5a42824a48c9bd63d3288f880156048f959254f54ddd97b4536b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueSNpjGZUjNPclE3pnt6LymPHfYiiKrZZjUdmmSIPbEQdvPSOnpPAPRw6vJvK2Qb1/SUcfnsgANV8Ha2qA3cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:03:52.389766Z","bundle_sha256":"54ca03523688cc96f162b7845c646438229c1c6aa7c2cdb1a76724c5de32f67b"}}