{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JHZQEUH3MSYLB3UOXL56QXKLGS","short_pith_number":"pith:JHZQEUH3","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"},"canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","source":{"kind":"arxiv","id":"1104.0920","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0920","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0920v3","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0920","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"JHZQEUH3MSYL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHZQEUH3MSYLB3UO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHZQEUH3","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JHZQEUH3MSYLB3UOXL56QXKLGS","target":"record","payload":{"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"},"canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","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"},"source_kind":"arxiv","source_id":"1104.0920","source_version":3,"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-18T04:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y88Rer+qe8eBq84esbTOwswywiIqucHs69TLzuTbJOAFOTORKiRjV+LLo3t4L1XyAOpxn1da3dYiV1hHlLoDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:12.413122Z"},"content_sha256":"6a1f9f55bab7171b935face20f02d179315e0ec6b587ad2f9c0b7cc679384862","schema_version":"1.0","event_id":"sha256:6a1f9f55bab7171b935face20f02d179315e0ec6b587ad2f9c0b7cc679384862"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JHZQEUH3MSYLB3UOXL56QXKLGS","target":"graph","payload":{"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"},"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-18T04:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jkT6QuH7CNeUXbMAiGeZWtOOpoU2yNHcBmBCG098NdOW06u/1IibYHpr4L6DXwA4dJhUe2vAV0bVbWxkFEKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:51:12.413549Z"},"content_sha256":"5d1fd9a1fd30ceabb24d4cc3f6c19469be02e785ccf03aebd508512bf8dae35b","schema_version":"1.0","event_id":"sha256:5d1fd9a1fd30ceabb24d4cc3f6c19469be02e785ccf03aebd508512bf8dae35b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/bundle.json","state_url":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/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-31T05:51:12Z","links":{"resolver":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS","bundle":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/bundle.json","state":"https://pith.science/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHZQEUH3MSYLB3UOXL56QXKLGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JHZQEUH3MSYLB3UOXL56QXKLGS","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":"43dbaaab2d5eaf6f96adc232be5bf021beb657c09fe7390fa15eab81c05000dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-05T19:43:04Z","title_canon_sha256":"1fb1519acf1702d60c41845aac64c0482cd5739f85bcb72c463de03132642360"},"schema_version":"1.0","source":{"id":"1104.0920","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0920","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0920v3","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0920","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"JHZQEUH3MSYL","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHZQEUH3MSYLB3UO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHZQEUH3","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:5d1fd9a1fd30ceabb24d4cc3f6c19469be02e785ccf03aebd508512bf8dae35b","target":"graph","created_at":"2026-05-18T04:21:29Z","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 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","authors_text":"Aleksandar Ili\\' c, Guihai Yu, Lihua Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-05T19:43:04Z","title":"The Harary index of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0920","kind":"arxiv","version":3},"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:6a1f9f55bab7171b935face20f02d179315e0ec6b587ad2f9c0b7cc679384862","target":"record","created_at":"2026-05-18T04:21:29Z","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":"43dbaaab2d5eaf6f96adc232be5bf021beb657c09fe7390fa15eab81c05000dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-05T19:43:04Z","title_canon_sha256":"1fb1519acf1702d60c41845aac64c0482cd5739f85bcb72c463de03132642360"},"schema_version":"1.0","source":{"id":"1104.0920","kind":"arxiv","version":3}},"canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49f30250fb64b0b0ee8ebafbe85d4b34b38a13867b7ca6fb10ba445b414954ce","first_computed_at":"2026-05-18T04:21:29.724744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:29.724744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6MI5FkTB2foYA+BbuTnVpcTldJKLw4TKpNKwprq3ds2qBooPGa0wgz6tEPxfKCT+3jNF0wopfdCnHG9+K+LfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:29.725076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0920","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a1f9f55bab7171b935face20f02d179315e0ec6b587ad2f9c0b7cc679384862","sha256:5d1fd9a1fd30ceabb24d4cc3f6c19469be02e785ccf03aebd508512bf8dae35b"],"state_sha256":"16c908d3c1d140c246755754b3a66a8424afdd2e713d41d240acec1bfd368de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pba6l/q5KqHK2vsVaiyuTO0ZvlvKHdvlyfq2VUboJ5by7rW2bfCzyC9OqFC1XtksldMJtxGUO5mpqXSCJD6uBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:51:12.416410Z","bundle_sha256":"fdd07ccc9c367183af1e1425aca2d7d86d6e829c1460b72e1cac2bfc1c2652e8"}}