{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T4UVHGNMQPVSMFJWY75VTIZHCQ","short_pith_number":"pith:T4UVHGNM","schema_version":"1.0","canonical_sha256":"9f295399ac83eb261536c7fb59a3271421a4987e32052af8f295294edf9e3260","source":{"kind":"arxiv","id":"1504.03987","version":2},"attestation_state":"computed","paper":{"title":"Random Laplacian matrices and convex relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI","math.OC"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira","submitted_at":"2015-04-15T18:36:26Z","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"},"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":"1504.03987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-15T18:36:26Z","cross_cats_sorted":["cs.DS","cs.SI","math.OC"],"title_canon_sha256":"057e04f3e90eceb1b74e8caaf03c60a7ff514d4cd16a62d222f2eeed42ded234","abstract_canon_sha256":"f1964a9bd2a5dbe6c38156b6370cae1b9b70664e6c0be693b320e304050c0bc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:18.075722Z","signature_b64":"vaJEIx+VNHy08nhUMX0ZRFl9JB8yLeMGOGpN0OeRiJXD2rQEvEx5XVf4dVw6kprYv/OCoR4eTHtVvGrmSjJDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f295399ac83eb261536c7fb59a3271421a4987e32052af8f295294edf9e3260","last_reissued_at":"2026-05-18T01:36:18.075019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:18.075019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Laplacian matrices and convex relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI","math.OC"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira","submitted_at":"2015-04-15T18:36:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03987","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":"1504.03987","created_at":"2026-05-18T01:36:18.075106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03987v2","created_at":"2026-05-18T01:36:18.075106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03987","created_at":"2026-05-18T01:36:18.075106+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4UVHGNMQPVS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4UVHGNMQPVSMFJW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4UVHGNM","created_at":"2026-05-18T12:29:42.218222+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/T4UVHGNMQPVSMFJWY75VTIZHCQ","json":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ.json","graph_json":"https://pith.science/api/pith-number/T4UVHGNMQPVSMFJWY75VTIZHCQ/graph.json","events_json":"https://pith.science/api/pith-number/T4UVHGNMQPVSMFJWY75VTIZHCQ/events.json","paper":"https://pith.science/paper/T4UVHGNM"},"agent_actions":{"view_html":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ","download_json":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ.json","view_paper":"https://pith.science/paper/T4UVHGNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03987&json=true","fetch_graph":"https://pith.science/api/pith-number/T4UVHGNMQPVSMFJWY75VTIZHCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/T4UVHGNMQPVSMFJWY75VTIZHCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ/action/storage_attestation","attest_author":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ/action/author_attestation","sign_citation":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ/action/citation_signature","submit_replication":"https://pith.science/pith/T4UVHGNMQPVSMFJWY75VTIZHCQ/action/replication_record"}},"created_at":"2026-05-18T01:36:18.075106+00:00","updated_at":"2026-05-18T01:36:18.075106+00:00"}