{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PKFIN5BPGHBE2UXSP4P5I6T5DA","short_pith_number":"pith:PKFIN5BP","schema_version":"1.0","canonical_sha256":"7a8a86f42f31c24d52f27f1fd47a7d180a20b6273646a8e1332fb004aad8d61c","source":{"kind":"arxiv","id":"1803.11525","version":2},"attestation_state":"computed","paper":{"title":"Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Chang Meng, Clarissa Garvey, James G. Nagy","submitted_at":"2018-03-30T15:58:30Z","abstract_excerpt":"In this paper we propose an approach to approximate a truncated singular value decomposition of a large structured matrix. By first decomposing the matrix into a sum of Kronecker products, our approach can be used to approximate a large number of singular values and vectors more efficiently than other well known schemes, such as randomized matrix algorithms or iterative algorithms based on Golub-Kahan bidiagonalization. We provide theoretical results and numerical experiments to demonstrate the accuracy of our approximation and show how the approximation can be used to solve large scale ill-po"},"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":"1803.11525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-30T15:58:30Z","cross_cats_sorted":[],"title_canon_sha256":"257b3e3b301320b4f5359b5eb36a359ca2cb8289e07b33de9b04d65c19402848","abstract_canon_sha256":"5222ce06d932398001c925ed6ee15dee652afb1c2b79501059339e3f600ab39c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:40.788166Z","signature_b64":"L3JIZK4jwxmeWUHFtwGzbCOww3q95IQWaPPhDn2a8Sv+cA3VokatI8Kubyh2rUCvlVp8chECkbRU249vBCf0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a8a86f42f31c24d52f27f1fd47a7d180a20b6273646a8e1332fb004aad8d61c","last_reissued_at":"2026-05-18T00:19:40.787531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:40.787531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Chang Meng, Clarissa Garvey, James G. Nagy","submitted_at":"2018-03-30T15:58:30Z","abstract_excerpt":"In this paper we propose an approach to approximate a truncated singular value decomposition of a large structured matrix. By first decomposing the matrix into a sum of Kronecker products, our approach can be used to approximate a large number of singular values and vectors more efficiently than other well known schemes, such as randomized matrix algorithms or iterative algorithms based on Golub-Kahan bidiagonalization. We provide theoretical results and numerical experiments to demonstrate the accuracy of our approximation and show how the approximation can be used to solve large scale ill-po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11525","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":"1803.11525","created_at":"2026-05-18T00:19:40.787623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11525v2","created_at":"2026-05-18T00:19:40.787623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11525","created_at":"2026-05-18T00:19:40.787623+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKFIN5BPGHBE","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKFIN5BPGHBE2UXS","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKFIN5BP","created_at":"2026-05-18T12:32:46.962924+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/PKFIN5BPGHBE2UXSP4P5I6T5DA","json":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA.json","graph_json":"https://pith.science/api/pith-number/PKFIN5BPGHBE2UXSP4P5I6T5DA/graph.json","events_json":"https://pith.science/api/pith-number/PKFIN5BPGHBE2UXSP4P5I6T5DA/events.json","paper":"https://pith.science/paper/PKFIN5BP"},"agent_actions":{"view_html":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA","download_json":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA.json","view_paper":"https://pith.science/paper/PKFIN5BP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11525&json=true","fetch_graph":"https://pith.science/api/pith-number/PKFIN5BPGHBE2UXSP4P5I6T5DA/graph.json","fetch_events":"https://pith.science/api/pith-number/PKFIN5BPGHBE2UXSP4P5I6T5DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA/action/storage_attestation","attest_author":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA/action/author_attestation","sign_citation":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA/action/citation_signature","submit_replication":"https://pith.science/pith/PKFIN5BPGHBE2UXSP4P5I6T5DA/action/replication_record"}},"created_at":"2026-05-18T00:19:40.787623+00:00","updated_at":"2026-05-18T00:19:40.787623+00:00"}