{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7DOJYZRS4WGKHJSKA6WJF52ZIF","short_pith_number":"pith:7DOJYZRS","schema_version":"1.0","canonical_sha256":"f8dc9c6632e58ca3a64a07ac92f759414cd69c6d64e84e40e5148311b607a875","source":{"kind":"arxiv","id":"1902.03070","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for Cosine Transform Based Tensor Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Michael Ng, Wen-hao Xu, Xi-Le Zhao","submitted_at":"2019-02-08T13:21:37Z","abstract_excerpt":"Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix. The main aims of this paper are to propose and study tensor singular value decomposition based on the discrete cosine transform (DCT) matrix. The advantages of using DCT are that (i) the complex arithmetic is not involved in the cosine transform based tensor singular value decomposition, so the computational cost required can be saved; (ii) the intrinsic reflexive boundary condition along the tubes in the third dimension of tensors is employed, so its pe"},"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":"1902.03070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-08T13:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"3a055b919754a878f19fe98a467668e89458e41ce7decb77bbd7ab2b33fb7da7","abstract_canon_sha256":"4a8c0a328762d719d1d8debe0890790b53b022580ca365967d80a675b022359f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.054799Z","signature_b64":"ICk0UacQyTBHuaQrxDtQkZXYWxBgiJ2WDdcFceVWyByo3QmNKkf1sddGiN6eDQRW8pT+YrqYID97GJuOc1cKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8dc9c6632e58ca3a64a07ac92f759414cd69c6d64e84e40e5148311b607a875","last_reissued_at":"2026-05-17T23:54:28.054001Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.054001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Cosine Transform Based Tensor Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Michael Ng, Wen-hao Xu, Xi-Le Zhao","submitted_at":"2019-02-08T13:21:37Z","abstract_excerpt":"Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix. The main aims of this paper are to propose and study tensor singular value decomposition based on the discrete cosine transform (DCT) matrix. The advantages of using DCT are that (i) the complex arithmetic is not involved in the cosine transform based tensor singular value decomposition, so the computational cost required can be saved; (ii) the intrinsic reflexive boundary condition along the tubes in the third dimension of tensors is employed, so its pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03070","kind":"arxiv","version":1},"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":"1902.03070","created_at":"2026-05-17T23:54:28.054114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03070v1","created_at":"2026-05-17T23:54:28.054114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03070","created_at":"2026-05-17T23:54:28.054114+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DOJYZRS4WGK","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DOJYZRS4WGKHJSK","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DOJYZRS","created_at":"2026-05-18T12:33:12.712433+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/7DOJYZRS4WGKHJSKA6WJF52ZIF","json":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF.json","graph_json":"https://pith.science/api/pith-number/7DOJYZRS4WGKHJSKA6WJF52ZIF/graph.json","events_json":"https://pith.science/api/pith-number/7DOJYZRS4WGKHJSKA6WJF52ZIF/events.json","paper":"https://pith.science/paper/7DOJYZRS"},"agent_actions":{"view_html":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF","download_json":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF.json","view_paper":"https://pith.science/paper/7DOJYZRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03070&json=true","fetch_graph":"https://pith.science/api/pith-number/7DOJYZRS4WGKHJSKA6WJF52ZIF/graph.json","fetch_events":"https://pith.science/api/pith-number/7DOJYZRS4WGKHJSKA6WJF52ZIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF/action/storage_attestation","attest_author":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF/action/author_attestation","sign_citation":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF/action/citation_signature","submit_replication":"https://pith.science/pith/7DOJYZRS4WGKHJSKA6WJF52ZIF/action/replication_record"}},"created_at":"2026-05-17T23:54:28.054114+00:00","updated_at":"2026-05-17T23:54:28.054114+00:00"}