{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HJ2C4VI2GALRGG5ZMUEKXUGXF2","short_pith_number":"pith:HJ2C4VI2","schema_version":"1.0","canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","source":{"kind":"arxiv","id":"1605.07239","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Gershgorin for Symmetric Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Lee DeVille","submitted_at":"2016-05-23T23:35:19Z","abstract_excerpt":"The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If $A$ is a symmetric matrix, by writing $A = B + x{\\bf 1}$, where ${\\bf 1}$ is the matrix with unit entries, we consider the problem of choosing $x$ to give the optimal Gershgorin bound on the eigenvalues of $B$, which then leads to one-sided bounds on the eigenvalues of $A$. We show that this $x$ can be found by an efficient linear program (whose solution can in may cases be written in closed form), and we show that for large classes of matrices, this shifting "},"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":"1605.07239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-05-23T23:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"88a53dc271cdb0850eeb1f4432e748023f143cf223230caffc9d001f137f8b41","abstract_canon_sha256":"76b6162e94f25aee43d10cf1c182d5c04214a927c18b9198e025fe3431741925"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:31.920032Z","signature_b64":"XWEhr+P3dkvWLIvXARIo8BfKD3gd3x63ye/9Sphnyu3pwVPdq0/EV2Q3K58MQRrxUZ4LjgwGeHIlYA3/23QKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","last_reissued_at":"2026-05-17T23:47:31.919287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:31.919287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Gershgorin for Symmetric Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Lee DeVille","submitted_at":"2016-05-23T23:35:19Z","abstract_excerpt":"The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If $A$ is a symmetric matrix, by writing $A = B + x{\\bf 1}$, where ${\\bf 1}$ is the matrix with unit entries, we consider the problem of choosing $x$ to give the optimal Gershgorin bound on the eigenvalues of $B$, which then leads to one-sided bounds on the eigenvalues of $A$. We show that this $x$ can be found by an efficient linear program (whose solution can in may cases be written in closed form), and we show that for large classes of matrices, this shifting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07239","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":"1605.07239","created_at":"2026-05-17T23:47:31.919422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07239v2","created_at":"2026-05-17T23:47:31.919422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07239","created_at":"2026-05-17T23:47:31.919422+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJ2C4VI2GALR","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJ2C4VI2GALRGG5Z","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJ2C4VI2","created_at":"2026-05-18T12:30:19.053100+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/HJ2C4VI2GALRGG5ZMUEKXUGXF2","json":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2.json","graph_json":"https://pith.science/api/pith-number/HJ2C4VI2GALRGG5ZMUEKXUGXF2/graph.json","events_json":"https://pith.science/api/pith-number/HJ2C4VI2GALRGG5ZMUEKXUGXF2/events.json","paper":"https://pith.science/paper/HJ2C4VI2"},"agent_actions":{"view_html":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2","download_json":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2.json","view_paper":"https://pith.science/paper/HJ2C4VI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07239&json=true","fetch_graph":"https://pith.science/api/pith-number/HJ2C4VI2GALRGG5ZMUEKXUGXF2/graph.json","fetch_events":"https://pith.science/api/pith-number/HJ2C4VI2GALRGG5ZMUEKXUGXF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/action/storage_attestation","attest_author":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/action/author_attestation","sign_citation":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/action/citation_signature","submit_replication":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/action/replication_record"}},"created_at":"2026-05-17T23:47:31.919422+00:00","updated_at":"2026-05-17T23:47:31.919422+00:00"}