{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VTBM5GF5HIMGXONFIVBUXOPJYB","short_pith_number":"pith:VTBM5GF5","schema_version":"1.0","canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","source":{"kind":"arxiv","id":"1202.1889","version":1},"attestation_state":"computed","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, "},"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":"1202.1889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T05:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"45d97d447ea6d237546ba75b3eb4164952bb05826812a1720645e1467dc56865","abstract_canon_sha256":"07804824ffd16a98a0dc9d48f10c6453edb3f0b6752bce677da5c87bd2f46e93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.842657Z","signature_b64":"s9b5LR5wGgHLjL4Z89MVc7QRkTLLvEvLQHihj6y9ZrtVf1yDRNHAlGQ6EhHXtHgyU0HiwGWn78kxlUOKvaWVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","last_reissued_at":"2026-05-18T04:02:38.842087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.842087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.1889","created_at":"2026-05-18T04:02:38.842183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1889v1","created_at":"2026-05-18T04:02:38.842183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1889","created_at":"2026-05-18T04:02:38.842183+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTBM5GF5HIMG","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTBM5GF5HIMGXONF","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTBM5GF5","created_at":"2026-05-18T12:27:25.539911+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/VTBM5GF5HIMGXONFIVBUXOPJYB","json":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB.json","graph_json":"https://pith.science/api/pith-number/VTBM5GF5HIMGXONFIVBUXOPJYB/graph.json","events_json":"https://pith.science/api/pith-number/VTBM5GF5HIMGXONFIVBUXOPJYB/events.json","paper":"https://pith.science/paper/VTBM5GF5"},"agent_actions":{"view_html":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB","download_json":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB.json","view_paper":"https://pith.science/paper/VTBM5GF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1889&json=true","fetch_graph":"https://pith.science/api/pith-number/VTBM5GF5HIMGXONFIVBUXOPJYB/graph.json","fetch_events":"https://pith.science/api/pith-number/VTBM5GF5HIMGXONFIVBUXOPJYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/action/storage_attestation","attest_author":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/action/author_attestation","sign_citation":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/action/citation_signature","submit_replication":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/action/replication_record"}},"created_at":"2026-05-18T04:02:38.842183+00:00","updated_at":"2026-05-18T04:02:38.842183+00:00"}