{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KQALSGQOHWN5V7UYMYWZCVLTTQ","short_pith_number":"pith:KQALSGQO","schema_version":"1.0","canonical_sha256":"5400b91a0e3d9bdafe98662d9155739c2dcbdd169391800a6701052b2494d142","source":{"kind":"arxiv","id":"1504.05273","version":3},"attestation_state":"computed","paper":{"title":"Low Rank Approximation of Tensors via Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carmeliza Navasca, Xiaofei Wang","submitted_at":"2015-04-21T01:26:48Z","abstract_excerpt":"The goal of this paper is to find a low-rank approximation for a given tensor. Specifically, we give a computable strategy on calculating the rank of a given tensor, based on approximating the solution to an NP-hard problem. In this paper, we formulate a sparse optimization problem via an $l_1$-regularization to find a low-rank approximation of tensors. To solve this sparse optimization problem, we propose a rescaling algorithm of the proximal alternating minimization and study the theoretical convergence of this algorithm. Furthermore, we discuss the probabilistic consistency of the sparsity "},"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":"1504.05273","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-04-21T01:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"cd971fef67f45849aac657da67a035700e3b1ec4879fb879feea7a0087458c88","abstract_canon_sha256":"24cfd296860ebdd1ede33aec04a29854637148e1b4c7616c31d1fd52042bb06e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:52.360740Z","signature_b64":"KyhOY/CvZ85iA5L7QcThh6S0jqM+2tiIJr4kw54Fqp+mWAjFnLJSJQW3Hx960HTgyPAtu3BuhUsExvGsloiiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5400b91a0e3d9bdafe98662d9155739c2dcbdd169391800a6701052b2494d142","last_reissued_at":"2026-05-18T01:01:52.360173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:52.360173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Approximation of Tensors via Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carmeliza Navasca, Xiaofei Wang","submitted_at":"2015-04-21T01:26:48Z","abstract_excerpt":"The goal of this paper is to find a low-rank approximation for a given tensor. Specifically, we give a computable strategy on calculating the rank of a given tensor, based on approximating the solution to an NP-hard problem. In this paper, we formulate a sparse optimization problem via an $l_1$-regularization to find a low-rank approximation of tensors. To solve this sparse optimization problem, we propose a rescaling algorithm of the proximal alternating minimization and study the theoretical convergence of this algorithm. Furthermore, we discuss the probabilistic consistency of the sparsity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05273","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":""},"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":"1504.05273","created_at":"2026-05-18T01:01:52.360253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05273v3","created_at":"2026-05-18T01:01:52.360253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05273","created_at":"2026-05-18T01:01:52.360253+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQALSGQOHWN5","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQALSGQOHWN5V7UY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQALSGQO","created_at":"2026-05-18T12:29:29.992203+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/KQALSGQOHWN5V7UYMYWZCVLTTQ","json":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ.json","graph_json":"https://pith.science/api/pith-number/KQALSGQOHWN5V7UYMYWZCVLTTQ/graph.json","events_json":"https://pith.science/api/pith-number/KQALSGQOHWN5V7UYMYWZCVLTTQ/events.json","paper":"https://pith.science/paper/KQALSGQO"},"agent_actions":{"view_html":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ","download_json":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ.json","view_paper":"https://pith.science/paper/KQALSGQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05273&json=true","fetch_graph":"https://pith.science/api/pith-number/KQALSGQOHWN5V7UYMYWZCVLTTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KQALSGQOHWN5V7UYMYWZCVLTTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ/action/storage_attestation","attest_author":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ/action/author_attestation","sign_citation":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ/action/citation_signature","submit_replication":"https://pith.science/pith/KQALSGQOHWN5V7UYMYWZCVLTTQ/action/replication_record"}},"created_at":"2026-05-18T01:01:52.360253+00:00","updated_at":"2026-05-18T01:01:52.360253+00:00"}