{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZEVS6U6WWCXMK4HOG46W7Q3TRG","short_pith_number":"pith:ZEVS6U6W","schema_version":"1.0","canonical_sha256":"c92b2f53d6b0aec570ee373d6fc37389a57755205b252dfa910a7ea5c8d04784","source":{"kind":"arxiv","id":"1907.10996","version":1},"attestation_state":"computed","paper":{"title":"First and Second Maximum of Randi\\'{c} Index Among all $k-$Cyclic Graphs of a Given Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Ghalavand, Ali Reza Ashrafi, Marzieh Pourbabaee","submitted_at":"2019-07-25T12:10:26Z","abstract_excerpt":"Suppose $G$ is a simple graph with edge set $E(G)$. The Randi\\'{c} index $R(G)$ is defined as $R(G)=\\sum_{uv\\in E(G)}\\frac{1}{\\sqrt{deg_{G}(u)deg_{G}(v)}}$, where $deg_G(u)$ denotes the vertex degree of $u$ in $G$. In this paper, the first and second maximum of Randi\\'{c} index among all $n-$vertex $k-$cyclic graphs were computed."},"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":"1907.10996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-25T12:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"6bebafdc7df4927fbf550c955f2b00559e96c58acc0bd450ee0e71c316c7dbdc","abstract_canon_sha256":"ff8f39e1e3d1d25c23ca0755f90288451747d343ccacb0561186c50b50f34d87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:33.790934Z","signature_b64":"1sXg4SLvzc9rfjwpOaqrXnKCb6sr3Qc9VexWckcO+rDD3FpzmRSf5B3JLpZrxQ+zrHSb9VLpAOmXGJXKWBJEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c92b2f53d6b0aec570ee373d6fc37389a57755205b252dfa910a7ea5c8d04784","last_reissued_at":"2026-05-17T23:39:33.790261Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:33.790261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First and Second Maximum of Randi\\'{c} Index Among all $k-$Cyclic Graphs of a Given Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Ghalavand, Ali Reza Ashrafi, Marzieh Pourbabaee","submitted_at":"2019-07-25T12:10:26Z","abstract_excerpt":"Suppose $G$ is a simple graph with edge set $E(G)$. The Randi\\'{c} index $R(G)$ is defined as $R(G)=\\sum_{uv\\in E(G)}\\frac{1}{\\sqrt{deg_{G}(u)deg_{G}(v)}}$, where $deg_G(u)$ denotes the vertex degree of $u$ in $G$. In this paper, the first and second maximum of Randi\\'{c} index among all $n-$vertex $k-$cyclic graphs were computed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10996","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.10996","created_at":"2026-05-17T23:39:33.790367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10996v1","created_at":"2026-05-17T23:39:33.790367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10996","created_at":"2026-05-17T23:39:33.790367+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEVS6U6WWCXM","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEVS6U6WWCXMK4HO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEVS6U6W","created_at":"2026-05-18T12:33:33.725879+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/ZEVS6U6WWCXMK4HOG46W7Q3TRG","json":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG.json","graph_json":"https://pith.science/api/pith-number/ZEVS6U6WWCXMK4HOG46W7Q3TRG/graph.json","events_json":"https://pith.science/api/pith-number/ZEVS6U6WWCXMK4HOG46W7Q3TRG/events.json","paper":"https://pith.science/paper/ZEVS6U6W"},"agent_actions":{"view_html":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG","download_json":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG.json","view_paper":"https://pith.science/paper/ZEVS6U6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10996&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEVS6U6WWCXMK4HOG46W7Q3TRG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEVS6U6WWCXMK4HOG46W7Q3TRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG/action/storage_attestation","attest_author":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG/action/author_attestation","sign_citation":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG/action/citation_signature","submit_replication":"https://pith.science/pith/ZEVS6U6WWCXMK4HOG46W7Q3TRG/action/replication_record"}},"created_at":"2026-05-17T23:39:33.790367+00:00","updated_at":"2026-05-17T23:39:33.790367+00:00"}