{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LXVUPDWGEABJRG3IWPUMG2MOXC","short_pith_number":"pith:LXVUPDWG","schema_version":"1.0","canonical_sha256":"5deb478ec62002989b68b3e8c3698eb89b759821d9cdee430ed8b245ef6c0ca2","source":{"kind":"arxiv","id":"1903.10326","version":1},"attestation_state":"computed","paper":{"title":"topFiberM: Scalable and Efficient Boolean Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abdelmoneim Amer Desouki, Axel-Cyrille Ngonga Ngomo, Michael R\\\"oder","submitted_at":"2019-03-06T02:41:09Z","abstract_excerpt":"Matrix Factorization has many applications such as clustering. When the matrix is Boolean it is favorable to have Boolean factors too. This will save the efforts of quantizing the reconstructed data back, which usually is done using arbitrary thresholds. Here we introduce topFiberM a Boolean matrix factorization algorithm. topFiberM chooses in a greedy way the fibers (rows or columns) to represent the entire matrix. Fibers are extended to rectangles according to a threshold on precision. The search for these \"top fibers\" can continue beyond the required rank and according to an optional parame"},"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":"1903.10326","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-06T02:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"487162382f9496d8c6eb86311f67784be5f86e918045371cf8e1d16e12aea303","abstract_canon_sha256":"9125ceb745b22568befa07d7a5a9d06e27a9e5338abf6c3beb0655ddf5b8c6c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:29.816605Z","signature_b64":"MYJOpd+MNUG9i6BF+kRvK2pC7AArYGhpWJ5n7xePSTvT2TSJuIeP7QlUsY/km7x071d8fmXryb7hu8VpGNaoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5deb478ec62002989b68b3e8c3698eb89b759821d9cdee430ed8b245ef6c0ca2","last_reissued_at":"2026-05-17T23:50:29.815827Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:29.815827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"topFiberM: Scalable and Efficient Boolean Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abdelmoneim Amer Desouki, Axel-Cyrille Ngonga Ngomo, Michael R\\\"oder","submitted_at":"2019-03-06T02:41:09Z","abstract_excerpt":"Matrix Factorization has many applications such as clustering. When the matrix is Boolean it is favorable to have Boolean factors too. This will save the efforts of quantizing the reconstructed data back, which usually is done using arbitrary thresholds. Here we introduce topFiberM a Boolean matrix factorization algorithm. topFiberM chooses in a greedy way the fibers (rows or columns) to represent the entire matrix. Fibers are extended to rectangles according to a threshold on precision. The search for these \"top fibers\" can continue beyond the required rank and according to an optional parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10326","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":"1903.10326","created_at":"2026-05-17T23:50:29.815954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10326v1","created_at":"2026-05-17T23:50:29.815954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10326","created_at":"2026-05-17T23:50:29.815954+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXVUPDWGEABJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXVUPDWGEABJRG3I","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXVUPDWG","created_at":"2026-05-18T12:33:21.387695+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/LXVUPDWGEABJRG3IWPUMG2MOXC","json":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC.json","graph_json":"https://pith.science/api/pith-number/LXVUPDWGEABJRG3IWPUMG2MOXC/graph.json","events_json":"https://pith.science/api/pith-number/LXVUPDWGEABJRG3IWPUMG2MOXC/events.json","paper":"https://pith.science/paper/LXVUPDWG"},"agent_actions":{"view_html":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC","download_json":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC.json","view_paper":"https://pith.science/paper/LXVUPDWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10326&json=true","fetch_graph":"https://pith.science/api/pith-number/LXVUPDWGEABJRG3IWPUMG2MOXC/graph.json","fetch_events":"https://pith.science/api/pith-number/LXVUPDWGEABJRG3IWPUMG2MOXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC/action/storage_attestation","attest_author":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC/action/author_attestation","sign_citation":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC/action/citation_signature","submit_replication":"https://pith.science/pith/LXVUPDWGEABJRG3IWPUMG2MOXC/action/replication_record"}},"created_at":"2026-05-17T23:50:29.815954+00:00","updated_at":"2026-05-17T23:50:29.815954+00:00"}