{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VEURDGTLP7DWLLGOQT67B4DTUO","short_pith_number":"pith:VEURDGTL","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"},"canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","source":{"kind":"arxiv","id":"2203.13073","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.13073","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2203.13073v3","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13073","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"VEURDGTLP7DW","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"VEURDGTLP7DWLLGO","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"VEURDGTL","created_at":"2026-07-05T05:38:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VEURDGTLP7DWLLGOQT67B4DTUO","target":"record","payload":{"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"},"canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","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"},"source_kind":"arxiv","source_id":"2203.13073","source_version":3,"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-07-05T05:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFK5kn3jaYKYdfSzk/208oTMIzufhSlR9BTm9ciOu7XGRwOtusXHuTfvEc+9Qj67uWQXFBnyEA+cjq8qhYgjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:52:36.335268Z"},"content_sha256":"fb8dac8c15208ea266693de104d5867b61921f4a6fe8f89bb7cd715df5e72e30","schema_version":"1.0","event_id":"sha256:fb8dac8c15208ea266693de104d5867b61921f4a6fe8f89bb7cd715df5e72e30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VEURDGTLP7DWLLGOQT67B4DTUO","target":"graph","payload":{"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"},"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-07-05T05:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUQzdiJtqxHBnq+bZ7YIpvUFwJpCGdbonzwmp8n1xYTmWXzVpAHZO0MugYU5vG8GEhNixEPVJrPPvVjms3MxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:52:36.335865Z"},"content_sha256":"2d98f6a2bdeaf37202ae263dbdf547ecb801d53264f6911ee64058da66fe2048","schema_version":"1.0","event_id":"sha256:2d98f6a2bdeaf37202ae263dbdf547ecb801d53264f6911ee64058da66fe2048"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/bundle.json","state_url":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEURDGTLP7DWLLGOQT67B4DTUO/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-08-23T11:52:36Z","links":{"resolver":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO","bundle":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/bundle.json","state":"https://pith.science/pith/VEURDGTLP7DWLLGOQT67B4DTUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEURDGTLP7DWLLGOQT67B4DTUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VEURDGTLP7DWLLGOQT67B4DTUO","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":"79bd5830e541a80f44a3cdabeeb38e303bf8c2663d4ffbec736fff177998d154","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-24T13:51:35Z","title_canon_sha256":"032afbd279d372e7688ec809df57bc143fb0179a84bd4ab261413dddd758ea0d"},"schema_version":"1.0","source":{"id":"2203.13073","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.13073","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2203.13073v3","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13073","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"VEURDGTLP7DW","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"VEURDGTLP7DWLLGO","created_at":"2026-07-05T05:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"VEURDGTL","created_at":"2026-07-05T05:38:27Z"}],"graph_snapshots":[{"event_id":"sha256:2d98f6a2bdeaf37202ae263dbdf547ecb801d53264f6911ee64058da66fe2048","target":"graph","created_at":"2026-07-05T05:38:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.13073/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ishay Haviv, Michal Parnas","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-24T13:51:35Z","title":"On the Binary and Boolean Rank of Regular Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.13073","kind":"arxiv","version":3},"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:fb8dac8c15208ea266693de104d5867b61921f4a6fe8f89bb7cd715df5e72e30","target":"record","created_at":"2026-07-05T05:38:27Z","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":"79bd5830e541a80f44a3cdabeeb38e303bf8c2663d4ffbec736fff177998d154","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-24T13:51:35Z","title_canon_sha256":"032afbd279d372e7688ec809df57bc143fb0179a84bd4ab261413dddd758ea0d"},"schema_version":"1.0","source":{"id":"2203.13073","kind":"arxiv","version":3}},"canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a929119a6b7fc765acce84fdf0f073a384cd6fb3645bc4d393bd5fbe73b96e7c","first_computed_at":"2026-07-05T05:38:27.492849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:27.492849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rmzIKSCLTU6dk5JLBOkkWdY527SbB5onktV91CZcIHS3L7DlvxJIQbblA0Dy1WV1CX7XwwGPmzcbiZjThadyAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:27.493374Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.13073","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb8dac8c15208ea266693de104d5867b61921f4a6fe8f89bb7cd715df5e72e30","sha256:2d98f6a2bdeaf37202ae263dbdf547ecb801d53264f6911ee64058da66fe2048"],"state_sha256":"7042a292125015886ccc7d9e734fe3d429f87148ed2ad5ac6e3ae80bda04a91d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3K7eA2GvIrOirC+NobKSWfsb5MPOuyt5d6x7bx3K50dllyXqbzCHBCiwzKl3wqT9g+gP39LIaO2nY7nidKW1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:52:36.341890Z","bundle_sha256":"42e814bde98d47f07808b89d321bdaf1b8d083840d72e45555b92a3e328793d6"}}