{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DX37ZCZD46JUOPLNT5YSCPFKEU","short_pith_number":"pith:DX37ZCZD","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"},"canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","source":{"kind":"arxiv","id":"1805.09661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09661","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09661v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09661","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"DX37ZCZD46JU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DX37ZCZD46JUOPLN","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DX37ZCZD","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DX37ZCZD46JUOPLNT5YSCPFKEU","target":"record","payload":{"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"},"canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","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"},"source_kind":"arxiv","source_id":"1805.09661","source_version":1,"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-18T00:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skVC+ytn5FIgnPId2cKbVobYcenVPDjMrKKzLKxVEGwhZYFFCTCJ11J+dazISw3Gc3xumDDIPwkC9QO8JXkfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:17:29.782871Z"},"content_sha256":"49c971a5f0a7622c7d60e9273a35112bfc8749473a42ef8956a22f5cef8a9d34","schema_version":"1.0","event_id":"sha256:49c971a5f0a7622c7d60e9273a35112bfc8749473a42ef8956a22f5cef8a9d34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DX37ZCZD46JUOPLNT5YSCPFKEU","target":"graph","payload":{"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"},"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-18T00:15:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWuBjednSHWKUxT3/Zx3ABpjO9gjUTAc7nYr6t4iXkOwmll1dsW/tWMVm2mtraGY4FCSEkeZLVGPQM84HdB2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:17:29.783214Z"},"content_sha256":"99362a4ca917c634ced48bd1e6ba9773218dff8bf595b0cdcd0f9ecc04920b78","schema_version":"1.0","event_id":"sha256:99362a4ca917c634ced48bd1e6ba9773218dff8bf595b0cdcd0f9ecc04920b78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/bundle.json","state_url":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/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-06-19T23:17:29Z","links":{"resolver":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU","bundle":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/bundle.json","state":"https://pith.science/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DX37ZCZD46JUOPLNT5YSCPFKEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DX37ZCZD46JUOPLNT5YSCPFKEU","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":"b2e2f7bf738d0775a2acf24941bd9ea40ac4ba61bf3f7e11ac95f0be97069008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T13:40:52Z","title_canon_sha256":"36dcc9a2637361e218e77d02e2e7d81fd3afcc87b66827c0063149976138cb5e"},"schema_version":"1.0","source":{"id":"1805.09661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09661","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09661v1","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09661","created_at":"2026-05-18T00:15:03Z"},{"alias_kind":"pith_short_12","alias_value":"DX37ZCZD46JU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DX37ZCZD46JUOPLN","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DX37ZCZD","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:99362a4ca917c634ced48bd1e6ba9773218dff8bf595b0cdcd0f9ecc04920b78","target":"graph","created_at":"2026-05-18T00:15:03Z","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":"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","authors_text":"Huiqiu Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T13:40:52Z","title":"On the sum of $k$-th largest distance eigenvalues of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09661","kind":"arxiv","version":1},"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:49c971a5f0a7622c7d60e9273a35112bfc8749473a42ef8956a22f5cef8a9d34","target":"record","created_at":"2026-05-18T00:15:03Z","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":"b2e2f7bf738d0775a2acf24941bd9ea40ac4ba61bf3f7e11ac95f0be97069008","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-24T13:40:52Z","title_canon_sha256":"36dcc9a2637361e218e77d02e2e7d81fd3afcc87b66827c0063149976138cb5e"},"schema_version":"1.0","source":{"id":"1805.09661","kind":"arxiv","version":1}},"canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1df7fc8b23e793473d6d9f71213caa253cc5fccab126935898285082d6286616","first_computed_at":"2026-05-18T00:15:03.221702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:03.221702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1z99htC1zKU1YvllDmb3qPDfT2GUXrVpgsM3O6WCOqE41nEJThwxC8TlsS5ET6qcYqigGVlQqTAAknICMUWTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:03.222333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49c971a5f0a7622c7d60e9273a35112bfc8749473a42ef8956a22f5cef8a9d34","sha256:99362a4ca917c634ced48bd1e6ba9773218dff8bf595b0cdcd0f9ecc04920b78"],"state_sha256":"d5634bc5356d55ae3b4a0c14d9e8fdb4fccbd382ccc7af08c98842af2aa5fc1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVEhx8MOadY6l7S94PUvyW02iWoLx7YPaKSdv6ql3I05IqqoLyLXI1JNdRJ2GvTUbhxKIm99v11FfyWs7PN2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:17:29.785141Z","bundle_sha256":"58dda3cd3aac813790b43b991c1c2fd8c803426a734fee23fd1b1880d10e1b4c"}}