{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KNWHSOGZJNKFPRGB7YR5ZCAWEJ","short_pith_number":"pith:KNWHSOGZ","canonical_record":{"source":{"id":"1705.06755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-18T18:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"f725ed9da3cb1876d9209f73121d34311dc8711c9361c1970f37a29c699ee36b","abstract_canon_sha256":"8031bbc9b4b333b7f7aec44b4c5c85a7b2df3e87732931b0737674b147a336d0"},"schema_version":"1.0"},"canonical_sha256":"536c7938d94b5457c4c1fe23dc88162252a76f9368c3c3be8bde03f9591b6cc0","source":{"kind":"arxiv","id":"1705.06755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06755","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06755v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06755","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"KNWHSOGZJNKF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNWHSOGZJNKFPRGB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNWHSOGZ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KNWHSOGZJNKFPRGB7YR5ZCAWEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-18T18:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"f725ed9da3cb1876d9209f73121d34311dc8711c9361c1970f37a29c699ee36b","abstract_canon_sha256":"8031bbc9b4b333b7f7aec44b4c5c85a7b2df3e87732931b0737674b147a336d0"},"schema_version":"1.0"},"canonical_sha256":"536c7938d94b5457c4c1fe23dc88162252a76f9368c3c3be8bde03f9591b6cc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.356289Z","signature_b64":"conRJANrH0uAFSBoroUI47KKQjJGSi2nzJW9+saH9W2Y7y8ovx1YPH6MiUruxzFod9kvUJikrmJ3u7s6Cc80Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"536c7938d94b5457c4c1fe23dc88162252a76f9368c3c3be8bde03f9591b6cc0","last_reissued_at":"2026-05-18T00:44:11.355847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.355847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06755","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUuESSjm66jHLzOKmtpZ/TiwNd2ZQCRg/QF1mpBNM38D6fDQhrnOAHkeoQTTT7YweGSS73wnv++hFUw+cgTzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:40:17.825827Z"},"content_sha256":"a48dd06787cb5adc34f9781bd95db3d85f1c7db827b28ebfb85716d00eaa2eb1","schema_version":"1.0","event_id":"sha256:a48dd06787cb5adc34f9781bd95db3d85f1c7db827b28ebfb85716d00eaa2eb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KNWHSOGZJNKFPRGB7YR5ZCAWEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Model for Robust Tensor Factorization with Unknown Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deyu Meng, Lin Lin, Qian Zhao, Xi'ai Chen, Yandong Tang, Yao Wang, Zhi Han","submitted_at":"2017-05-18T18:04:15Z","abstract_excerpt":"Because of the limitations of matrix factorization, such as losing spatial structure information, the concept of low-rank tensor factorization (LRTF) has been applied for the recovery of a low dimensional subspace from high dimensional visual data. The low-rank tensor recovery is generally achieved by minimizing the loss function between the observed data and the factorization representation. The loss function is designed in various forms under different noise distribution assumptions, like $L_1$ norm for Laplacian distribution and $L_2$ norm for Gaussian distribution. However, they often fail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06755","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:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txBXvjiUvWfi1OQdhwl5DHlh0g6iVoixiA9tYJ1cCJRdZXFap1qDcXrirBJUqiUVBp7jUuYtz6a3gwYj0dcNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:40:17.828264Z"},"content_sha256":"53cdc57d56df3efb180db9d43f790fc5896dad7df2f7c8c42ca83e288fa39f1c","schema_version":"1.0","event_id":"sha256:53cdc57d56df3efb180db9d43f790fc5896dad7df2f7c8c42ca83e288fa39f1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/bundle.json","state_url":"https://pith.science/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/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-08T04:40:17Z","links":{"resolver":"https://pith.science/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ","bundle":"https://pith.science/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/bundle.json","state":"https://pith.science/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNWHSOGZJNKFPRGB7YR5ZCAWEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNWHSOGZJNKFPRGB7YR5ZCAWEJ","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":"8031bbc9b4b333b7f7aec44b4c5c85a7b2df3e87732931b0737674b147a336d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-18T18:04:15Z","title_canon_sha256":"f725ed9da3cb1876d9209f73121d34311dc8711c9361c1970f37a29c699ee36b"},"schema_version":"1.0","source":{"id":"1705.06755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06755","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06755v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06755","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"KNWHSOGZJNKF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNWHSOGZJNKFPRGB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNWHSOGZ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:53cdc57d56df3efb180db9d43f790fc5896dad7df2f7c8c42ca83e288fa39f1c","target":"graph","created_at":"2026-05-18T00:44:11Z","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":"Because of the limitations of matrix factorization, such as losing spatial structure information, the concept of low-rank tensor factorization (LRTF) has been applied for the recovery of a low dimensional subspace from high dimensional visual data. The low-rank tensor recovery is generally achieved by minimizing the loss function between the observed data and the factorization representation. The loss function is designed in various forms under different noise distribution assumptions, like $L_1$ norm for Laplacian distribution and $L_2$ norm for Gaussian distribution. However, they often fail","authors_text":"Deyu Meng, Lin Lin, Qian Zhao, Xi'ai Chen, Yandong Tang, Yao Wang, Zhi Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-18T18:04:15Z","title":"A General Model for Robust Tensor Factorization with Unknown Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06755","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:a48dd06787cb5adc34f9781bd95db3d85f1c7db827b28ebfb85716d00eaa2eb1","target":"record","created_at":"2026-05-18T00:44:11Z","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":"8031bbc9b4b333b7f7aec44b4c5c85a7b2df3e87732931b0737674b147a336d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-18T18:04:15Z","title_canon_sha256":"f725ed9da3cb1876d9209f73121d34311dc8711c9361c1970f37a29c699ee36b"},"schema_version":"1.0","source":{"id":"1705.06755","kind":"arxiv","version":1}},"canonical_sha256":"536c7938d94b5457c4c1fe23dc88162252a76f9368c3c3be8bde03f9591b6cc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"536c7938d94b5457c4c1fe23dc88162252a76f9368c3c3be8bde03f9591b6cc0","first_computed_at":"2026-05-18T00:44:11.355847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.355847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"conRJANrH0uAFSBoroUI47KKQjJGSi2nzJW9+saH9W2Y7y8ovx1YPH6MiUruxzFod9kvUJikrmJ3u7s6Cc80Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.356289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a48dd06787cb5adc34f9781bd95db3d85f1c7db827b28ebfb85716d00eaa2eb1","sha256:53cdc57d56df3efb180db9d43f790fc5896dad7df2f7c8c42ca83e288fa39f1c"],"state_sha256":"cc32e4775a55bcbb46b7edf8bea0599ea05621e1ec2be7f28434b7faca4c0fc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/Pfpgr9MLkrb848gKFB9gFhEPZWWndLXtXcn7hAhfRmQfNWkrdAOrpCDGNbYVhcEcGX22lJE7PQI5GpY0fnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:40:17.832962Z","bundle_sha256":"c761f94ebced08539ed4ed46d9ad9d44b4e3356dbcbabb469289a20c018bcf57"}}