{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TJYL2YABGKFQHUZY3OHONDQLKU","short_pith_number":"pith:TJYL2YAB","canonical_record":{"source":{"id":"1706.07834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T18:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"6b7222df840c2cd48cfaebc52f30b482e911034744fb9d8896f0e8df10e12137","abstract_canon_sha256":"259ae6c9530cb55a8baacd7d16c10f804e41a044aa179e6866e34ae391d41ca8"},"schema_version":"1.0"},"canonical_sha256":"9a70bd6001328b03d338db8ee68e0b551e560bf23c117c3c26107402479cdbb3","source":{"kind":"arxiv","id":"1706.07834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07834","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07834v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07834","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"TJYL2YABGKFQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TJYL2YABGKFQHUZY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TJYL2YAB","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TJYL2YABGKFQHUZY3OHONDQLKU","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T18:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"6b7222df840c2cd48cfaebc52f30b482e911034744fb9d8896f0e8df10e12137","abstract_canon_sha256":"259ae6c9530cb55a8baacd7d16c10f804e41a044aa179e6866e34ae391d41ca8"},"schema_version":"1.0"},"canonical_sha256":"9a70bd6001328b03d338db8ee68e0b551e560bf23c117c3c26107402479cdbb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.676617Z","signature_b64":"QlPXNPQO7YHT3Ar0VtxntUmo0VFUnICh+trMEFRKlWuNAiuwBgsrTJ2slol+I+ZNM5+kaZ8EvNvRuGF8/GsmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a70bd6001328b03d338db8ee68e0b551e560bf23c117c3c26107402479cdbb3","last_reissued_at":"2026-05-18T00:05:56.676096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.676096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07834","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AizJQPYENV5bOpDwZj9NaFpx32XPZo/2IVvSesgoKHxaC6Ew2AggqDk5eJrpF92Sq/z8O1fB/VAP3ZrF9JrKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:34:23.864121Z"},"content_sha256":"cf3147ba99fc9a002dccbf98c2b1aa4f68acdfd776dd3a6739a1c8231206d253","schema_version":"1.0","event_id":"sha256:cf3147ba99fc9a002dccbf98c2b1aa4f68acdfd776dd3a6739a1c8231206d253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TJYL2YABGKFQHUZY3OHONDQLKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cover Tree Compressed Sensing for Fast MR Fingerprint Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Mike E. Davies, Mohammad Golbabaee, Yves Wiaux, Zhouye Chen","submitted_at":"2017-06-23T18:57:17Z","abstract_excerpt":"We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by using the cover tree's ANN searches, we decrease the projection cost of the IPG algorithm to be logarithmically growing with data population for low dimensional smooth manifolds. We apply our results to quantitative MRI compressed sensing and in particular within the Magnetic Reson"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07834","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ikcXP4iChq0HftTu6zSsd2ZZhD4fU6FlXpAeTxohY1DumdxMtY2EH3f/LC29vuCkh/F2/Ap3FBtuqoDCC+qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:34:23.864498Z"},"content_sha256":"5bdf4b78c433fe4587bb2dcbc354ce39458b6378c00a24324338cf38462c6d24","schema_version":"1.0","event_id":"sha256:5bdf4b78c433fe4587bb2dcbc354ce39458b6378c00a24324338cf38462c6d24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJYL2YABGKFQHUZY3OHONDQLKU/bundle.json","state_url":"https://pith.science/pith/TJYL2YABGKFQHUZY3OHONDQLKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJYL2YABGKFQHUZY3OHONDQLKU/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-08T23:34:23Z","links":{"resolver":"https://pith.science/pith/TJYL2YABGKFQHUZY3OHONDQLKU","bundle":"https://pith.science/pith/TJYL2YABGKFQHUZY3OHONDQLKU/bundle.json","state":"https://pith.science/pith/TJYL2YABGKFQHUZY3OHONDQLKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJYL2YABGKFQHUZY3OHONDQLKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TJYL2YABGKFQHUZY3OHONDQLKU","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":"259ae6c9530cb55a8baacd7d16c10f804e41a044aa179e6866e34ae391d41ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T18:57:17Z","title_canon_sha256":"6b7222df840c2cd48cfaebc52f30b482e911034744fb9d8896f0e8df10e12137"},"schema_version":"1.0","source":{"id":"1706.07834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07834","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07834v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07834","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"TJYL2YABGKFQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TJYL2YABGKFQHUZY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TJYL2YAB","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5bdf4b78c433fe4587bb2dcbc354ce39458b6378c00a24324338cf38462c6d24","target":"graph","created_at":"2026-05-18T00:05:56Z","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 adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by using the cover tree's ANN searches, we decrease the projection cost of the IPG algorithm to be logarithmically growing with data population for low dimensional smooth manifolds. We apply our results to quantitative MRI compressed sensing and in particular within the Magnetic Reson","authors_text":"Mike E. Davies, Mohammad Golbabaee, Yves Wiaux, Zhouye Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T18:57:17Z","title":"Cover Tree Compressed Sensing for Fast MR Fingerprint Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07834","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:cf3147ba99fc9a002dccbf98c2b1aa4f68acdfd776dd3a6739a1c8231206d253","target":"record","created_at":"2026-05-18T00:05:56Z","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":"259ae6c9530cb55a8baacd7d16c10f804e41a044aa179e6866e34ae391d41ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T18:57:17Z","title_canon_sha256":"6b7222df840c2cd48cfaebc52f30b482e911034744fb9d8896f0e8df10e12137"},"schema_version":"1.0","source":{"id":"1706.07834","kind":"arxiv","version":2}},"canonical_sha256":"9a70bd6001328b03d338db8ee68e0b551e560bf23c117c3c26107402479cdbb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a70bd6001328b03d338db8ee68e0b551e560bf23c117c3c26107402479cdbb3","first_computed_at":"2026-05-18T00:05:56.676096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.676096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlPXNPQO7YHT3Ar0VtxntUmo0VFUnICh+trMEFRKlWuNAiuwBgsrTJ2slol+I+ZNM5+kaZ8EvNvRuGF8/GsmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.676617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3147ba99fc9a002dccbf98c2b1aa4f68acdfd776dd3a6739a1c8231206d253","sha256:5bdf4b78c433fe4587bb2dcbc354ce39458b6378c00a24324338cf38462c6d24"],"state_sha256":"6a917f3b3010146b21ef09f573abca956f5d609462b340aaf8e895c26bd885e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxJWdSlk3watCzx4YNNQ+Zkvat8csfTAqtchL8dANvlUt+sxdkM5aDaH/8qSjpPD4KRRm90N0u72E98wbWcxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:34:23.866638Z","bundle_sha256":"3114ac78ff01861c9e9205c0a7ff3ba4d7eea93bf229a078026be44ef999cfc7"}}