{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2X7KNAILJYES6OHSOIQYTNBTPJ","short_pith_number":"pith:2X7KNAIL","schema_version":"1.0","canonical_sha256":"d5fea6810b4e092f38f2722189b4337a7b8a64dec9b6ac7fe3909994f75418e8","source":{"kind":"arxiv","id":"1204.3313","version":1},"attestation_state":"computed","paper":{"title":"Note on the harmonic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ilic","submitted_at":"2012-04-15T19:18:03Z","abstract_excerpt":"The harmonic index of a graph $G$ is defined as the sum of weights $\\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The harmonic index on graphs, Appl. Math. Lett. 25 (2012), 561--566] and establish some upper and lower bounds on the harmonic index of $G$."},"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":"1204.3313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-15T19:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"c9ada87199a1587d89bb6e5dac099592e9b0009d112033cb09609eee1949e2f7","abstract_canon_sha256":"b1fa377160d445fbe05a86d15b7f15284c83f8562d98c8f9aa8d46d1a4613585"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:51.867507Z","signature_b64":"cDgad0A8JNFAfaUtlcySuojoiASfhdlbO7omyYAN4DX2mJaozShlmM0pohyhmBEnf3D4mVVmxvrtvTJNsgJDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5fea6810b4e092f38f2722189b4337a7b8a64dec9b6ac7fe3909994f75418e8","last_reissued_at":"2026-05-18T03:57:51.866872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:51.866872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on the harmonic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ilic","submitted_at":"2012-04-15T19:18:03Z","abstract_excerpt":"The harmonic index of a graph $G$ is defined as the sum of weights $\\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The harmonic index on graphs, Appl. Math. Lett. 25 (2012), 561--566] and establish some upper and lower bounds on the harmonic index of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3313","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":"1204.3313","created_at":"2026-05-18T03:57:51.866961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3313v1","created_at":"2026-05-18T03:57:51.866961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3313","created_at":"2026-05-18T03:57:51.866961+00:00"},{"alias_kind":"pith_short_12","alias_value":"2X7KNAILJYES","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2X7KNAILJYES6OHS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2X7KNAIL","created_at":"2026-05-18T12:26:50.516681+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/2X7KNAILJYES6OHSOIQYTNBTPJ","json":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ.json","graph_json":"https://pith.science/api/pith-number/2X7KNAILJYES6OHSOIQYTNBTPJ/graph.json","events_json":"https://pith.science/api/pith-number/2X7KNAILJYES6OHSOIQYTNBTPJ/events.json","paper":"https://pith.science/paper/2X7KNAIL"},"agent_actions":{"view_html":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ","download_json":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ.json","view_paper":"https://pith.science/paper/2X7KNAIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3313&json=true","fetch_graph":"https://pith.science/api/pith-number/2X7KNAILJYES6OHSOIQYTNBTPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2X7KNAILJYES6OHSOIQYTNBTPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ/action/storage_attestation","attest_author":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ/action/author_attestation","sign_citation":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ/action/citation_signature","submit_replication":"https://pith.science/pith/2X7KNAILJYES6OHSOIQYTNBTPJ/action/replication_record"}},"created_at":"2026-05-18T03:57:51.866961+00:00","updated_at":"2026-05-18T03:57:51.866961+00:00"}