{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KDUOU5TIQX7WQDCP366SWZXWDB","short_pith_number":"pith:KDUOU5TI","canonical_record":{"source":{"id":"1902.08388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"0bfbb00378b9333001f7cbbe96127d82b91c4e09fdd1fa514cada075b3e17ba1","abstract_canon_sha256":"d58060af962839d344f42fbf1e46ba6e9c29c323996f516a68deaab783ae547f"},"schema_version":"1.0"},"canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","source":{"kind":"arxiv","id":"1902.08388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08388","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08388v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08388","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"KDUOU5TIQX7W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KDUOU5TIQX7WQDCP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KDUOU5TI","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KDUOU5TIQX7WQDCP366SWZXWDB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"0bfbb00378b9333001f7cbbe96127d82b91c4e09fdd1fa514cada075b3e17ba1","abstract_canon_sha256":"d58060af962839d344f42fbf1e46ba6e9c29c323996f516a68deaab783ae547f"},"schema_version":"1.0"},"canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.408522Z","signature_b64":"ev+XCOMZVYXUY69SQR6ry7JaPHGo34ANJ1dz3FKpf3ge7eDkq/1gm+lYBO0tpnA1vkvhiYcHT+Qpo1F8tMllBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","last_reissued_at":"2026-05-17T23:52:57.407976Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.407976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08388","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCAUDmwzBRTiX5U8TOVtz7bEoKkJ35fK3UqOTo68ot9QvZwN0L8XpbJwpFFVLQwcT1EVyaC2YV2YTbVpyjLiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:08:05.130689Z"},"content_sha256":"f84219a7da957625537de2f32f6d2786b35801040c133545aba93293dbd60cfb","schema_version":"1.0","event_id":"sha256:f84219a7da957625537de2f32f6d2786b35801040c133545aba93293dbd60cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KDUOU5TIQX7WQDCP366SWZXWDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometrical inverse matrix approximation for least-squares problems and acceleration strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jean-Paul Chehab, Marcos Raydan","submitted_at":"2019-02-22T08:06:20Z","abstract_excerpt":"We extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate inverse. In particular, we adapt the recently published simplified gradient-type iterative scheme MinCos to the least-squares scenario. In addition, we combine the generated convergent sequence of matrices with well-known acceleration strategies based on recently developed matrix extrapolation methods, and also with some deterministic and heuristic accelera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08388","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaljHIZmXsJjfUvQU4hLtLaKW2XZRP0tBOvkaFcyNxliaxZaHbUKSes8CumIjkCmx1tGWs56TIwqPzURywWEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:08:05.131044Z"},"content_sha256":"2a68405f30fd1268dc915a9c940ccfcf55078673f9fcfeeba65e190177c8e168","schema_version":"1.0","event_id":"sha256:2a68405f30fd1268dc915a9c940ccfcf55078673f9fcfeeba65e190177c8e168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/bundle.json","state_url":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDUOU5TIQX7WQDCP366SWZXWDB/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-26T01:08:05Z","links":{"resolver":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB","bundle":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/bundle.json","state":"https://pith.science/pith/KDUOU5TIQX7WQDCP366SWZXWDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDUOU5TIQX7WQDCP366SWZXWDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KDUOU5TIQX7WQDCP366SWZXWDB","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":"d58060af962839d344f42fbf1e46ba6e9c29c323996f516a68deaab783ae547f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","title_canon_sha256":"0bfbb00378b9333001f7cbbe96127d82b91c4e09fdd1fa514cada075b3e17ba1"},"schema_version":"1.0","source":{"id":"1902.08388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08388","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08388v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08388","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"KDUOU5TIQX7W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KDUOU5TIQX7WQDCP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KDUOU5TI","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2a68405f30fd1268dc915a9c940ccfcf55078673f9fcfeeba65e190177c8e168","target":"graph","created_at":"2026-05-17T23:52:57Z","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 extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate inverse. In particular, we adapt the recently published simplified gradient-type iterative scheme MinCos to the least-squares scenario. In addition, we combine the generated convergent sequence of matrices with well-known acceleration strategies based on recently developed matrix extrapolation methods, and also with some deterministic and heuristic accelera","authors_text":"Jean-Paul Chehab, Marcos Raydan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","title":"Geometrical inverse matrix approximation for least-squares problems and acceleration strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08388","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:f84219a7da957625537de2f32f6d2786b35801040c133545aba93293dbd60cfb","target":"record","created_at":"2026-05-17T23:52:57Z","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":"d58060af962839d344f42fbf1e46ba6e9c29c323996f516a68deaab783ae547f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-22T08:06:20Z","title_canon_sha256":"0bfbb00378b9333001f7cbbe96127d82b91c4e09fdd1fa514cada075b3e17ba1"},"schema_version":"1.0","source":{"id":"1902.08388","kind":"arxiv","version":1}},"canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e8ea766885ff680c4fdfbd2b66f6187ddc411586aad1bbc30688d4a9df58e7","first_computed_at":"2026-05-17T23:52:57.407976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:57.407976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ev+XCOMZVYXUY69SQR6ry7JaPHGo34ANJ1dz3FKpf3ge7eDkq/1gm+lYBO0tpnA1vkvhiYcHT+Qpo1F8tMllBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:57.408522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f84219a7da957625537de2f32f6d2786b35801040c133545aba93293dbd60cfb","sha256:2a68405f30fd1268dc915a9c940ccfcf55078673f9fcfeeba65e190177c8e168"],"state_sha256":"104100158e736e043f39a2261eae7c1d26a79a8e5b3ef17c8854279ec245fda8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ch9tD0bYRCiPw4rDrUkgrHva3l97DWzgBB0uE0RXUtYRhf8ZTr5WxNdfv/J4r5pTvTmR6N6KdAjqm/ytq/mQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:08:05.132961Z","bundle_sha256":"7a41341459b914605aaa6f13b06783f5f79d5dda375c12499feaf1b98404de29"}}