{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CRGO6WDICLWF7U7XKBFM2H5SQZ","short_pith_number":"pith:CRGO6WDI","canonical_record":{"source":{"id":"1210.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-09T09:53:38Z","cross_cats_sorted":[],"title_canon_sha256":"7696b52edc09bd8cd705eb594fa98665dc84eaff005e0b15961abae0683860fa","abstract_canon_sha256":"4b0d998adc65aa84ab6d332d00980040ae74bcbaa6963a413aceb7dc2de849e1"},"schema_version":"1.0"},"canonical_sha256":"144cef586812ec5fd3f7504acd1fb2867a39a361ab15063da88d24b2ed28da94","source":{"kind":"arxiv","id":"1210.2543","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2543","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2543v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2543","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"CRGO6WDICLWF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CRGO6WDICLWF7U7X","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CRGO6WDI","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CRGO6WDICLWF7U7XKBFM2H5SQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-09T09:53:38Z","cross_cats_sorted":[],"title_canon_sha256":"7696b52edc09bd8cd705eb594fa98665dc84eaff005e0b15961abae0683860fa","abstract_canon_sha256":"4b0d998adc65aa84ab6d332d00980040ae74bcbaa6963a413aceb7dc2de849e1"},"schema_version":"1.0"},"canonical_sha256":"144cef586812ec5fd3f7504acd1fb2867a39a361ab15063da88d24b2ed28da94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:41.247685Z","signature_b64":"rYVyCVOJ56Oji0wJiU20wAHdn2N4Ic8DOmjRzqeZ/DLsxDu3x4WgOtqKWpFEZOGrrIXDbzNLd0fUVKR9HxxbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"144cef586812ec5fd3f7504acd1fb2867a39a361ab15063da88d24b2ed28da94","last_reissued_at":"2026-05-18T03:43:41.247098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:41.247098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2543","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-18T03:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7s5Urlr+yKzGkX7vrYwonCwAMTNCjmnTukaE96Ni87wnT0W3zUJhazJ8dqZQ610G8tqf3ZMhU/DEOPds7++Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:35.854849Z"},"content_sha256":"f86fc02401ac1675f165e170e6309b539f49a415231e6c3d66cfa4522d5505ab","schema_version":"1.0","event_id":"sha256:f86fc02401ac1675f165e170e6309b539f49a415231e6c3d66cfa4522d5505ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CRGO6WDICLWF7U7XKBFM2H5SQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Conjecture of Randi\\'{c} Index and Graph Radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanyuan Deng, Jie Zhang, Zikai Tang","submitted_at":"2012-10-09T09:53:38Z","abstract_excerpt":"The Randi\\'{c} index $R(G)$ of a graph $G$ is defined as the sum of $(d_i d_j)^{-1/2}$ over all edges $v_i v_j$ of $G$, where $d_i$ is the degree of the vertex $v_i$ in $G$. The radius $r(G)$ of a graph $G$ is the minimum graph eccentricity of any graph vertex in $G$. Fajtlowicz(1988) conjectures $R(G) \\ge r(G)-1$ for all connected graph $G$. A stronger version, $R(G) \\ge r(G)$, is conjectured by Caporossi and Hansen(2000) for all connected graphs except even paths. In this paper, we make use of Harmonic index $H(G)$, which is defined as the sum of $\\frac{2}{d_i+d_j}$ over all edges $v_i v_j$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2543","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-18T03:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIX79RqgtbLuSM3Y+f00UGGfFpnFsioYGyXGwqJm9Snsj1HH2ijrdAi8nqSWCyN2OQUN/oiOigKOmYdiaK4sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:35.855525Z"},"content_sha256":"0223fde954607156cbae412aba0d2ffd1045f6d20168ae88c2c86c37fb31b1ff","schema_version":"1.0","event_id":"sha256:0223fde954607156cbae412aba0d2ffd1045f6d20168ae88c2c86c37fb31b1ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/bundle.json","state_url":"https://pith.science/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/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-05-28T23:39:35Z","links":{"resolver":"https://pith.science/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ","bundle":"https://pith.science/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/bundle.json","state":"https://pith.science/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRGO6WDICLWF7U7XKBFM2H5SQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CRGO6WDICLWF7U7XKBFM2H5SQZ","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":"4b0d998adc65aa84ab6d332d00980040ae74bcbaa6963a413aceb7dc2de849e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-09T09:53:38Z","title_canon_sha256":"7696b52edc09bd8cd705eb594fa98665dc84eaff005e0b15961abae0683860fa"},"schema_version":"1.0","source":{"id":"1210.2543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2543","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2543v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2543","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"CRGO6WDICLWF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CRGO6WDICLWF7U7X","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CRGO6WDI","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:0223fde954607156cbae412aba0d2ffd1045f6d20168ae88c2c86c37fb31b1ff","target":"graph","created_at":"2026-05-18T03:43:41Z","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 Randi\\'{c} index $R(G)$ of a graph $G$ is defined as the sum of $(d_i d_j)^{-1/2}$ over all edges $v_i v_j$ of $G$, where $d_i$ is the degree of the vertex $v_i$ in $G$. The radius $r(G)$ of a graph $G$ is the minimum graph eccentricity of any graph vertex in $G$. Fajtlowicz(1988) conjectures $R(G) \\ge r(G)-1$ for all connected graph $G$. A stronger version, $R(G) \\ge r(G)$, is conjectured by Caporossi and Hansen(2000) for all connected graphs except even paths. In this paper, we make use of Harmonic index $H(G)$, which is defined as the sum of $\\frac{2}{d_i+d_j}$ over all edges $v_i v_j$ ","authors_text":"Hanyuan Deng, Jie Zhang, Zikai Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-09T09:53:38Z","title":"On a Conjecture of Randi\\'{c} Index and Graph Radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2543","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:f86fc02401ac1675f165e170e6309b539f49a415231e6c3d66cfa4522d5505ab","target":"record","created_at":"2026-05-18T03:43:41Z","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":"4b0d998adc65aa84ab6d332d00980040ae74bcbaa6963a413aceb7dc2de849e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-09T09:53:38Z","title_canon_sha256":"7696b52edc09bd8cd705eb594fa98665dc84eaff005e0b15961abae0683860fa"},"schema_version":"1.0","source":{"id":"1210.2543","kind":"arxiv","version":1}},"canonical_sha256":"144cef586812ec5fd3f7504acd1fb2867a39a361ab15063da88d24b2ed28da94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"144cef586812ec5fd3f7504acd1fb2867a39a361ab15063da88d24b2ed28da94","first_computed_at":"2026-05-18T03:43:41.247098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:41.247098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rYVyCVOJ56Oji0wJiU20wAHdn2N4Ic8DOmjRzqeZ/DLsxDu3x4WgOtqKWpFEZOGrrIXDbzNLd0fUVKR9HxxbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:41.247685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86fc02401ac1675f165e170e6309b539f49a415231e6c3d66cfa4522d5505ab","sha256:0223fde954607156cbae412aba0d2ffd1045f6d20168ae88c2c86c37fb31b1ff"],"state_sha256":"6243014f3f07a156f89b6ae3ec3b71ec2d65594820c7d67f11ddd7be1103a9b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sayCETw/nsDDRTSVx/7h4IY2Y5VWoe+kASTS5QqCix28/gUcr+D5l7v7pmDdsh70vF7lAwOlqYvK8a3S/xsLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:39:35.858958Z","bundle_sha256":"ffafd7786606a2e7e8863da684c61649133d4c5aa19de687a308959bf71c6476"}}