{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZXCB4S27MRI4Z3ML5W3ICPFK4Z","short_pith_number":"pith:ZXCB4S27","schema_version":"1.0","canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","source":{"kind":"arxiv","id":"1412.7270","version":1},"attestation_state":"computed","paper":{"title":"Nearly Low Rank Tensors and Their Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jiawang Nie","submitted_at":"2014-12-23T06:59:14Z","abstract_excerpt":"The low rank tensor approximation problem (LRTAP) is to find a tensor whose rank is small and that is close to a given one. This paper studies the LRTAP when the tensor to be approximated is close to a low rank one. Both symmetric and nonsymmetric tensors are discussed. We propose a new approach for solving the LRTAP. It consists of three major stages: i) Find a set of linear relations that are approximately satisfied by the tensor; such linear relations can be expressed by polynomials and can be found by solving linear least squares. ii) Compute a set of points that are approximately common z"},"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":"1412.7270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-23T06:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"161ce11b4ec6b0ecefb56567762d93afc2f6cb7786a457633f8ba60c44847f91","abstract_canon_sha256":"0ac2185287563496fc2408d3d977aa2f0cad63754a574d779eee8ab9351e30a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:39.269013Z","signature_b64":"XaFtjdoCMfJoVr6Gx8WNljzV/hsef9Tns/NV75Y4gAa65LxVaULaAi2U+xwWO4bnwfOKkdNiiRUPsw3FcF+aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","last_reissued_at":"2026-05-18T02:30:39.268577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:39.268577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Low Rank Tensors and Their Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jiawang Nie","submitted_at":"2014-12-23T06:59:14Z","abstract_excerpt":"The low rank tensor approximation problem (LRTAP) is to find a tensor whose rank is small and that is close to a given one. This paper studies the LRTAP when the tensor to be approximated is close to a low rank one. Both symmetric and nonsymmetric tensors are discussed. We propose a new approach for solving the LRTAP. It consists of three major stages: i) Find a set of linear relations that are approximately satisfied by the tensor; such linear relations can be expressed by polynomials and can be found by solving linear least squares. ii) Compute a set of points that are approximately common z"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7270","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":"1412.7270","created_at":"2026-05-18T02:30:39.268641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7270v1","created_at":"2026-05-18T02:30:39.268641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7270","created_at":"2026-05-18T02:30:39.268641+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXCB4S27MRI4","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXCB4S27MRI4Z3ML","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXCB4S27","created_at":"2026-05-18T12:28:59.999130+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/ZXCB4S27MRI4Z3ML5W3ICPFK4Z","json":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z.json","graph_json":"https://pith.science/api/pith-number/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/graph.json","events_json":"https://pith.science/api/pith-number/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/events.json","paper":"https://pith.science/paper/ZXCB4S27"},"agent_actions":{"view_html":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z","download_json":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z.json","view_paper":"https://pith.science/paper/ZXCB4S27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7270&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/action/storage_attestation","attest_author":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/action/author_attestation","sign_citation":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/action/citation_signature","submit_replication":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/action/replication_record"}},"created_at":"2026-05-18T02:30:39.268641+00:00","updated_at":"2026-05-18T02:30:39.268641+00:00"}