{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZHEQGQ65W5G7DGIPZPJ6FUT4RX","short_pith_number":"pith:ZHEQGQ65","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"},"canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","source":{"kind":"arxiv","id":"1702.06166","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06166","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06166v2","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06166","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZHEQGQ65W5G7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHEQGQ65W5G7DGIP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHEQGQ65","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZHEQGQ65W5G7DGIPZPJ6FUT4RX","target":"record","payload":{"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"},"canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","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"},"source_kind":"arxiv","source_id":"1702.06166","source_version":2,"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-18T00:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqZ0hNCqeaWtxqSIzUIiqQeq8f0Y4ZsnUZtKRoRoBouiUeWlf480qQB0O21ZRyvTA3BAENv7zm0OVyC64ZzeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:17:09.505289Z"},"content_sha256":"1906ae9ef0a33ed5985a26454daed194d9e59951bca9f7c09a64355c0733ea47","schema_version":"1.0","event_id":"sha256:1906ae9ef0a33ed5985a26454daed194d9e59951bca9f7c09a64355c0733ea47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZHEQGQ65W5G7DGIPZPJ6FUT4RX","target":"graph","payload":{"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"},"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-18T00:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5JY0AuLduFKWlavQvuESCB4LrN6Pdr2gEDRv9UdScl7KR/pHa/w2R8PiA9M+batEcbbCC5ml5EW/T5fVgQEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:17:09.505654Z"},"content_sha256":"809a87c4bc49c034ba3bfbbdc0739c483489317645fc62c55a8694c994da5196","schema_version":"1.0","event_id":"sha256:809a87c4bc49c034ba3bfbbdc0739c483489317645fc62c55a8694c994da5196"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/bundle.json","state_url":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/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-07-02T20:17:09Z","links":{"resolver":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX","bundle":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/bundle.json","state":"https://pith.science/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHEQGQ65W5G7DGIPZPJ6FUT4RX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZHEQGQ65W5G7DGIPZPJ6FUT4RX","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":"a1e1df0831f497176458275968f2ba52c8471e38263841e6ddac65931c5f04a7","cross_cats_sorted":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-20T20:31:39Z","title_canon_sha256":"b547a2920bbdfe5ee9be268df955b4d0d07fc7548f4137a649887cab97073282"},"schema_version":"1.0","source":{"id":"1702.06166","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06166","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06166v2","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06166","created_at":"2026-05-18T00:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZHEQGQ65W5G7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHEQGQ65W5G7DGIP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHEQGQ65","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:809a87c4bc49c034ba3bfbbdc0739c483489317645fc62c55a8694c994da5196","target":"graph","created_at":"2026-05-18T00:49:57Z","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 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.","authors_text":"Chris C. Holmes, Christopher Yau, Michalis K. Titsias, Tammo Rukat","cross_cats":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-20T20:31:39Z","title":"Bayesian Boolean Matrix Factorisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06166","kind":"arxiv","version":2},"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:1906ae9ef0a33ed5985a26454daed194d9e59951bca9f7c09a64355c0733ea47","target":"record","created_at":"2026-05-18T00:49:57Z","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":"a1e1df0831f497176458275968f2ba52c8471e38263841e6ddac65931c5f04a7","cross_cats_sorted":["cs.LG","cs.NA","q-bio.GN","q-bio.QM","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-20T20:31:39Z","title_canon_sha256":"b547a2920bbdfe5ee9be268df955b4d0d07fc7548f4137a649887cab97073282"},"schema_version":"1.0","source":{"id":"1702.06166","kind":"arxiv","version":2}},"canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9c90343ddb74df1990fcbd3e2d27c8dcf77ff764fba289ae820dbd6e30689df","first_computed_at":"2026-05-18T00:49:57.370797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:57.370797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YyZXAVI6YZaUaaiPlNCo632xy8C1CuWD09K7LwJLAukrq9ZQuTlbS8eAcijti8kG0V92DMVUh7jOjnEfl039Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:57.371303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06166","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1906ae9ef0a33ed5985a26454daed194d9e59951bca9f7c09a64355c0733ea47","sha256:809a87c4bc49c034ba3bfbbdc0739c483489317645fc62c55a8694c994da5196"],"state_sha256":"3aae172ff94ed6b01dccbd78abad045d666341e50963e66d58264c8b381cfb66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLkNXcHuanawVsw8cThsVsU3UjP6tGeR6W1+hPeYkPNWOlS9pRNpqAr7UI5PjYwiLo+FBiyXa3afxZ3DZ1sODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T20:17:09.507640Z","bundle_sha256":"a85bbe9744736fad3146d919a9e0aa19402cf2c325e971dba961382eb628cb8f"}}