{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLASI75WDSEKMRSWREK3DRZWZK","short_pith_number":"pith:LLASI75W","schema_version":"1.0","canonical_sha256":"5ac1247fb61c88a646568915b1c736caa7f8b3a9b6e129111f87dd87923564e3","source":{"kind":"arxiv","id":"2102.09661","version":1},"attestation_state":"computed","paper":{"title":"Recovering orthogonal tensors under arbitrarily strong, but locally correlated, noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oscar Mickelin, Sertac Karaman","submitted_at":"2021-02-18T23:09:22Z","abstract_excerpt":"We consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by noise vectors with components that are correlated locally, i.e., with nearby components. We show that this deterministic tensor completion problem has the unusual property that it can be solved in polynomial time if the rank of the tensor is sufficiently large. This is the polar opposite of the low-rank assumptions of typical low-rank tensor and matrix complet"},"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":"2102.09661","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2021-02-18T23:09:22Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e631fd4d973a340fa63292f4c6441c43aef0c7edf75b692886d8adfcaa6614c1","abstract_canon_sha256":"7f5de296bcea5fd6c00c102ba06a0025fe2292ec47baced3408a5878cf7a81e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:29.869932Z","signature_b64":"0m6Hhlbtq9Cw65axeQHAZwO+12U8+HxAmJnMJ/JHByvZp3GhKvfK3epX7q+FzvFnVaAp23oK28zdZqrJLTOcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac1247fb61c88a646568915b1c736caa7f8b3a9b6e129111f87dd87923564e3","last_reissued_at":"2026-07-05T02:16:29.869515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:29.869515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovering orthogonal tensors under arbitrarily strong, but locally correlated, noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Oscar Mickelin, Sertac Karaman","submitted_at":"2021-02-18T23:09:22Z","abstract_excerpt":"We consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by noise vectors with components that are correlated locally, i.e., with nearby components. We show that this deterministic tensor completion problem has the unusual property that it can be solved in polynomial time if the rank of the tensor is sufficiently large. This is the polar opposite of the low-rank assumptions of typical low-rank tensor and matrix complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09661","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.09661/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":"2102.09661","created_at":"2026-07-05T02:16:29.869567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09661v1","created_at":"2026-07-05T02:16:29.869567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09661","created_at":"2026-07-05T02:16:29.869567+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLASI75WDSEK","created_at":"2026-07-05T02:16:29.869567+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLASI75WDSEKMRSW","created_at":"2026-07-05T02:16:29.869567+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLASI75W","created_at":"2026-07-05T02:16:29.869567+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/LLASI75WDSEKMRSWREK3DRZWZK","json":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK.json","graph_json":"https://pith.science/api/pith-number/LLASI75WDSEKMRSWREK3DRZWZK/graph.json","events_json":"https://pith.science/api/pith-number/LLASI75WDSEKMRSWREK3DRZWZK/events.json","paper":"https://pith.science/paper/LLASI75W"},"agent_actions":{"view_html":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK","download_json":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK.json","view_paper":"https://pith.science/paper/LLASI75W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09661&json=true","fetch_graph":"https://pith.science/api/pith-number/LLASI75WDSEKMRSWREK3DRZWZK/graph.json","fetch_events":"https://pith.science/api/pith-number/LLASI75WDSEKMRSWREK3DRZWZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK/action/storage_attestation","attest_author":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK/action/author_attestation","sign_citation":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK/action/citation_signature","submit_replication":"https://pith.science/pith/LLASI75WDSEKMRSWREK3DRZWZK/action/replication_record"}},"created_at":"2026-07-05T02:16:29.869567+00:00","updated_at":"2026-07-05T02:16:29.869567+00:00"}