{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X5F3QY4AWNGM22VDOYRKEKG7HP","short_pith_number":"pith:X5F3QY4A","canonical_record":{"source":{"id":"1809.02503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-09-06T08:58:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fd425050cebe16e380c0b7f872831227caeecd400492de6d5709320dd7be562","abstract_canon_sha256":"1c34f2751cb5bb549fd1071752e8bd1ac84b1def29e902e0ecc19dd7463ae3d2"},"schema_version":"1.0"},"canonical_sha256":"bf4bb86380b34ccd6aa37622a228df3bd460b4f639dc51d963850b4003445f52","source":{"kind":"arxiv","id":"1809.02503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02503","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02503v1","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02503","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"X5F3QY4AWNGM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X5F3QY4AWNGM22VD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X5F3QY4A","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X5F3QY4AWNGM22VDOYRKEKG7HP","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-09-06T08:58:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fd425050cebe16e380c0b7f872831227caeecd400492de6d5709320dd7be562","abstract_canon_sha256":"1c34f2751cb5bb549fd1071752e8bd1ac84b1def29e902e0ecc19dd7463ae3d2"},"schema_version":"1.0"},"canonical_sha256":"bf4bb86380b34ccd6aa37622a228df3bd460b4f639dc51d963850b4003445f52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:16.924682Z","signature_b64":"PsRUULAD08KnVwEsm+MtaQU1CbqEnRdlHNo+J0Uv/9usN1RGguL6ai5/lLr9jO0lmPvw1J5FOWMfZ1CXJiASCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf4bb86380b34ccd6aa37622a228df3bd460b4f639dc51d963850b4003445f52","last_reissued_at":"2026-05-18T00:06:16.924110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:16.924110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02503","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:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GP4R4pHGNP/8+1Ar+8H3sOCRk+FdJNaAGLWino4e1d40WHSklYLcg+uoVEQ4SYqXWfupkCd2ivGrmlNpFn3vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:23:37.291813Z"},"content_sha256":"57d37db75fb7ad3b5b94a788945bb3f0aa28e03b2c8fd06849857c63253dcc7b","schema_version":"1.0","event_id":"sha256:57d37db75fb7ad3b5b94a788945bb3f0aa28e03b2c8fd06849857c63253dcc7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X5F3QY4AWNGM22VDOYRKEKG7HP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.QM","authors_text":"Mike E. Davies, Mohammad Golbabaee, Yves Wiaux, Zhouye Chen","submitted_at":"2018-09-06T08:58:09Z","abstract_excerpt":"Current proposed solutions for the high dimensionality of the MRF reconstruction problem rely on a linear compression step to reduce the matching computations and boost the efficiency of fast but non-scalable searching schemes such as the KD-trees. However such methodologies often introduce an unfavourable compromise in the estimation accuracy when applied to nonlinear data structures such as the manifold of Bloch responses with possible increased dynamic complexity and growth in data population. To address this shortcoming we propose an inexact iterative reconstruction method, dubbed as the C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02503","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:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTlSmot/0zVPOXO7dnQ9U8Z2bCJpcwRf3DD/QRj3LwiAPQ0Rop29duXq86HJNBRMnEQEM97bx0go60lwiKdMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:23:37.292467Z"},"content_sha256":"b4e19a27db2080b7f3814e9415b1a2af85284f482eafa598ae584608238c9baf","schema_version":"1.0","event_id":"sha256:b4e19a27db2080b7f3814e9415b1a2af85284f482eafa598ae584608238c9baf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/bundle.json","state_url":"https://pith.science/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/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-09T02:23:37Z","links":{"resolver":"https://pith.science/pith/X5F3QY4AWNGM22VDOYRKEKG7HP","bundle":"https://pith.science/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/bundle.json","state":"https://pith.science/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5F3QY4AWNGM22VDOYRKEKG7HP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X5F3QY4AWNGM22VDOYRKEKG7HP","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":"1c34f2751cb5bb549fd1071752e8bd1ac84b1def29e902e0ecc19dd7463ae3d2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-09-06T08:58:09Z","title_canon_sha256":"9fd425050cebe16e380c0b7f872831227caeecd400492de6d5709320dd7be562"},"schema_version":"1.0","source":{"id":"1809.02503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02503","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02503v1","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02503","created_at":"2026-05-18T00:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"X5F3QY4AWNGM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X5F3QY4AWNGM22VD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X5F3QY4A","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b4e19a27db2080b7f3814e9415b1a2af85284f482eafa598ae584608238c9baf","target":"graph","created_at":"2026-05-18T00:06:16Z","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":"Current proposed solutions for the high dimensionality of the MRF reconstruction problem rely on a linear compression step to reduce the matching computations and boost the efficiency of fast but non-scalable searching schemes such as the KD-trees. However such methodologies often introduce an unfavourable compromise in the estimation accuracy when applied to nonlinear data structures such as the manifold of Bloch responses with possible increased dynamic complexity and growth in data population. To address this shortcoming we propose an inexact iterative reconstruction method, dubbed as the C","authors_text":"Mike E. Davies, Mohammad Golbabaee, Yves Wiaux, Zhouye Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-09-06T08:58:09Z","title":"CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02503","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:57d37db75fb7ad3b5b94a788945bb3f0aa28e03b2c8fd06849857c63253dcc7b","target":"record","created_at":"2026-05-18T00:06:16Z","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":"1c34f2751cb5bb549fd1071752e8bd1ac84b1def29e902e0ecc19dd7463ae3d2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-09-06T08:58:09Z","title_canon_sha256":"9fd425050cebe16e380c0b7f872831227caeecd400492de6d5709320dd7be562"},"schema_version":"1.0","source":{"id":"1809.02503","kind":"arxiv","version":1}},"canonical_sha256":"bf4bb86380b34ccd6aa37622a228df3bd460b4f639dc51d963850b4003445f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf4bb86380b34ccd6aa37622a228df3bd460b4f639dc51d963850b4003445f52","first_computed_at":"2026-05-18T00:06:16.924110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:16.924110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PsRUULAD08KnVwEsm+MtaQU1CbqEnRdlHNo+J0Uv/9usN1RGguL6ai5/lLr9jO0lmPvw1J5FOWMfZ1CXJiASCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:16.924682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57d37db75fb7ad3b5b94a788945bb3f0aa28e03b2c8fd06849857c63253dcc7b","sha256:b4e19a27db2080b7f3814e9415b1a2af85284f482eafa598ae584608238c9baf"],"state_sha256":"3bdd95dcdee34d80780e5a997e9fbdb1d76eb3856875b57c5a5df450522066a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+jSHHJZTxiztmORI8XQd/A/xd9ooMFOfGSf8WA9zSNnfn7j3Na1Qre/0d1aTux7qqYHCkTgXa6Q7mnrn79UBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:23:37.297950Z","bundle_sha256":"36ac722452e98bb01ab1d380f247473bcea04c2b7cef1492e336a5fc8fed77f1"}}