{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DX37ZCZD46JUOPLNT5YSCPFKEU","short_pith_number":"pith:DX37ZCZD","schema_version":"1.0","canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","source":{"kind":"arxiv","id":"1805.09661","version":1},"attestation_state":"computed","paper":{"title":"On the sum of $k$-th largest distance eigenvalues of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiqiu Lin","submitted_at":"2018-05-24T13:40:52Z","abstract_excerpt":"For a connected graph $G$ with order $n$ and an integer $k\\geq 1$, we denote by $$S_k(D(G))=\\lambda_1(D(G))+\\cdots+\\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and lower bound of $S_k(D(G))$. We determine the sharp lower bounds of $S_k(D(G))$ when $G$ is connected graph and is a tree, respectively, and characterize both the extremal graphs. Moreover, we conjecture that the upper bound is attained when $G$ is a path of order $n$ and prove some partial result supporting the conjecture. To prove our result, we obtain a shar"},"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":"1805.09661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T13:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"36dcc9a2637361e218e77d02e2e7d81fd3afcc87b66827c0063149976138cb5e","abstract_canon_sha256":"b2e2f7bf738d0775a2acf24941bd9ea40ac4ba61bf3f7e11ac95f0be97069008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.222333Z","signature_b64":"1z99htC1zKU1YvllDmb3qPDfT2GUXrVpgsM3O6WCOqE41nEJThwxC8TlsS5ET6qcYqigGVlQqTAAknICMUWTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","last_reissued_at":"2026-05-18T00:15:03.221702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.221702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sum of $k$-th largest distance eigenvalues of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiqiu Lin","submitted_at":"2018-05-24T13:40:52Z","abstract_excerpt":"For a connected graph $G$ with order $n$ and an integer $k\\geq 1$, we denote by $$S_k(D(G))=\\lambda_1(D(G))+\\cdots+\\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and lower bound of $S_k(D(G))$. We determine the sharp lower bounds of $S_k(D(G))$ when $G$ is connected graph and is a tree, respectively, and characterize both the extremal graphs. Moreover, we conjecture that the upper bound is attained when $G$ is a path of order $n$ and prove some partial result supporting the conjecture. To prove our result, we obtain a shar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09661","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":"1805.09661","created_at":"2026-05-18T00:15:03.221829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09661v1","created_at":"2026-05-18T00:15:03.221829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09661","created_at":"2026-05-18T00:15:03.221829+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX37ZCZD46JU","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX37ZCZD46JUOPLN","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX37ZCZD","created_at":"2026-05-18T12:32:19.392346+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/DX37ZCZD46JUOPLNT5YSCPFKEU","json":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU.json","graph_json":"https://pith.science/api/pith-number/DX37ZCZD46JUOPLNT5YSCPFKEU/graph.json","events_json":"https://pith.science/api/pith-number/DX37ZCZD46JUOPLNT5YSCPFKEU/events.json","paper":"https://pith.science/paper/DX37ZCZD"},"agent_actions":{"view_html":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU","download_json":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU.json","view_paper":"https://pith.science/paper/DX37ZCZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09661&json=true","fetch_graph":"https://pith.science/api/pith-number/DX37ZCZD46JUOPLNT5YSCPFKEU/graph.json","fetch_events":"https://pith.science/api/pith-number/DX37ZCZD46JUOPLNT5YSCPFKEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/action/storage_attestation","attest_author":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/action/author_attestation","sign_citation":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/action/citation_signature","submit_replication":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/action/replication_record"}},"created_at":"2026-05-18T00:15:03.221829+00:00","updated_at":"2026-05-18T00:15:03.221829+00:00"}