{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FBCJEU6SDOWYSBR3B7ZKJQMSQV","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":"18da83e6e346aa4f1f9062eae87bb48174c537e8c14111537892ba8c4d2590d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-19T15:24:59Z","title_canon_sha256":"5f862d31ba055a478a8ed30338f7f56a824661fa9ccfff3a77553f2513889ccd"},"schema_version":"1.0","source":{"id":"2607.17293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17293","created_at":"2026-07-21T01:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17293v1","created_at":"2026-07-21T01:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17293","created_at":"2026-07-21T01:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"FBCJEU6SDOWY","created_at":"2026-07-21T01:21:25Z"},{"alias_kind":"pith_short_16","alias_value":"FBCJEU6SDOWYSBR3","created_at":"2026-07-21T01:21:25Z"},{"alias_kind":"pith_short_8","alias_value":"FBCJEU6S","created_at":"2026-07-21T01:21:25Z"}],"graph_snapshots":[{"event_id":"sha256:389af90f7d7f97592891ee546d41aa4c39ed8a935b593bc1a9358d3abd2b5cf8","target":"graph","created_at":"2026-07-21T01:21:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.17293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Brouwer conjectured that the sum of the $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 every $k\\in \\{1,2,\\dots,n\\}$, which has been confirmed by Kothari and Tudose (2026) recently. In this note, we characterize the equality case in this inequality. Our main result is that for every $n$-vertex graph $G=(V,E)$ and for every $k\\in \\{1,2,\\dots,n-1\\}$, the equality $\\sum_{i=1}^k\\mu_i(G)=|E(G)|+\\binom{k+1}{2}$ holds if and only if $G$ is a threshold graph with clique number $k+1$, where $\\mu_1(G)\\geq \\mu_2(G)\\geq \\c","authors_text":"Xiaodan Chen, Yuhang Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-19T15:24:59Z","title":"Characterizing the equality case in Brouwer's inequality for Laplacian eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17293","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:e2adf6c763a619826b1e44690228628b588c9bec9d069128b5a0d2d9211c5aa1","target":"record","created_at":"2026-07-21T01:21:25Z","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":"18da83e6e346aa4f1f9062eae87bb48174c537e8c14111537892ba8c4d2590d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-19T15:24:59Z","title_canon_sha256":"5f862d31ba055a478a8ed30338f7f56a824661fa9ccfff3a77553f2513889ccd"},"schema_version":"1.0","source":{"id":"2607.17293","kind":"arxiv","version":1}},"canonical_sha256":"28449253d21bad89063b0ff2a4c192855870aa1b88044856289af6bd37520088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28449253d21bad89063b0ff2a4c192855870aa1b88044856289af6bd37520088","first_computed_at":"2026-07-21T01:21:25.769869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:25.769869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"klooQOMX9Xf3ouqT1nHimCzwlvu56VEJJZmKjTajFM0v0HdtxSWtthAVM15sxMIh9E97uycPbWiJ4t7bOKGBDQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:25.770682Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2adf6c763a619826b1e44690228628b588c9bec9d069128b5a0d2d9211c5aa1","sha256:389af90f7d7f97592891ee546d41aa4c39ed8a935b593bc1a9358d3abd2b5cf8"],"state_sha256":"020120a18f89b5cf7f96fad2aee9935776171386c849f9e3db3cec5fbfb65697"}