{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SWZTLKWWJEPMGZPB5FRQLUITLW","short_pith_number":"pith:SWZTLKWW","canonical_record":{"source":{"id":"1502.06919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-24T19:27:06Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f6d9d1248d21349ec64b2f2be5c50709f5d2c2512c50ce9072458a53169bc609","abstract_canon_sha256":"b61137a066ca5f117d6f7e0583267235e36a31ce4c6718c0306f08cd7bdace4d"},"schema_version":"1.0"},"canonical_sha256":"95b335aad6491ec365e1e96305d1135db5bc5f12dc38ca52b260c30cd7ea7762","source":{"kind":"arxiv","id":"1502.06919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06919","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06919v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06919","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"SWZTLKWWJEPM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SWZTLKWWJEPMGZPB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SWZTLKWW","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SWZTLKWWJEPMGZPB5FRQLUITLW","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-24T19:27:06Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f6d9d1248d21349ec64b2f2be5c50709f5d2c2512c50ce9072458a53169bc609","abstract_canon_sha256":"b61137a066ca5f117d6f7e0583267235e36a31ce4c6718c0306f08cd7bdace4d"},"schema_version":"1.0"},"canonical_sha256":"95b335aad6491ec365e1e96305d1135db5bc5f12dc38ca52b260c30cd7ea7762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.311678Z","signature_b64":"5xKDP1QNxRlcWJcOuI/CftCEzdJG/gnklJGZbl6NxWqML38+IcTsNg8FD1vfEhTd3CH8cvV3ZXvCRN944MA6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b335aad6491ec365e1e96305d1135db5bc5f12dc38ca52b260c30cd7ea7762","last_reissued_at":"2026-05-18T02:18:23.310997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.310997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06919","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:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+Qyj3C554dvRbMeDUsB5tBa8tOTzZ16kVb/jrYVQ34HGNkt1VVXCaYVGgnINW3N/e1fpzsq/Q4ARfGcV9YtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:45.706715Z"},"content_sha256":"414730286627f6b3b5a393d538e8d672e87997fa06d14b64731bb5b375d15562","schema_version":"1.0","event_id":"sha256:414730286627f6b3b5a393d538e8d672e87997fa06d14b64731bb5b375d15562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SWZTLKWWJEPMGZPB5FRQLUITLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Rank Matrix Completion with Exponential Family Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jean Lafond (LTCI)","submitted_at":"2015-02-24T19:27:06Z","abstract_excerpt":"The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where the noise distribution belongs to the exponential family and is sub-exponential. Our framework alllows for a general sampling scheme. We first consider an estimator defined as the minimizer of the sum of a log-likelihood term and a nuclear norm penalization and prove an upper bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06919","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:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MGrByR4WN+Glj/yWZe9VPmXlEvgfIvbBxwWJvcy36G1j10BeeElDGzig9n1PzR+ATmBYNjqCdJD8Ed11HF5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:45.707065Z"},"content_sha256":"a401a034d3518b6dd6dff871fd76749afd77c274c30b72d205ce74653718d837","schema_version":"1.0","event_id":"sha256:a401a034d3518b6dd6dff871fd76749afd77c274c30b72d205ce74653718d837"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/bundle.json","state_url":"https://pith.science/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/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-30T01:09:45Z","links":{"resolver":"https://pith.science/pith/SWZTLKWWJEPMGZPB5FRQLUITLW","bundle":"https://pith.science/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/bundle.json","state":"https://pith.science/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWZTLKWWJEPMGZPB5FRQLUITLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SWZTLKWWJEPMGZPB5FRQLUITLW","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":"b61137a066ca5f117d6f7e0583267235e36a31ce4c6718c0306f08cd7bdace4d","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-24T19:27:06Z","title_canon_sha256":"f6d9d1248d21349ec64b2f2be5c50709f5d2c2512c50ce9072458a53169bc609"},"schema_version":"1.0","source":{"id":"1502.06919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06919","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06919v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06919","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"SWZTLKWWJEPM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SWZTLKWWJEPMGZPB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SWZTLKWW","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:a401a034d3518b6dd6dff871fd76749afd77c274c30b72d205ce74653718d837","target":"graph","created_at":"2026-05-18T02:18:23Z","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":"The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where the noise distribution belongs to the exponential family and is sub-exponential. Our framework alllows for a general sampling scheme. We first consider an estimator defined as the minimizer of the sum of a log-likelihood term and a nuclear norm penalization and prove an upper bou","authors_text":"Jean Lafond (LTCI)","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-24T19:27:06Z","title":"Low Rank Matrix Completion with Exponential Family Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06919","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:414730286627f6b3b5a393d538e8d672e87997fa06d14b64731bb5b375d15562","target":"record","created_at":"2026-05-18T02:18:23Z","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":"b61137a066ca5f117d6f7e0583267235e36a31ce4c6718c0306f08cd7bdace4d","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-24T19:27:06Z","title_canon_sha256":"f6d9d1248d21349ec64b2f2be5c50709f5d2c2512c50ce9072458a53169bc609"},"schema_version":"1.0","source":{"id":"1502.06919","kind":"arxiv","version":2}},"canonical_sha256":"95b335aad6491ec365e1e96305d1135db5bc5f12dc38ca52b260c30cd7ea7762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95b335aad6491ec365e1e96305d1135db5bc5f12dc38ca52b260c30cd7ea7762","first_computed_at":"2026-05-18T02:18:23.310997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:23.310997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xKDP1QNxRlcWJcOuI/CftCEzdJG/gnklJGZbl6NxWqML38+IcTsNg8FD1vfEhTd3CH8cvV3ZXvCRN944MA6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:23.311678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:414730286627f6b3b5a393d538e8d672e87997fa06d14b64731bb5b375d15562","sha256:a401a034d3518b6dd6dff871fd76749afd77c274c30b72d205ce74653718d837"],"state_sha256":"656adb3265bcc378d94dd9b11ed846da2ada7bf9883819016140fba6266692cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXbVeQAFJZJ9T9MJtd6ONLEIzXMTqKyl+ZjxDwR+FGgUF37xptAKVCk3bAdRDFB6GArlflt4BZNoFIK3cnEgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:09:45.709161Z","bundle_sha256":"12aa65d68553d2918654a3d9b21cae8ac7d313d1f4d4b7076ceb441724b2d039"}}