{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KBV2SPXIRIHXYYJIJ4VPG4GE7O","short_pith_number":"pith:KBV2SPXI","canonical_record":{"source":{"id":"1705.05963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T00:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"d66b47b7ae7055ca04b6212f54365ac5c7b13b7863585995667cf53925fbd479","abstract_canon_sha256":"3d62a26ddb879f6bbc196d976205f2db6ec6224c2fd6f46c86870cbd533cf945"},"schema_version":"1.0"},"canonical_sha256":"506ba93ee88a0f7c61284f2af370c4fbaf6f0ce0debccbb354e30b5c8854fadc","source":{"kind":"arxiv","id":"1705.05963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05963","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05963v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05963","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"KBV2SPXIRIHX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KBV2SPXIRIHXYYJI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KBV2SPXI","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KBV2SPXIRIHXYYJIJ4VPG4GE7O","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T00:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"d66b47b7ae7055ca04b6212f54365ac5c7b13b7863585995667cf53925fbd479","abstract_canon_sha256":"3d62a26ddb879f6bbc196d976205f2db6ec6224c2fd6f46c86870cbd533cf945"},"schema_version":"1.0"},"canonical_sha256":"506ba93ee88a0f7c61284f2af370c4fbaf6f0ce0debccbb354e30b5c8854fadc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.329513Z","signature_b64":"KHoqQn04Fy9AV9lWJwHwhzi0y0i6tqhHP4lzPIQL9TvAq5gT6xb3eHl5kRo/e2IoKqDbYGMR1xZIC3zcDPz/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506ba93ee88a0f7c61284f2af370c4fbaf6f0ce0debccbb354e30b5c8854fadc","last_reissued_at":"2026-05-18T00:44:19.329016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.329016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05963","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-18T00:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzyMwoBOArghPYcXd2b7UgQF8WjTawMeOgAGGa37NlhKgCEt8+Xya20hKzD0Jfe4LpUKzhZFYtyIdu0l31ufAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:42:19.414826Z"},"content_sha256":"b393a0d3fb4b4a4a9e71c079773257b6575d80da7df3195f0dd23df4969c4e5f","schema_version":"1.0","event_id":"sha256:b393a0d3fb4b4a4a9e71c079773257b6575d80da7df3195f0dd23df4969c4e5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KBV2SPXIRIHXYYJIJ4VPG4GE7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp bounds for the Randic index of graphs with given minimum and maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Suil O, Yongtang Shi","submitted_at":"2017-05-17T00:50:24Z","abstract_excerpt":"The Randi{\\' c} index of a graph $G$, written $R(G)$, is the sum of $\\frac 1{\\sqrt{d(u)d(v)}}$ over all edges $uv$ in $E(G)$. %let $R(G)=\\sum_{uv \\in E(G)} \\frac 1{\\sqrt{d(u)d(v)}}$, which is called the Randi{\\' c} index of it. Let $d$ and $D$ be positive integers $d < D$. In this paper, we prove that if $G$ is a graph with minimum degree $d$ and maximum degree $D$, then $R(G) \\ge \\frac{\\sqrt{dD}}{d+D}n$; equality holds only when $G$ is an $n$-vertex $(d,D)$-biregular. Furthermore, we show that if $G$ is an $n$-vertex connected graph with minimum degree $d$ and maximum degree $D$, then $R(G) \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05963","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-18T00:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xukn479X/p9TnnHET3tUwoXD9VnxGTRHfHWU+lYR3o+AqOwHDael7uxPs2Tj2iWf5XgYW/5XD2ru6PhA7rSGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:42:19.415530Z"},"content_sha256":"31c39460816879ef466b7df4b5a2a54143f427d078299f8c427682b81b71589d","schema_version":"1.0","event_id":"sha256:31c39460816879ef466b7df4b5a2a54143f427d078299f8c427682b81b71589d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/bundle.json","state_url":"https://pith.science/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/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-25T19:42:19Z","links":{"resolver":"https://pith.science/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O","bundle":"https://pith.science/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/bundle.json","state":"https://pith.science/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBV2SPXIRIHXYYJIJ4VPG4GE7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KBV2SPXIRIHXYYJIJ4VPG4GE7O","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":"3d62a26ddb879f6bbc196d976205f2db6ec6224c2fd6f46c86870cbd533cf945","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T00:50:24Z","title_canon_sha256":"d66b47b7ae7055ca04b6212f54365ac5c7b13b7863585995667cf53925fbd479"},"schema_version":"1.0","source":{"id":"1705.05963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05963","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05963v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05963","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"KBV2SPXIRIHX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KBV2SPXIRIHXYYJI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KBV2SPXI","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:31c39460816879ef466b7df4b5a2a54143f427d078299f8c427682b81b71589d","target":"graph","created_at":"2026-05-18T00:44:19Z","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 of a graph $G$, written $R(G)$, is the sum of $\\frac 1{\\sqrt{d(u)d(v)}}$ over all edges $uv$ in $E(G)$. %let $R(G)=\\sum_{uv \\in E(G)} \\frac 1{\\sqrt{d(u)d(v)}}$, which is called the Randi{\\' c} index of it. Let $d$ and $D$ be positive integers $d < D$. In this paper, we prove that if $G$ is a graph with minimum degree $d$ and maximum degree $D$, then $R(G) \\ge \\frac{\\sqrt{dD}}{d+D}n$; equality holds only when $G$ is an $n$-vertex $(d,D)$-biregular. Furthermore, we show that if $G$ is an $n$-vertex connected graph with minimum degree $d$ and maximum degree $D$, then $R(G) \\","authors_text":"Suil O, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T00:50:24Z","title":"Sharp bounds for the Randic index of graphs with given minimum and maximum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05963","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:b393a0d3fb4b4a4a9e71c079773257b6575d80da7df3195f0dd23df4969c4e5f","target":"record","created_at":"2026-05-18T00:44:19Z","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":"3d62a26ddb879f6bbc196d976205f2db6ec6224c2fd6f46c86870cbd533cf945","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T00:50:24Z","title_canon_sha256":"d66b47b7ae7055ca04b6212f54365ac5c7b13b7863585995667cf53925fbd479"},"schema_version":"1.0","source":{"id":"1705.05963","kind":"arxiv","version":1}},"canonical_sha256":"506ba93ee88a0f7c61284f2af370c4fbaf6f0ce0debccbb354e30b5c8854fadc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506ba93ee88a0f7c61284f2af370c4fbaf6f0ce0debccbb354e30b5c8854fadc","first_computed_at":"2026-05-18T00:44:19.329016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.329016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHoqQn04Fy9AV9lWJwHwhzi0y0i6tqhHP4lzPIQL9TvAq5gT6xb3eHl5kRo/e2IoKqDbYGMR1xZIC3zcDPz/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.329513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b393a0d3fb4b4a4a9e71c079773257b6575d80da7df3195f0dd23df4969c4e5f","sha256:31c39460816879ef466b7df4b5a2a54143f427d078299f8c427682b81b71589d"],"state_sha256":"2bbbf8abc264910d7dd2ee06cc244bd0c6e14450e14c2d977fe79fae053dc293"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsPJzzOCPBii7jyRjSiQupjmqECb+x6rCz/faz/dUos7nGfh4EL/EU5Fx4h8JdhaLzweiJwowkmj1VWkIDTpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:42:19.419353Z","bundle_sha256":"088b3bbc32e37dee6db0d1b9f780f7d86085d80069cfa3e75a3db11e4dc66c1f"}}