{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4UVHGNMQPVSMFJWY75VTIZHCQ","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":"f1964a9bd2a5dbe6c38156b6370cae1b9b70664e6c0be693b320e304050c0bc6","cross_cats_sorted":["cs.DS","cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-15T18:36:26Z","title_canon_sha256":"057e04f3e90eceb1b74e8caaf03c60a7ff514d4cd16a62d222f2eeed42ded234"},"schema_version":"1.0","source":{"id":"1504.03987","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03987","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03987v2","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03987","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"T4UVHGNMQPVS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4UVHGNMQPVSMFJW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4UVHGNM","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:98b15c6ed3be041848bac255c09548bb19707d6d995df9d88ad9b9d855d01624","target":"graph","created_at":"2026-05-18T01:36:18Z","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":"The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms, often the size of the largest diagonal entry.\n  Besides being a simple tool to obtain precise estimates on the largest eigenvalue of a large class of random Laplacian matrices, our main result settles a number of open problems related to the tightness of certain convex relaxation-based algorithms. It easily implies the optimality of the semidefinite relaxati","authors_text":"Afonso S. Bandeira","cross_cats":["cs.DS","cs.SI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-15T18:36:26Z","title":"Random Laplacian matrices and convex relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03987","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:a1d62a45bf28af41a1ffd9cdacec7f8ffab9f9ffe1a8a2230c74076333a7d237","target":"record","created_at":"2026-05-18T01:36:18Z","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":"f1964a9bd2a5dbe6c38156b6370cae1b9b70664e6c0be693b320e304050c0bc6","cross_cats_sorted":["cs.DS","cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-15T18:36:26Z","title_canon_sha256":"057e04f3e90eceb1b74e8caaf03c60a7ff514d4cd16a62d222f2eeed42ded234"},"schema_version":"1.0","source":{"id":"1504.03987","kind":"arxiv","version":2}},"canonical_sha256":"9f295399ac83eb261536c7fb59a3271421a4987e32052af8f295294edf9e3260","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f295399ac83eb261536c7fb59a3271421a4987e32052af8f295294edf9e3260","first_computed_at":"2026-05-18T01:36:18.075019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:18.075019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vaJEIx+VNHy08nhUMX0ZRFl9JB8yLeMGOGpN0OeRiJXD2rQEvEx5XVf4dVw6kprYv/OCoR4eTHtVvGrmSjJDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:18.075722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03987","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1d62a45bf28af41a1ffd9cdacec7f8ffab9f9ffe1a8a2230c74076333a7d237","sha256:98b15c6ed3be041848bac255c09548bb19707d6d995df9d88ad9b9d855d01624"],"state_sha256":"ed9145be78f0dc497f114f01b7dd293f9a403d3ac471272d1fbb5d859c6d255e"}