{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SJDCGD6MBD2WTOM6KE2ROIBQKG","short_pith_number":"pith:SJDCGD6M","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"},"canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","source":{"kind":"arxiv","id":"1209.3672","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3672","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3672v3","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3672","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"SJDCGD6MBD2W","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJDCGD6MBD2WTOM6","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJDCGD6M","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SJDCGD6MBD2WTOM6KE2ROIBQKG","target":"record","payload":{"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"},"canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","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"},"source_kind":"arxiv","source_id":"1209.3672","source_version":3,"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/V/wjXmP0kDLjKGtn77K62OEiZMoistTXzcMD2pgyOdR0Q7FNZsw3ueSprS+bxbnT4bFoiJD6DWQxBye7a+cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:59:43.579010Z"},"content_sha256":"2e2e15b65350df041b50ca569e1640af1e30b641b766210efd4fa83db7e07bd4","schema_version":"1.0","event_id":"sha256:2e2e15b65350df041b50ca569e1640af1e30b641b766210efd4fa83db7e07bd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SJDCGD6MBD2WTOM6KE2ROIBQKG","target":"graph","payload":{"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"},"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJ8/bbeI8ncb8wtilJ+2jeJOOIU1E0yEDe0p0tWZVZV6DBgqcdAl6QhorxM3dCksjccPo/VBWLPFkrKohM5zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:59:43.579567Z"},"content_sha256":"6b82f60d44c1595910797973b33a95a9e83bb857e13c343ad6d5ba3de7cf10b2","schema_version":"1.0","event_id":"sha256:6b82f60d44c1595910797973b33a95a9e83bb857e13c343ad6d5ba3de7cf10b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/bundle.json","state_url":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/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-07T10:59:43Z","links":{"resolver":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG","bundle":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/bundle.json","state":"https://pith.science/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJDCGD6MBD2WTOM6KE2ROIBQKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SJDCGD6MBD2WTOM6KE2ROIBQKG","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":"92693f00ee068edc90865a3aa2ada6c6229c4d126c905c251fbfb52aa100edcd","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-09-17T14:47:31Z","title_canon_sha256":"54d25086aa654effafc38e29e6bcf844c3e72d9c34d7e234ba6ba521796366d2"},"schema_version":"1.0","source":{"id":"1209.3672","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3672","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3672v3","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3672","created_at":"2026-05-18T02:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"SJDCGD6MBD2W","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJDCGD6MBD2WTOM6","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJDCGD6M","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:6b82f60d44c1595910797973b33a95a9e83bb857e13c343ad6d5ba3de7cf10b2","target":"graph","created_at":"2026-05-18T02:48:43Z","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":"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||","authors_text":"Ewout van den Berg, Mark A. Davenport, Mary Wootters, Yaniv Plan","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-09-17T14:47:31Z","title":"1-Bit Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3672","kind":"arxiv","version":3},"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:2e2e15b65350df041b50ca569e1640af1e30b641b766210efd4fa83db7e07bd4","target":"record","created_at":"2026-05-18T02:48:43Z","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":"92693f00ee068edc90865a3aa2ada6c6229c4d126c905c251fbfb52aa100edcd","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-09-17T14:47:31Z","title_canon_sha256":"54d25086aa654effafc38e29e6bcf844c3e72d9c34d7e234ba6ba521796366d2"},"schema_version":"1.0","source":{"id":"1209.3672","kind":"arxiv","version":3}},"canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9246230fcc08f569b99e5135172030518a354ed46b1d4a3924182352b0837a1d","first_computed_at":"2026-05-18T02:48:43.731139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:43.731139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mK6jXLXWBUk9z4KCHbulixeDsAXZyi+2V4WmqJFB641pRqplyjCOO0pUtHZx8oFiFykCfYJulMfg9vg1Cl9BDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:43.731882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3672","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2e15b65350df041b50ca569e1640af1e30b641b766210efd4fa83db7e07bd4","sha256:6b82f60d44c1595910797973b33a95a9e83bb857e13c343ad6d5ba3de7cf10b2"],"state_sha256":"5653a80b3c47a6e2f2657312cedae15090e84cd46bb5d4cb0d9a7e63016b03a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYmW5FpNfys/U7QlqF+Nwn4UNu7RCqKrhc/E747+v3tdXY4Qcth9UD+1ck2LkyFxiFM4rzESdWPAXzytp5+eAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:59:43.582820Z","bundle_sha256":"14794debf4fc345551b213a879cabb6961072781fae03ce399f6e777ae56a514"}}