{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JQXJ55A6FLUAMDSLQVLH6G6D2N","short_pith_number":"pith:JQXJ55A6","schema_version":"1.0","canonical_sha256":"4c2e9ef41e2ae8060e4b85567f1bc3d36f36b5e3575a1ca84d3c1ce2a02e78f1","source":{"kind":"arxiv","id":"2503.11165","version":1},"attestation_state":"computed","paper":{"title":"More on the full Brouwer Laplacian spectrum conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junwei Zi, Xiaodan Chen","submitted_at":"2025-03-14T08:05:52Z","abstract_excerpt":"Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\\binom{k+1}{2}$ for each $k\\in \\{1,2,\\cdots,n\\}$, which has come to be known as Brouwer's conjecture. Recently, Li and Guo further considered the case when the equalities hold in these conjectured inequalities, and proposed the full version of Brouwer's conjecture. In this paper, we first present a concise version of the full Brouwer's conjecture. Then we show that the full Brouwer's conjecture holds for two families of spanning subgraphs"},"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":"2503.11165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-14T08:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"d8f8e65534f71805cd7c2e808de76839130d74c4598d341281e4966f392778f7","abstract_canon_sha256":"ca16f13f6bccb82ac1d8828c3fff0bea86d91030d347dce5c3dce521f5546e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:13.330191Z","signature_b64":"jICcdhuOBpgTfBlwO56ZSp+7lVXr9R7sOq2EGRWGRWQvW5mMy/XTs155DffpqNsFFOArVcFGAbB6/gpeOVtfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2e9ef41e2ae8060e4b85567f1bc3d36f36b5e3575a1ca84d3c1ce2a02e78f1","last_reissued_at":"2026-07-05T10:31:13.329250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:13.329250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More on the full Brouwer Laplacian spectrum conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junwei Zi, Xiaodan Chen","submitted_at":"2025-03-14T08:05:52Z","abstract_excerpt":"Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\\binom{k+1}{2}$ for each $k\\in \\{1,2,\\cdots,n\\}$, which has come to be known as Brouwer's conjecture. Recently, Li and Guo further considered the case when the equalities hold in these conjectured inequalities, and proposed the full version of Brouwer's conjecture. In this paper, we first present a concise version of the full Brouwer's conjecture. Then we show that the full Brouwer's conjecture holds for two families of spanning subgraphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11165","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/2503.11165/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":"2503.11165","created_at":"2026-07-05T10:31:13.329358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11165v1","created_at":"2026-07-05T10:31:13.329358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11165","created_at":"2026-07-05T10:31:13.329358+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQXJ55A6FLUA","created_at":"2026-07-05T10:31:13.329358+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQXJ55A6FLUAMDSL","created_at":"2026-07-05T10:31:13.329358+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQXJ55A6","created_at":"2026-07-05T10:31:13.329358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07118","citing_title":"A Matching-Number Refinement of Brouwer's Laplacian Eigenvalue Inequality","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26707","citing_title":"Sum of the $k$ Largest Eigenvalues of Symmetric Matrices: Theory and Applications","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N","json":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N.json","graph_json":"https://pith.science/api/pith-number/JQXJ55A6FLUAMDSLQVLH6G6D2N/graph.json","events_json":"https://pith.science/api/pith-number/JQXJ55A6FLUAMDSLQVLH6G6D2N/events.json","paper":"https://pith.science/paper/JQXJ55A6"},"agent_actions":{"view_html":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N","download_json":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N.json","view_paper":"https://pith.science/paper/JQXJ55A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11165&json=true","fetch_graph":"https://pith.science/api/pith-number/JQXJ55A6FLUAMDSLQVLH6G6D2N/graph.json","fetch_events":"https://pith.science/api/pith-number/JQXJ55A6FLUAMDSLQVLH6G6D2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N/action/storage_attestation","attest_author":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N/action/author_attestation","sign_citation":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N/action/citation_signature","submit_replication":"https://pith.science/pith/JQXJ55A6FLUAMDSLQVLH6G6D2N/action/replication_record"}},"created_at":"2026-07-05T10:31:13.329358+00:00","updated_at":"2026-07-05T10:31:13.329358+00:00"}