{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:33RNGDLM262JLKTS55Y3VOQYWP","short_pith_number":"pith:33RNGDLM","schema_version":"1.0","canonical_sha256":"dee2d30d6cd7b495aa72ef71baba18b3f87a24e02a717b680a3cb1a47c106bc6","source":{"kind":"arxiv","id":"2605.26707","version":1},"attestation_state":"computed","paper":{"title":"Sum of the $k$ Largest Eigenvalues of Symmetric Matrices: Theory and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kinkar Chandra Das, Shaowei Sun, Yaping Min","submitted_at":"2026-05-26T08:47:25Z","abstract_excerpt":"This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\\bf [On the sum of k largest eigenvalues of graphs and symmetric matrices, J. Combin. Theory Ser. B 99 (2009) 306--313]}. Furthermore, in the case of the Laplacian matrix, we prove that the well-known Brouwer's conjecture {\\bf [Spectra of Graphs, Springer, New York, 2012]} holds for small values of $k$ for almost all graphs, thereby taking a significant step toward its complete resolutio"},"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":"2605.26707","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T08:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"117f456dbcc0a13a0c496021e36aa7733176bb6b03a54484f5a2c6c6b791f25b","abstract_canon_sha256":"b36b54ff1309a1810abfe6a679a3d9923e3cda8b94926533aa5ecbe710faa2f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:08.460402Z","signature_b64":"fseVgRnQVz7KggzBwteKON69ZRbPDcWaFl2u18/BJbQ2jwRcPOyD6iR66CIVHG8F7CVUA0eOrjpo9/kXNwDUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee2d30d6cd7b495aa72ef71baba18b3f87a24e02a717b680a3cb1a47c106bc6","last_reissued_at":"2026-05-27T01:06:08.459535Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:08.459535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum of the $k$ Largest Eigenvalues of Symmetric Matrices: Theory and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kinkar Chandra Das, Shaowei Sun, Yaping Min","submitted_at":"2026-05-26T08:47:25Z","abstract_excerpt":"This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\\bf [On the sum of k largest eigenvalues of graphs and symmetric matrices, J. Combin. Theory Ser. B 99 (2009) 306--313]}. Furthermore, in the case of the Laplacian matrix, we prove that the well-known Brouwer's conjecture {\\bf [Spectra of Graphs, Springer, New York, 2012]} holds for small values of $k$ for almost all graphs, thereby taking a significant step toward its complete resolutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26707","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.26707","created_at":"2026-05-27T01:06:08.459677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26707v1","created_at":"2026-05-27T01:06:08.459677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26707","created_at":"2026-05-27T01:06:08.459677+00:00"},{"alias_kind":"pith_short_12","alias_value":"33RNGDLM262J","created_at":"2026-05-27T01:06:08.459677+00:00"},{"alias_kind":"pith_short_16","alias_value":"33RNGDLM262JLKTS","created_at":"2026-05-27T01:06:08.459677+00:00"},{"alias_kind":"pith_short_8","alias_value":"33RNGDLM","created_at":"2026-05-27T01:06:08.459677+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/33RNGDLM262JLKTS55Y3VOQYWP","json":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP.json","graph_json":"https://pith.science/api/pith-number/33RNGDLM262JLKTS55Y3VOQYWP/graph.json","events_json":"https://pith.science/api/pith-number/33RNGDLM262JLKTS55Y3VOQYWP/events.json","paper":"https://pith.science/paper/33RNGDLM"},"agent_actions":{"view_html":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP","download_json":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP.json","view_paper":"https://pith.science/paper/33RNGDLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26707&json=true","fetch_graph":"https://pith.science/api/pith-number/33RNGDLM262JLKTS55Y3VOQYWP/graph.json","fetch_events":"https://pith.science/api/pith-number/33RNGDLM262JLKTS55Y3VOQYWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP/action/storage_attestation","attest_author":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP/action/author_attestation","sign_citation":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP/action/citation_signature","submit_replication":"https://pith.science/pith/33RNGDLM262JLKTS55Y3VOQYWP/action/replication_record"}},"created_at":"2026-05-27T01:06:08.459677+00:00","updated_at":"2026-05-27T01:06:08.459677+00:00"}