{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMQKEAPFLWU3NH4YNPCCCB6SFM","short_pith_number":"pith:DMQKEAPF","canonical_record":{"source":{"id":"1609.03958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T18:08:06Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"7670d680db93685925cbd289572cf9ca9c56a6f7a7ecc6bcfc651597c5abbe6b","abstract_canon_sha256":"508b47be8402251cf42cbe67e8f02684e8780bb6424f104d5ba651900addce3d"},"schema_version":"1.0"},"canonical_sha256":"1b20a201e55da9b69f986bc42107d22b16ab29060f7ccc599ac4512d4c3b369d","source":{"kind":"arxiv","id":"1609.03958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03958","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03958v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03958","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"DMQKEAPFLWU3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMQKEAPFLWU3NH4Y","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMQKEAPF","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMQKEAPFLWU3NH4YNPCCCB6SFM","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T18:08:06Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"7670d680db93685925cbd289572cf9ca9c56a6f7a7ecc6bcfc651597c5abbe6b","abstract_canon_sha256":"508b47be8402251cf42cbe67e8f02684e8780bb6424f104d5ba651900addce3d"},"schema_version":"1.0"},"canonical_sha256":"1b20a201e55da9b69f986bc42107d22b16ab29060f7ccc599ac4512d4c3b369d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.100756Z","signature_b64":"uJs4MedEm5APK96zVmBIIwV4Q3LSKe7sZh3H1Mc138QGO0GvwgxtCG++dokTDZ9XuvvQSurWKUdsbzkS9O0IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b20a201e55da9b69f986bc42107d22b16ab29060f7ccc599ac4512d4c3b369d","last_reissued_at":"2026-05-18T01:04:42.100294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.100294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03958","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvpQIYdLhLofFebPxogSBroLE3X6+I20XNZuQZO17TuuetcO1U78goAiCTC/kkvx8dr7hGQZlXLKcopto1wvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:36:20.168839Z"},"content_sha256":"c3b16504cd1cb41b0cda3cb5f5e9b21d31cbfbcb8e74c8ea86e4a885941640f1","schema_version":"1.0","event_id":"sha256:c3b16504cd1cb41b0cda3cb5f5e9b21d31cbfbcb8e74c8ea86e4a885941640f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMQKEAPFLWU3NH4YNPCCCB6SFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Inductive Matrix Completion Under Sparse Factor Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Akshay Soni, Swayambhoo Jain, Troy Chevalier","submitted_at":"2016-09-13T18:08:06Z","abstract_excerpt":"Inductive Matrix Completion (IMC) is an important class of matrix completion problems that allows direct inclusion of available features to enhance estimation capabilities. These models have found applications in personalized recommendation systems, multilabel learning, dictionary learning, etc. This paper examines a general class of noisy matrix completion tasks where the underlying matrix is following an IMC model i.e., it is formed by a mixing matrix (a priori unknown) sandwiched between two known feature matrices. The mixing matrix here is assumed to be well approximated by the product of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03958","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCex8WX7KKqt/A0ZPbrfdjmjPOi6BeNVQu8lPC8gcecSxDNzsPoMzKQq0Yxn828C1DuRCdU4iYQoFdGNnn1rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:36:20.169528Z"},"content_sha256":"4765326803c9606f98e70002276eba409cd407df4813ed57de381a6b09be978b","schema_version":"1.0","event_id":"sha256:4765326803c9606f98e70002276eba409cd407df4813ed57de381a6b09be978b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/bundle.json","state_url":"https://pith.science/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/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-10T23:36:20Z","links":{"resolver":"https://pith.science/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM","bundle":"https://pith.science/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/bundle.json","state":"https://pith.science/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMQKEAPFLWU3NH4YNPCCCB6SFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMQKEAPFLWU3NH4YNPCCCB6SFM","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":"508b47be8402251cf42cbe67e8f02684e8780bb6424f104d5ba651900addce3d","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T18:08:06Z","title_canon_sha256":"7670d680db93685925cbd289572cf9ca9c56a6f7a7ecc6bcfc651597c5abbe6b"},"schema_version":"1.0","source":{"id":"1609.03958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03958","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03958v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03958","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"DMQKEAPFLWU3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMQKEAPFLWU3NH4Y","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMQKEAPF","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:4765326803c9606f98e70002276eba409cd407df4813ed57de381a6b09be978b","target":"graph","created_at":"2026-05-18T01:04:42Z","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":"Inductive Matrix Completion (IMC) is an important class of matrix completion problems that allows direct inclusion of available features to enhance estimation capabilities. These models have found applications in personalized recommendation systems, multilabel learning, dictionary learning, etc. This paper examines a general class of noisy matrix completion tasks where the underlying matrix is following an IMC model i.e., it is formed by a mixing matrix (a priori unknown) sandwiched between two known feature matrices. The mixing matrix here is assumed to be well approximated by the product of ","authors_text":"Akshay Soni, Swayambhoo Jain, Troy Chevalier","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T18:08:06Z","title":"Noisy Inductive Matrix Completion Under Sparse Factor Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03958","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:c3b16504cd1cb41b0cda3cb5f5e9b21d31cbfbcb8e74c8ea86e4a885941640f1","target":"record","created_at":"2026-05-18T01:04:42Z","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":"508b47be8402251cf42cbe67e8f02684e8780bb6424f104d5ba651900addce3d","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T18:08:06Z","title_canon_sha256":"7670d680db93685925cbd289572cf9ca9c56a6f7a7ecc6bcfc651597c5abbe6b"},"schema_version":"1.0","source":{"id":"1609.03958","kind":"arxiv","version":1}},"canonical_sha256":"1b20a201e55da9b69f986bc42107d22b16ab29060f7ccc599ac4512d4c3b369d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b20a201e55da9b69f986bc42107d22b16ab29060f7ccc599ac4512d4c3b369d","first_computed_at":"2026-05-18T01:04:42.100294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:42.100294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJs4MedEm5APK96zVmBIIwV4Q3LSKe7sZh3H1Mc138QGO0GvwgxtCG++dokTDZ9XuvvQSurWKUdsbzkS9O0IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:42.100756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3b16504cd1cb41b0cda3cb5f5e9b21d31cbfbcb8e74c8ea86e4a885941640f1","sha256:4765326803c9606f98e70002276eba409cd407df4813ed57de381a6b09be978b"],"state_sha256":"b4dea1dc80d66a24cbcc91eac3e5728f669d7f7da01b1aba13a3e3a06afef3e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRYuHuD/gAa+1H7t80AMdHlN0rX07BMbZPEmACRcv2nlUKR/s0Wj8auPf/qjKpQRLJqmardRupV/udD1z/E1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:36:20.173820Z","bundle_sha256":"f97ac0dc84b74bd19845cb91c2eb6c4aedaba180c9ca2272980968d442c8255c"}}