{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJ2C4VI2GALRGG5ZMUEKXUGXF2","short_pith_number":"pith:HJ2C4VI2","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"},"canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","source":{"kind":"arxiv","id":"1605.07239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07239","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07239v2","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07239","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"HJ2C4VI2GALR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJ2C4VI2GALRGG5Z","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJ2C4VI2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJ2C4VI2GALRGG5ZMUEKXUGXF2","target":"record","payload":{"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"},"canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","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"},"source_kind":"arxiv","source_id":"1605.07239","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:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/M8jRRA5ep9joo2FOo3EDHxq8Te6j9RIScl5Tcdg4xmeN2Miv3TJ25cwbf9225027ZnLTxdJQS3bPhM7P61Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:12:38.129578Z"},"content_sha256":"67e68063857b2354e3b3dfed2975cfbf5b8445de7d1486e70b96030eae5e9733","schema_version":"1.0","event_id":"sha256:67e68063857b2354e3b3dfed2975cfbf5b8445de7d1486e70b96030eae5e9733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJ2C4VI2GALRGG5ZMUEKXUGXF2","target":"graph","payload":{"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"},"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:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc2LPsK9asW3dArlb1YlZr27UcwyVYsyCU86M83VKVvG0DIdkwHBTixS7jMRT5D77C1MOzxOTxP3XUp4NKT1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:12:38.130218Z"},"content_sha256":"46deb7eaae4c73eb677cb6105d734623ac2a10f7fef6b7bff1d39e09a55126ae","schema_version":"1.0","event_id":"sha256:46deb7eaae4c73eb677cb6105d734623ac2a10f7fef6b7bff1d39e09a55126ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/bundle.json","state_url":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/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-05-28T22:12:38Z","links":{"resolver":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2","bundle":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/bundle.json","state":"https://pith.science/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJ2C4VI2GALRGG5ZMUEKXUGXF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJ2C4VI2GALRGG5ZMUEKXUGXF2","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":"76b6162e94f25aee43d10cf1c182d5c04214a927c18b9198e025fe3431741925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-05-23T23:35:19Z","title_canon_sha256":"88a53dc271cdb0850eeb1f4432e748023f143cf223230caffc9d001f137f8b41"},"schema_version":"1.0","source":{"id":"1605.07239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07239","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07239v2","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07239","created_at":"2026-05-17T23:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"HJ2C4VI2GALR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJ2C4VI2GALRGG5Z","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJ2C4VI2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:46deb7eaae4c73eb677cb6105d734623ac2a10f7fef6b7bff1d39e09a55126ae","target":"graph","created_at":"2026-05-17T23:47:31Z","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 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 ","authors_text":"Lee DeVille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-05-23T23:35:19Z","title":"Optimizing Gershgorin for Symmetric Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07239","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:67e68063857b2354e3b3dfed2975cfbf5b8445de7d1486e70b96030eae5e9733","target":"record","created_at":"2026-05-17T23:47:31Z","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":"76b6162e94f25aee43d10cf1c182d5c04214a927c18b9198e025fe3431741925","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2016-05-23T23:35:19Z","title_canon_sha256":"88a53dc271cdb0850eeb1f4432e748023f143cf223230caffc9d001f137f8b41"},"schema_version":"1.0","source":{"id":"1605.07239","kind":"arxiv","version":2}},"canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a742e551a3017131bb96508abd0d72eb77dcf61b0e33e8e2d20cf009417c06f","first_computed_at":"2026-05-17T23:47:31.919287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:31.919287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWEhr+P3dkvWLIvXARIo8BfKD3gd3x63ye/9Sphnyu3pwVPdq0/EV2Q3K58MQRrxUZ4LjgwGeHIlYA3/23QKAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:31.920032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e68063857b2354e3b3dfed2975cfbf5b8445de7d1486e70b96030eae5e9733","sha256:46deb7eaae4c73eb677cb6105d734623ac2a10f7fef6b7bff1d39e09a55126ae"],"state_sha256":"86cd9ab031524cffbfb520d4748ecf1625440280926bf5644a803242fcf55a89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3V6I2tkQ6AZl4+dJgWk52VvMioXbUy8N7W7GuomJ3Nw9XUVBkVVMEza696fyG0YVs//fuzHy9W3Hgw0DYaZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:12:38.133712Z","bundle_sha256":"47c044b4eb8058c779aea1adc1bd1b865052fd89a62e60fe7ed1a9f6461df9ce"}}