{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VCHZGFPJAMNV6ERYY7CRMKRLAU","short_pith_number":"pith:VCHZGFPJ","canonical_record":{"source":{"id":"1611.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T20:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"1df3f77c254f769adf5202cf4ebfa081843414aff4099b51bb76f32206d978d9","abstract_canon_sha256":"3c9b8305c981e3927f520af507af277b4189bdfe36b4f8effcd7a5ec90afe4ca"},"schema_version":"1.0"},"canonical_sha256":"a88f9315e9031b5f1238c7c5162a2b0508983b6ae1816e359d401bdd2e59f7e6","source":{"kind":"arxiv","id":"1611.03893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03893","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03893v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03893","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"VCHZGFPJAMNV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VCHZGFPJAMNV6ERY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VCHZGFPJ","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VCHZGFPJAMNV6ERYY7CRMKRLAU","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T20:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"1df3f77c254f769adf5202cf4ebfa081843414aff4099b51bb76f32206d978d9","abstract_canon_sha256":"3c9b8305c981e3927f520af507af277b4189bdfe36b4f8effcd7a5ec90afe4ca"},"schema_version":"1.0"},"canonical_sha256":"a88f9315e9031b5f1238c7c5162a2b0508983b6ae1816e359d401bdd2e59f7e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:18.132055Z","signature_b64":"mhlwSAqubInjK3fVuxOHhCQDtZudoL0yvMdMoZPcXKTgXXndQgARyfkQQcR7Z1H0ui7YR7qwe3SxSzTF0YXDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88f9315e9031b5f1238c7c5162a2b0508983b6ae1816e359d401bdd2e59f7e6","last_reissued_at":"2026-05-18T00:59:18.131373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:18.131373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03893","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aYDkeBIqYKceRQr6XkbeoLVVdNrmqFu934HN6SgSfNDwgrmqRg28+5jiSyX/CPM8N3D1juSru4n5ZOkQd7aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:25.225639Z"},"content_sha256":"df3a0a4d8cab137aabcade11de06cc058124a119b37071e2816420a38333406e","schema_version":"1.0","event_id":"sha256:df3a0a4d8cab137aabcade11de06cc058124a119b37071e2816420a38333406e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VCHZGFPJAMNV6ERYY7CRMKRLAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation operators for matrix-valued functions based on matrix decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Nira Dyn, Nir Sharon, Uri Itai","submitted_at":"2016-11-03T20:17:58Z","abstract_excerpt":"Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the structure of the matrices in the samples set, and based on decomposition theorems. We introduce our approach in detail and discuss its advantages using a few examples. In addition, we provide basic tools for analyzing properties of the matrix functions generated by our approximation operators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03893","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-18T00:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olp+F1RH+f1J5ItBIHqPg8CGid4+0ZradZEobxXvGv+c6eyVVy0j/hDFHhEEDD3OrhxJwoclupwrXZzYSf8GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:01:25.225977Z"},"content_sha256":"2e3b07687906a85526806b42f62619305a9b305d78ffda3e77be82aad9faf6c5","schema_version":"1.0","event_id":"sha256:2e3b07687906a85526806b42f62619305a9b305d78ffda3e77be82aad9faf6c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/bundle.json","state_url":"https://pith.science/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/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-09T16:01:25Z","links":{"resolver":"https://pith.science/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU","bundle":"https://pith.science/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/bundle.json","state":"https://pith.science/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCHZGFPJAMNV6ERYY7CRMKRLAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VCHZGFPJAMNV6ERYY7CRMKRLAU","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":"3c9b8305c981e3927f520af507af277b4189bdfe36b4f8effcd7a5ec90afe4ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T20:17:58Z","title_canon_sha256":"1df3f77c254f769adf5202cf4ebfa081843414aff4099b51bb76f32206d978d9"},"schema_version":"1.0","source":{"id":"1611.03893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03893","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03893v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03893","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"VCHZGFPJAMNV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VCHZGFPJAMNV6ERY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VCHZGFPJ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:2e3b07687906a85526806b42f62619305a9b305d78ffda3e77be82aad9faf6c5","target":"graph","created_at":"2026-05-18T00:59:18Z","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":"Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the structure of the matrices in the samples set, and based on decomposition theorems. We introduce our approach in detail and discuss its advantages using a few examples. In addition, we provide basic tools for analyzing properties of the matrix functions generated by our approximation operators.","authors_text":"Nira Dyn, Nir Sharon, Uri Itai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T20:17:58Z","title":"Approximation operators for matrix-valued functions based on matrix decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03893","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:df3a0a4d8cab137aabcade11de06cc058124a119b37071e2816420a38333406e","target":"record","created_at":"2026-05-18T00:59:18Z","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":"3c9b8305c981e3927f520af507af277b4189bdfe36b4f8effcd7a5ec90afe4ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-11-03T20:17:58Z","title_canon_sha256":"1df3f77c254f769adf5202cf4ebfa081843414aff4099b51bb76f32206d978d9"},"schema_version":"1.0","source":{"id":"1611.03893","kind":"arxiv","version":1}},"canonical_sha256":"a88f9315e9031b5f1238c7c5162a2b0508983b6ae1816e359d401bdd2e59f7e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a88f9315e9031b5f1238c7c5162a2b0508983b6ae1816e359d401bdd2e59f7e6","first_computed_at":"2026-05-18T00:59:18.131373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:18.131373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mhlwSAqubInjK3fVuxOHhCQDtZudoL0yvMdMoZPcXKTgXXndQgARyfkQQcR7Z1H0ui7YR7qwe3SxSzTF0YXDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:18.132055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df3a0a4d8cab137aabcade11de06cc058124a119b37071e2816420a38333406e","sha256:2e3b07687906a85526806b42f62619305a9b305d78ffda3e77be82aad9faf6c5"],"state_sha256":"7a1f4df4eafe0b4f3dbb2b94ac440ebc4ee572c84e44635072aadcbf15679334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkWvMiSOA9eXHbXc71FJzPQRa0wWhHgHOkaVDuQykJC7tBPRbiXjbYjgkS7Ph6lzta3ViWiqWbNEGRn63ajyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:01:25.227894Z","bundle_sha256":"522f8a0eb3ad37f80366410f99f9b03205ca2a401c34c9b360a0ad7b20dd37af"}}