{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UN2TZJ4ZB6IWIBKZDFYQTEOIGZ","short_pith_number":"pith:UN2TZJ4Z","canonical_record":{"source":{"id":"1506.08353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-28T03:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"fdbf25c204dc301c8c515261ad8d457d1f0a070f45098e0af3a2034a71712c49","abstract_canon_sha256":"ce2761708b273bc20d3ec0e010282066f7a6e9d7968a91135e34f4ac1a6d2c71"},"schema_version":"1.0"},"canonical_sha256":"a3753ca7990f9164055919710991c8364f511af95c3183a49241a740428d5c4c","source":{"kind":"arxiv","id":"1506.08353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08353","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08353v2","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08353","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"UN2TZJ4ZB6IW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UN2TZJ4ZB6IWIBKZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UN2TZJ4Z","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UN2TZJ4ZB6IWIBKZDFYQTEOIGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-28T03:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"fdbf25c204dc301c8c515261ad8d457d1f0a070f45098e0af3a2034a71712c49","abstract_canon_sha256":"ce2761708b273bc20d3ec0e010282066f7a6e9d7968a91135e34f4ac1a6d2c71"},"schema_version":"1.0"},"canonical_sha256":"a3753ca7990f9164055919710991c8364f511af95c3183a49241a740428d5c4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.148927Z","signature_b64":"CNR9afJ9+yN9w3tamUkYZ6gCW1USlBxv/p3ovQokkwptjZi0Cr6p70nqa5OuRa6m1hQR5WOUlRXtRlhQ5exFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3753ca7990f9164055919710991c8364f511af95c3183a49241a740428d5c4c","last_reissued_at":"2026-05-18T00:22:53.148532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.148532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08353","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWjCj5qWByYOW87Ico99SFawbk+ZPaxqRpC0dRL4DuMzrWMEdpeKdWN16np0e6jWQepaByJ1/abxfqk6njkeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:06:42.190285Z"},"content_sha256":"b30139f5f5d9cbea3988e14dc7da97c62299c20cd46a998a6499f033c540eb47","schema_version":"1.0","event_id":"sha256:b30139f5f5d9cbea3988e14dc7da97c62299c20cd46a998a6499f033c540eb47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UN2TZJ4ZB6IWIBKZDFYQTEOIGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on patch-based low-rank minimization for fast image denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haijuan Hu, Jacques Froment, Quansheng Liu","submitted_at":"2015-06-28T03:52:42Z","abstract_excerpt":"Patch-based low-rank minimization for image processing attracts much attention in recent years. The minimization of the matrix rank coupled with the Frobenius norm data fidelity can be solved by the hard thresholding filter with principle component analysis (PCA) or singular value decomposition (SVD). Based on this idea, we propose a patch-based low-rank minimization method for image denoising. The main denoising process is stated in three equivalent way: PCA, SVD and low-rank minimization. Compared to recent patch-based sparse representation methods, experiments demonstrate that the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08353","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TSyQt3eQ+GPIXKe9Xwg+1mbkCpWTUo1sCdCN5GBJ6OBMSKMFsxzOS6X2B/EwazUodK98qXlyy75fROGH0fKWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:06:42.190662Z"},"content_sha256":"bcd06cdf10d4de0d55142982f846caefb767bf08b255b0cda3e8a2e5ddd49c54","schema_version":"1.0","event_id":"sha256:bcd06cdf10d4de0d55142982f846caefb767bf08b255b0cda3e8a2e5ddd49c54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/bundle.json","state_url":"https://pith.science/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/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-22T23:06:42Z","links":{"resolver":"https://pith.science/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ","bundle":"https://pith.science/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/bundle.json","state":"https://pith.science/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UN2TZJ4ZB6IWIBKZDFYQTEOIGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UN2TZJ4ZB6IWIBKZDFYQTEOIGZ","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":"ce2761708b273bc20d3ec0e010282066f7a6e9d7968a91135e34f4ac1a6d2c71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-28T03:52:42Z","title_canon_sha256":"fdbf25c204dc301c8c515261ad8d457d1f0a070f45098e0af3a2034a71712c49"},"schema_version":"1.0","source":{"id":"1506.08353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08353","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08353v2","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08353","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"UN2TZJ4ZB6IW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UN2TZJ4ZB6IWIBKZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UN2TZJ4Z","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:bcd06cdf10d4de0d55142982f846caefb767bf08b255b0cda3e8a2e5ddd49c54","target":"graph","created_at":"2026-05-18T00:22:53Z","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":"Patch-based low-rank minimization for image processing attracts much attention in recent years. The minimization of the matrix rank coupled with the Frobenius norm data fidelity can be solved by the hard thresholding filter with principle component analysis (PCA) or singular value decomposition (SVD). Based on this idea, we propose a patch-based low-rank minimization method for image denoising. The main denoising process is stated in three equivalent way: PCA, SVD and low-rank minimization. Compared to recent patch-based sparse representation methods, experiments demonstrate that the proposed ","authors_text":"Haijuan Hu, Jacques Froment, Quansheng Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-28T03:52:42Z","title":"A note on patch-based low-rank minimization for fast image denoising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08353","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:b30139f5f5d9cbea3988e14dc7da97c62299c20cd46a998a6499f033c540eb47","target":"record","created_at":"2026-05-18T00:22:53Z","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":"ce2761708b273bc20d3ec0e010282066f7a6e9d7968a91135e34f4ac1a6d2c71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-28T03:52:42Z","title_canon_sha256":"fdbf25c204dc301c8c515261ad8d457d1f0a070f45098e0af3a2034a71712c49"},"schema_version":"1.0","source":{"id":"1506.08353","kind":"arxiv","version":2}},"canonical_sha256":"a3753ca7990f9164055919710991c8364f511af95c3183a49241a740428d5c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3753ca7990f9164055919710991c8364f511af95c3183a49241a740428d5c4c","first_computed_at":"2026-05-18T00:22:53.148532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.148532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CNR9afJ9+yN9w3tamUkYZ6gCW1USlBxv/p3ovQokkwptjZi0Cr6p70nqa5OuRa6m1hQR5WOUlRXtRlhQ5exFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.148927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b30139f5f5d9cbea3988e14dc7da97c62299c20cd46a998a6499f033c540eb47","sha256:bcd06cdf10d4de0d55142982f846caefb767bf08b255b0cda3e8a2e5ddd49c54"],"state_sha256":"ce26acaf94edc2d9014fad4f4d1e2379f8b43e0e2dd0d9c61de3e9780bdc3494"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQDFU7X0vfHNBSVFy/naYjWZOw+PGjANHQZ2pQC8izPBTgo/ezGcaVA0Vj59hmFxy27BQFi7ajW58BZvDaaxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:06:42.192659Z","bundle_sha256":"56a1633c60b6e732dad20564f406b66ad7b2beeb0ed71479266f3cdf05b8c245"}}