{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IOYLN7FZGUMPVRLFR53KPD5WOO","short_pith_number":"pith:IOYLN7FZ","schema_version":"1.0","canonical_sha256":"43b0b6fcb93518fac5658f76a78fb6739a192be6864ecd97885aff5ceea43b64","source":{"kind":"arxiv","id":"1611.04835","version":1},"attestation_state":"computed","paper":{"title":"Multilinear Low-Rank Tensors on Graphs & Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Francesco Grassi, Nauman Shahid, Pierre Vandergheynst","submitted_at":"2016-11-15T14:05:43Z","abstract_excerpt":"We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank SVD for matrices and multi-linear SVD for tensors. Then, building on this novel decomposition we construct a general class of convex optimization problems for approximately solving low-rank tensor inverse problems, such as tensor Robust PCA. The whole framework is named as 'Multilinear Low-rank tensors on Graphs (MLRTG)'. Our theoretical analys"},"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":"1611.04835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-15T14:05:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1f554422b27eeba26534436e628a76891d40167b178c1f88cd6a334cb6c88400","abstract_canon_sha256":"5889f2f1cbc84db05826e06f1d69bba0f8f63b827776bf7755fec300b505c3a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:49.744781Z","signature_b64":"xx3X+jPDKtiKaH/gTJOBwFJEHxPbEpRmNXftZsK3/LKaQIJawIq6IHm1cp6m8poAt67t6oH94S4cYm/drClpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b0b6fcb93518fac5658f76a78fb6739a192be6864ecd97885aff5ceea43b64","last_reissued_at":"2026-05-18T00:58:49.744144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:49.744144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multilinear Low-Rank Tensors on Graphs & Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Francesco Grassi, Nauman Shahid, Pierre Vandergheynst","submitted_at":"2016-11-15T14:05:43Z","abstract_excerpt":"We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank SVD for matrices and multi-linear SVD for tensors. Then, building on this novel decomposition we construct a general class of convex optimization problems for approximately solving low-rank tensor inverse problems, such as tensor Robust PCA. The whole framework is named as 'Multilinear Low-rank tensors on Graphs (MLRTG)'. Our theoretical analys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04835","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":"1611.04835","created_at":"2026-05-18T00:58:49.744233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04835v1","created_at":"2026-05-18T00:58:49.744233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04835","created_at":"2026-05-18T00:58:49.744233+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOYLN7FZGUMP","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOYLN7FZGUMPVRLF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOYLN7FZ","created_at":"2026-05-18T12:30:22.444734+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/IOYLN7FZGUMPVRLFR53KPD5WOO","json":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO.json","graph_json":"https://pith.science/api/pith-number/IOYLN7FZGUMPVRLFR53KPD5WOO/graph.json","events_json":"https://pith.science/api/pith-number/IOYLN7FZGUMPVRLFR53KPD5WOO/events.json","paper":"https://pith.science/paper/IOYLN7FZ"},"agent_actions":{"view_html":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO","download_json":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO.json","view_paper":"https://pith.science/paper/IOYLN7FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04835&json=true","fetch_graph":"https://pith.science/api/pith-number/IOYLN7FZGUMPVRLFR53KPD5WOO/graph.json","fetch_events":"https://pith.science/api/pith-number/IOYLN7FZGUMPVRLFR53KPD5WOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO/action/storage_attestation","attest_author":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO/action/author_attestation","sign_citation":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO/action/citation_signature","submit_replication":"https://pith.science/pith/IOYLN7FZGUMPVRLFR53KPD5WOO/action/replication_record"}},"created_at":"2026-05-18T00:58:49.744233+00:00","updated_at":"2026-05-18T00:58:49.744233+00:00"}