{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F7M4OI55W56PZLCSZ77BKQ3VOI","short_pith_number":"pith:F7M4OI55","schema_version":"1.0","canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","source":{"kind":"arxiv","id":"1010.0789","version":2},"attestation_state":"computed","paper":{"title":"Estimation of low-rank tensors via convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"stat.ML","authors_text":"Hisashi Kashima, Kohei Hayashi, Ryota Tomioka","submitted_at":"2010-10-05T08:00:33Z","abstract_excerpt":"In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is guaranteed to be unique. The proposed approaches can automatically estimate the number of factors (rank) through the optimization. Thus, there is no need to specify the rank beforehand. The key technique we employ is the trace norm regularization, which is a popular approach for the estimation of low-rank matrices. In addition, we propose a simple heuristic to i"},"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":"1010.0789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-05T08:00:33Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3e3d5f17eac8d0b9e68dd13d8193338ac71ddbe90f4629f282807de53d03f9bf","abstract_canon_sha256":"e69675ecd1f9da136091097803ab618fc4f6246bb381b944379a7ed41e6db8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:46.904491Z","signature_b64":"So5SyOcwU39/OrY0psnBRAwjTRgcDLucZiFmCwKxb0dngVrsQbcLYo6mjOwwEiSlnfLcPSpUqzZgQpGCZ453Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","last_reissued_at":"2026-05-18T02:23:46.903801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:46.903801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation of low-rank tensors via convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"stat.ML","authors_text":"Hisashi Kashima, Kohei Hayashi, Ryota Tomioka","submitted_at":"2010-10-05T08:00:33Z","abstract_excerpt":"In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is guaranteed to be unique. The proposed approaches can automatically estimate the number of factors (rank) through the optimization. Thus, there is no need to specify the rank beforehand. The key technique we employ is the trace norm regularization, which is a popular approach for the estimation of low-rank matrices. In addition, we propose a simple heuristic to i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0789","kind":"arxiv","version":2},"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":"1010.0789","created_at":"2026-05-18T02:23:46.903903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0789v2","created_at":"2026-05-18T02:23:46.903903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0789","created_at":"2026-05-18T02:23:46.903903+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7M4OI55W56P","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7M4OI55W56PZLCS","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7M4OI55","created_at":"2026-05-18T12:26:06.534383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06491","citing_title":"Inference on Linear Regressions with Two-Way Unobserved Heterogeneity","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI","json":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI.json","graph_json":"https://pith.science/api/pith-number/F7M4OI55W56PZLCSZ77BKQ3VOI/graph.json","events_json":"https://pith.science/api/pith-number/F7M4OI55W56PZLCSZ77BKQ3VOI/events.json","paper":"https://pith.science/paper/F7M4OI55"},"agent_actions":{"view_html":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI","download_json":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI.json","view_paper":"https://pith.science/paper/F7M4OI55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0789&json=true","fetch_graph":"https://pith.science/api/pith-number/F7M4OI55W56PZLCSZ77BKQ3VOI/graph.json","fetch_events":"https://pith.science/api/pith-number/F7M4OI55W56PZLCSZ77BKQ3VOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/action/storage_attestation","attest_author":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/action/author_attestation","sign_citation":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/action/citation_signature","submit_replication":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/action/replication_record"}},"created_at":"2026-05-18T02:23:46.903903+00:00","updated_at":"2026-05-18T02:23:46.903903+00:00"}