{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X32JIHVEPKPXPVX7MECUPYIR4P","short_pith_number":"pith:X32JIHVE","schema_version":"1.0","canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","source":{"kind":"arxiv","id":"1712.01193","version":4},"attestation_state":"computed","paper":{"title":"A dual framework for low-rank tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Madhav Nimishakavi, Pratik Jawanpuria","submitted_at":"2017-12-04T16:55:52Z","abstract_excerpt":"One of the popular approaches for low-rank tensor completion is to use the latent trace norm regularization. However, most existing works in this direction learn a sparse combination of tensors. In this work, we fill this gap by proposing a variant of the latent trace norm that helps in learning a non-sparse combination of tensors. We develop a dual framework for solving the low-rank tensor completion problem. We first show a novel characterization of the dual solution space with an interesting factorization of the optimal solution. Overall, the optimal solution is shown to lie on a Cartesian "},"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":"1712.01193","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-04T16:55:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e66f477207892310271861b10005c0a38a4fa1909988c94fcf6103214b59aa23","abstract_canon_sha256":"d8b2c7ac0e4f30d378249e515652c05e122baa9208a9f685678f71884289454f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.040686Z","signature_b64":"dsITvO9LYaSKOoOk8ScKlkr4wdproqCdL7pw55r44bgNreKXCu271dgIDwzSjMBnklmwg51kfnlEuOrD+i1wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","last_reissued_at":"2026-05-18T00:01:10.040159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.040159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dual framework for low-rank tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Madhav Nimishakavi, Pratik Jawanpuria","submitted_at":"2017-12-04T16:55:52Z","abstract_excerpt":"One of the popular approaches for low-rank tensor completion is to use the latent trace norm regularization. However, most existing works in this direction learn a sparse combination of tensors. In this work, we fill this gap by proposing a variant of the latent trace norm that helps in learning a non-sparse combination of tensors. We develop a dual framework for solving the low-rank tensor completion problem. We first show a novel characterization of the dual solution space with an interesting factorization of the optimal solution. Overall, the optimal solution is shown to lie on a Cartesian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01193","kind":"arxiv","version":4},"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":"1712.01193","created_at":"2026-05-18T00:01:10.040245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01193v4","created_at":"2026-05-18T00:01:10.040245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01193","created_at":"2026-05-18T00:01:10.040245+00:00"},{"alias_kind":"pith_short_12","alias_value":"X32JIHVEPKPX","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X32JIHVEPKPXPVX7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X32JIHVE","created_at":"2026-05-18T12:31:53.515858+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/X32JIHVEPKPXPVX7MECUPYIR4P","json":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P.json","graph_json":"https://pith.science/api/pith-number/X32JIHVEPKPXPVX7MECUPYIR4P/graph.json","events_json":"https://pith.science/api/pith-number/X32JIHVEPKPXPVX7MECUPYIR4P/events.json","paper":"https://pith.science/paper/X32JIHVE"},"agent_actions":{"view_html":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P","download_json":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P.json","view_paper":"https://pith.science/paper/X32JIHVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01193&json=true","fetch_graph":"https://pith.science/api/pith-number/X32JIHVEPKPXPVX7MECUPYIR4P/graph.json","fetch_events":"https://pith.science/api/pith-number/X32JIHVEPKPXPVX7MECUPYIR4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/action/storage_attestation","attest_author":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/action/author_attestation","sign_citation":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/action/citation_signature","submit_replication":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/action/replication_record"}},"created_at":"2026-05-18T00:01:10.040245+00:00","updated_at":"2026-05-18T00:01:10.040245+00:00"}