{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X6ESQCCDJY3GKP5T6BFU2Z5U2W","short_pith_number":"pith:X6ESQCCD","canonical_record":{"source":{"id":"1407.0726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T21:27:23Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e8d3e88c4fca687a8e5fb706ea2b7e5a69afa288a80faf9bbaa9b547fb5bdff3","abstract_canon_sha256":"3b490e9ed87922a83e3e08da6b7ea02ddd1d89cbfea2d7e16d2457b13691d46c"},"schema_version":"1.0"},"canonical_sha256":"bf892808434e36653fb3f04b4d67b4d5962fa3a7dfb32dbbc67a825b252f1b3e","source":{"kind":"arxiv","id":"1407.0726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0726","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0726v2","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0726","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"X6ESQCCDJY3G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6ESQCCDJY3GKP5T","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6ESQCCD","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X6ESQCCDJY3GKP5T6BFU2Z5U2W","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T21:27:23Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e8d3e88c4fca687a8e5fb706ea2b7e5a69afa288a80faf9bbaa9b547fb5bdff3","abstract_canon_sha256":"3b490e9ed87922a83e3e08da6b7ea02ddd1d89cbfea2d7e16d2457b13691d46c"},"schema_version":"1.0"},"canonical_sha256":"bf892808434e36653fb3f04b4d67b4d5962fa3a7dfb32dbbc67a825b252f1b3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.893101Z","signature_b64":"UE7Lh6ZmmMiPGErSdOGsT43GrzQm3rClvGCurumXakuC9KKcF3qd7OgOBK8ggf3pZ3loDJLjtaKEOk5Q2KHKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf892808434e36653fb3f04b4d67b4d5962fa3a7dfb32dbbc67a825b252f1b3e","last_reissued_at":"2026-05-18T02:30:54.892620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.892620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0726","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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVkX+WCQA2d4kR7q8FjLPJNok4D8hW72fuHzwB0ZXqp1CkvqRb/ujhb9jSZBAWNnvJWG8xy2wZtjdu8CVrlZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:37.096953Z"},"content_sha256":"dd4a4904aeb5a3b02a7abb3ac2a68832ac679132881e96e69b319cfdbed56710","schema_version":"1.0","event_id":"sha256:dd4a4904aeb5a3b02a7abb3ac2a68832ac679132881e96e69b319cfdbed56710"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X6ESQCCDJY3GKP5T6BFU2Z5U2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Algorithm for Low-rank matrix recovery in Poisson noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Yang Cao, Yao Xie","submitted_at":"2014-07-02T21:27:23Z","abstract_excerpt":"This paper describes a fast algorithm for recovering low-rank matrices from their linear measurements contaminated with Poisson noise: the Poisson noise Maximum Likelihood Singular Value thresholding (PMLSV) algorithm. We propose a convex optimization formulation with a cost function consisting of the sum of a likelihood function and a regularization function which the nuclear norm of the matrix. Instead of solving the optimization problem directly by semi-definite program (SDP), we derive an iterative singular value thresholding algorithm by expanding the likelihood function. We demonstrate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0726","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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yJaboFofHWqZq4cXQwgxS4PPP8zTNyReMjQzklhGtb8IEUGXaOn1uSMKY2ZbYosr3gA187Md0ummInlq5XtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:37.097300Z"},"content_sha256":"e5e7d329eeb04ec51b76a2d5f40559010b67916d65ce49975ebf0fa13363bd7a","schema_version":"1.0","event_id":"sha256:e5e7d329eeb04ec51b76a2d5f40559010b67916d65ce49975ebf0fa13363bd7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/bundle.json","state_url":"https://pith.science/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/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-04T21:10:37Z","links":{"resolver":"https://pith.science/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W","bundle":"https://pith.science/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/bundle.json","state":"https://pith.science/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6ESQCCDJY3GKP5T6BFU2Z5U2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X6ESQCCDJY3GKP5T6BFU2Z5U2W","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":"3b490e9ed87922a83e3e08da6b7ea02ddd1d89cbfea2d7e16d2457b13691d46c","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T21:27:23Z","title_canon_sha256":"e8d3e88c4fca687a8e5fb706ea2b7e5a69afa288a80faf9bbaa9b547fb5bdff3"},"schema_version":"1.0","source":{"id":"1407.0726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0726","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0726v2","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0726","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"X6ESQCCDJY3G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6ESQCCDJY3GKP5T","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6ESQCCD","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:e5e7d329eeb04ec51b76a2d5f40559010b67916d65ce49975ebf0fa13363bd7a","target":"graph","created_at":"2026-05-18T02:30:54Z","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":"This paper describes a fast algorithm for recovering low-rank matrices from their linear measurements contaminated with Poisson noise: the Poisson noise Maximum Likelihood Singular Value thresholding (PMLSV) algorithm. We propose a convex optimization formulation with a cost function consisting of the sum of a likelihood function and a regularization function which the nuclear norm of the matrix. Instead of solving the optimization problem directly by semi-definite program (SDP), we derive an iterative singular value thresholding algorithm by expanding the likelihood function. We demonstrate t","authors_text":"Yang Cao, Yao Xie","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T21:27:23Z","title":"Fast Algorithm for Low-rank matrix recovery in Poisson noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0726","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:dd4a4904aeb5a3b02a7abb3ac2a68832ac679132881e96e69b319cfdbed56710","target":"record","created_at":"2026-05-18T02:30:54Z","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":"3b490e9ed87922a83e3e08da6b7ea02ddd1d89cbfea2d7e16d2457b13691d46c","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-07-02T21:27:23Z","title_canon_sha256":"e8d3e88c4fca687a8e5fb706ea2b7e5a69afa288a80faf9bbaa9b547fb5bdff3"},"schema_version":"1.0","source":{"id":"1407.0726","kind":"arxiv","version":2}},"canonical_sha256":"bf892808434e36653fb3f04b4d67b4d5962fa3a7dfb32dbbc67a825b252f1b3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf892808434e36653fb3f04b4d67b4d5962fa3a7dfb32dbbc67a825b252f1b3e","first_computed_at":"2026-05-18T02:30:54.892620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:54.892620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UE7Lh6ZmmMiPGErSdOGsT43GrzQm3rClvGCurumXakuC9KKcF3qd7OgOBK8ggf3pZ3loDJLjtaKEOk5Q2KHKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:54.893101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd4a4904aeb5a3b02a7abb3ac2a68832ac679132881e96e69b319cfdbed56710","sha256:e5e7d329eeb04ec51b76a2d5f40559010b67916d65ce49975ebf0fa13363bd7a"],"state_sha256":"61fcc742570c8f0bda7ca903be2f2de0f4808e0027d0e80ee1433070f4776fbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YdRz3a8eVSOebnhd5ieblY8+wJAPEangz+G+MJS0b2JD0kxvpXtT99Clbhd0WVTYDoxT+MwcoyhO/pHu6i2CCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:10:37.099262Z","bundle_sha256":"bb2224e7adb73e8ac974528219d3f3e9b7602bb013ad7ca126fee2c755ee0eb0"}}