{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J62LVZTYFQGVMUGNXIZSTQWQME","short_pith_number":"pith:J62LVZTY","schema_version":"1.0","canonical_sha256":"4fb4bae6782c0d5650cdba3329c2d06121ab212a2d7ad201079e3035e97efdbc","source":{"kind":"arxiv","id":"1512.02127","version":1},"attestation_state":"computed","paper":{"title":"Extremal k-apex Trees for Randic Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ioan Tomescu, Muhammad Kamran Jamil, Naveed Akhter","submitted_at":"2015-12-07T17:16:20Z","abstract_excerpt":"The Randic (connectivity) index is one of the most successful molecular descriptors in structure-property and structure-activity relationships studies. J. Gao found the sharp upper bound for the Randic index of apex trees. In this paper, we proved that k-apex trees are not regular graphs for k\\ge2 and proposed a sharp upper bound for the Randic index of k-apex trees for k>1."},"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":"1512.02127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-07T17:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"7aaafe86cdbda64fcc99a0c608f4b35b1b637b40383b32cdd61785608dc3b211","abstract_canon_sha256":"2ca45220e6074a24d18984845358f0a04e1dc89ee54238c697701ede3d337cf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:09.539883Z","signature_b64":"oTBqRgJyPPsnTiCP+ZxQdvmd2g1yq+JdCJ9ymYGyEc9Kv8uVd3RN5xCG9S8xZugUtyVvU7YNBlTtQmQbtBEcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fb4bae6782c0d5650cdba3329c2d06121ab212a2d7ad201079e3035e97efdbc","last_reissued_at":"2026-05-18T01:25:09.539198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:09.539198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal k-apex Trees for Randic Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ioan Tomescu, Muhammad Kamran Jamil, Naveed Akhter","submitted_at":"2015-12-07T17:16:20Z","abstract_excerpt":"The Randic (connectivity) index is one of the most successful molecular descriptors in structure-property and structure-activity relationships studies. J. Gao found the sharp upper bound for the Randic index of apex trees. In this paper, we proved that k-apex trees are not regular graphs for k\\ge2 and proposed a sharp upper bound for the Randic index of k-apex trees for k>1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02127","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":"1512.02127","created_at":"2026-05-18T01:25:09.539327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02127v1","created_at":"2026-05-18T01:25:09.539327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02127","created_at":"2026-05-18T01:25:09.539327+00:00"},{"alias_kind":"pith_short_12","alias_value":"J62LVZTYFQGV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J62LVZTYFQGVMUGN","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J62LVZTY","created_at":"2026-05-18T12:29:27.538025+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/J62LVZTYFQGVMUGNXIZSTQWQME","json":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME.json","graph_json":"https://pith.science/api/pith-number/J62LVZTYFQGVMUGNXIZSTQWQME/graph.json","events_json":"https://pith.science/api/pith-number/J62LVZTYFQGVMUGNXIZSTQWQME/events.json","paper":"https://pith.science/paper/J62LVZTY"},"agent_actions":{"view_html":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME","download_json":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME.json","view_paper":"https://pith.science/paper/J62LVZTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02127&json=true","fetch_graph":"https://pith.science/api/pith-number/J62LVZTYFQGVMUGNXIZSTQWQME/graph.json","fetch_events":"https://pith.science/api/pith-number/J62LVZTYFQGVMUGNXIZSTQWQME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME/action/storage_attestation","attest_author":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME/action/author_attestation","sign_citation":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME/action/citation_signature","submit_replication":"https://pith.science/pith/J62LVZTYFQGVMUGNXIZSTQWQME/action/replication_record"}},"created_at":"2026-05-18T01:25:09.539327+00:00","updated_at":"2026-05-18T01:25:09.539327+00:00"}