{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ROIV4NRGGVHZPS4WSKCFWJX2TH","short_pith_number":"pith:ROIV4NRG","canonical_record":{"source":{"id":"1703.02283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-07T08:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b4bfcf1aab6e794538456299b6a856cb2df907735a701078d68d9115e778a6e","abstract_canon_sha256":"7ed9547224f1127979a9ae73bee982a08410ea31c1d43c5ca4abbf1a365db186"},"schema_version":"1.0"},"canonical_sha256":"8b915e3626354f97cb9692845b26fa99f730b1f1909514d7719ca67c9133aa78","source":{"kind":"arxiv","id":"1703.02283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02283","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02283v1","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02283","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"ROIV4NRGGVHZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROIV4NRGGVHZPS4W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROIV4NRG","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ROIV4NRGGVHZPS4WSKCFWJX2TH","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-07T08:57:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b4bfcf1aab6e794538456299b6a856cb2df907735a701078d68d9115e778a6e","abstract_canon_sha256":"7ed9547224f1127979a9ae73bee982a08410ea31c1d43c5ca4abbf1a365db186"},"schema_version":"1.0"},"canonical_sha256":"8b915e3626354f97cb9692845b26fa99f730b1f1909514d7719ca67c9133aa78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:20.293724Z","signature_b64":"G1Z2JHsdATSvMQpeV6KunvpJpjQvUykg8S+wcl6R/F1nmWWzWr+ocWqiG+M1Oxn5hcU+0bTRwLePxQPrFgpPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b915e3626354f97cb9692845b26fa99f730b1f1909514d7719ca67c9133aa78","last_reissued_at":"2026-05-18T00:49:20.293117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:20.293117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02283","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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1aqd/21QLaWNFm+CXbYKQO12IO1BMnfz6dCRHGRZvBTH8NsXo6u+QDZSdhq86cNa1ah8fmWfYz3WcqH4H7ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:51.896252Z"},"content_sha256":"0ec2dc60a459be6dc5028f8ddc68cae3a6ab68ad4096128ff6a5cf3ac179ff84","schema_version":"1.0","event_id":"sha256:0ec2dc60a459be6dc5028f8ddc68cae3a6ab68ad4096128ff6a5cf3ac179ff84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ROIV4NRGGVHZPS4WSKCFWJX2TH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Christian Plessl, Michael Lass, Thomas D. K\\\"uhne","submitted_at":"2017-03-07T08:57:53Z","abstract_excerpt":"Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we demonstrate its suitability to a problem from scientific computing. Utilizing the self-correcting behavior of iterative algorithms, we show that approximate computing can be applied to the calculation of inverse matrix p-th roots which are required in many applications in scientific computing. Results show great opportunities to reduce the computational eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02283","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:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ul8MHxyMWjYF1RKhX7RO3fwZj+RHjn16aVY8jtDywVYzO1Sd7mnWrKzYujAGz5pYGlHsO3C4UB/N822ECtb/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:51.896619Z"},"content_sha256":"1c0d7c4215811577021e3d1a4113c47d61e612ed3ad1d0ca40385192ab94909b","schema_version":"1.0","event_id":"sha256:1c0d7c4215811577021e3d1a4113c47d61e612ed3ad1d0ca40385192ab94909b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/bundle.json","state_url":"https://pith.science/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/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-07-06T19:34:51Z","links":{"resolver":"https://pith.science/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH","bundle":"https://pith.science/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/bundle.json","state":"https://pith.science/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROIV4NRGGVHZPS4WSKCFWJX2TH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ROIV4NRGGVHZPS4WSKCFWJX2TH","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":"7ed9547224f1127979a9ae73bee982a08410ea31c1d43c5ca4abbf1a365db186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-07T08:57:53Z","title_canon_sha256":"4b4bfcf1aab6e794538456299b6a856cb2df907735a701078d68d9115e778a6e"},"schema_version":"1.0","source":{"id":"1703.02283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02283","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02283v1","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02283","created_at":"2026-05-18T00:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"ROIV4NRGGVHZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROIV4NRGGVHZPS4W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROIV4NRG","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:1c0d7c4215811577021e3d1a4113c47d61e612ed3ad1d0ca40385192ab94909b","target":"graph","created_at":"2026-05-18T00:49: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":"Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we demonstrate its suitability to a problem from scientific computing. Utilizing the self-correcting behavior of iterative algorithms, we show that approximate computing can be applied to the calculation of inverse matrix p-th roots which are required in many applications in scientific computing. Results show great opportunities to reduce the computational eff","authors_text":"Christian Plessl, Michael Lass, Thomas D. K\\\"uhne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-07T08:57:53Z","title":"Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02283","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:0ec2dc60a459be6dc5028f8ddc68cae3a6ab68ad4096128ff6a5cf3ac179ff84","target":"record","created_at":"2026-05-18T00:49: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":"7ed9547224f1127979a9ae73bee982a08410ea31c1d43c5ca4abbf1a365db186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-03-07T08:57:53Z","title_canon_sha256":"4b4bfcf1aab6e794538456299b6a856cb2df907735a701078d68d9115e778a6e"},"schema_version":"1.0","source":{"id":"1703.02283","kind":"arxiv","version":1}},"canonical_sha256":"8b915e3626354f97cb9692845b26fa99f730b1f1909514d7719ca67c9133aa78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b915e3626354f97cb9692845b26fa99f730b1f1909514d7719ca67c9133aa78","first_computed_at":"2026-05-18T00:49:20.293117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:20.293117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1Z2JHsdATSvMQpeV6KunvpJpjQvUykg8S+wcl6R/F1nmWWzWr+ocWqiG+M1Oxn5hcU+0bTRwLePxQPrFgpPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:20.293724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ec2dc60a459be6dc5028f8ddc68cae3a6ab68ad4096128ff6a5cf3ac179ff84","sha256:1c0d7c4215811577021e3d1a4113c47d61e612ed3ad1d0ca40385192ab94909b"],"state_sha256":"9525e7ecbe28fb9670635b33989ca13186dc6b716283849db30b79b485cfb8d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBaQoqxr/jxZhtIDTSTHceoUyT/7ZYSu3VcgYdyPGuTxDVOtT4GBJFGm3WKZG+SLSVE2hWh0nOgfLz85FhJaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:34:51.898536Z","bundle_sha256":"5514712d07ba1fc6ef7947c915402f147f3a4cc4e64dbe4b843021a2156df7fc"}}