{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CVHNT2OOL3YOL4KYRQBAXER6UB","short_pith_number":"pith:CVHNT2OO","canonical_record":{"source":{"id":"1601.01060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-06T02:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"8b7b9d7dcb80ffbfabd0208bf0a68d4c82b953aa83004933b1092d0aeacafb52","abstract_canon_sha256":"e8f295a0ebcaccc942615b5140ab7b6fa67f7267bedf7059a0153e88a31b49d2"},"schema_version":"1.0"},"canonical_sha256":"154ed9e9ce5ef0e5f1588c020b923ea064a96478b5f46daa42b903f4abeb30b8","source":{"kind":"arxiv","id":"1601.01060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01060","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01060v1","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01060","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"CVHNT2OOL3YO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CVHNT2OOL3YOL4KY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CVHNT2OO","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CVHNT2OOL3YOL4KYRQBAXER6UB","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-06T02:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"8b7b9d7dcb80ffbfabd0208bf0a68d4c82b953aa83004933b1092d0aeacafb52","abstract_canon_sha256":"e8f295a0ebcaccc942615b5140ab7b6fa67f7267bedf7059a0153e88a31b49d2"},"schema_version":"1.0"},"canonical_sha256":"154ed9e9ce5ef0e5f1588c020b923ea064a96478b5f46daa42b903f4abeb30b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:13.995225Z","signature_b64":"Gh5us0x/sZ/IsKq7olFLIG5GbD8R/R8AOHDZKHISYBe0n2QwOvcUesQPvU8Q0rlAnARUnDUN9y+CziSkYO1cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154ed9e9ce5ef0e5f1588c020b923ea064a96478b5f46daa42b903f4abeb30b8","last_reissued_at":"2026-05-18T01:04:13.994827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:13.994827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01060","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-18T01:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjHPjEcm2e0rUpPg2lSlYKc3kqyJOlEP6/ZZJd5W9t+rNXzc2pvGxD/Z/HLd+x4B3znqm2hDBdiFEJhWyK09AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:58:08.078942Z"},"content_sha256":"94cd9a1fc6515eacc2491eb7b0c0058281ba6a09a24b78709166face2816c955","schema_version":"1.0","event_id":"sha256:94cd9a1fc6515eacc2491eb7b0c0058281ba6a09a24b78709166face2816c955"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CVHNT2OOL3YOL4KYRQBAXER6UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank Matrix Factorization under General Mixture Noise Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deyu Meng, Qian Zhao, Xiangyong Cao, Yang Chen, Zongben Xu","submitted_at":"2016-01-06T02:52:30Z","abstract_excerpt":"Many computer vision problems can be posed as learning a low-dimensional subspace from high dimensional data. The low rank matrix factorization (LRMF) represents a commonly utilized subspace learning strategy. Most of the current LRMF techniques are constructed on the optimization problems using L1-norm and L2-norm losses, which mainly deal with Laplacian and Gaussian noises, respectively. To make LRMF capable of adapting more complex noise, this paper proposes a new LRMF model by assuming noise as Mixture of Exponential Power (MoEP) distributions and proposes a penalized MoEP (PMoEP) model by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01060","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-18T01:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/OgSu5x+ECNcGP6CioCtZyZQo/Ut7hTo3gbXTkcSe+emYmzgmar8mttaFiRqMKFtJfhfojhLoxtbw0FMSydDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:58:08.079288Z"},"content_sha256":"3bc710b40e6e7e6013310ec0beee1f68ba8da80db11f6761712b8ce0703a00c2","schema_version":"1.0","event_id":"sha256:3bc710b40e6e7e6013310ec0beee1f68ba8da80db11f6761712b8ce0703a00c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/bundle.json","state_url":"https://pith.science/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/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-07-04T10:58:08Z","links":{"resolver":"https://pith.science/pith/CVHNT2OOL3YOL4KYRQBAXER6UB","bundle":"https://pith.science/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/bundle.json","state":"https://pith.science/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVHNT2OOL3YOL4KYRQBAXER6UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CVHNT2OOL3YOL4KYRQBAXER6UB","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":"e8f295a0ebcaccc942615b5140ab7b6fa67f7267bedf7059a0153e88a31b49d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-06T02:52:30Z","title_canon_sha256":"8b7b9d7dcb80ffbfabd0208bf0a68d4c82b953aa83004933b1092d0aeacafb52"},"schema_version":"1.0","source":{"id":"1601.01060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01060","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01060v1","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01060","created_at":"2026-05-18T01:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"CVHNT2OOL3YO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CVHNT2OOL3YOL4KY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CVHNT2OO","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:3bc710b40e6e7e6013310ec0beee1f68ba8da80db11f6761712b8ce0703a00c2","target":"graph","created_at":"2026-05-18T01:04:13Z","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":"Many computer vision problems can be posed as learning a low-dimensional subspace from high dimensional data. The low rank matrix factorization (LRMF) represents a commonly utilized subspace learning strategy. Most of the current LRMF techniques are constructed on the optimization problems using L1-norm and L2-norm losses, which mainly deal with Laplacian and Gaussian noises, respectively. To make LRMF capable of adapting more complex noise, this paper proposes a new LRMF model by assuming noise as Mixture of Exponential Power (MoEP) distributions and proposes a penalized MoEP (PMoEP) model by","authors_text":"Deyu Meng, Qian Zhao, Xiangyong Cao, Yang Chen, Zongben Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-06T02:52:30Z","title":"Low-rank Matrix Factorization under General Mixture Noise Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01060","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:94cd9a1fc6515eacc2491eb7b0c0058281ba6a09a24b78709166face2816c955","target":"record","created_at":"2026-05-18T01:04:13Z","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":"e8f295a0ebcaccc942615b5140ab7b6fa67f7267bedf7059a0153e88a31b49d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-06T02:52:30Z","title_canon_sha256":"8b7b9d7dcb80ffbfabd0208bf0a68d4c82b953aa83004933b1092d0aeacafb52"},"schema_version":"1.0","source":{"id":"1601.01060","kind":"arxiv","version":1}},"canonical_sha256":"154ed9e9ce5ef0e5f1588c020b923ea064a96478b5f46daa42b903f4abeb30b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"154ed9e9ce5ef0e5f1588c020b923ea064a96478b5f46daa42b903f4abeb30b8","first_computed_at":"2026-05-18T01:04:13.994827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:13.994827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gh5us0x/sZ/IsKq7olFLIG5GbD8R/R8AOHDZKHISYBe0n2QwOvcUesQPvU8Q0rlAnARUnDUN9y+CziSkYO1cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:13.995225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94cd9a1fc6515eacc2491eb7b0c0058281ba6a09a24b78709166face2816c955","sha256:3bc710b40e6e7e6013310ec0beee1f68ba8da80db11f6761712b8ce0703a00c2"],"state_sha256":"96e6c0c8ed80afd5f1bc9dcb2d8a08199368fb8e3bada15d0f254192428bb105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bb5ZmQcBIyBIqShppreDPFIkWf0cKAmFZiyFh4EYqaPV69hHAXswxbTPnJZTR800a9ikrdnsGkYOc8jkS3BXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:58:08.081179Z","bundle_sha256":"9f769c5486b592dc9df6d5211aeb62e0a6173689c83863f91ddfd9a611ac2699"}}