{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EMY3PR7XOQ5AJBM5LYKDF3UKLR","short_pith_number":"pith:EMY3PR7X","canonical_record":{"source":{"id":"1511.07694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-24T13:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"e39f14076b041ac606f8ce04e3f7aea966ffa401cdb595f2d408503fcc6d9f4a","abstract_canon_sha256":"6f39dabe31ec71cea1ad6af88352853cf5b1b4842b6b7db9a267aa7112a4429e"},"schema_version":"1.0"},"canonical_sha256":"2331b7c7f7743a04859d5e1432ee8a5c43ff3f8804c0a6d59778fa248168ded0","source":{"kind":"arxiv","id":"1511.07694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07694","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07694v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07694","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"EMY3PR7XOQ5A","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMY3PR7XOQ5AJBM5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMY3PR7X","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EMY3PR7XOQ5AJBM5LYKDF3UKLR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-24T13:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"e39f14076b041ac606f8ce04e3f7aea966ffa401cdb595f2d408503fcc6d9f4a","abstract_canon_sha256":"6f39dabe31ec71cea1ad6af88352853cf5b1b4842b6b7db9a267aa7112a4429e"},"schema_version":"1.0"},"canonical_sha256":"2331b7c7f7743a04859d5e1432ee8a5c43ff3f8804c0a6d59778fa248168ded0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.948874Z","signature_b64":"vw/VmO46NlzC1porSRifNcq11vNTIzThmgMobircasV+Qd7JKyj9mmyAULQeWydXfkYAQQ2afcM6LJf7Fw+8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2331b7c7f7743a04859d5e1432ee8a5c43ff3f8804c0a6d59778fa248168ded0","last_reissued_at":"2026-05-18T01:26:03.948226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.948226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07694","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-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+BEEVSDJkKlbF1RDyiyxDwOLdstIeGR+k5Gnh3nEby1ZL0cWTCNqcIioV/uzaBwJzPXcrQPtST3gFsWmdb3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:30:24.270674Z"},"content_sha256":"3bf677b5d50753fc83065978e1ed59daedc818e3647e8fd2f727c31f30281a3a","schema_version":"1.0","event_id":"sha256:3bf677b5d50753fc83065978e1ed59daedc818e3647e8fd2f727c31f30281a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EMY3PR7XOQ5AJBM5LYKDF3UKLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometrical inverse preconditioning for symmetric positive definite matrices","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":"2015-11-24T13:20:47Z","abstract_excerpt":"We focus on inverse preconditioners based on minimizing $F(X) = 1-\\cos(XA,I)$, where $XA$ is the preconditioned matrix\n  and $A$ is symmetric and positive definite. We present and analyze gradient-type methods to minimize $F(X)$\n  on a suitable compact set. For that we use the geometrical properties of the non-polyhedral\n  cone of symmetric and positive definite matrices, and also the special properties of $F(X)$ on the feasible set.\n  Preliminary and encouraging numerical results are also presented\n  in which dense and sparse approximations are included."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07694","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-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKUGzbdQidcTLVvTEJk1QtgADeyoE6Z7XrmggS6WihRHRAVfzfDRmkNjkzkjLNZho2TppEi9Hl7vAJjRY/5gCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:30:24.271018Z"},"content_sha256":"1967314618e842c759133f8e6ac596760aec9531415404745c0745d350ff3f90","schema_version":"1.0","event_id":"sha256:1967314618e842c759133f8e6ac596760aec9531415404745c0745d350ff3f90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/bundle.json","state_url":"https://pith.science/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/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-26T02:30:24Z","links":{"resolver":"https://pith.science/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR","bundle":"https://pith.science/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/bundle.json","state":"https://pith.science/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMY3PR7XOQ5AJBM5LYKDF3UKLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EMY3PR7XOQ5AJBM5LYKDF3UKLR","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":"6f39dabe31ec71cea1ad6af88352853cf5b1b4842b6b7db9a267aa7112a4429e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-24T13:20:47Z","title_canon_sha256":"e39f14076b041ac606f8ce04e3f7aea966ffa401cdb595f2d408503fcc6d9f4a"},"schema_version":"1.0","source":{"id":"1511.07694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07694","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07694v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07694","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"EMY3PR7XOQ5A","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMY3PR7XOQ5AJBM5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMY3PR7X","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:1967314618e842c759133f8e6ac596760aec9531415404745c0745d350ff3f90","target":"graph","created_at":"2026-05-18T01:26:03Z","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 focus on inverse preconditioners based on minimizing $F(X) = 1-\\cos(XA,I)$, where $XA$ is the preconditioned matrix\n  and $A$ is symmetric and positive definite. We present and analyze gradient-type methods to minimize $F(X)$\n  on a suitable compact set. For that we use the geometrical properties of the non-polyhedral\n  cone of symmetric and positive definite matrices, and also the special properties of $F(X)$ on the feasible set.\n  Preliminary and encouraging numerical results are also presented\n  in which dense and sparse approximations are included.","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":"2015-11-24T13:20:47Z","title":"Geometrical inverse preconditioning for symmetric positive definite matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07694","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:3bf677b5d50753fc83065978e1ed59daedc818e3647e8fd2f727c31f30281a3a","target":"record","created_at":"2026-05-18T01:26:03Z","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":"6f39dabe31ec71cea1ad6af88352853cf5b1b4842b6b7db9a267aa7112a4429e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-24T13:20:47Z","title_canon_sha256":"e39f14076b041ac606f8ce04e3f7aea966ffa401cdb595f2d408503fcc6d9f4a"},"schema_version":"1.0","source":{"id":"1511.07694","kind":"arxiv","version":1}},"canonical_sha256":"2331b7c7f7743a04859d5e1432ee8a5c43ff3f8804c0a6d59778fa248168ded0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2331b7c7f7743a04859d5e1432ee8a5c43ff3f8804c0a6d59778fa248168ded0","first_computed_at":"2026-05-18T01:26:03.948226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:03.948226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vw/VmO46NlzC1porSRifNcq11vNTIzThmgMobircasV+Qd7JKyj9mmyAULQeWydXfkYAQQ2afcM6LJf7Fw+8Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:03.948874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf677b5d50753fc83065978e1ed59daedc818e3647e8fd2f727c31f30281a3a","sha256:1967314618e842c759133f8e6ac596760aec9531415404745c0745d350ff3f90"],"state_sha256":"babe1cb7832cb5f24a927d903cc810086ccecf08abb217f73eb2952f23aa8e45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btkaC7ReuJWFULUmuKhAIpLKTINnnnbUkuYUZ/J4iI/Ke2eAK665xLHtSpzWeD7ESuFT9Qlgr/XJaSe5hKZkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:30:24.273198Z","bundle_sha256":"bc6c3889e6eec2063f2e9ea84b4f2c2c133918051ba636fd312dadd797699d10"}}