{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SLCM5W4E74WH7IBDK3JKGYNKF3","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":"8dbcda42980c23bbae1c538b1b4b463d93319a99224ed8e86ae9ff06ad0b3311","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-07T21:38:07Z","title_canon_sha256":"02c4c0cf7fa4e6a73388b734c7f7e39906e20d6ace037a2fe340312a0407093b"},"schema_version":"1.0","source":{"id":"1503.02216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02216","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02216v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02216","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"SLCM5W4E74WH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SLCM5W4E74WH7IBD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SLCM5W4E","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:572ae04f3d86b51225db012f03ffa85b48640dea2b2590a50ac8ef5f84217758","target":"graph","created_at":"2026-05-18T02:25:25Z","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":"Low rank tensor learning, such as tensor completion and multilinear multitask learning, has received much attention in recent years. In this paper, we propose higher order matching pursuit for low rank tensor learning problems with a convex or a nonconvex cost function, which is a generalization of the matching pursuit type methods. At each iteration, the main cost of the proposed methods is only to compute a rank-one tensor, which can be done efficiently, making the proposed methods scalable to large scale problems. Moreover, storing the resulting rank-one tensors is of low storage requiremen","authors_text":"Johan A.K. Suykens, Siamak Mehrkanoon, Yuning Yang","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-07T21:38:07Z","title":"Higher order Matching Pursuit for Low Rank Tensor Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02216","kind":"arxiv","version":1},"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:6ae220f0c704718046e90e364c876e5707f911514f5d63fbbbdc83dcfe3416a9","target":"record","created_at":"2026-05-18T02:25:25Z","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":"8dbcda42980c23bbae1c538b1b4b463d93319a99224ed8e86ae9ff06ad0b3311","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-07T21:38:07Z","title_canon_sha256":"02c4c0cf7fa4e6a73388b734c7f7e39906e20d6ace037a2fe340312a0407093b"},"schema_version":"1.0","source":{"id":"1503.02216","kind":"arxiv","version":1}},"canonical_sha256":"92c4cedb84ff2c7fa02356d2a361aa2ee59b86f3186b2925ae381671f1d92021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92c4cedb84ff2c7fa02356d2a361aa2ee59b86f3186b2925ae381671f1d92021","first_computed_at":"2026-05-18T02:25:25.594026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:25.594026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNILO00cGGLeW4GK0Fk3vbL2PZf9zj68LkjqraZq0k5DBolCGnG2zrmHzlZyKWgZPXrXBjqUnc02p+cHFBZ8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:25.594494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae220f0c704718046e90e364c876e5707f911514f5d63fbbbdc83dcfe3416a9","sha256:572ae04f3d86b51225db012f03ffa85b48640dea2b2590a50ac8ef5f84217758"],"state_sha256":"a72da798e4593bfe2d0cd88f9fcb90b5e85f8e59d098e65754a461d9d6784ea9"}