{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MIV2XSDKF3KTBNPPOYBZNAXPDV","short_pith_number":"pith:MIV2XSDK","schema_version":"1.0","canonical_sha256":"622babc86a2ed530b5ef76039682ef1d58633489620bc48e64de7c80afe3c600","source":{"kind":"arxiv","id":"1801.02662","version":2},"attestation_state":"computed","paper":{"title":"Tensor network ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ke Ye, Lek-Heng Lim","submitted_at":"2018-01-08T19:55:19Z","abstract_excerpt":"In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor (which we will see are all the same object in this context) has \\emph{low rank} may be ill-justified. There are many natural instances where the object in question has high rank with respect to the classical notions of rank: matrix rank, tensor rank, multilinear rank --- the latter two being the most straightforward generalizations of the former. To remedy "},"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":"1801.02662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-08T19:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"5d5397e2b73ede6a69c5cc6b4998002b857c8b220e26863a6de0fe4d396d86c3","abstract_canon_sha256":"30de230900dd499496e2d024c0ff204973784029ee6b5974c5472c26b4fb00ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.473188Z","signature_b64":"Cu+p9qxLCv6U/pnw3Ip7iFkbAZPp4gHxUpTTNCzfhD12WSrpdi6KGQJrOKxNlQ4ctGzIsEC0b1WEG/lTdf4kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622babc86a2ed530b5ef76039682ef1d58633489620bc48e64de7c80afe3c600","last_reissued_at":"2026-05-17T23:54:26.472619Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.472619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor network ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ke Ye, Lek-Heng Lim","submitted_at":"2018-01-08T19:55:19Z","abstract_excerpt":"In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor (which we will see are all the same object in this context) has \\emph{low rank} may be ill-justified. There are many natural instances where the object in question has high rank with respect to the classical notions of rank: matrix rank, tensor rank, multilinear rank --- the latter two being the most straightforward generalizations of the former. To remedy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02662","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":"1801.02662","created_at":"2026-05-17T23:54:26.472734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02662v2","created_at":"2026-05-17T23:54:26.472734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02662","created_at":"2026-05-17T23:54:26.472734+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIV2XSDKF3KT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIV2XSDKF3KTBNPP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIV2XSDK","created_at":"2026-05-18T12:32:37.024351+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/MIV2XSDKF3KTBNPPOYBZNAXPDV","json":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV.json","graph_json":"https://pith.science/api/pith-number/MIV2XSDKF3KTBNPPOYBZNAXPDV/graph.json","events_json":"https://pith.science/api/pith-number/MIV2XSDKF3KTBNPPOYBZNAXPDV/events.json","paper":"https://pith.science/paper/MIV2XSDK"},"agent_actions":{"view_html":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV","download_json":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV.json","view_paper":"https://pith.science/paper/MIV2XSDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02662&json=true","fetch_graph":"https://pith.science/api/pith-number/MIV2XSDKF3KTBNPPOYBZNAXPDV/graph.json","fetch_events":"https://pith.science/api/pith-number/MIV2XSDKF3KTBNPPOYBZNAXPDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV/action/storage_attestation","attest_author":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV/action/author_attestation","sign_citation":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV/action/citation_signature","submit_replication":"https://pith.science/pith/MIV2XSDKF3KTBNPPOYBZNAXPDV/action/replication_record"}},"created_at":"2026-05-17T23:54:26.472734+00:00","updated_at":"2026-05-17T23:54:26.472734+00:00"}