{"paper":{"title":"Secure Frameproof Code Through Biclique Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Hossein Hajiabolhassan","submitted_at":"2012-02-09T05:25:51Z","abstract_excerpt":"For a binary code $\\Gamma$ of length $v$, a $v$-word $w$ produces by a set of codewords $\\{w^1,...,w^r\\} \\subseteq \\Gamma$ if for all $i=1,...,v$, we have $w_i\\in \\{w_i^1, ..., w_i^r\\}$ . We call a code $r$-secure frameproof of size $t$ if $|\\Gamma|=t$ and for any $v$-word that is produced by two sets $C_1$ and $C_2$ of size at most $r$ then the intersection of these sets is nonempty. A $d$-biclique cover of size $v$ of a graph $G$ is a collection of $v$-complete bipartite subgraphs of $G$ such that each edge of $G$ belongs to at least $d$ of these complete bipartite subgraphs. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1889","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"}