{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V6AXJHIYE4WVLTPICPV6H7HM5V","short_pith_number":"pith:V6AXJHIY","canonical_record":{"source":{"id":"1712.09999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-28T18:56:04Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"818d09f1453947853f65208f506c2a42aa00c34d0186cac6c4c1c1a78f8a6068","abstract_canon_sha256":"21b7a5b8253e31d705053b76108e29508d7dc7177e9aa7905c21f42db7aec347"},"schema_version":"1.0"},"canonical_sha256":"af81749d18272d55cde813ebe3fceced4a83df2d1b68b30c68cf0dcdd56bb63d","source":{"kind":"arxiv","id":"1712.09999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09999","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09999v1","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09999","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"V6AXJHIYE4WV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6AXJHIYE4WVLTPI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6AXJHIY","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V6AXJHIYE4WVLTPICPV6H7HM5V","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-28T18:56:04Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"818d09f1453947853f65208f506c2a42aa00c34d0186cac6c4c1c1a78f8a6068","abstract_canon_sha256":"21b7a5b8253e31d705053b76108e29508d7dc7177e9aa7905c21f42db7aec347"},"schema_version":"1.0"},"canonical_sha256":"af81749d18272d55cde813ebe3fceced4a83df2d1b68b30c68cf0dcdd56bb63d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.121106Z","signature_b64":"ii4UTY1F47bi2AjH+LSB82h2hw31sDMqtalvlxprmxwe3sXFEfBEhXw/floZcDdBDnyiSoQ/ziwpuadoRmLeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af81749d18272d55cde813ebe3fceced4a83df2d1b68b30c68cf0dcdd56bb63d","last_reissued_at":"2026-05-18T00:27:05.120649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.120649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09999","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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7y7nFFRW4+EXqKkro2GgAzQPto3w0AvSYm4nyHejev4ApeZ+vvYnp35Hf/04ThSIfFelPyEMpHjAnu9YGS9EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:11:27.202443Z"},"content_sha256":"a69b421cebad398a3257b6c1bf583558453722de3c31ab56ca238ccc483941da","schema_version":"1.0","event_id":"sha256:a69b421cebad398a3257b6c1bf583558453722de3c31ab56ca238ccc483941da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V6AXJHIYE4WVLTPICPV6H7HM5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Active Subspace Decomposition for Scalable and Efficient Tensor Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.NA","authors_text":"Jonathan Q. Jiang, Michael K. Ng","submitted_at":"2017-12-28T18:56:04Z","abstract_excerpt":"Tensor robust principal component analysis (TRPCA) has received a substantial amount of attention in various fields. Most existing methods, normally relying on tensor nuclear norm minimization, need to pay an expensive computational cost due to multiple singular value decompositions (SVDs) at each iteration. To overcome the drawback, we propose a scalable and efficient method, named Parallel Active Subspace Decomposition (PASD), which divides the unfolding along each mode of the tensor into a columnwise orthonormal matrix (active subspace) and another small-size matrix in parallel. Such a tran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09999","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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMkro1QnxsNSe8PPZ8yhNuAbV+rMtKtmyiP4CU08uXMK9zQq4imQHmignrfFGJGO0vVTauC2vflMHOkcjoqTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:11:27.202789Z"},"content_sha256":"c638eca8deff503156b48158dace06a6bf43a0b8ce50f34aa3b858f42727f5f6","schema_version":"1.0","event_id":"sha256:c638eca8deff503156b48158dace06a6bf43a0b8ce50f34aa3b858f42727f5f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/bundle.json","state_url":"https://pith.science/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/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-21T21:11:27Z","links":{"resolver":"https://pith.science/pith/V6AXJHIYE4WVLTPICPV6H7HM5V","bundle":"https://pith.science/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/bundle.json","state":"https://pith.science/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6AXJHIYE4WVLTPICPV6H7HM5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V6AXJHIYE4WVLTPICPV6H7HM5V","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":"21b7a5b8253e31d705053b76108e29508d7dc7177e9aa7905c21f42db7aec347","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-28T18:56:04Z","title_canon_sha256":"818d09f1453947853f65208f506c2a42aa00c34d0186cac6c4c1c1a78f8a6068"},"schema_version":"1.0","source":{"id":"1712.09999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09999","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09999v1","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09999","created_at":"2026-05-18T00:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"V6AXJHIYE4WV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V6AXJHIYE4WVLTPI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V6AXJHIY","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c638eca8deff503156b48158dace06a6bf43a0b8ce50f34aa3b858f42727f5f6","target":"graph","created_at":"2026-05-18T00:27:05Z","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":"Tensor robust principal component analysis (TRPCA) has received a substantial amount of attention in various fields. Most existing methods, normally relying on tensor nuclear norm minimization, need to pay an expensive computational cost due to multiple singular value decompositions (SVDs) at each iteration. To overcome the drawback, we propose a scalable and efficient method, named Parallel Active Subspace Decomposition (PASD), which divides the unfolding along each mode of the tensor into a columnwise orthonormal matrix (active subspace) and another small-size matrix in parallel. Such a tran","authors_text":"Jonathan Q. Jiang, Michael K. Ng","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-28T18:56:04Z","title":"Parallel Active Subspace Decomposition for Scalable and Efficient Tensor Robust Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09999","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:a69b421cebad398a3257b6c1bf583558453722de3c31ab56ca238ccc483941da","target":"record","created_at":"2026-05-18T00:27:05Z","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":"21b7a5b8253e31d705053b76108e29508d7dc7177e9aa7905c21f42db7aec347","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-12-28T18:56:04Z","title_canon_sha256":"818d09f1453947853f65208f506c2a42aa00c34d0186cac6c4c1c1a78f8a6068"},"schema_version":"1.0","source":{"id":"1712.09999","kind":"arxiv","version":1}},"canonical_sha256":"af81749d18272d55cde813ebe3fceced4a83df2d1b68b30c68cf0dcdd56bb63d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af81749d18272d55cde813ebe3fceced4a83df2d1b68b30c68cf0dcdd56bb63d","first_computed_at":"2026-05-18T00:27:05.120649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:05.120649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ii4UTY1F47bi2AjH+LSB82h2hw31sDMqtalvlxprmxwe3sXFEfBEhXw/floZcDdBDnyiSoQ/ziwpuadoRmLeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:05.121106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a69b421cebad398a3257b6c1bf583558453722de3c31ab56ca238ccc483941da","sha256:c638eca8deff503156b48158dace06a6bf43a0b8ce50f34aa3b858f42727f5f6"],"state_sha256":"35e3f2608abde13538481bee9db17a23335f06cb908adde5a7259f91510bd2fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PmmDFLIt23znk9Dc0+wElEShPihGjuP18BXp9jU0QB+yF8pVA4jSzlh7uRCM/9c+EJq8pZM3BMsWwZZCXwZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:11:27.204758Z","bundle_sha256":"55f40ec53e5eb345375beb5741cd8a8a01ab60d0e4bbe4a00e3cb4000397adf6"}}