{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BVPWYLNJRKEFTDD6NOSL2WAKXN","short_pith_number":"pith:BVPWYLNJ","canonical_record":{"source":{"id":"1509.08535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-28T23:11:16Z","cross_cats_sorted":["cs.AI","cs.DM","stat.ML","stat.TH"],"title_canon_sha256":"a6d256d5c2fea2f3392eb92d1c647d657a172815ba2b8f8ae05519350e8e2d8e","abstract_canon_sha256":"c3927655273be130b28eae727fadd5eec51d5583b75234270e0e9598911ec573"},"schema_version":"1.0"},"canonical_sha256":"0d5f6c2da98a88598c7e6ba4bd580abb44f75d83c6fd13e1e90e54bdc33b34b1","source":{"kind":"arxiv","id":"1509.08535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08535","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08535v3","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08535","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"BVPWYLNJRKEF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BVPWYLNJRKEFTDD6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BVPWYLNJ","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BVPWYLNJRKEFTDD6NOSL2WAKXN","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-28T23:11:16Z","cross_cats_sorted":["cs.AI","cs.DM","stat.ML","stat.TH"],"title_canon_sha256":"a6d256d5c2fea2f3392eb92d1c647d657a172815ba2b8f8ae05519350e8e2d8e","abstract_canon_sha256":"c3927655273be130b28eae727fadd5eec51d5583b75234270e0e9598911ec573"},"schema_version":"1.0"},"canonical_sha256":"0d5f6c2da98a88598c7e6ba4bd580abb44f75d83c6fd13e1e90e54bdc33b34b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:15.677216Z","signature_b64":"Bf+IyS9itdgfipzWNk7RLcl7e3p8+Q/N75jP3JhQFuWJcaOHnIOoCdC1Mb9YwT+DY+Nj57hkMd3HCRKx6WhjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d5f6c2da98a88598c7e6ba4bd580abb44f75d83c6fd13e1e90e54bdc33b34b1","last_reissued_at":"2026-05-18T01:21:15.676501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:15.676501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08535","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-18T01:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vFD3TGCmSk5eIa3aJMMDAYa27O/5ZC/N1mkYcytxrHhLwc+54KNKnKjxM77HbWiLAmMQvhc8yiH+hTnoPUEyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:44:33.847795Z"},"content_sha256":"104c9aed8eec45471a213c5f2f3b1f5170b9e3638bcd726d2c7315e6805d32d8","schema_version":"1.0","event_id":"sha256:104c9aed8eec45471a213c5f2f3b1f5170b9e3638bcd726d2c7315e6805d32d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BVPWYLNJRKEFTDD6NOSL2WAKXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Matrix Factorization and Noisy Completion via Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Barnabas Poczos, Russell Greiner, Siamak Ravanbakhsh","submitted_at":"2015-09-28T23:11:16Z","abstract_excerpt":"Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as maximum a posteriori inference problems in a graphical model and present a message passing approach that scales linearly with the number of observations and factors. Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08535","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-18T01:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC4CMdrhChd4hPk4yp9gs87rdHJ6x9O1jPBC9d9MOHM+WUEtEIjYSSWalb2gJ5HPyuxG2j4cO0tZJv/aTZooDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:44:33.848142Z"},"content_sha256":"4ae74c3d5369bc5926711af5ed4eac44b2a602e4c193c24136a4a1253dcb31da","schema_version":"1.0","event_id":"sha256:4ae74c3d5369bc5926711af5ed4eac44b2a602e4c193c24136a4a1253dcb31da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/bundle.json","state_url":"https://pith.science/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/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-07T14:44:33Z","links":{"resolver":"https://pith.science/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN","bundle":"https://pith.science/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/bundle.json","state":"https://pith.science/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVPWYLNJRKEFTDD6NOSL2WAKXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BVPWYLNJRKEFTDD6NOSL2WAKXN","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":"c3927655273be130b28eae727fadd5eec51d5583b75234270e0e9598911ec573","cross_cats_sorted":["cs.AI","cs.DM","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-28T23:11:16Z","title_canon_sha256":"a6d256d5c2fea2f3392eb92d1c647d657a172815ba2b8f8ae05519350e8e2d8e"},"schema_version":"1.0","source":{"id":"1509.08535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08535","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08535v3","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08535","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"BVPWYLNJRKEF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BVPWYLNJRKEFTDD6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BVPWYLNJ","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:4ae74c3d5369bc5926711af5ed4eac44b2a602e4c193c24136a4a1253dcb31da","target":"graph","created_at":"2026-05-18T01:21:15Z","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":"Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as maximum a posteriori inference problems in a graphical model and present a message passing approach that scales linearly with the number of observations and factors. Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art ","authors_text":"Barnabas Poczos, Russell Greiner, Siamak Ravanbakhsh","cross_cats":["cs.AI","cs.DM","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-28T23:11:16Z","title":"Boolean Matrix Factorization and Noisy Completion via Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08535","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:104c9aed8eec45471a213c5f2f3b1f5170b9e3638bcd726d2c7315e6805d32d8","target":"record","created_at":"2026-05-18T01:21:15Z","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":"c3927655273be130b28eae727fadd5eec51d5583b75234270e0e9598911ec573","cross_cats_sorted":["cs.AI","cs.DM","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-28T23:11:16Z","title_canon_sha256":"a6d256d5c2fea2f3392eb92d1c647d657a172815ba2b8f8ae05519350e8e2d8e"},"schema_version":"1.0","source":{"id":"1509.08535","kind":"arxiv","version":3}},"canonical_sha256":"0d5f6c2da98a88598c7e6ba4bd580abb44f75d83c6fd13e1e90e54bdc33b34b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d5f6c2da98a88598c7e6ba4bd580abb44f75d83c6fd13e1e90e54bdc33b34b1","first_computed_at":"2026-05-18T01:21:15.676501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:15.676501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bf+IyS9itdgfipzWNk7RLcl7e3p8+Q/N75jP3JhQFuWJcaOHnIOoCdC1Mb9YwT+DY+Nj57hkMd3HCRKx6WhjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:15.677216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:104c9aed8eec45471a213c5f2f3b1f5170b9e3638bcd726d2c7315e6805d32d8","sha256:4ae74c3d5369bc5926711af5ed4eac44b2a602e4c193c24136a4a1253dcb31da"],"state_sha256":"c84b58527c9170c623e06e8cef841b1a0566944fa3f26e8e615b5a7f5b3feb7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHMgqTVK9rPT82xpKmX+9pTBnTng0AsDTjlyylwZ/O4MVGadcnH5oDROAL+cymkxhXdpAye2VPVX6tPmabbICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:44:33.850073Z","bundle_sha256":"e74f448322fd5387858f9a31dcb516a17be0f30a8b71a6f6a83aa97c15d6ad55"}}