{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WIP57T64JNY7ZK32I65YV3QQTV","short_pith_number":"pith:WIP57T64","schema_version":"1.0","canonical_sha256":"b21fdfcfdc4b71fcab7a47bb8aee109d770c200494c7e586b046fa09d1cd82fa","source":{"kind":"arxiv","id":"1706.07584","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.07584","created_at":"2026-05-18T00:41:48.718640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07584v1","created_at":"2026-05-18T00:41:48.718640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07584","created_at":"2026-05-18T00:41:48.718640+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIP57T64JNY7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIP57T64JNY7ZK32","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIP57T64","created_at":"2026-05-18T12:31:53.515858+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/WIP57T64JNY7ZK32I65YV3QQTV","json":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV.json","graph_json":"https://pith.science/api/pith-number/WIP57T64JNY7ZK32I65YV3QQTV/graph.json","events_json":"https://pith.science/api/pith-number/WIP57T64JNY7ZK32I65YV3QQTV/events.json","paper":"https://pith.science/paper/WIP57T64"},"agent_actions":{"view_html":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV","download_json":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV.json","view_paper":"https://pith.science/paper/WIP57T64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07584&json=true","fetch_graph":"https://pith.science/api/pith-number/WIP57T64JNY7ZK32I65YV3QQTV/graph.json","fetch_events":"https://pith.science/api/pith-number/WIP57T64JNY7ZK32I65YV3QQTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/action/storage_attestation","attest_author":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/action/author_attestation","sign_citation":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/action/citation_signature","submit_replication":"https://pith.science/pith/WIP57T64JNY7ZK32I65YV3QQTV/action/replication_record"}},"created_at":"2026-05-18T00:41:48.718640+00:00","updated_at":"2026-05-18T00:41:48.718640+00:00"}