{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FMUA2GBASPLL3M4HQ3M4TNHSQG","short_pith_number":"pith:FMUA2GBA","canonical_record":{"source":{"id":"1611.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"97b3eb9be0f6cca832e4b3ecb5eae995cdf759876c91d05b28d1f85eea35bbae","abstract_canon_sha256":"aad6a95fd5cd160b7dfd73d31e80ed487d7341534913b0a18ef47b1beb76235c"},"schema_version":"1.0"},"canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","source":{"kind":"arxiv","id":"1611.10349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10349","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10349v1","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10349","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FMUA2GBASPLL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FMUA2GBASPLL3M4H","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FMUA2GBA","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FMUA2GBASPLL3M4HQ3M4TNHSQG","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"97b3eb9be0f6cca832e4b3ecb5eae995cdf759876c91d05b28d1f85eea35bbae","abstract_canon_sha256":"aad6a95fd5cd160b7dfd73d31e80ed487d7341534913b0a18ef47b1beb76235c"},"schema_version":"1.0"},"canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:10.713899Z","signature_b64":"LLpmvXXfxVOECNdBbGV8wrS25x8dIyOsrKUoNOal3uNWYSh0k42/pPZFwqCE0G1TOHoFsTYV4EovbEo4F1A8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","last_reissued_at":"2026-05-18T00:56:10.713461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:10.713461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10349","source_version":1,"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:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"au9GhcPlvtMogH8bELko9n20LVU0Bo/9YK71pxhyfCDw8Dnt3ah6soKaXLEL4eWSFbXwE9kWDr1TTt/tWiAACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:15:57.943090Z"},"content_sha256":"71af77ef37ca0ef27e3ba8c63ebb9fcb0e531f3f71f1c9b715aa6aa84c6af2d4","schema_version":"1.0","event_id":"sha256:71af77ef37ca0ef27e3ba8c63ebb9fcb0e531f3f71f1c9b715aa6aa84c6af2d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FMUA2GBASPLL3M4HQ3M4TNHSQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Garvesh Raskutti, Han Chen, Ming Yuan","submitted_at":"2016-11-30T20:45:23Z","abstract_excerpt":"In this paper, we consider the problem of learning high-dimensional tensor regression problems with low-rank structure. One of the core challenges associated with learning high-dimensional models is computation since the underlying optimization problems are often non-convex. While convex relaxations could lead to polynomial-time algorithms they are often slow in practice. On the other hand, limited theoretical guarantees exist for non-convex methods. In this paper we provide a general framework that provides theoretical guarantees for learning high-dimensional tensor regression models under di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10349","kind":"arxiv","version":1},"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:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcklNVpQMfA+ym6arXOxvlL3KMgKkDDYm3NUgzYI37oqJUoQjqgIMHGAGeRiF/3qsH+cL2TrrAGosKuolbxBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:15:57.943742Z"},"content_sha256":"c12d6b3d8687c8be5f41da2384f75f79ec82020a003e8f4897a036213d84fe6d","schema_version":"1.0","event_id":"sha256:c12d6b3d8687c8be5f41da2384f75f79ec82020a003e8f4897a036213d84fe6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/bundle.json","state_url":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/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-06-06T14:15:57Z","links":{"resolver":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG","bundle":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/bundle.json","state":"https://pith.science/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMUA2GBASPLL3M4HQ3M4TNHSQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FMUA2GBASPLL3M4HQ3M4TNHSQG","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":"aad6a95fd5cd160b7dfd73d31e80ed487d7341534913b0a18ef47b1beb76235c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","title_canon_sha256":"97b3eb9be0f6cca832e4b3ecb5eae995cdf759876c91d05b28d1f85eea35bbae"},"schema_version":"1.0","source":{"id":"1611.10349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10349","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10349v1","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10349","created_at":"2026-05-18T00:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FMUA2GBASPLL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FMUA2GBASPLL3M4H","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FMUA2GBA","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:c12d6b3d8687c8be5f41da2384f75f79ec82020a003e8f4897a036213d84fe6d","target":"graph","created_at":"2026-05-18T00:56: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":"In this paper, we consider the problem of learning high-dimensional tensor regression problems with low-rank structure. One of the core challenges associated with learning high-dimensional models is computation since the underlying optimization problems are often non-convex. While convex relaxations could lead to polynomial-time algorithms they are often slow in practice. On the other hand, limited theoretical guarantees exist for non-convex methods. In this paper we provide a general framework that provides theoretical guarantees for learning high-dimensional tensor regression models under di","authors_text":"Garvesh Raskutti, Han Chen, Ming Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","title":"Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10349","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:71af77ef37ca0ef27e3ba8c63ebb9fcb0e531f3f71f1c9b715aa6aa84c6af2d4","target":"record","created_at":"2026-05-18T00:56: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":"aad6a95fd5cd160b7dfd73d31e80ed487d7341534913b0a18ef47b1beb76235c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-30T20:45:23Z","title_canon_sha256":"97b3eb9be0f6cca832e4b3ecb5eae995cdf759876c91d05b28d1f85eea35bbae"},"schema_version":"1.0","source":{"id":"1611.10349","kind":"arxiv","version":1}},"canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b280d182093d6bdb38786d9c9b4f281b6c4a2443e37830f58f0854f8659bc4e","first_computed_at":"2026-05-18T00:56:10.713461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:10.713461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LLpmvXXfxVOECNdBbGV8wrS25x8dIyOsrKUoNOal3uNWYSh0k42/pPZFwqCE0G1TOHoFsTYV4EovbEo4F1A8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:10.713899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71af77ef37ca0ef27e3ba8c63ebb9fcb0e531f3f71f1c9b715aa6aa84c6af2d4","sha256:c12d6b3d8687c8be5f41da2384f75f79ec82020a003e8f4897a036213d84fe6d"],"state_sha256":"078823e86633ba74470a53144d50328a3986f48218cd3673f6a7ecd328dacdfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zp88r6BLzOfR2KF7qcbYdO58jEgbfOHES+OFSCXFMoGLmF6F3ZcFamWPDPK6RUwFE7Lpy2q7NcliNj/KBl8aDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:15:57.946970Z","bundle_sha256":"4aa4d637d586bcbb0b5e991c6cb5ee7f956d643f069ededd2c53ab82b225318a"}}