{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T3TSMZV6YMDOJV5OEXWP6YWQCZ","short_pith_number":"pith:T3TSMZV6","schema_version":"1.0","canonical_sha256":"9ee72666bec306e4d7ae25ecff62d016770abcaf8048136c85aa93aec16c9e30","source":{"kind":"arxiv","id":"1502.06689","version":1},"attestation_state":"computed","paper":{"title":"1-Bit Matrix Completion under Exact Low-Rank Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Adel Javanmard, Sonia Bhaskar","submitted_at":"2015-02-24T05:38:31Z","abstract_excerpt":"We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix $M^*$. Instead of observing a subset of the noisy continuous-valued entries of a matrix $M^*$, we observe a subset of noisy 1-bit (or binary) measurements generated according to a probabilistic model. We consider constrained maximum likelihood estimation of $M^*$, under a constraint on the entry-wise infinity-norm of $M^*$ and an exact rank constraint. This is in contrast to previous work which has used convex relaxations for the rank. We provide an upper bound on the matrix es"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.06689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-24T05:38:31Z","cross_cats_sorted":[],"title_canon_sha256":"51c9027d32fa05e50fbec4efd941dfe9ac6e5d4bbbd2bbc6b8a7ad28b04eea1a","abstract_canon_sha256":"83160a5567ba790dcdda2f3ff08123c1158515dfed7794211752887ba0870c00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:29.417912Z","signature_b64":"4l/f+vNgFy+vVezfNaq6slcZ9Je+M7ck6fqj+l43qEjJQMwcCrcJS7GLPSa812EEvxUmFxFMSX3/0/28PMxsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ee72666bec306e4d7ae25ecff62d016770abcaf8048136c85aa93aec16c9e30","last_reissued_at":"2026-05-18T02:26:29.417452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:29.417452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-Bit Matrix Completion under Exact Low-Rank Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Adel Javanmard, Sonia Bhaskar","submitted_at":"2015-02-24T05:38:31Z","abstract_excerpt":"We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix $M^*$. Instead of observing a subset of the noisy continuous-valued entries of a matrix $M^*$, we observe a subset of noisy 1-bit (or binary) measurements generated according to a probabilistic model. We consider constrained maximum likelihood estimation of $M^*$, under a constraint on the entry-wise infinity-norm of $M^*$ and an exact rank constraint. This is in contrast to previous work which has used convex relaxations for the rank. We provide an upper bound on the matrix es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06689","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.06689","created_at":"2026-05-18T02:26:29.417510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06689v1","created_at":"2026-05-18T02:26:29.417510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06689","created_at":"2026-05-18T02:26:29.417510+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3TSMZV6YMDO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3TSMZV6YMDOJV5O","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3TSMZV6","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ","json":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ.json","graph_json":"https://pith.science/api/pith-number/T3TSMZV6YMDOJV5OEXWP6YWQCZ/graph.json","events_json":"https://pith.science/api/pith-number/T3TSMZV6YMDOJV5OEXWP6YWQCZ/events.json","paper":"https://pith.science/paper/T3TSMZV6"},"agent_actions":{"view_html":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ","download_json":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ.json","view_paper":"https://pith.science/paper/T3TSMZV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06689&json=true","fetch_graph":"https://pith.science/api/pith-number/T3TSMZV6YMDOJV5OEXWP6YWQCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/T3TSMZV6YMDOJV5OEXWP6YWQCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ/action/storage_attestation","attest_author":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ/action/author_attestation","sign_citation":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ/action/citation_signature","submit_replication":"https://pith.science/pith/T3TSMZV6YMDOJV5OEXWP6YWQCZ/action/replication_record"}},"created_at":"2026-05-18T02:26:29.417510+00:00","updated_at":"2026-05-18T02:26:29.417510+00:00"}