{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CD7UCETWH6COWPGMSK4OYBFLZ4","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":"585ad56adbe050be9bdc6e75d81df726f37c70d0448a2fe94ed190e2761904b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-03T21:22:42Z","title_canon_sha256":"c2b5b36dacfc089b14451c95546528b8f40b041882c619a054d439d53098feee"},"schema_version":"1.0","source":{"id":"1106.0769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0769","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0769v1","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0769","created_at":"2026-05-18T04:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"CD7UCETWH6CO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CD7UCETWH6COWPGM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CD7UCETW","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:2f796ca3db558cc72fa2cce75dcdb5a4b0828541ff6213d06055e94eb383d09d","target":"graph","created_at":"2026-05-18T04:20:39Z","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":"In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest Laplacian eigenvalue of $G$ respectively. Then $ \\lambda_{m+1}(G)\\leq d_{m}(G)+m-1 $ for $\\bar{G} \\neq K_{m}+(n-m)K_1 $. We also introduce upper and lower bound for the Laplacian eigenvalues of weighted graphs, and compare it with the special case of unweighted graphs.","authors_text":"Ido Kaminer, Miriam Farber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-03T21:22:42Z","title":"Upper bound for the Laplacian eigenvalues of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0769","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:99b14ac544283b60e9fab16a9f7da8d33e36c308983b0cc035b1682a88ffde8c","target":"record","created_at":"2026-05-18T04:20:39Z","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":"585ad56adbe050be9bdc6e75d81df726f37c70d0448a2fe94ed190e2761904b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-03T21:22:42Z","title_canon_sha256":"c2b5b36dacfc089b14451c95546528b8f40b041882c619a054d439d53098feee"},"schema_version":"1.0","source":{"id":"1106.0769","kind":"arxiv","version":1}},"canonical_sha256":"10ff4112763f84eb3ccc92b8ec04abcf17c2d82d67f265a4721e567bd1cea8c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10ff4112763f84eb3ccc92b8ec04abcf17c2d82d67f265a4721e567bd1cea8c4","first_computed_at":"2026-05-18T04:20:39.264756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:39.264756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LxI8fgIGuwoXmJYgUh2V0AfUd7KCA0YjWw2QWfI9p4rh2TYeOJ5LzemUtWn1hSGjWIss3qg2ocv7rherz69NCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:39.265571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99b14ac544283b60e9fab16a9f7da8d33e36c308983b0cc035b1682a88ffde8c","sha256:2f796ca3db558cc72fa2cce75dcdb5a4b0828541ff6213d06055e94eb383d09d"],"state_sha256":"022900d638a8f18cc40140f823d5238e8aeaa7ca728eda7e0b8ddf6dcaf9e148"}