{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2WPE7RDGII5A4HDQQC6WL7PYXO","short_pith_number":"pith:2WPE7RDG","schema_version":"1.0","canonical_sha256":"d59e4fc466423a0e1c7080bd65fdf8bb95d225780fb595a49a259bb9f6b649ed","source":{"kind":"arxiv","id":"1805.04582","version":1},"attestation_state":"computed","paper":{"title":"TensOrMachine: Probabilistic Boolean Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-bio.GN","stat.AP"],"primary_cat":"stat.ML","authors_text":"Chris C. Holmes, Christopher Yau, Tammo Rukat","submitted_at":"2018-05-11T20:23:35Z","abstract_excerpt":"Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate scalable sampling-based posterior inference by exploitation of the combinatorial structure of the factor conditionals. Maximum a posteriori decompositions feature higher accuracies than existing techniques throughout a wide range of simulated conditions. Moreover, the probabilistic approach facilitates the treatment of missing data and enables model selectio"},"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":"1805.04582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T20:23:35Z","cross_cats_sorted":["cs.AI","cs.LG","q-bio.GN","stat.AP"],"title_canon_sha256":"cd9ee747ea1498608699adb3135294beb495af6b023d016c784d193aeb9cbd51","abstract_canon_sha256":"bd061d481106aedab80c9806d555bc33e57a727b54ff62ae9b30e5339573ac83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.007545Z","signature_b64":"fs4Enxn3eRFveAHOQ8rEGupj+N2rn6yWykeu2oL+dpXqpQsPdmVtLPAIgJEmJTbArOabmIERJsVupqFOIUeBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59e4fc466423a0e1c7080bd65fdf8bb95d225780fb595a49a259bb9f6b649ed","last_reissued_at":"2026-05-18T00:16:07.006854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.006854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TensOrMachine: Probabilistic Boolean Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","q-bio.GN","stat.AP"],"primary_cat":"stat.ML","authors_text":"Chris C. Holmes, Christopher Yau, Tammo Rukat","submitted_at":"2018-05-11T20:23:35Z","abstract_excerpt":"Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate scalable sampling-based posterior inference by exploitation of the combinatorial structure of the factor conditionals. Maximum a posteriori decompositions feature higher accuracies than existing techniques throughout a wide range of simulated conditions. Moreover, the probabilistic approach facilitates the treatment of missing data and enables model selectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04582","kind":"arxiv","version":1},"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":"1805.04582","created_at":"2026-05-18T00:16:07.006973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04582v1","created_at":"2026-05-18T00:16:07.006973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04582","created_at":"2026-05-18T00:16:07.006973+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WPE7RDGII5A","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WPE7RDGII5A4HDQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WPE7RDG","created_at":"2026-05-18T12:32:02.567920+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/2WPE7RDGII5A4HDQQC6WL7PYXO","json":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO.json","graph_json":"https://pith.science/api/pith-number/2WPE7RDGII5A4HDQQC6WL7PYXO/graph.json","events_json":"https://pith.science/api/pith-number/2WPE7RDGII5A4HDQQC6WL7PYXO/events.json","paper":"https://pith.science/paper/2WPE7RDG"},"agent_actions":{"view_html":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO","download_json":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO.json","view_paper":"https://pith.science/paper/2WPE7RDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04582&json=true","fetch_graph":"https://pith.science/api/pith-number/2WPE7RDGII5A4HDQQC6WL7PYXO/graph.json","fetch_events":"https://pith.science/api/pith-number/2WPE7RDGII5A4HDQQC6WL7PYXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO/action/storage_attestation","attest_author":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO/action/author_attestation","sign_citation":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO/action/citation_signature","submit_replication":"https://pith.science/pith/2WPE7RDGII5A4HDQQC6WL7PYXO/action/replication_record"}},"created_at":"2026-05-18T00:16:07.006973+00:00","updated_at":"2026-05-18T00:16:07.006973+00:00"}