{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5ETJE22IPIST3XBBHD4RDN7UFA","short_pith_number":"pith:5ETJE22I","schema_version":"1.0","canonical_sha256":"e926926b487a253ddc2138f911b7f4283f84bd70684d822800c8feef717a222e","source":{"kind":"arxiv","id":"1503.01993","version":2},"attestation_state":"computed","paper":{"title":"Tomographic Image Reconstruction using Training images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CV","authors_text":"Martin S. Andersen, Per Christian Hansen, Sara Soltani","submitted_at":"2015-03-06T15:47:45Z","abstract_excerpt":"We describe and examine an algorithm for tomographic image reconstruction where prior knowledge about the solution is available in the form of training images. We first construct a nonnegative dictionary based on prototype elements from the training images; this problem is formulated as a regularized non-negative matrix factorization. Incorporating the dictionary as a prior in a convex reconstruction problem, we then find an approximate solution with a sparse representation in the dictionary. The dictionary is applied to non-overlapping patches of the image, which reduces the computational com"},"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":"1503.01993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-06T15:47:45Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4c09678596608ec6f71a16feac66dabff3ad65efc9a1b3b1ed85fd8f35a05000","abstract_canon_sha256":"cf688d111eb73d75c10fb1a54b8478ff4245ad9f13a78ef1f47f1c5bf64b9b9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:16.126763Z","signature_b64":"KL9d1f1QVVB7lPasnadNq2Y3MbsRarr06CBluoJ/P1Z4j56RxV5hM7sidOXiJ4O4V25aNKUuvsYRkQ2CQNcTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e926926b487a253ddc2138f911b7f4283f84bd70684d822800c8feef717a222e","last_reissued_at":"2026-05-18T01:35:16.126053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:16.126053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tomographic Image Reconstruction using Training images","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CV","authors_text":"Martin S. Andersen, Per Christian Hansen, Sara Soltani","submitted_at":"2015-03-06T15:47:45Z","abstract_excerpt":"We describe and examine an algorithm for tomographic image reconstruction where prior knowledge about the solution is available in the form of training images. We first construct a nonnegative dictionary based on prototype elements from the training images; this problem is formulated as a regularized non-negative matrix factorization. Incorporating the dictionary as a prior in a convex reconstruction problem, we then find an approximate solution with a sparse representation in the dictionary. The dictionary is applied to non-overlapping patches of the image, which reduces the computational com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01993","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":"1503.01993","created_at":"2026-05-18T01:35:16.126147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01993v2","created_at":"2026-05-18T01:35:16.126147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01993","created_at":"2026-05-18T01:35:16.126147+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ETJE22IPIST","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ETJE22IPIST3XBB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ETJE22I","created_at":"2026-05-18T12:29:05.191682+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/5ETJE22IPIST3XBBHD4RDN7UFA","json":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA.json","graph_json":"https://pith.science/api/pith-number/5ETJE22IPIST3XBBHD4RDN7UFA/graph.json","events_json":"https://pith.science/api/pith-number/5ETJE22IPIST3XBBHD4RDN7UFA/events.json","paper":"https://pith.science/paper/5ETJE22I"},"agent_actions":{"view_html":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA","download_json":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA.json","view_paper":"https://pith.science/paper/5ETJE22I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01993&json=true","fetch_graph":"https://pith.science/api/pith-number/5ETJE22IPIST3XBBHD4RDN7UFA/graph.json","fetch_events":"https://pith.science/api/pith-number/5ETJE22IPIST3XBBHD4RDN7UFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA/action/storage_attestation","attest_author":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA/action/author_attestation","sign_citation":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA/action/citation_signature","submit_replication":"https://pith.science/pith/5ETJE22IPIST3XBBHD4RDN7UFA/action/replication_record"}},"created_at":"2026-05-18T01:35:16.126147+00:00","updated_at":"2026-05-18T01:35:16.126147+00:00"}