{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DSPT5SUEQZJP73WAANXKA5TE5T","short_pith_number":"pith:DSPT5SUE","schema_version":"1.0","canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","source":{"kind":"arxiv","id":"1708.01008","version":1},"attestation_state":"computed","paper":{"title":"Beyond Low Rank: A Data-Adaptive Tensor Completion Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Lei Zhang, Qinfeng Shi, Wei Wei, Yanning Zhang","submitted_at":"2017-08-03T05:51:27Z","abstract_excerpt":"Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explicitly represents both the low-rank and non-low-rank structures in a latent tensor. Representing the non-low-rank structure separately from the low-rank one allows priors which capture the important distinc"},"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":"1708.01008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-03T05:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"b3fae5e2f6b4f107837f041d98c5e727060b183854bf92bd41528d2d8d24e0c6","abstract_canon_sha256":"329315c76f6ce5b482bf8a120707988a20213a03fe408b6f9527ab5b538c32b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.851528Z","signature_b64":"/PwATATk3nIDgdZ9OaUavYdQIJP5VQ1ky5KmtkfBCdNgI1R7sVuseCw5Ld0KjuuS+ESpzxSoiKDgjZdlCh6lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","last_reissued_at":"2026-05-18T00:38:40.850998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.850998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Low Rank: A Data-Adaptive Tensor Completion Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Lei Zhang, Qinfeng Shi, Wei Wei, Yanning Zhang","submitted_at":"2017-08-03T05:51:27Z","abstract_excerpt":"Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explicitly represents both the low-rank and non-low-rank structures in a latent tensor. Representing the non-low-rank structure separately from the low-rank one allows priors which capture the important distinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01008","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":"1708.01008","created_at":"2026-05-18T00:38:40.851067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01008v1","created_at":"2026-05-18T00:38:40.851067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01008","created_at":"2026-05-18T00:38:40.851067+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSPT5SUEQZJP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSPT5SUEQZJP73WA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSPT5SUE","created_at":"2026-05-18T12:31:12.930513+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/DSPT5SUEQZJP73WAANXKA5TE5T","json":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T.json","graph_json":"https://pith.science/api/pith-number/DSPT5SUEQZJP73WAANXKA5TE5T/graph.json","events_json":"https://pith.science/api/pith-number/DSPT5SUEQZJP73WAANXKA5TE5T/events.json","paper":"https://pith.science/paper/DSPT5SUE"},"agent_actions":{"view_html":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T","download_json":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T.json","view_paper":"https://pith.science/paper/DSPT5SUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01008&json=true","fetch_graph":"https://pith.science/api/pith-number/DSPT5SUEQZJP73WAANXKA5TE5T/graph.json","fetch_events":"https://pith.science/api/pith-number/DSPT5SUEQZJP73WAANXKA5TE5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/action/storage_attestation","attest_author":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/action/author_attestation","sign_citation":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/action/citation_signature","submit_replication":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/action/replication_record"}},"created_at":"2026-05-18T00:38:40.851067+00:00","updated_at":"2026-05-18T00:38:40.851067+00:00"}