{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JHZQEUH3MSYLB3UOXL56QXKLGS","short_pith_number":"pith:JHZQEUH3","schema_version":"1.0","canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","source":{"kind":"arxiv","id":"1104.0920","version":3},"attestation_state":"computed","paper":{"title":"The Harary index of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ili\\' c, Guihai Yu, Lihua Feng","submitted_at":"2011-04-05T19:43:04Z","abstract_excerpt":"The Harary index of a graph $G$ is recently introduced topological index, defined on the reverse distance matrix as $H(G)=\\sum_{u,v \\in V(G)}\\frac{1}{d(u,v)}$, where $d(u,v)$ is the length of the shortest path between two distinct vertices $u$ and $v$. We present the partial ordering of starlike trees based on the Harary index and we describe the trees with the second maximal and the second minimal Harary index. In this paper, we investigate the Harary index of trees with $k$ pendent vertices and determine the extremal trees with maximal Harary index. We also characterize the extremal trees wi"},"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":"1104.0920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-05T19:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"1fb1519acf1702d60c41845aac64c0482cd5739f85bcb72c463de03132642360","abstract_canon_sha256":"43dbaaab2d5eaf6f96adc232be5bf021beb657c09fe7390fa15eab81c05000dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:29.725076Z","signature_b64":"6MI5FkTB2foYA+BbuTnVpcTldJKLw4TKpNKwprq3ds2qBooPGa0wgz6tEPxfKCT+3jNF0wopfdCnHG9+K+LfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","last_reissued_at":"2026-05-18T04:21:29.724744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:29.724744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Harary index of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ili\\' c, Guihai Yu, Lihua Feng","submitted_at":"2011-04-05T19:43:04Z","abstract_excerpt":"The Harary index of a graph $G$ is recently introduced topological index, defined on the reverse distance matrix as $H(G)=\\sum_{u,v \\in V(G)}\\frac{1}{d(u,v)}$, where $d(u,v)$ is the length of the shortest path between two distinct vertices $u$ and $v$. We present the partial ordering of starlike trees based on the Harary index and we describe the trees with the second maximal and the second minimal Harary index. In this paper, we investigate the Harary index of trees with $k$ pendent vertices and determine the extremal trees with maximal Harary index. We also characterize the extremal trees wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0920","kind":"arxiv","version":3},"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":"1104.0920","created_at":"2026-05-18T04:21:29.724798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0920v3","created_at":"2026-05-18T04:21:29.724798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0920","created_at":"2026-05-18T04:21:29.724798+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHZQEUH3MSYL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHZQEUH3MSYLB3UO","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHZQEUH3","created_at":"2026-05-18T12:26:32.869790+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/JHZQEUH3MSYLB3UOXL56QXKLGS","json":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS.json","graph_json":"https://pith.science/api/pith-number/JHZQEUH3MSYLB3UOXL56QXKLGS/graph.json","events_json":"https://pith.science/api/pith-number/JHZQEUH3MSYLB3UOXL56QXKLGS/events.json","paper":"https://pith.science/paper/JHZQEUH3"},"agent_actions":{"view_html":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS","download_json":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS.json","view_paper":"https://pith.science/paper/JHZQEUH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0920&json=true","fetch_graph":"https://pith.science/api/pith-number/JHZQEUH3MSYLB3UOXL56QXKLGS/graph.json","fetch_events":"https://pith.science/api/pith-number/JHZQEUH3MSYLB3UOXL56QXKLGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/action/storage_attestation","attest_author":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/action/author_attestation","sign_citation":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/action/citation_signature","submit_replication":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/action/replication_record"}},"created_at":"2026-05-18T04:21:29.724798+00:00","updated_at":"2026-05-18T04:21:29.724798+00:00"}