{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BFAYAQUETCHI63YTZIES5RIILP","short_pith_number":"pith:BFAYAQUE","canonical_record":{"source":{"id":"1705.07497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T19:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"e4bb156252868eea150343d55a510961e6d18415389c91e7d76ae3d652a4d2eb","abstract_canon_sha256":"a0deec020be33324a32bef1d25f22c0f7ec769c32415d8340e0a69aee49855f1"},"schema_version":"1.0"},"canonical_sha256":"0941804284988e8f6f13ca092ec5085bc14f0382f776367b4f2aae9dd42737c5","source":{"kind":"arxiv","id":"1705.07497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07497","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07497v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07497","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"BFAYAQUETCHI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFAYAQUETCHI63YT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFAYAQUE","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BFAYAQUETCHI63YTZIES5RIILP","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T19:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"e4bb156252868eea150343d55a510961e6d18415389c91e7d76ae3d652a4d2eb","abstract_canon_sha256":"a0deec020be33324a32bef1d25f22c0f7ec769c32415d8340e0a69aee49855f1"},"schema_version":"1.0"},"canonical_sha256":"0941804284988e8f6f13ca092ec5085bc14f0382f776367b4f2aae9dd42737c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.389306Z","signature_b64":"roRWLTwtsya1Vu+LEG4t5nxpf5Prw6LVKJJuBQTERYAxXaSe02wEH98+y271CfAeGgwhePTS5x2XG5iIBedbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0941804284988e8f6f13ca092ec5085bc14f0382f776367b4f2aae9dd42737c5","last_reissued_at":"2026-05-18T00:44:05.388728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.388728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07497","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8y30w8ZpAqVfCr0yvoRsm42CdKUWlGzk2cHv1WUOHJv2qYUVh7vm5taEnbINff94GrEwprG0G2eaf4lxIwlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:57:18.487350Z"},"content_sha256":"c7c6a20a9474017872a196164638005651aebbd8a29d29bf5fda969f68d231e3","schema_version":"1.0","event_id":"sha256:c7c6a20a9474017872a196164638005651aebbd8a29d29bf5fda969f68d231e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BFAYAQUETCHI63YTZIES5RIILP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating optimization-based computed tomography via sparse matrix approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Richard C. Barnard, Rick Archibald","submitted_at":"2017-05-21T19:40:54Z","abstract_excerpt":"Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are relatively expensive. We look at two methods for reducing the effect of this resulting computational bottleneck via approximating the transform evaluation with sparse matrix multiplications. The first method is applicable for general iterative optimization algorithms. The second is applicable in error-forgetting algorithms such as split Bregman. We demonstrate these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07497","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6o56KdT0uE6T7xT962wFKvZbSGikldTFt5NuVt/i/m0CJN8YrSc1NNIK9WlmQWU+nhe744/mALNJGrNKwqAmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:57:18.488090Z"},"content_sha256":"3ab61ef5a12016ddefb563b51a3beb055a911a49670f2bf27e8df51834d11f80","schema_version":"1.0","event_id":"sha256:3ab61ef5a12016ddefb563b51a3beb055a911a49670f2bf27e8df51834d11f80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFAYAQUETCHI63YTZIES5RIILP/bundle.json","state_url":"https://pith.science/pith/BFAYAQUETCHI63YTZIES5RIILP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFAYAQUETCHI63YTZIES5RIILP/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-12T00:57:18Z","links":{"resolver":"https://pith.science/pith/BFAYAQUETCHI63YTZIES5RIILP","bundle":"https://pith.science/pith/BFAYAQUETCHI63YTZIES5RIILP/bundle.json","state":"https://pith.science/pith/BFAYAQUETCHI63YTZIES5RIILP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFAYAQUETCHI63YTZIES5RIILP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BFAYAQUETCHI63YTZIES5RIILP","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":"a0deec020be33324a32bef1d25f22c0f7ec769c32415d8340e0a69aee49855f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T19:40:54Z","title_canon_sha256":"e4bb156252868eea150343d55a510961e6d18415389c91e7d76ae3d652a4d2eb"},"schema_version":"1.0","source":{"id":"1705.07497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07497","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07497v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07497","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"BFAYAQUETCHI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFAYAQUETCHI63YT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFAYAQUE","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:3ab61ef5a12016ddefb563b51a3beb055a911a49670f2bf27e8df51834d11f80","target":"graph","created_at":"2026-05-18T00:44: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":"Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are relatively expensive. We look at two methods for reducing the effect of this resulting computational bottleneck via approximating the transform evaluation with sparse matrix multiplications. The first method is applicable for general iterative optimization algorithms. The second is applicable in error-forgetting algorithms such as split Bregman. We demonstrate these ","authors_text":"Richard C. Barnard, Rick Archibald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T19:40:54Z","title":"Accelerating optimization-based computed tomography via sparse matrix approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07497","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:c7c6a20a9474017872a196164638005651aebbd8a29d29bf5fda969f68d231e3","target":"record","created_at":"2026-05-18T00:44: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":"a0deec020be33324a32bef1d25f22c0f7ec769c32415d8340e0a69aee49855f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T19:40:54Z","title_canon_sha256":"e4bb156252868eea150343d55a510961e6d18415389c91e7d76ae3d652a4d2eb"},"schema_version":"1.0","source":{"id":"1705.07497","kind":"arxiv","version":1}},"canonical_sha256":"0941804284988e8f6f13ca092ec5085bc14f0382f776367b4f2aae9dd42737c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0941804284988e8f6f13ca092ec5085bc14f0382f776367b4f2aae9dd42737c5","first_computed_at":"2026-05-18T00:44:05.388728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.388728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"roRWLTwtsya1Vu+LEG4t5nxpf5Prw6LVKJJuBQTERYAxXaSe02wEH98+y271CfAeGgwhePTS5x2XG5iIBedbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.389306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7c6a20a9474017872a196164638005651aebbd8a29d29bf5fda969f68d231e3","sha256:3ab61ef5a12016ddefb563b51a3beb055a911a49670f2bf27e8df51834d11f80"],"state_sha256":"bf1dc66e89524e424aedc517499873700c952ae1eba5c3bca69ba3b6447b7f90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2zn1DHlHIC5N2CfDwFrVY5qt/G808wcNoAC4EcCXod4vWFVHdt4Tol+qRztvzHdPWfJ7hYQo0hrQTTW5Q0JBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:57:18.492433Z","bundle_sha256":"d907cf6fb5c619fc7596eff5d903e657aeed40057bafdcb06bd8d1ecf903cdae"}}