{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEDARNICLEDFZ3EVL7UAQQ3VL2","short_pith_number":"pith:CEDARNIC","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"},"canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","source":{"kind":"arxiv","id":"1707.03221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03221","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03221v2","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03221","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"CEDARNICLEDF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEDARNICLEDFZ3EV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEDARNIC","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEDARNICLEDFZ3EVL7UAQQ3VL2","target":"record","payload":{"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"},"canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","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"},"source_kind":"arxiv","source_id":"1707.03221","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOrnE1yqXmU4aszOZ88GL2Q2yA12fn6MPrObGSt4gmVlv1ZJF2fg9da13QH8lAbgh6iQMldU+fbKQDwUF4oGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:34.737968Z"},"content_sha256":"8f820e197f5a552bbe079eef3f9bb6d351e88ea9022c1181cbe7f762ad4153e7","schema_version":"1.0","event_id":"sha256:8f820e197f5a552bbe079eef3f9bb6d351e88ea9022c1181cbe7f762ad4153e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEDARNICLEDFZ3EVL7UAQQ3VL2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IS3ixKXszq5MvRKpKNqnVvd/1PC/BBkLPAI9RM6xuqqV4hMSBhuSsSd9mmsHFXf3Y+10pfffm1sjPDC5ZMBvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:34.738543Z"},"content_sha256":"d812df1ef8bca0cfb05b4e5687a908907df90a622f1bc9cbfdc798228e9efcd5","schema_version":"1.0","event_id":"sha256:d812df1ef8bca0cfb05b4e5687a908907df90a622f1bc9cbfdc798228e9efcd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/bundle.json","state_url":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:34:34Z","links":{"resolver":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2","bundle":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/bundle.json","state":"https://pith.science/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEDARNICLEDFZ3EVL7UAQQ3VL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEDARNICLEDFZ3EVL7UAQQ3VL2","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":"85e8be3865f498648e836286a8abd4e5157b4eed27637eabfea0aa3e860c7083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-11T11:20:11Z","title_canon_sha256":"ec63e282b1248e3c3bbf9b0cdc052144ade7f19243e0e2a705e4cbd62cb7c1a5"},"schema_version":"1.0","source":{"id":"1707.03221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03221","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03221v2","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03221","created_at":"2026-05-17T23:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"CEDARNICLEDF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEDARNICLEDFZ3EV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEDARNIC","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:d812df1ef8bca0cfb05b4e5687a908907df90a622f1bc9cbfdc798228e9efcd5","target":"graph","created_at":"2026-05-17T23:55:09Z","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"},"paper":{"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$.","authors_text":"Akihiro Munemasa, Anni Peng, Gary R. W. Greaves","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-11T11:20:11Z","title":"On a lower bound for the Laplacian eigenvalues of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03221","kind":"arxiv","version":2},"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:8f820e197f5a552bbe079eef3f9bb6d351e88ea9022c1181cbe7f762ad4153e7","target":"record","created_at":"2026-05-17T23:55:09Z","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":"85e8be3865f498648e836286a8abd4e5157b4eed27637eabfea0aa3e860c7083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-11T11:20:11Z","title_canon_sha256":"ec63e282b1248e3c3bbf9b0cdc052144ade7f19243e0e2a705e4cbd62cb7c1a5"},"schema_version":"1.0","source":{"id":"1707.03221","kind":"arxiv","version":2}},"canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"110608b50259065cec955fe80843755ea9b60de2204b8a87e152aff2d9463864","first_computed_at":"2026-05-17T23:55:09.824702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:09.824702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lb/AkdNdlHsl1K2/LhM+9DfpkfOKCH0psib3FautXE/m2uGRlvTcAzktC7HJZGgUHg8cayKel9IW/DTtGxgKAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:09.825149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f820e197f5a552bbe079eef3f9bb6d351e88ea9022c1181cbe7f762ad4153e7","sha256:d812df1ef8bca0cfb05b4e5687a908907df90a622f1bc9cbfdc798228e9efcd5"],"state_sha256":"20a9206e397805a2581297a0f1b51e632780b740b8139d80a1f14767dc6fad74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDuWOPcxPTeliW8LE9pLkqxqGFhbMXdXr+As74TNTigT5WLj5kKO1CPg6/WvKA1QjyxtbwubATPfoE7IypV/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:34:34.741521Z","bundle_sha256":"573414bfc2632943abb238c119dc53806165f409d2c529a2bfe8ac2966736a0d"}}