{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JJK7I4TVS2OOPAIGECSZDJQJ2F","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":"3e7b87674be8859bcb74aa81d63d7746a3a137ed21117655d666cca160b22347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-25T21:48:05Z","title_canon_sha256":"b656a6a26d67f199c8e0a9e62d125d38fb552e90ec58e1cc37a3b8ca8bc9d4d8"},"schema_version":"1.0","source":{"id":"1512.08041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08041","created_at":"2026-05-18T01:23:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08041v1","created_at":"2026-05-18T01:23:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08041","created_at":"2026-05-18T01:23:43Z"},{"alias_kind":"pith_short_12","alias_value":"JJK7I4TVS2OO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JJK7I4TVS2OOPAIG","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JJK7I4TV","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:2106211bb3a7fd011b67ba1e2aec3bd874ed7fec4e49459f9464142bc377ffa7","target":"graph","created_at":"2026-05-18T01:23:43Z","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":"An arbitrary $m\\times n$ Boolean matrix $M$ can be decomposed {\\em exactly} as $M =U\\circ V$, where $U$ (resp. $V$) is an $m\\times k$ (resp. $k\\times n$) Boolean matrix and $\\circ$ denotes the Boolean matrix multiplication operator. We first prove an exact formula for the Boolean matrix $J$ such that $M =M\\circ J^T$ holds, where $J$ is maximal in the sense that if any 0 element in $J$ is changed to a 1 then this equality no longer holds. Since minimizing $k$ is NP-hard, we propose two heuristic algorithms for finding suboptimal but good decomposition. We measure the performance (in minimizing ","authors_text":"Shiwei Ye, Tsunehiko Kameda, Yi Sun, Yuan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-25T21:48:05Z","title":"Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08041","kind":"arxiv","version":1},"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:d3e22dd8ce92638c826f5a6bf9a01ff416ac59ae966758b5d7bc74577f5a27ac","target":"record","created_at":"2026-05-18T01:23:43Z","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":"3e7b87674be8859bcb74aa81d63d7746a3a137ed21117655d666cca160b22347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-25T21:48:05Z","title_canon_sha256":"b656a6a26d67f199c8e0a9e62d125d38fb552e90ec58e1cc37a3b8ca8bc9d4d8"},"schema_version":"1.0","source":{"id":"1512.08041","kind":"arxiv","version":1}},"canonical_sha256":"4a55f47275969ce7810620a591a609d176bd86eb913450c1dc8bce08b44feaa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a55f47275969ce7810620a591a609d176bd86eb913450c1dc8bce08b44feaa6","first_computed_at":"2026-05-18T01:23:43.475970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:43.475970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+h+B6yIiC1N6t3WBIfFFt6gF8AmsVBZBedeqdqPlEGqdFrPe4/D3/sTFMhahEBWl+PliPuoHPHGFSBiy/e1sDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:43.476561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e22dd8ce92638c826f5a6bf9a01ff416ac59ae966758b5d7bc74577f5a27ac","sha256:2106211bb3a7fd011b67ba1e2aec3bd874ed7fec4e49459f9464142bc377ffa7"],"state_sha256":"e5a0ce46c5214e77648036f9618e42db4e541f8ec6e20f6539332428ccbda895"}