{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZXCB4S27MRI4Z3ML5W3ICPFK4Z","short_pith_number":"pith:ZXCB4S27","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"},"canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","source":{"kind":"arxiv","id":"1412.7270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7270","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7270v1","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7270","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZXCB4S27MRI4","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXCB4S27MRI4Z3ML","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXCB4S27","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZXCB4S27MRI4Z3ML5W3ICPFK4Z","target":"record","payload":{"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"},"canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","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"},"source_kind":"arxiv","source_id":"1412.7270","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+8Y4+s772hf2wb42j5X3L93/Im0/iADDe0Sb4MhSoLLp0iDWM6ieHPH6ELVdkKW807JfYZz3vyETIOYm0juAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:13.036837Z"},"content_sha256":"f059ff2d38d12acfc4aa4225de14ff022f113a72eabb619f0fb5fc0f41c9e60f","schema_version":"1.0","event_id":"sha256:f059ff2d38d12acfc4aa4225de14ff022f113a72eabb619f0fb5fc0f41c9e60f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZXCB4S27MRI4Z3ML5W3ICPFK4Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixCFEcs7TCLHXuPgDmivkmDF5zI5MKRLIq3v23U6+NN/lxpHERaRY/9v4CoanaNMNo8bMo2G4blBA4Uh/5UsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:13.037220Z"},"content_sha256":"ba9b8d4e8f0d40c6bf413fad1f9a39a424e8d9cca1b79643de6b4cb1b72e8825","schema_version":"1.0","event_id":"sha256:ba9b8d4e8f0d40c6bf413fad1f9a39a424e8d9cca1b79643de6b4cb1b72e8825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/bundle.json","state_url":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T14:17:13Z","links":{"resolver":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z","bundle":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/bundle.json","state":"https://pith.science/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXCB4S27MRI4Z3ML5W3ICPFK4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZXCB4S27MRI4Z3ML5W3ICPFK4Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ac2185287563496fc2408d3d977aa2f0cad63754a574d779eee8ab9351e30a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-23T06:59:14Z","title_canon_sha256":"161ce11b4ec6b0ecefb56567762d93afc2f6cb7786a457633f8ba60c44847f91"},"schema_version":"1.0","source":{"id":"1412.7270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7270","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7270v1","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7270","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZXCB4S27MRI4","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXCB4S27MRI4Z3ML","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXCB4S27","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ba9b8d4e8f0d40c6bf413fad1f9a39a424e8d9cca1b79643de6b4cb1b72e8825","target":"graph","created_at":"2026-05-18T02:30:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jiawang Nie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-23T06:59:14Z","title":"Nearly Low Rank Tensors and Their Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7270","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f059ff2d38d12acfc4aa4225de14ff022f113a72eabb619f0fb5fc0f41c9e60f","target":"record","created_at":"2026-05-18T02:30:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ac2185287563496fc2408d3d977aa2f0cad63754a574d779eee8ab9351e30a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-23T06:59:14Z","title_canon_sha256":"161ce11b4ec6b0ecefb56567762d93afc2f6cb7786a457633f8ba60c44847f91"},"schema_version":"1.0","source":{"id":"1412.7270","kind":"arxiv","version":1}},"canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdc41e4b5f6451cced8bedb6813caae64029dff0d0489c18faee9fa8c0d940c9","first_computed_at":"2026-05-18T02:30:39.268577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:39.268577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XaFtjdoCMfJoVr6Gx8WNljzV/hsef9Tns/NV75Y4gAa65LxVaULaAi2U+xwWO4bnwfOKkdNiiRUPsw3FcF+aBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:39.269013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f059ff2d38d12acfc4aa4225de14ff022f113a72eabb619f0fb5fc0f41c9e60f","sha256:ba9b8d4e8f0d40c6bf413fad1f9a39a424e8d9cca1b79643de6b4cb1b72e8825"],"state_sha256":"7b7e836a1d79ab364604deb37f0e4b12a54e8c6a04ffdae3274c7fd0974c8568"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHRfzjxwpkir4LdJia2t0WpyynR25NuDZPu4Ah3C2hHcHtazBqr9y7jViA5zNoc0Xg1TVlWZT5Qw5LoTWaS5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:17:13.039331Z","bundle_sha256":"93610e979de532e41d2c4d0b4bd364ff4d1fc063c1186a69f4e10a13240929c0"}}