{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WATR4FH52Y3A4A62F2HPPUFCCT","short_pith_number":"pith:WATR4FH5","canonical_record":{"source":{"id":"1609.00670","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-02T17:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"ae75e5f3bb07550caf0e2357ceedad40f65cf619380e3f048e1b1ab3d9cf8070","abstract_canon_sha256":"1242a30994c53efabf9e928b2deefd9a5bd95941de53336e9e50f3d50cad2538"},"schema_version":"1.0"},"canonical_sha256":"b0271e14fdd6360e03da2e8ef7d0a214e288a9460e8cc24bd9e6f087ce4b729f","source":{"kind":"arxiv","id":"1609.00670","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00670","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00670v3","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00670","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"WATR4FH52Y3A","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WATR4FH52Y3A4A62","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WATR4FH5","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WATR4FH52Y3A4A62F2HPPUFCCT","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00670","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-02T17:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"ae75e5f3bb07550caf0e2357ceedad40f65cf619380e3f048e1b1ab3d9cf8070","abstract_canon_sha256":"1242a30994c53efabf9e928b2deefd9a5bd95941de53336e9e50f3d50cad2538"},"schema_version":"1.0"},"canonical_sha256":"b0271e14fdd6360e03da2e8ef7d0a214e288a9460e8cc24bd9e6f087ce4b729f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.919372Z","signature_b64":"oIneUP7G0iOqqY+WOwwiLojaBv+d9dySRwrMO0erq36ec2+oN0v7BbsB0W07SP6Ufd3dJDJ43WzJjJaSCa2cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0271e14fdd6360e03da2e8ef7d0a214e288a9460e8cc24bd9e6f087ce4b729f","last_reissued_at":"2026-05-18T00:09:05.918819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.918819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00670","source_version":3,"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tI0ABuY9qR0bbSM/9DcklVPssiWZxFYMAg/32rlVEyw9DOZjrdSrIdkZxmlvPUaEIHVVncSf+yeS88kBdEbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:22.282728Z"},"content_sha256":"9ef66391755a73a400e53754148d19f07da6c71fe1ad4b6959c703cccfad5c1d","schema_version":"1.0","event_id":"sha256:9ef66391755a73a400e53754148d19f07da6c71fe1ad4b6959c703cccfad5c1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WATR4FH52Y3A4A62F2HPPUFCCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An EM based Iterative Method for Solving Large Sparse Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Minwoo Chae, Stephen G. Walker","submitted_at":"2016-09-02T17:20:08Z","abstract_excerpt":"We propose a novel iterative algorithm for solving a large sparse linear system. The method is based on the EM algorithm. If the system has a unique solution, the algorithm guarantees convergence with a geometric rate. Otherwise, convergence to a minimal Kullback--Leibler divergence point is guaranteed. The algorithm is easy to code and competitive with other iterative algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00670","kind":"arxiv","version":3},"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juUQwZYRORFd7bAvPOhIy8GPIyKYa9ULH8X5s+jvfUwqI7fKhV+SbM9zh0rX96Dg1Kuc5pov7QS3U8ssI2GpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:22.283480Z"},"content_sha256":"00baf65874c674a3952816aaf332949d635c9f68a6937cfec00e969c3132b0c2","schema_version":"1.0","event_id":"sha256:00baf65874c674a3952816aaf332949d635c9f68a6937cfec00e969c3132b0c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WATR4FH52Y3A4A62F2HPPUFCCT/bundle.json","state_url":"https://pith.science/pith/WATR4FH52Y3A4A62F2HPPUFCCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WATR4FH52Y3A4A62F2HPPUFCCT/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-10T01:12:22Z","links":{"resolver":"https://pith.science/pith/WATR4FH52Y3A4A62F2HPPUFCCT","bundle":"https://pith.science/pith/WATR4FH52Y3A4A62F2HPPUFCCT/bundle.json","state":"https://pith.science/pith/WATR4FH52Y3A4A62F2HPPUFCCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WATR4FH52Y3A4A62F2HPPUFCCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WATR4FH52Y3A4A62F2HPPUFCCT","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":"1242a30994c53efabf9e928b2deefd9a5bd95941de53336e9e50f3d50cad2538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-02T17:20:08Z","title_canon_sha256":"ae75e5f3bb07550caf0e2357ceedad40f65cf619380e3f048e1b1ab3d9cf8070"},"schema_version":"1.0","source":{"id":"1609.00670","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00670","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00670v3","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00670","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"WATR4FH52Y3A","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WATR4FH52Y3A4A62","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WATR4FH5","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:00baf65874c674a3952816aaf332949d635c9f68a6937cfec00e969c3132b0c2","target":"graph","created_at":"2026-05-18T00:09:05Z","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":"We propose a novel iterative algorithm for solving a large sparse linear system. The method is based on the EM algorithm. If the system has a unique solution, the algorithm guarantees convergence with a geometric rate. Otherwise, convergence to a minimal Kullback--Leibler divergence point is guaranteed. The algorithm is easy to code and competitive with other iterative algorithms.","authors_text":"Minwoo Chae, Stephen G. Walker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-02T17:20:08Z","title":"An EM based Iterative Method for Solving Large Sparse Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00670","kind":"arxiv","version":3},"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:9ef66391755a73a400e53754148d19f07da6c71fe1ad4b6959c703cccfad5c1d","target":"record","created_at":"2026-05-18T00:09:05Z","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":"1242a30994c53efabf9e928b2deefd9a5bd95941de53336e9e50f3d50cad2538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-02T17:20:08Z","title_canon_sha256":"ae75e5f3bb07550caf0e2357ceedad40f65cf619380e3f048e1b1ab3d9cf8070"},"schema_version":"1.0","source":{"id":"1609.00670","kind":"arxiv","version":3}},"canonical_sha256":"b0271e14fdd6360e03da2e8ef7d0a214e288a9460e8cc24bd9e6f087ce4b729f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0271e14fdd6360e03da2e8ef7d0a214e288a9460e8cc24bd9e6f087ce4b729f","first_computed_at":"2026-05-18T00:09:05.918819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:05.918819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oIneUP7G0iOqqY+WOwwiLojaBv+d9dySRwrMO0erq36ec2+oN0v7BbsB0W07SP6Ufd3dJDJ43WzJjJaSCa2cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:05.919372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00670","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ef66391755a73a400e53754148d19f07da6c71fe1ad4b6959c703cccfad5c1d","sha256:00baf65874c674a3952816aaf332949d635c9f68a6937cfec00e969c3132b0c2"],"state_sha256":"0376120520ef19e0421357327539888f1e1c016d8a6bb7d95e43591960949346"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8x7moqvKkTzKIWM9CdZW1uOLf2BGNf4ffhCPnFPuLbUWyBZGcXPJGOHcPv3dgZHfgqF2C6YPUHaG6Cy3Gz+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:12:22.287779Z","bundle_sha256":"d7aff2f96dbe4666e29785b06b410321e31c35982abb8e0a1c5906cbae54d468"}}