{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FBUXWMVZY7ZR7QZDXWDXFVTRSA","short_pith_number":"pith:FBUXWMVZ","schema_version":"1.0","canonical_sha256":"28697b32b9c7f31fc323bd8772d671901661e5e449ee3bbe7a9c2f14aebf896d","source":{"kind":"arxiv","id":"1610.04490","version":3},"attestation_state":"computed","paper":{"title":"Amortised MAP Inference for Image Super-resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Casper Kaae S{\\o}nderby, Ferenc Husz\\'ar, Jose Caballero, Lucas Theis, Wenzhe Shi","submitted_at":"2016-10-14T14:58:44Z","abstract_excerpt":"Image super-resolution (SR) is an underdetermined inverse problem, where a large number of plausible high-resolution images can explain the same downsampled image. Most current single image SR methods use empirical risk minimisation, often with a pixel-wise mean squared error (MSE) loss. However, the outputs from such methods tend to be blurry, over-smoothed and generally appear implausible. A more desirable approach would employ Maximum a Posteriori (MAP) inference, preferring solutions that always have a high probability under the image prior, and thus appear more plausible. Direct MAP estim"},"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":"1610.04490","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-14T14:58:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"67d8dc8c5cf6e6255a24da373f25e9c6c1aaba7884e950696213f36a228c7ab1","abstract_canon_sha256":"f45071d12e3dd1f1549d03e1cb797d04b2054f2e7f6fa1a13dcc2b99397b0c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:58.224477Z","signature_b64":"i0ZXe7F3hmPUs0OFmEEezce9atOQbrSvc/O09rrdf8Tvh3aWGskoNn4x0/T6u+JeAkYfu7716W9BSMPKxzjCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28697b32b9c7f31fc323bd8772d671901661e5e449ee3bbe7a9c2f14aebf896d","last_reissued_at":"2026-05-18T00:49:58.223854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:58.223854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortised MAP Inference for Image Super-resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Casper Kaae S{\\o}nderby, Ferenc Husz\\'ar, Jose Caballero, Lucas Theis, Wenzhe Shi","submitted_at":"2016-10-14T14:58:44Z","abstract_excerpt":"Image super-resolution (SR) is an underdetermined inverse problem, where a large number of plausible high-resolution images can explain the same downsampled image. Most current single image SR methods use empirical risk minimisation, often with a pixel-wise mean squared error (MSE) loss. However, the outputs from such methods tend to be blurry, over-smoothed and generally appear implausible. A more desirable approach would employ Maximum a Posteriori (MAP) inference, preferring solutions that always have a high probability under the image prior, and thus appear more plausible. Direct MAP estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04490","kind":"arxiv","version":3},"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":"1610.04490","created_at":"2026-05-18T00:49:58.223941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04490v3","created_at":"2026-05-18T00:49:58.223941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04490","created_at":"2026-05-18T00:49:58.223941+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBUXWMVZY7ZR","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBUXWMVZY7ZR7QZD","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBUXWMVZ","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20130","citing_title":"Pairing Regularization for Mitigating Many-to-One Collapse in GANs","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA","json":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA.json","graph_json":"https://pith.science/api/pith-number/FBUXWMVZY7ZR7QZDXWDXFVTRSA/graph.json","events_json":"https://pith.science/api/pith-number/FBUXWMVZY7ZR7QZDXWDXFVTRSA/events.json","paper":"https://pith.science/paper/FBUXWMVZ"},"agent_actions":{"view_html":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA","download_json":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA.json","view_paper":"https://pith.science/paper/FBUXWMVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04490&json=true","fetch_graph":"https://pith.science/api/pith-number/FBUXWMVZY7ZR7QZDXWDXFVTRSA/graph.json","fetch_events":"https://pith.science/api/pith-number/FBUXWMVZY7ZR7QZDXWDXFVTRSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA/action/storage_attestation","attest_author":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA/action/author_attestation","sign_citation":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA/action/citation_signature","submit_replication":"https://pith.science/pith/FBUXWMVZY7ZR7QZDXWDXFVTRSA/action/replication_record"}},"created_at":"2026-05-18T00:49:58.223941+00:00","updated_at":"2026-05-18T00:49:58.223941+00:00"}