{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DSPT5SUEQZJP73WAANXKA5TE5T","short_pith_number":"pith:DSPT5SUE","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"},"canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","source":{"kind":"arxiv","id":"1708.01008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01008","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01008v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01008","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"DSPT5SUEQZJP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSPT5SUEQZJP73WA","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSPT5SUE","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DSPT5SUEQZJP73WAANXKA5TE5T","target":"record","payload":{"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"},"canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","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"},"source_kind":"arxiv","source_id":"1708.01008","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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGXFeRYrpEPIINoDQPyt+bYFyOlAuHLe7g+XivDgH9QI0W3QKo4zhO2uEofvzzANSeDLjqOvLrZAgfWryhn4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:47:23.981740Z"},"content_sha256":"1c0a1a2bf715ed1f4d2319fe28ad3ccccb5ec4fe06adad7f67c080dd1116c3c9","schema_version":"1.0","event_id":"sha256:1c0a1a2bf715ed1f4d2319fe28ad3ccccb5ec4fe06adad7f67c080dd1116c3c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DSPT5SUEQZJP73WAANXKA5TE5T","target":"graph","payload":{"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"},"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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TeHAVftdHR4IKA8BqZhZIWjd0VJT2uuA3cWbQkN7lFGLnFZg6DFbop6B/s0vy1l6s85145Kx6sUM9IK9VBwvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:47:23.982163Z"},"content_sha256":"fc77e461dafc9c89dc1164817306f3d17cf7bd84e5a9e7cd3cc265ab7544b8b5","schema_version":"1.0","event_id":"sha256:fc77e461dafc9c89dc1164817306f3d17cf7bd84e5a9e7cd3cc265ab7544b8b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/bundle.json","state_url":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSPT5SUEQZJP73WAANXKA5TE5T/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-05-27T01:47:23Z","links":{"resolver":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T","bundle":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/bundle.json","state":"https://pith.science/pith/DSPT5SUEQZJP73WAANXKA5TE5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSPT5SUEQZJP73WAANXKA5TE5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DSPT5SUEQZJP73WAANXKA5TE5T","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":"329315c76f6ce5b482bf8a120707988a20213a03fe408b6f9527ab5b538c32b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-03T05:51:27Z","title_canon_sha256":"b3fae5e2f6b4f107837f041d98c5e727060b183854bf92bd41528d2d8d24e0c6"},"schema_version":"1.0","source":{"id":"1708.01008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01008","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01008v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01008","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"DSPT5SUEQZJP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSPT5SUEQZJP73WA","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSPT5SUE","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:fc77e461dafc9c89dc1164817306f3d17cf7bd84e5a9e7cd3cc265ab7544b8b5","target":"graph","created_at":"2026-05-18T00:38:40Z","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":"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","authors_text":"Anton van den Hengel, Chunhua Shen, Lei Zhang, Qinfeng Shi, Wei Wei, Yanning Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-03T05:51:27Z","title":"Beyond Low Rank: A Data-Adaptive Tensor Completion Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01008","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:1c0a1a2bf715ed1f4d2319fe28ad3ccccb5ec4fe06adad7f67c080dd1116c3c9","target":"record","created_at":"2026-05-18T00:38:40Z","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":"329315c76f6ce5b482bf8a120707988a20213a03fe408b6f9527ab5b538c32b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-03T05:51:27Z","title_canon_sha256":"b3fae5e2f6b4f107837f041d98c5e727060b183854bf92bd41528d2d8d24e0c6"},"schema_version":"1.0","source":{"id":"1708.01008","kind":"arxiv","version":1}},"canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c9f3eca848652ffeec0036ea07664ece8f4bbdb54fb2714ed655e089cbfe938","first_computed_at":"2026-05-18T00:38:40.850998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.850998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/PwATATk3nIDgdZ9OaUavYdQIJP5VQ1ky5KmtkfBCdNgI1R7sVuseCw5Ld0KjuuS+ESpzxSoiKDgjZdlCh6lBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.851528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c0a1a2bf715ed1f4d2319fe28ad3ccccb5ec4fe06adad7f67c080dd1116c3c9","sha256:fc77e461dafc9c89dc1164817306f3d17cf7bd84e5a9e7cd3cc265ab7544b8b5"],"state_sha256":"ad9c29966541a4d32f3c28acb79aaad21694196a84eccddf083e8d4f19280677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sBEPNToiIpJIRovo49pCO2ngpIhyAkCQDh/QvnVIHbsHn63oBFQ8yr2EtYFCjixHwtkSe8PFw0CMWjHEmbDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:47:23.985617Z","bundle_sha256":"df319950a57ab60856cae320ba7ccadcd22ce7e3c0318a2d5977bbf1aab5ecd4"}}