{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WIP57T64JNY7ZK32I65YV3QQTV","short_pith_number":"pith:WIP57T64","canonical_record":{"source":{"id":"1706.07584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-23T07:03:45Z","cross_cats_sorted":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"title_canon_sha256":"723a7db63f7010fd6319ccf9f53874b7a41af9676592921c852d0136e346ba41","abstract_canon_sha256":"ac98ed5f63d0e8b51d1310937e0cda4e32a4adb16bcbe8359f0e2e38a944f5e1"},"schema_version":"1.0"},"canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","source":{"kind":"arxiv","id":"1706.07584","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07584","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07584v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07584","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"WIP57T64JNY7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WIP57T64JNY7ZK32","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WIP57T64","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WIP57T64JNY7ZK32I65YV3QQTV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-23T07:03:45Z","cross_cats_sorted":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"title_canon_sha256":"723a7db63f7010fd6319ccf9f53874b7a41af9676592921c852d0136e346ba41","abstract_canon_sha256":"ac98ed5f63d0e8b51d1310937e0cda4e32a4adb16bcbe8359f0e2e38a944f5e1"},"schema_version":"1.0"},"canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.719072Z","signature_b64":"h4pv89uboeOalKKkFhMQgASDqRKvZpKD8nbtpO7VVj0e+o0NW2YfNqMEtOXBjOa8kJgPqLb1iL10/Vq0sdTdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","last_reissued_at":"2026-05-18T00:41:48.718561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.718561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07584","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:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rTqr9ywcVkROWlZaQdHQTStPR5FS6+qIgLS84RPx9ACmN21SvRbnAmKgFhKVSejKI+EkJnCAI6oAGOJ83A0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:00:55.722729Z"},"content_sha256":"03eb0153b60c54ea72a36206fa6c527cfa9dd54324a66441c0579d39d6c4fdf1","schema_version":"1.0","event_id":"sha256:03eb0153b60c54ea72a36206fa6c527cfa9dd54324a66441c0579d39d6c4fdf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WIP57T64JNY7ZK32I65YV3QQTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global algorithms for maximal eigenpair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Mu-Fa chen","submitted_at":"2017-06-23T07:03:45Z","abstract_excerpt":"This paper is a continuation of \\ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements. This paper introduces two global algorithms for computing the maximal eigenpair in a rather general setup, including even a class of real (with some negative off-diagonal elements) or complex matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07584","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:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1lLG406zRNjEahJKo6jczMzYm46qzbs06rlgJXt7WonmPMkZ9zdrzcVagodzFpkLh1g8xmmUIjHNngp+yeFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:00:55.723358Z"},"content_sha256":"d9f603a0ca5e203554eacf2a3c3f2a72b9b223f0bb2c4c06a69ee021f61e8edd","schema_version":"1.0","event_id":"sha256:d9f603a0ca5e203554eacf2a3c3f2a72b9b223f0bb2c4c06a69ee021f61e8edd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/bundle.json","state_url":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIP57T64JNY7ZK32I65YV3QQTV/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-23T18:00:55Z","links":{"resolver":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV","bundle":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/bundle.json","state":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIP57T64JNY7ZK32I65YV3QQTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WIP57T64JNY7ZK32I65YV3QQTV","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":"ac98ed5f63d0e8b51d1310937e0cda4e32a4adb16bcbe8359f0e2e38a944f5e1","cross_cats_sorted":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-23T07:03:45Z","title_canon_sha256":"723a7db63f7010fd6319ccf9f53874b7a41af9676592921c852d0136e346ba41"},"schema_version":"1.0","source":{"id":"1706.07584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07584","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07584v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07584","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"WIP57T64JNY7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WIP57T64JNY7ZK32","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WIP57T64","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:d9f603a0ca5e203554eacf2a3c3f2a72b9b223f0bb2c4c06a69ee021f61e8edd","target":"graph","created_at":"2026-05-18T00:41:48Z","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":"This paper is a continuation of \\ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements. This paper introduces two global algorithms for computing the maximal eigenpair in a rather general setup, including even a class of real (with some negative off-diagonal elements) or complex matrices.","authors_text":"Mu-Fa chen","cross_cats":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-23T07:03:45Z","title":"Global algorithms for maximal eigenpair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07584","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:03eb0153b60c54ea72a36206fa6c527cfa9dd54324a66441c0579d39d6c4fdf1","target":"record","created_at":"2026-05-18T00:41:48Z","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":"ac98ed5f63d0e8b51d1310937e0cda4e32a4adb16bcbe8359f0e2e38a944f5e1","cross_cats_sorted":["math.NA","math.OC","math.SP","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-23T07:03:45Z","title_canon_sha256":"723a7db63f7010fd6319ccf9f53874b7a41af9676592921c852d0136e346ba41"},"schema_version":"1.0","source":{"id":"1706.07584","kind":"arxiv","version":1}},"canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","first_computed_at":"2026-05-18T00:41:48.718561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:48.718561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4pv89uboeOalKKkFhMQgASDqRKvZpKD8nbtpO7VVj0e+o0NW2YfNqMEtOXBjOa8kJgPqLb1iL10/Vq0sdTdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:48.719072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03eb0153b60c54ea72a36206fa6c527cfa9dd54324a66441c0579d39d6c4fdf1","sha256:d9f603a0ca5e203554eacf2a3c3f2a72b9b223f0bb2c4c06a69ee021f61e8edd"],"state_sha256":"8d4298a7e25f9b4cba5f67c1b53c114405ce8a1aa42b9671011b1f46c4da58aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxbGadmXI6BLW9sv1olzBd+DnG/NGtvIH5ShES9YyKx9B0GyfPIwXo5ANLU/AUm/p7AgLiLvJxi5o1U5mEWqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T18:00:55.728918Z","bundle_sha256":"2d2c72f17f941f738b3a35d94641f20d09d8d8abf25b330a63ea127355257bea"}}