{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HGB4PAU2WJOYAV5PUCLLNOWWAV","short_pith_number":"pith:HGB4PAU2","schema_version":"1.0","canonical_sha256":"3983c7829ab25d8057afa096b6bad6055329ca2bece89917088557b05146ea5a","source":{"kind":"arxiv","id":"1104.3206","version":1},"attestation_state":"computed","paper":{"title":"Eccentric Connectivity Index of Chemical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ili\\' c, Ivan Gutman","submitted_at":"2011-04-16T07:59:36Z","abstract_excerpt":"The eccentric connectivity index $\\xi^c$ is a distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. We prove that the broom has maximum $\\xi^c$ among trees with a fixed maximum vertex degree, and characterize such trees with minimum $\\xi^c$\\,. In addition, we propose a simple linear algorithm for calculating $\\xi^c$ of trees."},"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.3206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-16T07:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"5daed272ee84957f44343fbd3b81e9cb6ae1fbdab9a184ceb859c8bfcfabbd44","abstract_canon_sha256":"9af2656c68af6852f3cdca59baa698f5382c5f848ee06397f125416935ca5d6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.596873Z","signature_b64":"H7OjrkGt1VL0nMplIteH2HYOfLWhsnKAJvPcjw0OIPbSZG0ed5Dmm6j0sQEOcZSHhR96BJjh8KVBmdPmbqlXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3983c7829ab25d8057afa096b6bad6055329ca2bece89917088557b05146ea5a","last_reissued_at":"2026-05-18T04:24:05.596117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.596117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eccentric Connectivity Index of Chemical Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ili\\' c, Ivan Gutman","submitted_at":"2011-04-16T07:59:36Z","abstract_excerpt":"The eccentric connectivity index $\\xi^c$ is a distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. We prove that the broom has maximum $\\xi^c$ among trees with a fixed maximum vertex degree, and characterize such trees with minimum $\\xi^c$\\,. In addition, we propose a simple linear algorithm for calculating $\\xi^c$ of trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3206","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":"1104.3206","created_at":"2026-05-18T04:24:05.596255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3206v1","created_at":"2026-05-18T04:24:05.596255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3206","created_at":"2026-05-18T04:24:05.596255+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGB4PAU2WJOY","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGB4PAU2WJOYAV5P","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGB4PAU2","created_at":"2026-05-18T12:26:30.835961+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/HGB4PAU2WJOYAV5PUCLLNOWWAV","json":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV.json","graph_json":"https://pith.science/api/pith-number/HGB4PAU2WJOYAV5PUCLLNOWWAV/graph.json","events_json":"https://pith.science/api/pith-number/HGB4PAU2WJOYAV5PUCLLNOWWAV/events.json","paper":"https://pith.science/paper/HGB4PAU2"},"agent_actions":{"view_html":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV","download_json":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV.json","view_paper":"https://pith.science/paper/HGB4PAU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3206&json=true","fetch_graph":"https://pith.science/api/pith-number/HGB4PAU2WJOYAV5PUCLLNOWWAV/graph.json","fetch_events":"https://pith.science/api/pith-number/HGB4PAU2WJOYAV5PUCLLNOWWAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV/action/storage_attestation","attest_author":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV/action/author_attestation","sign_citation":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV/action/citation_signature","submit_replication":"https://pith.science/pith/HGB4PAU2WJOYAV5PUCLLNOWWAV/action/replication_record"}},"created_at":"2026-05-18T04:24:05.596255+00:00","updated_at":"2026-05-18T04:24:05.596255+00:00"}