{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZXV2ZXHYXSMSNT73TZF7ARPAPB","short_pith_number":"pith:ZXV2ZXHY","schema_version":"1.0","canonical_sha256":"cdebacdcf8bc9926cffb9e4bf045e07871e91469f6750b0890cf2a9c283b56fe","source":{"kind":"arxiv","id":"1702.04608","version":2},"attestation_state":"computed","paper":{"title":"On the connective eccentricity index of two types of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanyuan Deng, Lingyao Jiang, Zikai Tang","submitted_at":"2017-02-15T13:54:31Z","abstract_excerpt":"The connective eccentricity index $\\xi^{ce}=\\sum^{}_{u\\in V}\\frac{d(u)}{\\varepsilon(u)}$, where\n  $\\varepsilon(u)$ and $d(u)$ denote the eccentricity and the degree of the vertex $u$, respectively. In this paper, we first determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given degree sequence, and then determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given number of branching vertices."},"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":"1702.04608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-15T13:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"ff355dffa2e39b26f4e3732a67e4bd4ccc5bc859bb2ec52561f3d48d8743d63a","abstract_canon_sha256":"5f8dcfd579d2be20309c18234e5e46589a00ea3a2213041a6f4c73bc8e526216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.931799Z","signature_b64":"O/A/uu3eKgfznKnvatrHcsMKAGE6RgdtxpLKSp+5rX5WpFIjRm+GuJH+4Hc/x9TEiQR2uvpOxLNO219qE386DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdebacdcf8bc9926cffb9e4bf045e07871e91469f6750b0890cf2a9c283b56fe","last_reissued_at":"2026-05-18T00:50:34.931153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.931153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the connective eccentricity index of two types of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hanyuan Deng, Lingyao Jiang, Zikai Tang","submitted_at":"2017-02-15T13:54:31Z","abstract_excerpt":"The connective eccentricity index $\\xi^{ce}=\\sum^{}_{u\\in V}\\frac{d(u)}{\\varepsilon(u)}$, where\n  $\\varepsilon(u)$ and $d(u)$ denote the eccentricity and the degree of the vertex $u$, respectively. In this paper, we first determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given degree sequence, and then determine the extremal trees which minimize and maximize the connective eccentricity index among all trees with a given number of branching vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04608","kind":"arxiv","version":2},"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":"1702.04608","created_at":"2026-05-18T00:50:34.931261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04608v2","created_at":"2026-05-18T00:50:34.931261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04608","created_at":"2026-05-18T00:50:34.931261+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXV2ZXHYXSMS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXV2ZXHYXSMSNT73","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXV2ZXHY","created_at":"2026-05-18T12:31:59.375834+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/ZXV2ZXHYXSMSNT73TZF7ARPAPB","json":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB.json","graph_json":"https://pith.science/api/pith-number/ZXV2ZXHYXSMSNT73TZF7ARPAPB/graph.json","events_json":"https://pith.science/api/pith-number/ZXV2ZXHYXSMSNT73TZF7ARPAPB/events.json","paper":"https://pith.science/paper/ZXV2ZXHY"},"agent_actions":{"view_html":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB","download_json":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB.json","view_paper":"https://pith.science/paper/ZXV2ZXHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04608&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXV2ZXHYXSMSNT73TZF7ARPAPB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXV2ZXHYXSMSNT73TZF7ARPAPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB/action/storage_attestation","attest_author":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB/action/author_attestation","sign_citation":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB/action/citation_signature","submit_replication":"https://pith.science/pith/ZXV2ZXHYXSMSNT73TZF7ARPAPB/action/replication_record"}},"created_at":"2026-05-18T00:50:34.931261+00:00","updated_at":"2026-05-18T00:50:34.931261+00:00"}