{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LWWJVLHEZIHNPR75YYEN7WH7SY","short_pith_number":"pith:LWWJVLHE","schema_version":"1.0","canonical_sha256":"5dac9aace4ca0ed7c7fdc608dfd8ff9621212ad2738f709e04c0d050b82ffbbe","source":{"kind":"arxiv","id":"1907.05277","version":2},"attestation_state":"computed","paper":{"title":"RinQ Fingerprinting: Recurrence-informed Quantile Networks for Magnetic Resonance Fingerprinting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"(2) MR Application Development, Andreas Maier (1) ((1) Pattern Recognition Lab, Christopher Syben (1), Department of Computer Science, Elisabeth Hoppe (1), Erlangen, Florian Thamm (1), Franziska Schirrmacher (1), Friedrich-Alexander-Universit\\\"at Erlangen-N\\\"urnberg, Germany, Germany), Gregor K\\\"orzd\\\"orfer (2), Heiko Meyer (2), Josef Pfeuffer (2), Mathias Nittka (2), Siemens Healthcare","submitted_at":"2019-07-09T10:29:55Z","abstract_excerpt":"Recently, Magnetic Resonance Fingerprinting (MRF) was proposed as a quantitative imaging technique for the simultaneous acquisition of tissue parameters such as relaxation times $T_1$ and $T_2$. Although the acquisition is highly accelerated, the state-of-the-art reconstruction suffers from long computation times: Template matching methods are used to find the most similar signal to the measured one by comparing it to pre-simulated signals of possible parameter combinations in a discretized dictionary. Deep learning approaches can overcome this limitation, by providing the direct mapping from "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.05277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-07-09T10:29:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"88c12142bf8d870cfe6e64062661a15bdd0809608a8e6b7a6bf8b195b189a5ef","abstract_canon_sha256":"058e553295dccaf96defd7b83f9f2167181085b9feee40470b03f1da8f93e1d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:03.164140Z","signature_b64":"YDB29xtVrCm3Q4fUTqk83Q80Em9fzBxM+UXd5EJvpl+3AXHvC4q9a8vphq2CmzLXeQTqOYgMGbeCvQrjIl76CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dac9aace4ca0ed7c7fdc608dfd8ff9621212ad2738f709e04c0d050b82ffbbe","last_reissued_at":"2026-05-17T23:40:03.163511Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:03.163511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RinQ Fingerprinting: Recurrence-informed Quantile Networks for Magnetic Resonance Fingerprinting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"(2) MR Application Development, Andreas Maier (1) ((1) Pattern Recognition Lab, Christopher Syben (1), Department of Computer Science, Elisabeth Hoppe (1), Erlangen, Florian Thamm (1), Franziska Schirrmacher (1), Friedrich-Alexander-Universit\\\"at Erlangen-N\\\"urnberg, Germany, Germany), Gregor K\\\"orzd\\\"orfer (2), Heiko Meyer (2), Josef Pfeuffer (2), Mathias Nittka (2), Siemens Healthcare","submitted_at":"2019-07-09T10:29:55Z","abstract_excerpt":"Recently, Magnetic Resonance Fingerprinting (MRF) was proposed as a quantitative imaging technique for the simultaneous acquisition of tissue parameters such as relaxation times $T_1$ and $T_2$. Although the acquisition is highly accelerated, the state-of-the-art reconstruction suffers from long computation times: Template matching methods are used to find the most similar signal to the measured one by comparing it to pre-simulated signals of possible parameter combinations in a discretized dictionary. Deep learning approaches can overcome this limitation, by providing the direct mapping from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05277","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.05277","created_at":"2026-05-17T23:40:03.163583+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05277v2","created_at":"2026-05-17T23:40:03.163583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05277","created_at":"2026-05-17T23:40:03.163583+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWWJVLHEZIHN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWWJVLHEZIHNPR75","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWWJVLHE","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY","json":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY.json","graph_json":"https://pith.science/api/pith-number/LWWJVLHEZIHNPR75YYEN7WH7SY/graph.json","events_json":"https://pith.science/api/pith-number/LWWJVLHEZIHNPR75YYEN7WH7SY/events.json","paper":"https://pith.science/paper/LWWJVLHE"},"agent_actions":{"view_html":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY","download_json":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY.json","view_paper":"https://pith.science/paper/LWWJVLHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05277&json=true","fetch_graph":"https://pith.science/api/pith-number/LWWJVLHEZIHNPR75YYEN7WH7SY/graph.json","fetch_events":"https://pith.science/api/pith-number/LWWJVLHEZIHNPR75YYEN7WH7SY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY/action/storage_attestation","attest_author":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY/action/author_attestation","sign_citation":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY/action/citation_signature","submit_replication":"https://pith.science/pith/LWWJVLHEZIHNPR75YYEN7WH7SY/action/replication_record"}},"created_at":"2026-05-17T23:40:03.163583+00:00","updated_at":"2026-05-17T23:40:03.163583+00:00"}