{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:F7M4OI55W56PZLCSZ77BKQ3VOI","short_pith_number":"pith:F7M4OI55","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"},"canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","source":{"kind":"arxiv","id":"1010.0789","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0789","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0789v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0789","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"F7M4OI55W56P","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F7M4OI55W56PZLCS","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F7M4OI55","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:F7M4OI55W56PZLCSZ77BKQ3VOI","target":"record","payload":{"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"},"canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","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"},"source_kind":"arxiv","source_id":"1010.0789","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xyv5Jrk4NCTfe4xZ7GfWBQnXiBYKwYbiEnkLlJbAzeU3LLAypgx6fsZvC8lI2dZG+9HD7I0RaAZioA7kqMFNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:29:41.827731Z"},"content_sha256":"92c366bed76aeba9df3cf39d0e378e4a5ceabdeae4b397c5c263cfc42431f69f","schema_version":"1.0","event_id":"sha256:92c366bed76aeba9df3cf39d0e378e4a5ceabdeae4b397c5c263cfc42431f69f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:F7M4OI55W56PZLCSZ77BKQ3VOI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRvkb8H667ulwoLGz6kG/1A1jx1N/tFrIjApareiwNbePhlqRfY001gqzMYxbg/V/N8mF5fHZS88O8leC1j0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:29:41.828385Z"},"content_sha256":"2328ded732c41fd75f48eb0848b35d424e100035f65ee72e1653c3733f101d24","schema_version":"1.0","event_id":"sha256:2328ded732c41fd75f48eb0848b35d424e100035f65ee72e1653c3733f101d24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/bundle.json","state_url":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T12:29:41Z","links":{"resolver":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI","bundle":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/bundle.json","state":"https://pith.science/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7M4OI55W56PZLCSZ77BKQ3VOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F7M4OI55W56PZLCSZ77BKQ3VOI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e69675ecd1f9da136091097803ab618fc4f6246bb381b944379a7ed41e6db8a0","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-05T08:00:33Z","title_canon_sha256":"3e3d5f17eac8d0b9e68dd13d8193338ac71ddbe90f4629f282807de53d03f9bf"},"schema_version":"1.0","source":{"id":"1010.0789","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0789","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0789v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0789","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"F7M4OI55W56P","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F7M4OI55W56PZLCS","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F7M4OI55","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:2328ded732c41fd75f48eb0848b35d424e100035f65ee72e1653c3733f101d24","target":"graph","created_at":"2026-05-18T02:23:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hisashi Kashima, Kohei Hayashi, Ryota Tomioka","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-05T08:00:33Z","title":"Estimation of low-rank tensors via convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0789","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92c366bed76aeba9df3cf39d0e378e4a5ceabdeae4b397c5c263cfc42431f69f","target":"record","created_at":"2026-05-18T02:23:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e69675ecd1f9da136091097803ab618fc4f6246bb381b944379a7ed41e6db8a0","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-05T08:00:33Z","title_canon_sha256":"3e3d5f17eac8d0b9e68dd13d8193338ac71ddbe90f4629f282807de53d03f9bf"},"schema_version":"1.0","source":{"id":"1010.0789","kind":"arxiv","version":2}},"canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fd9c723bdb77cfcac52cffe154375720ab4de63f6cc68bbcfe60d113c4d7947","first_computed_at":"2026-05-18T02:23:46.903801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:46.903801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"So5SyOcwU39/OrY0psnBRAwjTRgcDLucZiFmCwKxb0dngVrsQbcLYo6mjOwwEiSlnfLcPSpUqzZgQpGCZ453Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:46.904491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0789","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c366bed76aeba9df3cf39d0e378e4a5ceabdeae4b397c5c263cfc42431f69f","sha256:2328ded732c41fd75f48eb0848b35d424e100035f65ee72e1653c3733f101d24"],"state_sha256":"56928f010fbe2315c726e9eeffa0fea13c339cff8580926a52b28c2412743cd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KQOg0kg8v7DTy+9J/Ut3pK2ynWWbsWS3MOqIsEuxvBkZ6wGojzeqmXcEQimIJIHylqqnJN35RO37FERdQduDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T12:29:41.831513Z","bundle_sha256":"478cec64aadc25c2902e2d8144d126fa5d236a7ac37ba2dfa05f5555957210cc"}}