{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X32JIHVEPKPXPVX7MECUPYIR4P","short_pith_number":"pith:X32JIHVE","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"},"canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","source":{"kind":"arxiv","id":"1712.01193","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01193","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01193v4","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01193","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"X32JIHVEPKPX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X32JIHVEPKPXPVX7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X32JIHVE","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X32JIHVEPKPXPVX7MECUPYIR4P","target":"record","payload":{"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"},"canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","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"},"source_kind":"arxiv","source_id":"1712.01193","source_version":4,"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-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHlSmHc/uxgx9OKRnUXUo45ofJT+RRCR0ZTuvBXd5huYT76g30CRqKrwYXnWsNpTC5aUM0BFvru3lOi7Bb9KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:44:49.564607Z"},"content_sha256":"74b673322e88a737b86392851ce7475883c974eedaaa9a86a5a26f40e632c759","schema_version":"1.0","event_id":"sha256:74b673322e88a737b86392851ce7475883c974eedaaa9a86a5a26f40e632c759"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X32JIHVEPKPXPVX7MECUPYIR4P","target":"graph","payload":{"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"},"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-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYPu83cBossCu0s69njuK6+2y2ktcC7QdidWvPvmewLJ9YtPCkTaZftIwJzTkFVWJaHKZsZY6/EQ00c/MdbqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:44:49.565415Z"},"content_sha256":"5d540205621bc9d8ad9b5b89872597730f249464c30e9805501c21eed45c27cc","schema_version":"1.0","event_id":"sha256:5d540205621bc9d8ad9b5b89872597730f249464c30e9805501c21eed45c27cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/bundle.json","state_url":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X32JIHVEPKPXPVX7MECUPYIR4P/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-31T15:44:49Z","links":{"resolver":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P","bundle":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/bundle.json","state":"https://pith.science/pith/X32JIHVEPKPXPVX7MECUPYIR4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X32JIHVEPKPXPVX7MECUPYIR4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X32JIHVEPKPXPVX7MECUPYIR4P","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":"d8b2c7ac0e4f30d378249e515652c05e122baa9208a9f685678f71884289454f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-04T16:55:52Z","title_canon_sha256":"e66f477207892310271861b10005c0a38a4fa1909988c94fcf6103214b59aa23"},"schema_version":"1.0","source":{"id":"1712.01193","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01193","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01193v4","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01193","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"X32JIHVEPKPX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X32JIHVEPKPXPVX7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X32JIHVE","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5d540205621bc9d8ad9b5b89872597730f249464c30e9805501c21eed45c27cc","target":"graph","created_at":"2026-05-18T00:01:10Z","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":"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 ","authors_text":"Bamdev Mishra, Madhav Nimishakavi, Pratik Jawanpuria","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-04T16:55:52Z","title":"A dual framework for low-rank tensor completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01193","kind":"arxiv","version":4},"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:74b673322e88a737b86392851ce7475883c974eedaaa9a86a5a26f40e632c759","target":"record","created_at":"2026-05-18T00:01:10Z","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":"d8b2c7ac0e4f30d378249e515652c05e122baa9208a9f685678f71884289454f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-04T16:55:52Z","title_canon_sha256":"e66f477207892310271861b10005c0a38a4fa1909988c94fcf6103214b59aa23"},"schema_version":"1.0","source":{"id":"1712.01193","kind":"arxiv","version":4}},"canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bef4941ea47a9f77d6ff610547e111e3c4d83d9546ba315cf65ab18c87dc0b3c","first_computed_at":"2026-05-18T00:01:10.040159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:10.040159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dsITvO9LYaSKOoOk8ScKlkr4wdproqCdL7pw55r44bgNreKXCu271dgIDwzSjMBnklmwg51kfnlEuOrD+i1wAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:10.040686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01193","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74b673322e88a737b86392851ce7475883c974eedaaa9a86a5a26f40e632c759","sha256:5d540205621bc9d8ad9b5b89872597730f249464c30e9805501c21eed45c27cc"],"state_sha256":"d0dc08a4ff919e162f657c1eecefe5341658644777abee093240a9fbd5a03ad4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWETb4nKPdWInS3/loMqSw14SNHnyzTd+NY06iPi9VbWP4UksHNIdSTCySa2AsUvjiwsoRLW7XigjQCGwEBBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:44:49.569758Z","bundle_sha256":"40d4e1cfb718c858c40dda4821092994ad9e977b3e14b21cad30fddbac8ffa2d"}}