{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SJDCGD6MBD2WTOM6KE2ROIBQKG","short_pith_number":"pith:SJDCGD6M","schema_version":"1.0","canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","source":{"kind":"arxiv","id":"1209.3672","version":3},"attestation_state":"computed","paper":{"title":"1-Bit Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Ewout van den Berg, Mark A. Davenport, Mary Wootters, Yaniv Plan","submitted_at":"2012-09-17T14:47:31Z","abstract_excerpt":"In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements generated according to a probability distribution determined by the real-valued entries of M. The central question we ask is whether or not it is possible to obtain an accurate estimate of M from this data. In general this would seem impossible, but we show that the maximum likelihood estimate under a suitable constraint returns an accurate estimate of M when ||M||"},"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":"1209.3672","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-09-17T14:47:31Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"54d25086aa654effafc38e29e6bcf844c3e72d9c34d7e234ba6ba521796366d2","abstract_canon_sha256":"92693f00ee068edc90865a3aa2ada6c6229c4d126c905c251fbfb52aa100edcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:43.731882Z","signature_b64":"mK6jXLXWBUk9z4KCHbulixeDsAXZyi+2V4WmqJFB641pRqplyjCOO0pUtHZx8oFiFykCfYJulMfg9vg1Cl9BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","last_reissued_at":"2026-05-18T02:48:43.731139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:43.731139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-Bit Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Ewout van den Berg, Mark A. Davenport, Mary Wootters, Yaniv Plan","submitted_at":"2012-09-17T14:47:31Z","abstract_excerpt":"In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements generated according to a probability distribution determined by the real-valued entries of M. The central question we ask is whether or not it is possible to obtain an accurate estimate of M from this data. In general this would seem impossible, but we show that the maximum likelihood estimate under a suitable constraint returns an accurate estimate of M when ||M||"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3672","kind":"arxiv","version":3},"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":"1209.3672","created_at":"2026-05-18T02:48:43.731261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3672v3","created_at":"2026-05-18T02:48:43.731261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3672","created_at":"2026-05-18T02:48:43.731261+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJDCGD6MBD2W","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJDCGD6MBD2WTOM6","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJDCGD6M","created_at":"2026-05-18T12:27:20.899486+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/SJDCGD6MBD2WTOM6KE2ROIBQKG","json":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG.json","graph_json":"https://pith.science/api/pith-number/SJDCGD6MBD2WTOM6KE2ROIBQKG/graph.json","events_json":"https://pith.science/api/pith-number/SJDCGD6MBD2WTOM6KE2ROIBQKG/events.json","paper":"https://pith.science/paper/SJDCGD6M"},"agent_actions":{"view_html":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG","download_json":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG.json","view_paper":"https://pith.science/paper/SJDCGD6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3672&json=true","fetch_graph":"https://pith.science/api/pith-number/SJDCGD6MBD2WTOM6KE2ROIBQKG/graph.json","fetch_events":"https://pith.science/api/pith-number/SJDCGD6MBD2WTOM6KE2ROIBQKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/action/storage_attestation","attest_author":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/action/author_attestation","sign_citation":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/action/citation_signature","submit_replication":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/action/replication_record"}},"created_at":"2026-05-18T02:48:43.731261+00:00","updated_at":"2026-05-18T02:48:43.731261+00:00"}