{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BCIEGAIZQEZSH35PG6A6JPELW2","short_pith_number":"pith:BCIEGAIZ","canonical_record":{"source":{"id":"1509.04397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-15T04:49:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7332b7782a044c7015c73f902abb62886324f1b3f68ef011e12cc93146d7cc7f","abstract_canon_sha256":"c3137a388cbbfd4b82edeff6d6d77a5f6af30bd9230b208cd0ac993a6bd21638"},"schema_version":"1.0"},"canonical_sha256":"0890430119813323efaf3781e4bc8bb6ba383659185752830881734098960fa9","source":{"kind":"arxiv","id":"1509.04397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04397","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04397v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04397","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"BCIEGAIZQEZS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCIEGAIZQEZSH35P","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCIEGAIZ","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BCIEGAIZQEZSH35PG6A6JPELW2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-15T04:49:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7332b7782a044c7015c73f902abb62886324f1b3f68ef011e12cc93146d7cc7f","abstract_canon_sha256":"c3137a388cbbfd4b82edeff6d6d77a5f6af30bd9230b208cd0ac993a6bd21638"},"schema_version":"1.0"},"canonical_sha256":"0890430119813323efaf3781e4bc8bb6ba383659185752830881734098960fa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.279383Z","signature_b64":"r5xeGqOKCtMS/6EMm/R+Q/UO+LsA2sXFnLpSd1c11A4BPEmkX5egBMcftbNV5gbQ587eVaH0lrpxG+BG5VlCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0890430119813323efaf3781e4bc8bb6ba383659185752830881734098960fa9","last_reissued_at":"2026-05-18T01:33:07.278856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.278856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04397","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGrWwRjtUfWZtSbdHey6NM4+XhDQj3Z9uY9X+aR0gDATQUi+A5IHiVQL+ExbjdQHUTTvReDPb4GGSwUDeObhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:37:31.482940Z"},"content_sha256":"75e3f0fa14753c84c92f45dc18c16d6287704b2623ffc38897ab21f93a2ea062","schema_version":"1.0","event_id":"sha256:75e3f0fa14753c84c92f45dc18c16d6287704b2623ffc38897ab21f93a2ea062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BCIEGAIZQEZSH35PG6A6JPELW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Family Matrix Completion under Structural Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Joydeep Ghosh, Pradeep Ravikumar, Suriya Gunasekar","submitted_at":"2015-09-15T04:49:57Z","abstract_excerpt":"We consider the matrix completion problem of recovering a structured matrix from noisy and partial measurements. Recent works have proposed tractable estimators with strong statistical guarantees for the case where the underlying matrix is low--rank, and the measurements consist of a subset, either of the exact individual entries, or of the entries perturbed by additive Gaussian noise, which is thus implicitly suited for thin--tailed continuous data. Arguably, common applications of matrix completion require estimators for (a) heterogeneous data--types, such as skewed--continuous, count, binar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04397","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6yqL7s7p/B+qUVAcFFoeDLGE92JL6Hp1da9MwXxA0c03/GB0GZFb85a2yX2z5l0krRtlsKe+VTxu/qI8TeM4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:37:31.483297Z"},"content_sha256":"e1145138cf70fe34723eae609be3ee19196df5c2d4f1eb690d4a149d69964b6f","schema_version":"1.0","event_id":"sha256:e1145138cf70fe34723eae609be3ee19196df5c2d4f1eb690d4a149d69964b6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCIEGAIZQEZSH35PG6A6JPELW2/bundle.json","state_url":"https://pith.science/pith/BCIEGAIZQEZSH35PG6A6JPELW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCIEGAIZQEZSH35PG6A6JPELW2/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-01T07:37:31Z","links":{"resolver":"https://pith.science/pith/BCIEGAIZQEZSH35PG6A6JPELW2","bundle":"https://pith.science/pith/BCIEGAIZQEZSH35PG6A6JPELW2/bundle.json","state":"https://pith.science/pith/BCIEGAIZQEZSH35PG6A6JPELW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCIEGAIZQEZSH35PG6A6JPELW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BCIEGAIZQEZSH35PG6A6JPELW2","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":"c3137a388cbbfd4b82edeff6d6d77a5f6af30bd9230b208cd0ac993a6bd21638","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-15T04:49:57Z","title_canon_sha256":"7332b7782a044c7015c73f902abb62886324f1b3f68ef011e12cc93146d7cc7f"},"schema_version":"1.0","source":{"id":"1509.04397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04397","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04397v1","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04397","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"BCIEGAIZQEZS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCIEGAIZQEZSH35P","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCIEGAIZ","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:e1145138cf70fe34723eae609be3ee19196df5c2d4f1eb690d4a149d69964b6f","target":"graph","created_at":"2026-05-18T01:33:07Z","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":"We consider the matrix completion problem of recovering a structured matrix from noisy and partial measurements. Recent works have proposed tractable estimators with strong statistical guarantees for the case where the underlying matrix is low--rank, and the measurements consist of a subset, either of the exact individual entries, or of the entries perturbed by additive Gaussian noise, which is thus implicitly suited for thin--tailed continuous data. Arguably, common applications of matrix completion require estimators for (a) heterogeneous data--types, such as skewed--continuous, count, binar","authors_text":"Joydeep Ghosh, Pradeep Ravikumar, Suriya Gunasekar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-15T04:49:57Z","title":"Exponential Family Matrix Completion under Structural Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04397","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:75e3f0fa14753c84c92f45dc18c16d6287704b2623ffc38897ab21f93a2ea062","target":"record","created_at":"2026-05-18T01:33:07Z","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":"c3137a388cbbfd4b82edeff6d6d77a5f6af30bd9230b208cd0ac993a6bd21638","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-15T04:49:57Z","title_canon_sha256":"7332b7782a044c7015c73f902abb62886324f1b3f68ef011e12cc93146d7cc7f"},"schema_version":"1.0","source":{"id":"1509.04397","kind":"arxiv","version":1}},"canonical_sha256":"0890430119813323efaf3781e4bc8bb6ba383659185752830881734098960fa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0890430119813323efaf3781e4bc8bb6ba383659185752830881734098960fa9","first_computed_at":"2026-05-18T01:33:07.278856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.278856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r5xeGqOKCtMS/6EMm/R+Q/UO+LsA2sXFnLpSd1c11A4BPEmkX5egBMcftbNV5gbQ587eVaH0lrpxG+BG5VlCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.279383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75e3f0fa14753c84c92f45dc18c16d6287704b2623ffc38897ab21f93a2ea062","sha256:e1145138cf70fe34723eae609be3ee19196df5c2d4f1eb690d4a149d69964b6f"],"state_sha256":"2c0a61dab3aba7f0be99fe98ef67bfd50529ecbcbeee7fc5bd5319f6d736c715"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0V8i4pQJIRTz8AZECISn2UiV4fT7Z1JWAY3IOhEsvE7MMA4LcYnNxL90guCauutoGeGPvhuboPV5+9RYNN8JBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:37:31.485381Z","bundle_sha256":"83d85e7c487f2515470cc377a67289c88fb9b3582ce335f47b4fdeb678ded745"}}