{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HB6JRHRF6DHVU2VSSJUDEDAT5Q","short_pith_number":"pith:HB6JRHRF","canonical_record":{"source":{"id":"1711.09006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-11-21T07:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bb646e2e20816f4ecfba979138d4b63d847caf1733b8c7437167f34ad74cc8b","abstract_canon_sha256":"dc0d4814e3aaaa819a71f1ef3fed68d11244c78989a50e379cfa65a5d98ac6bd"},"schema_version":"1.0"},"canonical_sha256":"387c989e25f0cf5a6ab29268320c13ec382b65946d00bee96148041e31a42d6b","source":{"kind":"arxiv","id":"1711.09006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09006","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09006v1","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09006","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"pith_short_12","alias_value":"HB6JRHRF6DHV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HB6JRHRF6DHVU2VS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HB6JRHRF","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HB6JRHRF6DHVU2VSSJUDEDAT5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-11-21T07:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bb646e2e20816f4ecfba979138d4b63d847caf1733b8c7437167f34ad74cc8b","abstract_canon_sha256":"dc0d4814e3aaaa819a71f1ef3fed68d11244c78989a50e379cfa65a5d98ac6bd"},"schema_version":"1.0"},"canonical_sha256":"387c989e25f0cf5a6ab29268320c13ec382b65946d00bee96148041e31a42d6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:24.022912Z","signature_b64":"XMzI1c2VJBotgiASavuclsrXtOCULl1M9wjmpYCy6CCKimesGfMIjhEjAKv7JEGkYWcO1woAYunCVTNAtaf+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387c989e25f0cf5a6ab29268320c13ec382b65946d00bee96148041e31a42d6b","last_reissued_at":"2026-05-18T00:29:24.022176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:24.022176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09006","source_version":1,"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:29:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7DFOPiMK1z/3A+UgwHZrziKsyUdJTFOfsYktDPMwghdhCQz0s9/Rtg/cN6O74jle9uqTQSl2lPGyVQ6i5NxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:19:27.264975Z"},"content_sha256":"6cef8df91376ea23fcd78e4f152a71ef50c9859b724dadf5b4e8c0a0f3ed8e44","schema_version":"1.0","event_id":"sha256:6cef8df91376ea23fcd78e4f152a71ef50c9859b724dadf5b4e8c0a0f3ed8e44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HB6JRHRF6DHVU2VSSJUDEDAT5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trilogy on Computing Maximal Eigenpair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Mu-Fa chen","submitted_at":"2017-11-21T07:41:53Z","abstract_excerpt":"The eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair. In the first two steps, we construct efficient initials for a known but dangerous algorithm, first for tridiagonal matrices and then for irreducible matrices, having nonnegative off-diagonal elements. In the third step, we present two global algorithms which are still efficient and work well for a quite large class of matrices, even complex for instance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09006","kind":"arxiv","version":1},"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:29:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEGpzdYTktoOjgE6roE8dHHUJAEwBVTLOd43Yh8nHeweJep6W7oW+gKuu1fvkKYJyzILFjxEI1zQXbI/nwREBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:19:27.265758Z"},"content_sha256":"3c565e592ead21c3f31210a62cf6f643e29d75620f9491c1273d4776ba8f40b3","schema_version":"1.0","event_id":"sha256:3c565e592ead21c3f31210a62cf6f643e29d75620f9491c1273d4776ba8f40b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/bundle.json","state_url":"https://pith.science/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/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-23T20:19:27Z","links":{"resolver":"https://pith.science/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q","bundle":"https://pith.science/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/bundle.json","state":"https://pith.science/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HB6JRHRF6DHVU2VSSJUDEDAT5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HB6JRHRF6DHVU2VSSJUDEDAT5Q","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":"dc0d4814e3aaaa819a71f1ef3fed68d11244c78989a50e379cfa65a5d98ac6bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-11-21T07:41:53Z","title_canon_sha256":"0bb646e2e20816f4ecfba979138d4b63d847caf1733b8c7437167f34ad74cc8b"},"schema_version":"1.0","source":{"id":"1711.09006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09006","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09006v1","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09006","created_at":"2026-05-18T00:29:24Z"},{"alias_kind":"pith_short_12","alias_value":"HB6JRHRF6DHV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HB6JRHRF6DHVU2VS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HB6JRHRF","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:3c565e592ead21c3f31210a62cf6f643e29d75620f9491c1273d4776ba8f40b3","target":"graph","created_at":"2026-05-18T00:29:24Z","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 eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair. In the first two steps, we construct efficient initials for a known but dangerous algorithm, first for tridiagonal matrices and then for irreducible matrices, having nonnegative off-diagonal elements. In the third step, we present two global algorithms which are still efficient and work well for a quite large class of matrices, even complex for instance.","authors_text":"Mu-Fa chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-11-21T07:41:53Z","title":"Trilogy on Computing Maximal Eigenpair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09006","kind":"arxiv","version":1},"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:6cef8df91376ea23fcd78e4f152a71ef50c9859b724dadf5b4e8c0a0f3ed8e44","target":"record","created_at":"2026-05-18T00:29:24Z","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":"dc0d4814e3aaaa819a71f1ef3fed68d11244c78989a50e379cfa65a5d98ac6bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-11-21T07:41:53Z","title_canon_sha256":"0bb646e2e20816f4ecfba979138d4b63d847caf1733b8c7437167f34ad74cc8b"},"schema_version":"1.0","source":{"id":"1711.09006","kind":"arxiv","version":1}},"canonical_sha256":"387c989e25f0cf5a6ab29268320c13ec382b65946d00bee96148041e31a42d6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"387c989e25f0cf5a6ab29268320c13ec382b65946d00bee96148041e31a42d6b","first_computed_at":"2026-05-18T00:29:24.022176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:24.022176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XMzI1c2VJBotgiASavuclsrXtOCULl1M9wjmpYCy6CCKimesGfMIjhEjAKv7JEGkYWcO1woAYunCVTNAtaf+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:24.022912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cef8df91376ea23fcd78e4f152a71ef50c9859b724dadf5b4e8c0a0f3ed8e44","sha256:3c565e592ead21c3f31210a62cf6f643e29d75620f9491c1273d4776ba8f40b3"],"state_sha256":"84ac21010f4ed4dd0d5545cadcbf2cfb831e9404df9aadc6cbcdba24d791594f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vh7zXBjoSkBguwOX7un8dYOkvVslabjIQIy919bHumLTBohx0qZAPCb9yvg0vToR6insSD9b2glcp4uDurw5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:19:27.269737Z","bundle_sha256":"9d7171e10f396ef38455b5a8297f2f86685aac269f01d19bbf6bcb36ed3823e8"}}