{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5IPQOZXRKUTNAC66KZUJIWUZB7","short_pith_number":"pith:5IPQOZXR","canonical_record":{"source":{"id":"1410.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-03T14:43:01Z","cross_cats_sorted":["cs.CV","math.NA"],"title_canon_sha256":"ccc0d10a88ef979f863c2075a87c662bcea41d0465f1533d6c46ce71d7ca57ea","abstract_canon_sha256":"0b27d3d827e4dbfea929ef4114392c3e15993b44474e3ce08eb928f1dcb37b7a"},"schema_version":"1.0"},"canonical_sha256":"ea1f0766f15526d00bde5668945a990fea80ee585587dbc17c6e3ae66de2e9af","source":{"kind":"arxiv","id":"1410.0868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0868","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0868v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0868","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"5IPQOZXRKUTN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IPQOZXRKUTNAC66","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IPQOZXR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5IPQOZXRKUTNAC66KZUJIWUZB7","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-03T14:43:01Z","cross_cats_sorted":["cs.CV","math.NA"],"title_canon_sha256":"ccc0d10a88ef979f863c2075a87c662bcea41d0465f1533d6c46ce71d7ca57ea","abstract_canon_sha256":"0b27d3d827e4dbfea929ef4114392c3e15993b44474e3ce08eb928f1dcb37b7a"},"schema_version":"1.0"},"canonical_sha256":"ea1f0766f15526d00bde5668945a990fea80ee585587dbc17c6e3ae66de2e9af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.131692Z","signature_b64":"0C0oyf2caCXvQahmswtNXTKpaiXEHmFpWVkacu9SttTft4K9O6AV2I6kT+r9KQq6f5RzsJ6488ATGbtCTiQJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1f0766f15526d00bde5668945a990fea80ee585587dbc17c6e3ae66de2e9af","last_reissued_at":"2026-05-18T02:41:03.131259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.131259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0868","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikd2XJHfmQeq9lktlQZoADiUFM2PmFXDfcOMxO9mQrfbwNs5aDR5gjGzRQPsp0TM47gbDpw2hCYq2K9ZVAsgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:02:58.478352Z"},"content_sha256":"3e9c4625f1dec09ea73cfb29474dc1e623355e0d96fd1b6c6acc7078b903efa9","schema_version":"1.0","event_id":"sha256:3e9c4625f1dec09ea73cfb29474dc1e623355e0d96fd1b6c6acc7078b903efa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5IPQOZXRKUTNAC66KZUJIWUZB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Orbit Optimization: A Unified Approach to Data Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA"],"primary_cat":"cs.NA","authors_text":"Shuchang Zhou, Xiaobing Feng, Zhihua Zhang","submitted_at":"2014-10-03T14:43:01Z","abstract_excerpt":"In this paper we propose and study an optimization problem over a matrix group orbit that we call \\emph{Group Orbit Optimization} (GOO). We prove that GOO can be used to induce matrix decomposition techniques such as singular value decomposition (SVD), LU decomposition, QR decomposition, Schur decomposition and Cholesky decomposition, etc. This gives rise to a unified framework for matrix decomposition and allows us to bridge these matrix decomposition methods. Moreover, we generalize GOO for tensor decomposition. As a concrete application of GOO, we devise a new data decomposition method over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0868","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMphWoZ981oQwMkfz5r8ykmFF9a1vjBayNljCBTvbexhe2COXvKnT4wnsobkMgFGBVJBh6h1M2KwzFxTi67gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:02:58.479072Z"},"content_sha256":"1c8f7b6a39715afd091c5470461f4b9a3abc58cb7774d30d352e89ccfdbea7f0","schema_version":"1.0","event_id":"sha256:1c8f7b6a39715afd091c5470461f4b9a3abc58cb7774d30d352e89ccfdbea7f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/bundle.json","state_url":"https://pith.science/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/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-28T22:02:58Z","links":{"resolver":"https://pith.science/pith/5IPQOZXRKUTNAC66KZUJIWUZB7","bundle":"https://pith.science/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/bundle.json","state":"https://pith.science/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IPQOZXRKUTNAC66KZUJIWUZB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5IPQOZXRKUTNAC66KZUJIWUZB7","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":"0b27d3d827e4dbfea929ef4114392c3e15993b44474e3ce08eb928f1dcb37b7a","cross_cats_sorted":["cs.CV","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-03T14:43:01Z","title_canon_sha256":"ccc0d10a88ef979f863c2075a87c662bcea41d0465f1533d6c46ce71d7ca57ea"},"schema_version":"1.0","source":{"id":"1410.0868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0868","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0868v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0868","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"5IPQOZXRKUTN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IPQOZXRKUTNAC66","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IPQOZXR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:1c8f7b6a39715afd091c5470461f4b9a3abc58cb7774d30d352e89ccfdbea7f0","target":"graph","created_at":"2026-05-18T02:41:03Z","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 propose and study an optimization problem over a matrix group orbit that we call \\emph{Group Orbit Optimization} (GOO). We prove that GOO can be used to induce matrix decomposition techniques such as singular value decomposition (SVD), LU decomposition, QR decomposition, Schur decomposition and Cholesky decomposition, etc. This gives rise to a unified framework for matrix decomposition and allows us to bridge these matrix decomposition methods. Moreover, we generalize GOO for tensor decomposition. As a concrete application of GOO, we devise a new data decomposition method over","authors_text":"Shuchang Zhou, Xiaobing Feng, Zhihua Zhang","cross_cats":["cs.CV","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-03T14:43:01Z","title":"Group Orbit Optimization: A Unified Approach to Data Normalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0868","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:3e9c4625f1dec09ea73cfb29474dc1e623355e0d96fd1b6c6acc7078b903efa9","target":"record","created_at":"2026-05-18T02:41:03Z","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":"0b27d3d827e4dbfea929ef4114392c3e15993b44474e3ce08eb928f1dcb37b7a","cross_cats_sorted":["cs.CV","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-10-03T14:43:01Z","title_canon_sha256":"ccc0d10a88ef979f863c2075a87c662bcea41d0465f1533d6c46ce71d7ca57ea"},"schema_version":"1.0","source":{"id":"1410.0868","kind":"arxiv","version":1}},"canonical_sha256":"ea1f0766f15526d00bde5668945a990fea80ee585587dbc17c6e3ae66de2e9af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea1f0766f15526d00bde5668945a990fea80ee585587dbc17c6e3ae66de2e9af","first_computed_at":"2026-05-18T02:41:03.131259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:03.131259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0C0oyf2caCXvQahmswtNXTKpaiXEHmFpWVkacu9SttTft4K9O6AV2I6kT+r9KQq6f5RzsJ6488ATGbtCTiQJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:03.131692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e9c4625f1dec09ea73cfb29474dc1e623355e0d96fd1b6c6acc7078b903efa9","sha256:1c8f7b6a39715afd091c5470461f4b9a3abc58cb7774d30d352e89ccfdbea7f0"],"state_sha256":"c4741c45f968c10d56f09bfc0701cdd736f46ba0a1b0af872ba1a37a12655646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOdcRqmazMt5EAf+0d+K0QECMjHXY5XRNjJzxwpdOgnvlSTxbSgnNtzhYNpNsztQ+wBgZzFW6CbjlrgmJ3oQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:02:58.482800Z","bundle_sha256":"e0f6e30a20e73a04dbfe74489aad34ca44c80ee7ab0fc126b1fabf63143cf7b5"}}