{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VEURDGTLP7DWLLGOQT67B4DTUO","short_pith_number":"pith:VEURDGTL","schema_version":"1.0","canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","source":{"kind":"arxiv","id":"2203.13073","version":3},"attestation_state":"computed","paper":{"title":"On the Binary and Boolean Rank of Regular Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Ishay Haviv, Michal Parnas","submitted_at":"2022-03-24T13:51:35Z","abstract_excerpt":"A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of its complement is $k^{\\widetilde{\\Omega}(\\log k)}$. Equivalently, the ones in the matrix can be partitioned into $k$ combinatorial rectangles, whereas the number of rectangles needed for any cover of its zeros is $k^{\\widetilde{\\Omega}(\\log k)}$. This settles, in a strong form, a question of Pullman (Linear Algebra Appl., 1988) and a conjecture of Hefner, H"},"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":"2203.13073","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-24T13:51:35Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"032afbd279d372e7688ec809df57bc143fb0179a84bd4ab261413dddd758ea0d","abstract_canon_sha256":"79bd5830e541a80f44a3cdabeeb38e303bf8c2663d4ffbec736fff177998d154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:27.493374Z","signature_b64":"rmzIKSCLTU6dk5JLBOkkWdY527SbB5onktV91CZcIHS3L7DlvxJIQbblA0Dy1WV1CX7XwwGPmzcbiZjThadyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","last_reissued_at":"2026-07-05T05:38:27.492849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:27.492849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Binary and Boolean Rank of Regular Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Ishay Haviv, Michal Parnas","submitted_at":"2022-03-24T13:51:35Z","abstract_excerpt":"A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of its complement is $k^{\\widetilde{\\Omega}(\\log k)}$. Equivalently, the ones in the matrix can be partitioned into $k$ combinatorial rectangles, whereas the number of rectangles needed for any cover of its zeros is $k^{\\widetilde{\\Omega}(\\log k)}$. This settles, in a strong form, a question of Pullman (Linear Algebra Appl., 1988) and a conjecture of Hefner, H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.13073","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.13073/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.13073","created_at":"2026-07-05T05:38:27.492913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.13073v3","created_at":"2026-07-05T05:38:27.492913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13073","created_at":"2026-07-05T05:38:27.492913+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEURDGTLP7DW","created_at":"2026-07-05T05:38:27.492913+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEURDGTLP7DWLLGO","created_at":"2026-07-05T05:38:27.492913+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEURDGTL","created_at":"2026-07-05T05:38:27.492913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06730","citing_title":"Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO","json":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO.json","graph_json":"https://pith.science/api/pith-number/VEURDGTLP7DWLLGOQT67B4DTUO/graph.json","events_json":"https://pith.science/api/pith-number/VEURDGTLP7DWLLGOQT67B4DTUO/events.json","paper":"https://pith.science/paper/VEURDGTL"},"agent_actions":{"view_html":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO","download_json":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO.json","view_paper":"https://pith.science/paper/VEURDGTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.13073&json=true","fetch_graph":"https://pith.science/api/pith-number/VEURDGTLP7DWLLGOQT67B4DTUO/graph.json","fetch_events":"https://pith.science/api/pith-number/VEURDGTLP7DWLLGOQT67B4DTUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/action/storage_attestation","attest_author":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/action/author_attestation","sign_citation":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/action/citation_signature","submit_replication":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/action/replication_record"}},"created_at":"2026-07-05T05:38:27.492913+00:00","updated_at":"2026-07-05T05:38:27.492913+00:00"}