{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:754QUSJWOCP6EUCXXUWWTXHGWW","short_pith_number":"pith:754QUSJW","canonical_record":{"source":{"id":"1806.06987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-18T23:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"0fdec649cfe571f94377b7e61496c86c8499ad15ea7219e29f5caa56779f937d","abstract_canon_sha256":"061f2a77e2ad3dbebde488c8224a7b807a704427fd434f9e3a82f92ccafae1ac"},"schema_version":"1.0"},"canonical_sha256":"ff790a4936709fe25057bd2d69dce6b5bfa1928b955e2e889aa009efde7b909f","source":{"kind":"arxiv","id":"1806.06987","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06987","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06987v2","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06987","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"754QUSJWOCP6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"754QUSJWOCP6EUCX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"754QUSJW","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:754QUSJWOCP6EUCXXUWWTXHGWW","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-18T23:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"0fdec649cfe571f94377b7e61496c86c8499ad15ea7219e29f5caa56779f937d","abstract_canon_sha256":"061f2a77e2ad3dbebde488c8224a7b807a704427fd434f9e3a82f92ccafae1ac"},"schema_version":"1.0"},"canonical_sha256":"ff790a4936709fe25057bd2d69dce6b5bfa1928b955e2e889aa009efde7b909f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:55.770363Z","signature_b64":"XgE78hkPWuClGJCSZ+wjRgg6wjAj+kTfHoO9WlMpjmYkzMbuHfPs4umoAV5x8HFJ6J2oq5GudMQQssJTJ7wwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff790a4936709fe25057bd2d69dce6b5bfa1928b955e2e889aa009efde7b909f","last_reissued_at":"2026-05-18T00:03:55.769902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:55.769902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06987","source_version":2,"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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqaveeDASzJNpBHgfsE4KI9t838K6pRC4xeqiPorICCQgcdfsfMrSpiHk6NCRehC5i8E03MNlJNFGjMobUYRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:37:40.171301Z"},"content_sha256":"928641dcd5a19141d7da22bfeed2ad44de5f25ce6e06d759de606f03cc14504e","schema_version":"1.0","event_id":"sha256:928641dcd5a19141d7da22bfeed2ad44de5f25ce6e06d759de606f03cc14504e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:754QUSJWOCP6EUCXXUWWTXHGWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Multiple Landmark Localisation Using a Patch-based Iterative Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir Alansary, Bernhard Kainz, Bishesh Khanal, Caroline Knight, Chandni Gupta, Daniel Rueckert, Jacqueline Matthew, Juan J. Cerrolaza, Matthew Sinclair, Yuanwei Li","submitted_at":"2018-06-18T23:51:02Z","abstract_excerpt":"We propose a new Patch-based Iterative Network (PIN) for fast and accurate landmark localisation in 3D medical volumes. PIN utilises a Convolutional Neural Network (CNN) to learn the spatial relationship between an image patch and anatomical landmark positions. During inference, patches are repeatedly passed to the CNN until the estimated landmark position converges to the true landmark location. PIN is computationally efficient since the inference stage only selectively samples a small number of patches in an iterative fashion rather than a dense sampling at every location in the volume. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06987","kind":"arxiv","version":2},"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:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RbmDjcLt19S26WZJkh1VJwuc2WO3mh6aLVPXFnyRsQ5hFhnyRFc3cDHeZHC971SghDUgzJ2gqOMSDaeY/5pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:37:40.171665Z"},"content_sha256":"51104c123841d34d874d9d0fb19644244a4056fc8908208403b2d9911607c96e","schema_version":"1.0","event_id":"sha256:51104c123841d34d874d9d0fb19644244a4056fc8908208403b2d9911607c96e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/754QUSJWOCP6EUCXXUWWTXHGWW/bundle.json","state_url":"https://pith.science/pith/754QUSJWOCP6EUCXXUWWTXHGWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/754QUSJWOCP6EUCXXUWWTXHGWW/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-05-28T07:37:40Z","links":{"resolver":"https://pith.science/pith/754QUSJWOCP6EUCXXUWWTXHGWW","bundle":"https://pith.science/pith/754QUSJWOCP6EUCXXUWWTXHGWW/bundle.json","state":"https://pith.science/pith/754QUSJWOCP6EUCXXUWWTXHGWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/754QUSJWOCP6EUCXXUWWTXHGWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:754QUSJWOCP6EUCXXUWWTXHGWW","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":"061f2a77e2ad3dbebde488c8224a7b807a704427fd434f9e3a82f92ccafae1ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-18T23:51:02Z","title_canon_sha256":"0fdec649cfe571f94377b7e61496c86c8499ad15ea7219e29f5caa56779f937d"},"schema_version":"1.0","source":{"id":"1806.06987","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06987","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06987v2","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06987","created_at":"2026-05-18T00:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"754QUSJWOCP6","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"754QUSJWOCP6EUCX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"754QUSJW","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:51104c123841d34d874d9d0fb19644244a4056fc8908208403b2d9911607c96e","target":"graph","created_at":"2026-05-18T00:03:55Z","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 propose a new Patch-based Iterative Network (PIN) for fast and accurate landmark localisation in 3D medical volumes. PIN utilises a Convolutional Neural Network (CNN) to learn the spatial relationship between an image patch and anatomical landmark positions. During inference, patches are repeatedly passed to the CNN until the estimated landmark position converges to the true landmark location. PIN is computationally efficient since the inference stage only selectively samples a small number of patches in an iterative fashion rather than a dense sampling at every location in the volume. Our ","authors_text":"Amir Alansary, Bernhard Kainz, Bishesh Khanal, Caroline Knight, Chandni Gupta, Daniel Rueckert, Jacqueline Matthew, Juan J. Cerrolaza, Matthew Sinclair, Yuanwei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-18T23:51:02Z","title":"Fast Multiple Landmark Localisation Using a Patch-based Iterative Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06987","kind":"arxiv","version":2},"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:928641dcd5a19141d7da22bfeed2ad44de5f25ce6e06d759de606f03cc14504e","target":"record","created_at":"2026-05-18T00:03:55Z","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":"061f2a77e2ad3dbebde488c8224a7b807a704427fd434f9e3a82f92ccafae1ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-18T23:51:02Z","title_canon_sha256":"0fdec649cfe571f94377b7e61496c86c8499ad15ea7219e29f5caa56779f937d"},"schema_version":"1.0","source":{"id":"1806.06987","kind":"arxiv","version":2}},"canonical_sha256":"ff790a4936709fe25057bd2d69dce6b5bfa1928b955e2e889aa009efde7b909f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff790a4936709fe25057bd2d69dce6b5bfa1928b955e2e889aa009efde7b909f","first_computed_at":"2026-05-18T00:03:55.769902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:55.769902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XgE78hkPWuClGJCSZ+wjRgg6wjAj+kTfHoO9WlMpjmYkzMbuHfPs4umoAV5x8HFJ6J2oq5GudMQQssJTJ7wwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:55.770363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06987","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:928641dcd5a19141d7da22bfeed2ad44de5f25ce6e06d759de606f03cc14504e","sha256:51104c123841d34d874d9d0fb19644244a4056fc8908208403b2d9911607c96e"],"state_sha256":"0b25a500c2a5edf4288494a1fe363abc2b6875cdd85439590cb975597a931abe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uB1OTT9LU8HQaJbET0MFmPA9Mxm/1oCgcPrqTVZQuEMjoHyCbJUxvJmmrauXMWhM3e41c0fijdCuNy2F4dIOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:37:40.173773Z","bundle_sha256":"d319c5914cd2ec5b62c540e1f2d3546695b5dec1e97c4e85662e172a3cf56213"}}