{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OIP6RRBMXOQK4GUNKYUFR6QRW3","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":"4795bc5ce46bba98540dbf3c9d3794fd58052f04582fbf0fb1ce03376eec3359","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T15:27:15Z","title_canon_sha256":"cc290120ff62ade59016e6565d2e9972f89a9a9cec11e70511a5810c2e88adb9"},"schema_version":"1.0","source":{"id":"1406.6920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6920","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6920v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6920","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"OIP6RRBMXOQK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OIP6RRBMXOQK4GUN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OIP6RRBM","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d04738e0134edf55d4c94186c622feec249a7b1442d00b4656b4908f42ab475e","target":"graph","created_at":"2026-05-18T02:48:55Z","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":"In this paper, we study $w$-frameproof codes, which are equivalent to $\\{1,w\\}$-separating hash families. Our main results concern binary codes, which are defined over an alphabet of two symbols. For all $w \\geq 3$, and for $w+1 \\leq N \\leq 3w$, we show that an $SHF(N; n,2, \\{1,w \\})$ exists only if $n \\leq N$, and an $SHF(N; N,2, \\{1,w \\})$ must be a permutation matrix of degree $N$.","authors_text":"Chuan Guo, Douglas R. Stinson, Tran van Trung","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T15:27:15Z","title":"On tight bounds for binary frameproof codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6920","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:cca432e2909c52865da960e4412e98a3d858fbf4600b43f7481fb7725de80b35","target":"record","created_at":"2026-05-18T02:48:55Z","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":"4795bc5ce46bba98540dbf3c9d3794fd58052f04582fbf0fb1ce03376eec3359","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T15:27:15Z","title_canon_sha256":"cc290120ff62ade59016e6565d2e9972f89a9a9cec11e70511a5810c2e88adb9"},"schema_version":"1.0","source":{"id":"1406.6920","kind":"arxiv","version":1}},"canonical_sha256":"721fe8c42cbba0ae1a8d562858fa11b6f1c2572fa17d4d8ade57bf16e891201e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"721fe8c42cbba0ae1a8d562858fa11b6f1c2572fa17d4d8ade57bf16e891201e","first_computed_at":"2026-05-18T02:48:55.489492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.489492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L148KfycXkXbx/30XgANWDzdXtFgzV+zxgJoydOtiQ75Ge4d8/NANSEa0Oymlgt39LQWibyvO5wyX6QxgsOqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.490013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cca432e2909c52865da960e4412e98a3d858fbf4600b43f7481fb7725de80b35","sha256:d04738e0134edf55d4c94186c622feec249a7b1442d00b4656b4908f42ab475e"],"state_sha256":"d6a7e93d65111d20d7190f2a37c7ec671b5729d562ee8b5c92f62eda12a8623e"}