{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TVHECAQDUZNV4I75C5K43XTQKV","short_pith_number":"pith:TVHECAQD","canonical_record":{"source":{"id":"1507.04721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc9004d9d7f270d264d8230a9c19a76bb1b974e2e8a2a41f62d711b9c377ad2e","abstract_canon_sha256":"0a2915a7193c35bb358c175877affdc4edf4f5256dd825e4450e0223478f306d"},"schema_version":"1.0"},"canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","source":{"kind":"arxiv","id":"1507.04721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04721","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04721v2","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04721","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"TVHECAQDUZNV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TVHECAQDUZNV4I75","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TVHECAQD","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TVHECAQDUZNV4I75C5K43XTQKV","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc9004d9d7f270d264d8230a9c19a76bb1b974e2e8a2a41f62d711b9c377ad2e","abstract_canon_sha256":"0a2915a7193c35bb358c175877affdc4edf4f5256dd825e4450e0223478f306d"},"schema_version":"1.0"},"canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:48.190835Z","signature_b64":"vDqwYcW+Sp++8VXtvfk8FBPAAxvLWQeceqnJzac3YCrejzEBTRaghaul2ckfpGYb3vxYOc00SsUiC99WAVexCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","last_reissued_at":"2026-05-18T00:39:48.190166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:48.190166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04721","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-18T00:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fruIejMnm0V2+ncPDe5FxX7YfBFt1ii2HHTjp4957sF1/N80OQRVHOXb0vHyEpxc7dy96zfrgjm3yUxet24AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:32:01.951131Z"},"content_sha256":"23b26273486b074aeb016972cfb5694b79f433a4d8bcdf781b5db7d86ccbb765","schema_version":"1.0","event_id":"sha256:23b26273486b074aeb016972cfb5694b79f433a4d8bcdf781b5db7d86ccbb765"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TVHECAQDUZNV4I75C5K43XTQKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Accelerating the Regularized Alternating Least Square Algorithm for Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carmeliza Navasca, Stefan Kindermann, Xiaofei Wang","submitted_at":"2015-07-16T19:32:57Z","abstract_excerpt":"In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm. Through numerical experiments, the fast algorithm demonstrate a faster convergence rate for the accelerated version in comparison to both the standard and regularized alternating least squares algorithms. In addition, we analyze the global convergence based on the Kurdyka- Lojasiewicz inequality as well as show that the RALS algorithm has a linear local convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04721","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-18T00:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yC5L0mk7gPL84Et1R6WMz1WHHY/5KMedMt5ri/38dgO9wzU3nqied3CVb77cg/N/Tf020pdrXfCVQ/m8mWJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:32:01.951550Z"},"content_sha256":"0b4a05beb2400b0c6b3b16b0644aa78cf4c0320a87facb4e87c8a6eaeaf6b742","schema_version":"1.0","event_id":"sha256:0b4a05beb2400b0c6b3b16b0644aa78cf4c0320a87facb4e87c8a6eaeaf6b742"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/bundle.json","state_url":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVHECAQDUZNV4I75C5K43XTQKV/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-29T18:32:01Z","links":{"resolver":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV","bundle":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/bundle.json","state":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVHECAQDUZNV4I75C5K43XTQKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TVHECAQDUZNV4I75C5K43XTQKV","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":"0a2915a7193c35bb358c175877affdc4edf4f5256dd825e4450e0223478f306d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","title_canon_sha256":"dc9004d9d7f270d264d8230a9c19a76bb1b974e2e8a2a41f62d711b9c377ad2e"},"schema_version":"1.0","source":{"id":"1507.04721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04721","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04721v2","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04721","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"TVHECAQDUZNV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TVHECAQDUZNV4I75","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TVHECAQD","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:0b4a05beb2400b0c6b3b16b0644aa78cf4c0320a87facb4e87c8a6eaeaf6b742","target":"graph","created_at":"2026-05-18T00:39:48Z","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 discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm. Through numerical experiments, the fast algorithm demonstrate a faster convergence rate for the accelerated version in comparison to both the standard and regularized alternating least squares algorithms. In addition, we analyze the global convergence based on the Kurdyka- Lojasiewicz inequality as well as show that the RALS algorithm has a linear local convergenc","authors_text":"Carmeliza Navasca, Stefan Kindermann, Xiaofei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","title":"On Accelerating the Regularized Alternating Least Square Algorithm for Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04721","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:23b26273486b074aeb016972cfb5694b79f433a4d8bcdf781b5db7d86ccbb765","target":"record","created_at":"2026-05-18T00:39:48Z","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":"0a2915a7193c35bb358c175877affdc4edf4f5256dd825e4450e0223478f306d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","title_canon_sha256":"dc9004d9d7f270d264d8230a9c19a76bb1b974e2e8a2a41f62d711b9c377ad2e"},"schema_version":"1.0","source":{"id":"1507.04721","kind":"arxiv","version":2}},"canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","first_computed_at":"2026-05-18T00:39:48.190166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:48.190166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDqwYcW+Sp++8VXtvfk8FBPAAxvLWQeceqnJzac3YCrejzEBTRaghaul2ckfpGYb3vxYOc00SsUiC99WAVexCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:48.190835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23b26273486b074aeb016972cfb5694b79f433a4d8bcdf781b5db7d86ccbb765","sha256:0b4a05beb2400b0c6b3b16b0644aa78cf4c0320a87facb4e87c8a6eaeaf6b742"],"state_sha256":"312d87411137160871da8bf37e8b8847c3a53a94e26bddd3a522d57d1fe7db9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcgWzNEYQUCfSg0Rmfz9Ct7fxVq1wCsShDYSu/ulhdZ16rFlQUxdfAg73Z/mbK2noPI9W7nFnPZefqkAEIubBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:32:01.953806Z","bundle_sha256":"04ed560ce37316f6cd3765e2f5df782d8a55b4ef6206e070dd5319bb722192b9"}}