{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CRQIITHE6RH6YPORPKPO2SHQBE","short_pith_number":"pith:CRQIITHE","canonical_record":{"source":{"id":"1903.08742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T21:05:42Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"d56b3ad6e0c40001907add385fb5f8c850b4090c1fa4018e7417fe304489252c","abstract_canon_sha256":"cdd9a4fa09e66c87c5301f566dfe245e1c1d5d1928fb69f3a1b3df36e3c5b814"},"schema_version":"1.0"},"canonical_sha256":"1460844ce4f44fec3dd17a9eed48f00904dce7bba998cb9eeb471ccdc2505524","source":{"kind":"arxiv","id":"1903.08742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08742","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08742v1","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08742","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"CRQIITHE6RH6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CRQIITHE6RH6YPOR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CRQIITHE","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CRQIITHE6RH6YPORPKPO2SHQBE","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T21:05:42Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"d56b3ad6e0c40001907add385fb5f8c850b4090c1fa4018e7417fe304489252c","abstract_canon_sha256":"cdd9a4fa09e66c87c5301f566dfe245e1c1d5d1928fb69f3a1b3df36e3c5b814"},"schema_version":"1.0"},"canonical_sha256":"1460844ce4f44fec3dd17a9eed48f00904dce7bba998cb9eeb471ccdc2505524","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:20.498657Z","signature_b64":"YmRPUPMyUIczePr7hScrG/HXUgkJss/uzr0zUHre2aT1w2QJbgCC1mNnfK7jnZFNBeAAffGpAiLTP054zlWkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1460844ce4f44fec3dd17a9eed48f00904dce7bba998cb9eeb471ccdc2505524","last_reissued_at":"2026-05-17T23:42:20.497963Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:20.497963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08742","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-17T23:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYPS7oZECbrBmICW7Q2x2SHA0TJ21ugdLAvP68jbVFmJDeIxX8tkWZ5e2mWv8qYVJ63Pu4OEEHIMCfCDfHFkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:47.222904Z"},"content_sha256":"6dcc8c6fe49cfe046b1af3247f8cdd5a9dac76f0c83fb6795aa7cb0b746659cd","schema_version":"1.0","event_id":"sha256:6dcc8c6fe49cfe046b1af3247f8cdd5a9dac76f0c83fb6795aa7cb0b746659cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CRQIITHE6RH6YPORPKPO2SHQBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Accelerated Power Method for Eigenproblems with Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"math.OC","authors_text":"Mikael Johansson, Vien V. Mai","submitted_at":"2019-03-20T21:05:42Z","abstract_excerpt":"This paper introduces an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex optimization, we develop a simple scalable algorithm with strong theoretical performance guarantees. More precisely, the algorithm retains the simplicity of the well-known power method but enjoys the asymptotic iteration complexity of the powerful Lanczos method. Unlike these classic techniques, our algorithm is designed to decompose the overall problem into a series of subproblems that only need to be solved approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08742","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-17T23:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWd7vwP761as/0od9VxQucIHsHBre1i31KymAD4DaH3y6JUI8vYYqEphP0VONR5i2NhzbqgvTOT1mh2fReQGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:47.223537Z"},"content_sha256":"2319c25a610df4b40c854fd9e60cab9285479bc5de56755c70d76b1dcf2b37f6","schema_version":"1.0","event_id":"sha256:2319c25a610df4b40c854fd9e60cab9285479bc5de56755c70d76b1dcf2b37f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRQIITHE6RH6YPORPKPO2SHQBE/bundle.json","state_url":"https://pith.science/pith/CRQIITHE6RH6YPORPKPO2SHQBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRQIITHE6RH6YPORPKPO2SHQBE/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-06-02T02:04:47Z","links":{"resolver":"https://pith.science/pith/CRQIITHE6RH6YPORPKPO2SHQBE","bundle":"https://pith.science/pith/CRQIITHE6RH6YPORPKPO2SHQBE/bundle.json","state":"https://pith.science/pith/CRQIITHE6RH6YPORPKPO2SHQBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRQIITHE6RH6YPORPKPO2SHQBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CRQIITHE6RH6YPORPKPO2SHQBE","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":"cdd9a4fa09e66c87c5301f566dfe245e1c1d5d1928fb69f3a1b3df36e3c5b814","cross_cats_sorted":["cs.LG","eess.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T21:05:42Z","title_canon_sha256":"d56b3ad6e0c40001907add385fb5f8c850b4090c1fa4018e7417fe304489252c"},"schema_version":"1.0","source":{"id":"1903.08742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08742","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08742v1","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08742","created_at":"2026-05-17T23:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"CRQIITHE6RH6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CRQIITHE6RH6YPOR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CRQIITHE","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:2319c25a610df4b40c854fd9e60cab9285479bc5de56755c70d76b1dcf2b37f6","target":"graph","created_at":"2026-05-17T23:42:20Z","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 an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex optimization, we develop a simple scalable algorithm with strong theoretical performance guarantees. More precisely, the algorithm retains the simplicity of the well-known power method but enjoys the asymptotic iteration complexity of the powerful Lanczos method. Unlike these classic techniques, our algorithm is designed to decompose the overall problem into a series of subproblems that only need to be solved approx","authors_text":"Mikael Johansson, Vien V. Mai","cross_cats":["cs.LG","eess.SP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T21:05:42Z","title":"Noisy Accelerated Power Method for Eigenproblems with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08742","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:6dcc8c6fe49cfe046b1af3247f8cdd5a9dac76f0c83fb6795aa7cb0b746659cd","target":"record","created_at":"2026-05-17T23:42:20Z","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":"cdd9a4fa09e66c87c5301f566dfe245e1c1d5d1928fb69f3a1b3df36e3c5b814","cross_cats_sorted":["cs.LG","eess.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T21:05:42Z","title_canon_sha256":"d56b3ad6e0c40001907add385fb5f8c850b4090c1fa4018e7417fe304489252c"},"schema_version":"1.0","source":{"id":"1903.08742","kind":"arxiv","version":1}},"canonical_sha256":"1460844ce4f44fec3dd17a9eed48f00904dce7bba998cb9eeb471ccdc2505524","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1460844ce4f44fec3dd17a9eed48f00904dce7bba998cb9eeb471ccdc2505524","first_computed_at":"2026-05-17T23:42:20.497963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:20.497963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmRPUPMyUIczePr7hScrG/HXUgkJss/uzr0zUHre2aT1w2QJbgCC1mNnfK7jnZFNBeAAffGpAiLTP054zlWkBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:20.498657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dcc8c6fe49cfe046b1af3247f8cdd5a9dac76f0c83fb6795aa7cb0b746659cd","sha256:2319c25a610df4b40c854fd9e60cab9285479bc5de56755c70d76b1dcf2b37f6"],"state_sha256":"5d479105e8c0b848d81191bfad3dbf04597a31df5a9b4273bfde0beddfd7ece9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79UNXYQIijhkbwQ8Lfkmi+qH+gRCsWiSqI4eU3GwwkM50l0anQ3rO/pBrTrAFVfkLzNc6oeHq5DmesyHS6bGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:04:47.226281Z","bundle_sha256":"767c23abea26957bc601c4077ca0ba7e37edaa72c391be7e085415df140bd2f5"}}