{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3ZSC5FHBM6HYEXAGSEW2M4HFNS","short_pith_number":"pith:3ZSC5FHB","canonical_record":{"source":{"id":"1901.01960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-01-07T18:30:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"007a3392329283b9f783b5b9b919bfebc9690ebe9f112eef175a6c3d1e09bc6b","abstract_canon_sha256":"92b3490cf0583711fb2bda2b5bfa2ed388f053e21820370baaf4fd44b44a74d1"},"schema_version":"1.0"},"canonical_sha256":"de642e94e1678f825c06912da670e56c900d13297c4898c059824693cad5bd99","source":{"kind":"arxiv","id":"1901.01960","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01960","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01960v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01960","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"3ZSC5FHBM6HY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ZSC5FHBM6HYEXAG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ZSC5FHB","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3ZSC5FHBM6HYEXAGSEW2M4HFNS","target":"record","payload":{"canonical_record":{"source":{"id":"1901.01960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-01-07T18:30:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"007a3392329283b9f783b5b9b919bfebc9690ebe9f112eef175a6c3d1e09bc6b","abstract_canon_sha256":"92b3490cf0583711fb2bda2b5bfa2ed388f053e21820370baaf4fd44b44a74d1"},"schema_version":"1.0"},"canonical_sha256":"de642e94e1678f825c06912da670e56c900d13297c4898c059824693cad5bd99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.708737Z","signature_b64":"dWk1exN0p2v+Kh4zEKEvHCAS5uLb1u/QxpViISUknVyw2wo9E5dJsqlacUpbl2On23u+qQNKQLY2QCf+LsPLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de642e94e1678f825c06912da670e56c900d13297c4898c059824693cad5bd99","last_reissued_at":"2026-05-17T23:47:15.708363Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.708363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.01960","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6oOwXMPlts/TlmRJD07amV0OfoOLy1EtjzOJ12+qV2A/79nqO8fGfB1m6y3CO5uS/OV6HP+hi4w3eswLkReCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:15:02.465647Z"},"content_sha256":"525bd1076a402d3715ff087355c006e0e7e8e041f185e0f6b70d778ce27b7dd9","schema_version":"1.0","event_id":"sha256:525bd1076a402d3715ff087355c006e0e7e8e041f185e0f6b70d778ce27b7dd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3ZSC5FHBM6HYEXAGSEW2M4HFNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-based Optimization of the Under-sampling Pattern in MRI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.IV","authors_text":"Adrian V. Dalca, Cagla Deniz Bahadir, Mert R. Sabuncu","submitted_at":"2019-01-07T18:30:51Z","abstract_excerpt":"Acquisition of Magnetic Resonance Imaging (MRI) scans can be accelerated by under-sampling in k-space (i.e., the Fourier domain). In this paper, we consider the problem of optimizing the sub-sampling pattern in a data-driven fashion. Since the reconstruction model's performance depends on the sub-sampling pattern, we combine the two problems. For a given sparsity constraint, our method optimizes the sub-sampling pattern and reconstruction model, using an end-to-end learning strategy. Our algorithm learns from full-resolution data that are under-sampled retrospectively, yielding a sub-sampling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01960","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BI0GeX6+W3AUtkVMLNgZxPBmMkaKxYp+qe1+9tGKMK6WuzSYr0VqjuWgbYhV/U0wh+aO925b6OR791+W0SGrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:15:02.466006Z"},"content_sha256":"295f94a5f7079ae12050e11f908098c573c628960f5b526967fcba87078e7610","schema_version":"1.0","event_id":"sha256:295f94a5f7079ae12050e11f908098c573c628960f5b526967fcba87078e7610"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/bundle.json","state_url":"https://pith.science/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/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-12T10:15:02Z","links":{"resolver":"https://pith.science/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS","bundle":"https://pith.science/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/bundle.json","state":"https://pith.science/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZSC5FHBM6HYEXAGSEW2M4HFNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3ZSC5FHBM6HYEXAGSEW2M4HFNS","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":"92b3490cf0583711fb2bda2b5bfa2ed388f053e21820370baaf4fd44b44a74d1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-01-07T18:30:51Z","title_canon_sha256":"007a3392329283b9f783b5b9b919bfebc9690ebe9f112eef175a6c3d1e09bc6b"},"schema_version":"1.0","source":{"id":"1901.01960","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01960","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01960v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01960","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"3ZSC5FHBM6HY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3ZSC5FHBM6HYEXAG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3ZSC5FHB","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:295f94a5f7079ae12050e11f908098c573c628960f5b526967fcba87078e7610","target":"graph","created_at":"2026-05-17T23:47:15Z","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":"Acquisition of Magnetic Resonance Imaging (MRI) scans can be accelerated by under-sampling in k-space (i.e., the Fourier domain). In this paper, we consider the problem of optimizing the sub-sampling pattern in a data-driven fashion. Since the reconstruction model's performance depends on the sub-sampling pattern, we combine the two problems. For a given sparsity constraint, our method optimizes the sub-sampling pattern and reconstruction model, using an end-to-end learning strategy. Our algorithm learns from full-resolution data that are under-sampled retrospectively, yielding a sub-sampling ","authors_text":"Adrian V. Dalca, Cagla Deniz Bahadir, Mert R. Sabuncu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-01-07T18:30:51Z","title":"Learning-based Optimization of the Under-sampling Pattern in MRI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01960","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:525bd1076a402d3715ff087355c006e0e7e8e041f185e0f6b70d778ce27b7dd9","target":"record","created_at":"2026-05-17T23:47:15Z","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":"92b3490cf0583711fb2bda2b5bfa2ed388f053e21820370baaf4fd44b44a74d1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-01-07T18:30:51Z","title_canon_sha256":"007a3392329283b9f783b5b9b919bfebc9690ebe9f112eef175a6c3d1e09bc6b"},"schema_version":"1.0","source":{"id":"1901.01960","kind":"arxiv","version":2}},"canonical_sha256":"de642e94e1678f825c06912da670e56c900d13297c4898c059824693cad5bd99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de642e94e1678f825c06912da670e56c900d13297c4898c059824693cad5bd99","first_computed_at":"2026-05-17T23:47:15.708363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.708363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dWk1exN0p2v+Kh4zEKEvHCAS5uLb1u/QxpViISUknVyw2wo9E5dJsqlacUpbl2On23u+qQNKQLY2QCf+LsPLCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.708737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01960","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:525bd1076a402d3715ff087355c006e0e7e8e041f185e0f6b70d778ce27b7dd9","sha256:295f94a5f7079ae12050e11f908098c573c628960f5b526967fcba87078e7610"],"state_sha256":"a090fac306a0f6adbe502c0d31d2de9c8067000731c52384fce6924209f49b45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQ1kihqpt0xwzGqezWyaRsE4Z/0nY3wx7BLfaHguv+HUOUdSvMBjZs8iuCLIgIjrLN8qFkTuGW7qBiM6QuOLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:15:02.468413Z","bundle_sha256":"15f3c3161930428ffb051b05341d309f3415f6f2abeb6709640ff1228494d49d"}}