{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W6GJUCDSMQ4TSJ6S3K4FZOHF4F","short_pith_number":"pith:W6GJUCDS","canonical_record":{"source":{"id":"1808.04012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T22:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"03bc9c2b73f9fd87d0acfda1e5aaea6057b37ba4a6a2f17fdbb8730e0182c94b","abstract_canon_sha256":"dd02f2510eb1e7c3ff34a06bbdef625f4877f312ec071590f73d9f68778eff25"},"schema_version":"1.0"},"canonical_sha256":"b78c9a087264393927d2dab85cb8e5e146542a28f0393cea1765b4334aa948d0","source":{"kind":"arxiv","id":"1808.04012","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04012","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04012v2","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04012","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"W6GJUCDSMQ4T","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W6GJUCDSMQ4TSJ6S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W6GJUCDS","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W6GJUCDSMQ4TSJ6S3K4FZOHF4F","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T22:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"03bc9c2b73f9fd87d0acfda1e5aaea6057b37ba4a6a2f17fdbb8730e0182c94b","abstract_canon_sha256":"dd02f2510eb1e7c3ff34a06bbdef625f4877f312ec071590f73d9f68778eff25"},"schema_version":"1.0"},"canonical_sha256":"b78c9a087264393927d2dab85cb8e5e146542a28f0393cea1765b4334aa948d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:14.184359Z","signature_b64":"iIe95LNN1vqUCeEYt2757aH9WvTqcRgoXp1WISxEWyBrbjG/dWgIsSpeABUuGkI5qBAA+XgQ8Zg/uCKpbueyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78c9a087264393927d2dab85cb8e5e146542a28f0393cea1765b4334aa948d0","last_reissued_at":"2026-05-18T00:08:14.183784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:14.183784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04012","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-18T00:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I42GndpTFHGZwRS2Jbk50TQ3LngDCNRMNty1ldhNywuY4cj5ZliMsdb3ud3jOaRbFQ6/RPmj9xo92Gp16LAeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:46:23.853529Z"},"content_sha256":"fb3efd406554fc7cd8227085d8198cacace402349844d62e17cb518510cf850d","schema_version":"1.0","event_id":"sha256:fb3efd406554fc7cd8227085d8198cacace402349844d62e17cb518510cf850d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W6GJUCDSMQ4TSJ6S3K4FZOHF4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on eigenvector error bounds for polynomial eigenvalue problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Javier Perez","submitted_at":"2018-08-12T22:47:25Z","abstract_excerpt":"The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and Tisseur, we present error bounds for the computed eigenvectors of matrix polynomials. Our error bounds are applicable to any linearization satisfying two properties. First, eigenvectors of the original matrix polynomial can be recovered from those of the linearization without any arithmetic computation. Second, the linearization presents one-sided factorization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04012","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-18T00:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBe3Kh1LgNm41GaYIj5scOrQW4LjS7ARzqL0Ti0bxn4FbMRKt6FpyryZJgaQIXmIY7uvQaSSvLjRZXCSI7zIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:46:23.853868Z"},"content_sha256":"4b83b308e97fe66b56a4c13b11d0485b4b08a59a8c80613dbd70a085644aa7cb","schema_version":"1.0","event_id":"sha256:4b83b308e97fe66b56a4c13b11d0485b4b08a59a8c80613dbd70a085644aa7cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/bundle.json","state_url":"https://pith.science/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/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-07-05T10:46:23Z","links":{"resolver":"https://pith.science/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F","bundle":"https://pith.science/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/bundle.json","state":"https://pith.science/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6GJUCDSMQ4TSJ6S3K4FZOHF4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W6GJUCDSMQ4TSJ6S3K4FZOHF4F","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":"dd02f2510eb1e7c3ff34a06bbdef625f4877f312ec071590f73d9f68778eff25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T22:47:25Z","title_canon_sha256":"03bc9c2b73f9fd87d0acfda1e5aaea6057b37ba4a6a2f17fdbb8730e0182c94b"},"schema_version":"1.0","source":{"id":"1808.04012","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04012","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04012v2","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04012","created_at":"2026-05-18T00:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"W6GJUCDSMQ4T","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W6GJUCDSMQ4TSJ6S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W6GJUCDS","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:4b83b308e97fe66b56a4c13b11d0485b4b08a59a8c80613dbd70a085644aa7cb","target":"graph","created_at":"2026-05-18T00:08:14Z","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 standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and Tisseur, we present error bounds for the computed eigenvectors of matrix polynomials. Our error bounds are applicable to any linearization satisfying two properties. First, eigenvectors of the original matrix polynomial can be recovered from those of the linearization without any arithmetic computation. Second, the linearization presents one-sided factorization","authors_text":"Javier Perez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T22:47:25Z","title":"A note on eigenvector error bounds for polynomial eigenvalue problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04012","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:fb3efd406554fc7cd8227085d8198cacace402349844d62e17cb518510cf850d","target":"record","created_at":"2026-05-18T00:08:14Z","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":"dd02f2510eb1e7c3ff34a06bbdef625f4877f312ec071590f73d9f68778eff25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T22:47:25Z","title_canon_sha256":"03bc9c2b73f9fd87d0acfda1e5aaea6057b37ba4a6a2f17fdbb8730e0182c94b"},"schema_version":"1.0","source":{"id":"1808.04012","kind":"arxiv","version":2}},"canonical_sha256":"b78c9a087264393927d2dab85cb8e5e146542a28f0393cea1765b4334aa948d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b78c9a087264393927d2dab85cb8e5e146542a28f0393cea1765b4334aa948d0","first_computed_at":"2026-05-18T00:08:14.183784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:14.183784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iIe95LNN1vqUCeEYt2757aH9WvTqcRgoXp1WISxEWyBrbjG/dWgIsSpeABUuGkI5qBAA+XgQ8Zg/uCKpbueyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:14.184359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04012","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb3efd406554fc7cd8227085d8198cacace402349844d62e17cb518510cf850d","sha256:4b83b308e97fe66b56a4c13b11d0485b4b08a59a8c80613dbd70a085644aa7cb"],"state_sha256":"a81eaf27eb07836a3fc5606f59d43d5050c4c12ce00528597d5dec019cb75e84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GT4G37NG7UOEhh7h6nL/I4BLw73STRkr8s9SzplutI2IfOSvPAd7shV5sZVOdMzeFwnpxuaNpiIc4etr4owaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:46:23.856097Z","bundle_sha256":"f5cb29b298be61ea954c7314a60af689579d3652d3624a881ad4076688fed19b"}}