{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VTBM5GF5HIMGXONFIVBUXOPJYB","short_pith_number":"pith:VTBM5GF5","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"},"canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","source":{"kind":"arxiv","id":"1202.1889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1889","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1889v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1889","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"VTBM5GF5HIMG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTBM5GF5HIMGXONF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTBM5GF5","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VTBM5GF5HIMGXONFIVBUXOPJYB","target":"record","payload":{"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"},"canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","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"},"source_kind":"arxiv","source_id":"1202.1889","source_version":1,"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-05-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nSKmAwbNnvW0RSYmT19hRke5T+VhpSZL+k5iP749qYG6rGmowByB2i0aSScAtsKw4Xbq1fMVPIGjHcEV30rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:54:53.906122Z"},"content_sha256":"403f8bb3120d28136f8baa215bddb73854ebd1a09684d7be8c50c080551ecb44","schema_version":"1.0","event_id":"sha256:403f8bb3120d28136f8baa215bddb73854ebd1a09684d7be8c50c080551ecb44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VTBM5GF5HIMGXONFIVBUXOPJYB","target":"graph","payload":{"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"},"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-05-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwZEBNpEE9dklCaOwwSIAFyiB406buRLtCB69KV14bt22A9MDtv9fnEnm5MrDAbvXcP/qDIIUNiaGKXyo1i+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:54:53.906476Z"},"content_sha256":"523622462d6162d8ed37ea939e92a0fcac56b39df377c3a2fb2c7a401a1473f8","schema_version":"1.0","event_id":"sha256:523622462d6162d8ed37ea939e92a0fcac56b39df377c3a2fb2c7a401a1473f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/bundle.json","state_url":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/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-06-28T12:54:53Z","links":{"resolver":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB","bundle":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/bundle.json","state":"https://pith.science/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTBM5GF5HIMGXONFIVBUXOPJYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VTBM5GF5HIMGXONFIVBUXOPJYB","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":"07804824ffd16a98a0dc9d48f10c6453edb3f0b6752bce677da5c87bd2f46e93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T05:25:51Z","title_canon_sha256":"45d97d447ea6d237546ba75b3eb4164952bb05826812a1720645e1467dc56865"},"schema_version":"1.0","source":{"id":"1202.1889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1889","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1889v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1889","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"VTBM5GF5HIMG","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTBM5GF5HIMGXONF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTBM5GF5","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:523622462d6162d8ed37ea939e92a0fcac56b39df377c3a2fb2c7a401a1473f8","target":"graph","created_at":"2026-05-18T04:02:38Z","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"},"paper":{"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, ","authors_text":"Farokhlagha Moazami, Hossein Hajiabolhassan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T05:25:51Z","title":"Secure Frameproof Code Through Biclique Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1889","kind":"arxiv","version":1},"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:403f8bb3120d28136f8baa215bddb73854ebd1a09684d7be8c50c080551ecb44","target":"record","created_at":"2026-05-18T04:02:38Z","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":"07804824ffd16a98a0dc9d48f10c6453edb3f0b6752bce677da5c87bd2f46e93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-09T05:25:51Z","title_canon_sha256":"45d97d447ea6d237546ba75b3eb4164952bb05826812a1720645e1467dc56865"},"schema_version":"1.0","source":{"id":"1202.1889","kind":"arxiv","version":1}},"canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acc2ce98bd3a186bb9a545434bb9e9c06cf1a179edd4759d3a430579858dea52","first_computed_at":"2026-05-18T04:02:38.842087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.842087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9b5LR5wGgHLjL4Z89MVc7QRkTLLvEvLQHihj6y9ZrtVf1yDRNHAlGQ6EhHXtHgyU0HiwGWn78kxlUOKvaWVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.842657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:403f8bb3120d28136f8baa215bddb73854ebd1a09684d7be8c50c080551ecb44","sha256:523622462d6162d8ed37ea939e92a0fcac56b39df377c3a2fb2c7a401a1473f8"],"state_sha256":"3da119e0c928cf5438d3d2d5359806d0b00a383e27cfe70f07600051e2d29e39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hV6G8JlK2+FO5pSlBO0EV4yAQQ13OTIwW4Mtni8nt0ArK0SR4Z+zAZDfg9fO6SZRWHO+vGiS3oygeaMCE4lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:54:53.908254Z","bundle_sha256":"f2f59fe3f9794d3d88ef4e8d3015324417a5534706b45a56c92fc06afbeaef51"}}