{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WDZ2VG6EYJJRTXNMHV67HKNOYX","short_pith_number":"pith:WDZ2VG6E","schema_version":"1.0","canonical_sha256":"b0f3aa9bc4c25319ddac3d7df3a9aec5d87dc25c71702a8cd548f2d1f8a80691","source":{"kind":"arxiv","id":"1601.02109","version":1},"attestation_state":"computed","paper":{"title":"Invertible binary matrix with maximum number of $2$-by-$2$ invertible submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Tao Zhang, Xin Wang, Yiwei Zhang","submitted_at":"2016-01-09T13:35:49Z","abstract_excerpt":"The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco, Esfahani and Stinson posed the problem on the constructions of binary matrices for which the desired properties of an AONT hold with the maximum probability. That is, for given integers $t\\le s$, what is the maximum number of $t$-by-$t$ invertible submatrices in a binary matrix of order $s$? For the case $t=2$, let $R_2(s)$ denote the maximal proportion of 2-by-2 "},"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":"1601.02109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-09T13:35:49Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"dff2741eb695fdfce3ee1bae02e9d3d4ed3e98d92710d32acb72dd1fd9c396db","abstract_canon_sha256":"668107ecc60f7d4b59149ccb61585f90b72b0cf514b31e9488ba5a717245ca9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:07.294212Z","signature_b64":"ZBclFbUJGPaxysvRR6/wRBe5E7iHv7pGRm8eefSDxVO39e2CBuY2zEgdUlenBAr1j/Vv+TRDSqdHnwlKCJsvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0f3aa9bc4c25319ddac3d7df3a9aec5d87dc25c71702a8cd548f2d1f8a80691","last_reissued_at":"2026-05-18T01:23:07.293750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:07.293750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Invertible binary matrix with maximum number of $2$-by-$2$ invertible submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Tao Zhang, Xin Wang, Yiwei Zhang","submitted_at":"2016-01-09T13:35:49Z","abstract_excerpt":"The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco, Esfahani and Stinson posed the problem on the constructions of binary matrices for which the desired properties of an AONT hold with the maximum probability. That is, for given integers $t\\le s$, what is the maximum number of $t$-by-$t$ invertible submatrices in a binary matrix of order $s$? For the case $t=2$, let $R_2(s)$ denote the maximal proportion of 2-by-2 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02109","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":"1601.02109","created_at":"2026-05-18T01:23:07.293827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02109v1","created_at":"2026-05-18T01:23:07.293827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02109","created_at":"2026-05-18T01:23:07.293827+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDZ2VG6EYJJR","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDZ2VG6EYJJRTXNM","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDZ2VG6E","created_at":"2026-05-18T12:30:48.956258+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/WDZ2VG6EYJJRTXNMHV67HKNOYX","json":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX.json","graph_json":"https://pith.science/api/pith-number/WDZ2VG6EYJJRTXNMHV67HKNOYX/graph.json","events_json":"https://pith.science/api/pith-number/WDZ2VG6EYJJRTXNMHV67HKNOYX/events.json","paper":"https://pith.science/paper/WDZ2VG6E"},"agent_actions":{"view_html":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX","download_json":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX.json","view_paper":"https://pith.science/paper/WDZ2VG6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02109&json=true","fetch_graph":"https://pith.science/api/pith-number/WDZ2VG6EYJJRTXNMHV67HKNOYX/graph.json","fetch_events":"https://pith.science/api/pith-number/WDZ2VG6EYJJRTXNMHV67HKNOYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX/action/storage_attestation","attest_author":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX/action/author_attestation","sign_citation":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX/action/citation_signature","submit_replication":"https://pith.science/pith/WDZ2VG6EYJJRTXNMHV67HKNOYX/action/replication_record"}},"created_at":"2026-05-18T01:23:07.293827+00:00","updated_at":"2026-05-18T01:23:07.293827+00:00"}