{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CEDARNICLEDFZ3EVL7UAQQ3VL2","short_pith_number":"pith:CEDARNIC","schema_version":"1.0","canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","source":{"kind":"arxiv","id":"1707.03221","version":2},"attestation_state":"computed","paper":{"title":"On a lower bound for the Laplacian eigenvalues of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Anni Peng, Gary R. W. Greaves","submitted_at":"2017-07-11T11:20:11Z","abstract_excerpt":"If $\\mu_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then $\\mu_m \\geqslant d_m-m+2$. This inequality was conjectured by Guo in 2007 and proved by Brouwer and Haemers in 2008. Brouwer and Haemers gave several examples of graphs achieving equality, but a complete characterisation was not given. In this paper we consider the problem of characterising graphs satisfying $\\mu_m = d_m-m+2$. In particular we give a full classification of graphs with $\\mu_m = d_m-m+2 \\leqslant 1$."},"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":"1707.03221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-11T11:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"ec63e282b1248e3c3bbf9b0cdc052144ade7f19243e0e2a705e4cbd62cb7c1a5","abstract_canon_sha256":"85e8be3865f498648e836286a8abd4e5157b4eed27637eabfea0aa3e860c7083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:09.825149Z","signature_b64":"lb/AkdNdlHsl1K2/LhM+9DfpkfOKCH0psib3FautXE/m2uGRlvTcAzktC7HJZGgUHg8cayKel9IW/DTtGxgKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","last_reissued_at":"2026-05-17T23:55:09.824702Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:09.824702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a lower bound for the Laplacian eigenvalues of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Anni Peng, Gary R. W. Greaves","submitted_at":"2017-07-11T11:20:11Z","abstract_excerpt":"If $\\mu_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then $\\mu_m \\geqslant d_m-m+2$. This inequality was conjectured by Guo in 2007 and proved by Brouwer and Haemers in 2008. Brouwer and Haemers gave several examples of graphs achieving equality, but a complete characterisation was not given. In this paper we consider the problem of characterising graphs satisfying $\\mu_m = d_m-m+2$. In particular we give a full classification of graphs with $\\mu_m = d_m-m+2 \\leqslant 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03221","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03221","created_at":"2026-05-17T23:55:09.824768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03221v2","created_at":"2026-05-17T23:55:09.824768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03221","created_at":"2026-05-17T23:55:09.824768+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEDARNICLEDF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEDARNICLEDFZ3EV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEDARNIC","created_at":"2026-05-18T12:31:10.602751+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/CEDARNICLEDFZ3EVL7UAQQ3VL2","json":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2.json","graph_json":"https://pith.science/api/pith-number/CEDARNICLEDFZ3EVL7UAQQ3VL2/graph.json","events_json":"https://pith.science/api/pith-number/CEDARNICLEDFZ3EVL7UAQQ3VL2/events.json","paper":"https://pith.science/paper/CEDARNIC"},"agent_actions":{"view_html":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2","download_json":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2.json","view_paper":"https://pith.science/paper/CEDARNIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03221&json=true","fetch_graph":"https://pith.science/api/pith-number/CEDARNICLEDFZ3EVL7UAQQ3VL2/graph.json","fetch_events":"https://pith.science/api/pith-number/CEDARNICLEDFZ3EVL7UAQQ3VL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/action/storage_attestation","attest_author":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/action/author_attestation","sign_citation":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/action/citation_signature","submit_replication":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/action/replication_record"}},"created_at":"2026-05-17T23:55:09.824768+00:00","updated_at":"2026-05-17T23:55:09.824768+00:00"}