{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3Y6TKRU4RVTJ76QX3V2RXQMSYB","short_pith_number":"pith:3Y6TKRU4","schema_version":"1.0","canonical_sha256":"de3d35469c8d669ffa17dd751bc192c040bb04eb2cc8c5081d55906bb5269e24","source":{"kind":"arxiv","id":"2207.06072","version":3},"attestation_state":"computed","paper":{"title":"Cross Tensor Approximation for Image and Video Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Ivan Oseledets, Jun Wang, Maame Gyamfua Asante-Mensah, Salman Ahmadi-Asl","submitted_at":"2022-07-13T09:23:55Z","abstract_excerpt":"This paper proposes a general framework to use the cross tensor approximation or tensor ColUmn-Row (CUR) approximation for reconstructing incomplete images and videos. The key importance of the new algorithms is their simplicity and ease of implementation with low computational complexity. For the case of data tensors with 1) structural missing components or 2) a high missing rate, we propose an efficient smooth tensor CUR algorithms which first make the sampled fibers smooth and then apply the proposed CUR algorithms. The numerical experiments show the significant benefit of this smoothing pr"},"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":"2207.06072","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2022-07-13T09:23:55Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1e7d645f27764fba128f842facc660285dbbab943bc5eb4c0b63283012d2868a","abstract_canon_sha256":"d664eac6be2535b22bf2d0c89d3a487efff1d2a486f1a1f17f6bfd19217996d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:15.876175Z","signature_b64":"pOKD80zX5vVz8b0AZhnA+UNbCCff0tzduw8faZAWKQGSLHAtg4pCQjNd8FOje1J9BKDRldsXNKRGIB41FAwXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de3d35469c8d669ffa17dd751bc192c040bb04eb2cc8c5081d55906bb5269e24","last_reissued_at":"2026-07-05T05:31:15.875715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:15.875715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross Tensor Approximation for Image and Video Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrzej Cichocki, Anh-Huy Phan, Ivan Oseledets, Jun Wang, Maame Gyamfua Asante-Mensah, Salman Ahmadi-Asl","submitted_at":"2022-07-13T09:23:55Z","abstract_excerpt":"This paper proposes a general framework to use the cross tensor approximation or tensor ColUmn-Row (CUR) approximation for reconstructing incomplete images and videos. The key importance of the new algorithms is their simplicity and ease of implementation with low computational complexity. For the case of data tensors with 1) structural missing components or 2) a high missing rate, we propose an efficient smooth tensor CUR algorithms which first make the sampled fibers smooth and then apply the proposed CUR algorithms. The numerical experiments show the significant benefit of this smoothing pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06072","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.06072/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.06072","created_at":"2026-07-05T05:31:15.875786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06072v3","created_at":"2026-07-05T05:31:15.875786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06072","created_at":"2026-07-05T05:31:15.875786+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Y6TKRU4RVTJ","created_at":"2026-07-05T05:31:15.875786+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Y6TKRU4RVTJ76QX","created_at":"2026-07-05T05:31:15.875786+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Y6TKRU4","created_at":"2026-07-05T05:31:15.875786+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09926","citing_title":"Robust Anomaly Detection via Tensor Pseudoskeleton Decomposition","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB","json":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB.json","graph_json":"https://pith.science/api/pith-number/3Y6TKRU4RVTJ76QX3V2RXQMSYB/graph.json","events_json":"https://pith.science/api/pith-number/3Y6TKRU4RVTJ76QX3V2RXQMSYB/events.json","paper":"https://pith.science/paper/3Y6TKRU4"},"agent_actions":{"view_html":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB","download_json":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB.json","view_paper":"https://pith.science/paper/3Y6TKRU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06072&json=true","fetch_graph":"https://pith.science/api/pith-number/3Y6TKRU4RVTJ76QX3V2RXQMSYB/graph.json","fetch_events":"https://pith.science/api/pith-number/3Y6TKRU4RVTJ76QX3V2RXQMSYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB/action/storage_attestation","attest_author":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB/action/author_attestation","sign_citation":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB/action/citation_signature","submit_replication":"https://pith.science/pith/3Y6TKRU4RVTJ76QX3V2RXQMSYB/action/replication_record"}},"created_at":"2026-07-05T05:31:15.875786+00:00","updated_at":"2026-07-05T05:31:15.875786+00:00"}