{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:URKEARVZNYSEWTNA6M5D7LKLGS","short_pith_number":"pith:URKEARVZ","schema_version":"1.0","canonical_sha256":"a4544046b96e244b4da0f33a3fad4b348d0e454ef5efcb4606fee9fd597ea380","source":{"kind":"arxiv","id":"2607.03388","version":1},"attestation_state":"computed","paper":{"title":"On Full Brouwer's Laplacian Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dongxiu Cai, Jia Yang, Xiao-Dong Zhang, Zhengbo Chen","submitted_at":"2026-07-03T14:43:32Z","abstract_excerpt":"Brouwer's Laplacian conjecture asserts that for any graph $G$ with $n$ vertices and $m$ edges, the sum of the $k$ largest Laplacian eigenvalues satisfies $s_k(G) \\le m + \\binom{k+1}{2}$ for $k=1, \\ldots, n$. The conjecture has been verified for numerous graph classes and for several values of $k$. Recently, Kothari and Tudose (2026) proved the conjecture. In this paper, we prove that equality holds for some $1\\le k\\le n-1$ if and only if $G$ is a threshold graph with clique number $k+1$, which confirms the full Brouwer conjecture formulated by Li and Guo (2022)."},"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":"2607.03388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-03T14:43:32Z","cross_cats_sorted":[],"title_canon_sha256":"d7d1244352e572bdcf7b3778beaa1a1831d6b0f3869c5100b94d274e466d87b2","abstract_canon_sha256":"3f178de6c1558fe07dfd5d0f02054c49115e9fa9c251fb7371355cb975b8d1e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:40.858630Z","signature_b64":"Eet8rjiDeN2+TyrGIiZSfNvfHKUDnK+8uv/QHimvNn/Sup4HRgVsNDPwvQ3QqHchjYZJHinjglrQTzo4MPjqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4544046b96e244b4da0f33a3fad4b348d0e454ef5efcb4606fee9fd597ea380","last_reissued_at":"2026-07-07T02:17:40.857938Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:40.857938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Full Brouwer's Laplacian Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dongxiu Cai, Jia Yang, Xiao-Dong Zhang, Zhengbo Chen","submitted_at":"2026-07-03T14:43:32Z","abstract_excerpt":"Brouwer's Laplacian conjecture asserts that for any graph $G$ with $n$ vertices and $m$ edges, the sum of the $k$ largest Laplacian eigenvalues satisfies $s_k(G) \\le m + \\binom{k+1}{2}$ for $k=1, \\ldots, n$. The conjecture has been verified for numerous graph classes and for several values of $k$. Recently, Kothari and Tudose (2026) proved the conjecture. In this paper, we prove that equality holds for some $1\\le k\\le n-1$ if and only if $G$ is a threshold graph with clique number $k+1$, which confirms the full Brouwer conjecture formulated by Li and Guo (2022)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03388","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/2607.03388/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":"2607.03388","created_at":"2026-07-07T02:17:40.858036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03388v1","created_at":"2026-07-07T02:17:40.858036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03388","created_at":"2026-07-07T02:17:40.858036+00:00"},{"alias_kind":"pith_short_12","alias_value":"URKEARVZNYSE","created_at":"2026-07-07T02:17:40.858036+00:00"},{"alias_kind":"pith_short_16","alias_value":"URKEARVZNYSEWTNA","created_at":"2026-07-07T02:17:40.858036+00:00"},{"alias_kind":"pith_short_8","alias_value":"URKEARVZ","created_at":"2026-07-07T02:17:40.858036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08452","citing_title":"Proofs of two conjectures on generalizations of Brouwer's Laplacian conjecture","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS","json":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS.json","graph_json":"https://pith.science/api/pith-number/URKEARVZNYSEWTNA6M5D7LKLGS/graph.json","events_json":"https://pith.science/api/pith-number/URKEARVZNYSEWTNA6M5D7LKLGS/events.json","paper":"https://pith.science/paper/URKEARVZ"},"agent_actions":{"view_html":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS","download_json":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS.json","view_paper":"https://pith.science/paper/URKEARVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03388&json=true","fetch_graph":"https://pith.science/api/pith-number/URKEARVZNYSEWTNA6M5D7LKLGS/graph.json","fetch_events":"https://pith.science/api/pith-number/URKEARVZNYSEWTNA6M5D7LKLGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS/action/storage_attestation","attest_author":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS/action/author_attestation","sign_citation":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS/action/citation_signature","submit_replication":"https://pith.science/pith/URKEARVZNYSEWTNA6M5D7LKLGS/action/replication_record"}},"created_at":"2026-07-07T02:17:40.858036+00:00","updated_at":"2026-07-07T02:17:40.858036+00:00"}