{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2CQKWXCXFUFPY2PIXJGXQP7ARL","short_pith_number":"pith:2CQKWXCX","canonical_record":{"source":{"id":"1609.01358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-06T01:00:19Z","cross_cats_sorted":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"title_canon_sha256":"5ea4f910ca0b1854522ad4a89edb4d363dbcb7caa37e8b3c0c465699702626b3","abstract_canon_sha256":"78b9c16d02a60ad5c9fde263af5d0e27411db3a97dac0054a5c8209896787149"},"schema_version":"1.0"},"canonical_sha256":"d0a0ab5c572d0afc69e8ba4d783fe08aff2599f461680d2df1c373ecec4d216c","source":{"kind":"arxiv","id":"1609.01358","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01358","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01358v2","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01358","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"2CQKWXCXFUFP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2CQKWXCXFUFPY2PI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2CQKWXCX","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2CQKWXCXFUFPY2PIXJGXQP7ARL","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-06T01:00:19Z","cross_cats_sorted":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"title_canon_sha256":"5ea4f910ca0b1854522ad4a89edb4d363dbcb7caa37e8b3c0c465699702626b3","abstract_canon_sha256":"78b9c16d02a60ad5c9fde263af5d0e27411db3a97dac0054a5c8209896787149"},"schema_version":"1.0"},"canonical_sha256":"d0a0ab5c572d0afc69e8ba4d783fe08aff2599f461680d2df1c373ecec4d216c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:26.155854Z","signature_b64":"/9qNFhFDufu9kmaekG8VUUPRNg3hDD4IrERJiZfpMNwlYfxMkV3Bx1krfbE6Bg5zm76sTNWNKmuzbBLWzgIQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a0ab5c572d0afc69e8ba4d783fe08aff2599f461680d2df1c373ecec4d216c","last_reissued_at":"2026-05-18T00:57:26.155162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:26.155162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01358","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Uv+A8+HEv3vebhTlfshPIb1GyjgvR2LCta8FkBqLqsd/So5AR4lxSwh2GJCPUbFMh3XEmPC2RzWUuL28zdmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:33.185399Z"},"content_sha256":"13da9537d470f315beaeda582a099f6050cf4d213e6301a1c9f2559e86442307","schema_version":"1.0","event_id":"sha256:13da9537d470f315beaeda582a099f6050cf4d213e6301a1c9f2559e86442307"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2CQKWXCXFUFPY2PIXJGXQP7ARL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient initials for computing maximal eigenpair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"primary_cat":"math.PR","authors_text":"Mu-Fa chen","submitted_at":"2016-09-06T01:00:19Z","abstract_excerpt":"This paper introduces some efficient initials for a well-known algorithm (an inverse iteration) for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01358","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:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHMVWAHCmFWkAemUI1KCmrbHEH9JpWYR91ZE8rZ+a5ddbOz0hUwHjY3hr4anpQU/QnKlGNtIDtYItvlQLkWnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:33.186075Z"},"content_sha256":"c39ff9fc4539aa5bf4318bdf3847d45dd7b2d24806be29c823ef8b041630adf7","schema_version":"1.0","event_id":"sha256:c39ff9fc4539aa5bf4318bdf3847d45dd7b2d24806be29c823ef8b041630adf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/bundle.json","state_url":"https://pith.science/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/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-24T00:14:33Z","links":{"resolver":"https://pith.science/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL","bundle":"https://pith.science/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/bundle.json","state":"https://pith.science/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CQKWXCXFUFPY2PIXJGXQP7ARL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2CQKWXCXFUFPY2PIXJGXQP7ARL","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":"78b9c16d02a60ad5c9fde263af5d0e27411db3a97dac0054a5c8209896787149","cross_cats_sorted":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-06T01:00:19Z","title_canon_sha256":"5ea4f910ca0b1854522ad4a89edb4d363dbcb7caa37e8b3c0c465699702626b3"},"schema_version":"1.0","source":{"id":"1609.01358","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01358","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01358v2","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01358","created_at":"2026-05-18T00:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"2CQKWXCXFUFP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2CQKWXCXFUFPY2PI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2CQKWXCX","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:c39ff9fc4539aa5bf4318bdf3847d45dd7b2d24806be29c823ef8b041630adf7","target":"graph","created_at":"2026-05-18T00:57:26Z","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 introduces some efficient initials for a well-known algorithm (an inverse iteration) for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied.","authors_text":"Mu-Fa chen","cross_cats":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-06T01:00:19Z","title":"Efficient initials for computing maximal eigenpair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01358","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:13da9537d470f315beaeda582a099f6050cf4d213e6301a1c9f2559e86442307","target":"record","created_at":"2026-05-18T00:57:26Z","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":"78b9c16d02a60ad5c9fde263af5d0e27411db3a97dac0054a5c8209896787149","cross_cats_sorted":["cs.IT","math.IT","math.NA","math.OC","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-06T01:00:19Z","title_canon_sha256":"5ea4f910ca0b1854522ad4a89edb4d363dbcb7caa37e8b3c0c465699702626b3"},"schema_version":"1.0","source":{"id":"1609.01358","kind":"arxiv","version":2}},"canonical_sha256":"d0a0ab5c572d0afc69e8ba4d783fe08aff2599f461680d2df1c373ecec4d216c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0a0ab5c572d0afc69e8ba4d783fe08aff2599f461680d2df1c373ecec4d216c","first_computed_at":"2026-05-18T00:57:26.155162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:26.155162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/9qNFhFDufu9kmaekG8VUUPRNg3hDD4IrERJiZfpMNwlYfxMkV3Bx1krfbE6Bg5zm76sTNWNKmuzbBLWzgIQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:26.155854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01358","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13da9537d470f315beaeda582a099f6050cf4d213e6301a1c9f2559e86442307","sha256:c39ff9fc4539aa5bf4318bdf3847d45dd7b2d24806be29c823ef8b041630adf7"],"state_sha256":"3640293c4e73234abb0e66fff2e576225aebbeb3ca73a3a7e6dd099dc6076bdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngpVfDstcSG4BI8QLBgm+JOTkeKiAsfKVVIl04qMzPL3yA+yi4/AH4mjLGCWuF7wW6mYP4JolEBTTpBll+ZrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:14:33.189908Z","bundle_sha256":"0dc1942a1044c986fdde308ccfa0ebf2fed0fe5b6b8503f271da4f4860cd0711"}}