{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:764SLV56EWBSDR6QNGGLD4RKRE","short_pith_number":"pith:764SLV56","canonical_record":{"source":{"id":"1804.10541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T14:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"36ca09c1f130e6598ff9c7ebbe5532dddc8fa70bec0a73993bf0aead10cfa69b","abstract_canon_sha256":"ac0df99a565832f2ecbf97ad0d06b80839a8226dd1560678bdd4f668eab881ac"},"schema_version":"1.0"},"canonical_sha256":"ffb925d7be258321c7d0698cb1f22a893c3d4a7532c58dc9479f78d2d25bad2a","source":{"kind":"arxiv","id":"1804.10541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10541","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10541v1","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10541","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"764SLV56EWBS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"764SLV56EWBSDR6Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"764SLV56","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:764SLV56EWBSDR6QNGGLD4RKRE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T14:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"36ca09c1f130e6598ff9c7ebbe5532dddc8fa70bec0a73993bf0aead10cfa69b","abstract_canon_sha256":"ac0df99a565832f2ecbf97ad0d06b80839a8226dd1560678bdd4f668eab881ac"},"schema_version":"1.0"},"canonical_sha256":"ffb925d7be258321c7d0698cb1f22a893c3d4a7532c58dc9479f78d2d25bad2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:20.471096Z","signature_b64":"pPN9COW/3mXSUfkkXRKVUzV1oJg8Dk9EAsN/AAUKtJ02CayiUPeTYfHLk/ZjRN8ZHXNO6w3y33yVGhFaViJpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffb925d7be258321c7d0698cb1f22a893c3d4a7532c58dc9479f78d2d25bad2a","last_reissued_at":"2026-05-18T00:17:20.470666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:20.470666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10541","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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MG0nCAj427OSoM1b5/WBeJ/Y6QasDJWQibeFr32uv/rA96c/XFnX0sgDImG/bvA5njIHkoCfKtWRaZOSE2G7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:17:06.641525Z"},"content_sha256":"941691cf90e98bb6336fda21ef1719b440ebbc5af8004f8097a62afbda7f22b7","schema_version":"1.0","event_id":"sha256:941691cf90e98bb6336fda21ef1719b440ebbc5af8004f8097a62afbda7f22b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:764SLV56EWBSDR6QNGGLD4RKRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A matrix-free approach to parallel and memory-efficient deformable image registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander Derksen, Jan Lellmann, Jan R\\\"uhaak, Lars K\\\"onig","submitted_at":"2018-04-27T14:52:41Z","abstract_excerpt":"We present a novel computational approach to fast and memory-efficient deformable image registration. In the variational registration model, the computation of the objective function derivatives is the computationally most expensive operation, both in terms of runtime and memory requirements. In order to target this bottleneck, we analyze the matrix structure of gradient and Hessian computations for the case of the normalized gradient fields distance measure and curvature regularization. Based on this analysis, we derive equivalent matrix-free closed-form expressions for derivative computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10541","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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neCLoLAC+VTrgwSpx8N8AqU8A2pnXVpU+ujOj2QxcSaOQ89jETe9ObJj2B0b/S45QOqx8zJ9jtA1Edf0t3JqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:17:06.642236Z"},"content_sha256":"279130524d3a946b9926e13074391d3a5876ad49a8a9029dc39039d2af84b2d8","schema_version":"1.0","event_id":"sha256:279130524d3a946b9926e13074391d3a5876ad49a8a9029dc39039d2af84b2d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/764SLV56EWBSDR6QNGGLD4RKRE/bundle.json","state_url":"https://pith.science/pith/764SLV56EWBSDR6QNGGLD4RKRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/764SLV56EWBSDR6QNGGLD4RKRE/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-06T15:17:06Z","links":{"resolver":"https://pith.science/pith/764SLV56EWBSDR6QNGGLD4RKRE","bundle":"https://pith.science/pith/764SLV56EWBSDR6QNGGLD4RKRE/bundle.json","state":"https://pith.science/pith/764SLV56EWBSDR6QNGGLD4RKRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/764SLV56EWBSDR6QNGGLD4RKRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:764SLV56EWBSDR6QNGGLD4RKRE","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":"ac0df99a565832f2ecbf97ad0d06b80839a8226dd1560678bdd4f668eab881ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T14:52:41Z","title_canon_sha256":"36ca09c1f130e6598ff9c7ebbe5532dddc8fa70bec0a73993bf0aead10cfa69b"},"schema_version":"1.0","source":{"id":"1804.10541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10541","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10541v1","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10541","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"764SLV56EWBS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"764SLV56EWBSDR6Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"764SLV56","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:279130524d3a946b9926e13074391d3a5876ad49a8a9029dc39039d2af84b2d8","target":"graph","created_at":"2026-05-18T00:17: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":"We present a novel computational approach to fast and memory-efficient deformable image registration. In the variational registration model, the computation of the objective function derivatives is the computationally most expensive operation, both in terms of runtime and memory requirements. In order to target this bottleneck, we analyze the matrix structure of gradient and Hessian computations for the case of the normalized gradient fields distance measure and curvature regularization. Based on this analysis, we derive equivalent matrix-free closed-form expressions for derivative computation","authors_text":"Alexander Derksen, Jan Lellmann, Jan R\\\"uhaak, Lars K\\\"onig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T14:52:41Z","title":"A matrix-free approach to parallel and memory-efficient deformable image registration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10541","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:941691cf90e98bb6336fda21ef1719b440ebbc5af8004f8097a62afbda7f22b7","target":"record","created_at":"2026-05-18T00:17: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":"ac0df99a565832f2ecbf97ad0d06b80839a8226dd1560678bdd4f668eab881ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-27T14:52:41Z","title_canon_sha256":"36ca09c1f130e6598ff9c7ebbe5532dddc8fa70bec0a73993bf0aead10cfa69b"},"schema_version":"1.0","source":{"id":"1804.10541","kind":"arxiv","version":1}},"canonical_sha256":"ffb925d7be258321c7d0698cb1f22a893c3d4a7532c58dc9479f78d2d25bad2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffb925d7be258321c7d0698cb1f22a893c3d4a7532c58dc9479f78d2d25bad2a","first_computed_at":"2026-05-18T00:17:20.470666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:20.470666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pPN9COW/3mXSUfkkXRKVUzV1oJg8Dk9EAsN/AAUKtJ02CayiUPeTYfHLk/ZjRN8ZHXNO6w3y33yVGhFaViJpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:20.471096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:941691cf90e98bb6336fda21ef1719b440ebbc5af8004f8097a62afbda7f22b7","sha256:279130524d3a946b9926e13074391d3a5876ad49a8a9029dc39039d2af84b2d8"],"state_sha256":"289e0d8f9b0472ad7a098bf348a9627b525a38819080736f84192d5400530a0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syev+Vv4X+qr3oKS/S+vEi/8yOHWwdPXOEpOZetoJMqauRhD5fsokHcCA0CdvZDJj7jL1glYAEAKpCab0LKMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:17:06.645875Z","bundle_sha256":"7ce4b32904e99a0bcf290c1c2196d29be3ba9dc3ede0a7454c76ae4c138223e5"}}