{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZHEQGQ65W5G7DGIPZPJ6FUT4RX","short_pith_number":"pith:ZHEQGQ65","schema_version":"1.0","canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","source":{"kind":"arxiv","id":"1702.06166","version":2},"attestation_state":"computed","paper":{"title":"Bayesian Boolean Matrix Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"primary_cat":"stat.ML","authors_text":"Chris C. Holmes, Christopher Yau, Michalis K. Titsias, Tammo Rukat","submitted_at":"2017-02-20T20:31:39Z","abstract_excerpt":"Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic generative model for Boolean matrix factorisation and derive a Metropolised Gibbs sampler that facilitates efficient parallel posterior inference. On real world and simulated data, our method outperforms all currently existing approaches for Boolean matrix factorisation and completion."},"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":"1702.06166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-20T20:31:39Z","cross_cats_sorted":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"title_canon_sha256":"b547a2920bbdfe5ee9be268df955b4d0d07fc7548f4137a649887cab97073282","abstract_canon_sha256":"a1e1df0831f497176458275968f2ba52c8471e38263841e6ddac65931c5f04a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:57.371303Z","signature_b64":"YyZXAVI6YZaUaaiPlNCo632xy8C1CuWD09K7LwJLAukrq9ZQuTlbS8eAcijti8kG0V92DMVUh7jOjnEfl039Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","last_reissued_at":"2026-05-18T00:49:57.370797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:57.370797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Boolean Matrix Factorisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"primary_cat":"stat.ML","authors_text":"Chris C. Holmes, Christopher Yau, Michalis K. Titsias, Tammo Rukat","submitted_at":"2017-02-20T20:31:39Z","abstract_excerpt":"Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic generative model for Boolean matrix factorisation and derive a Metropolised Gibbs sampler that facilitates efficient parallel posterior inference. On real world and simulated data, our method outperforms all currently existing approaches for Boolean matrix factorisation and completion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06166","kind":"arxiv","version":2},"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":"1702.06166","created_at":"2026-05-18T00:49:57.370882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06166v2","created_at":"2026-05-18T00:49:57.370882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06166","created_at":"2026-05-18T00:49:57.370882+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHEQGQ65W5G7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHEQGQ65W5G7DGIP","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHEQGQ65","created_at":"2026-05-18T12:31:59.375834+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/ZHEQGQ65W5G7DGIPZPJ6FUT4RX","json":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX.json","graph_json":"https://pith.science/api/pith-number/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/graph.json","events_json":"https://pith.science/api/pith-number/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/events.json","paper":"https://pith.science/paper/ZHEQGQ65"},"agent_actions":{"view_html":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX","download_json":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX.json","view_paper":"https://pith.science/paper/ZHEQGQ65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06166&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/action/storage_attestation","attest_author":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/action/author_attestation","sign_citation":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/action/citation_signature","submit_replication":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/action/replication_record"}},"created_at":"2026-05-18T00:49:57.370882+00:00","updated_at":"2026-05-18T00:49:57.370882+00:00"}