{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OIP6RRBMXOQK4GUNKYUFR6QRW3","short_pith_number":"pith:OIP6RRBM","schema_version":"1.0","canonical_sha256":"721fe8c42cbba0ae1a8d562858fa11b6f1c2572fa17d4d8ade57bf16e891201e","source":{"kind":"arxiv","id":"1406.6920","version":1},"attestation_state":"computed","paper":{"title":"On tight bounds for binary frameproof codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chuan Guo, Douglas R. Stinson, Tran van Trung","submitted_at":"2014-06-26T15:27:15Z","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$."},"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":"1406.6920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-26T15:27:15Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"cc290120ff62ade59016e6565d2e9972f89a9a9cec11e70511a5810c2e88adb9","abstract_canon_sha256":"4795bc5ce46bba98540dbf3c9d3794fd58052f04582fbf0fb1ce03376eec3359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.490013Z","signature_b64":"L148KfycXkXbx/30XgANWDzdXtFgzV+zxgJoydOtiQ75Ge4d8/NANSEa0Oymlgt39LQWibyvO5wyX6QxgsOqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721fe8c42cbba0ae1a8d562858fa11b6f1c2572fa17d4d8ade57bf16e891201e","last_reissued_at":"2026-05-18T02:48:55.489492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.489492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On tight bounds for binary frameproof codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chuan Guo, Douglas R. Stinson, Tran van Trung","submitted_at":"2014-06-26T15:27:15Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6920","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":"1406.6920","created_at":"2026-05-18T02:48:55.489570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6920v1","created_at":"2026-05-18T02:48:55.489570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6920","created_at":"2026-05-18T02:48:55.489570+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIP6RRBMXOQK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIP6RRBMXOQK4GUN","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIP6RRBM","created_at":"2026-05-18T12:28:41.024544+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/OIP6RRBMXOQK4GUNKYUFR6QRW3","json":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3.json","graph_json":"https://pith.science/api/pith-number/OIP6RRBMXOQK4GUNKYUFR6QRW3/graph.json","events_json":"https://pith.science/api/pith-number/OIP6RRBMXOQK4GUNKYUFR6QRW3/events.json","paper":"https://pith.science/paper/OIP6RRBM"},"agent_actions":{"view_html":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3","download_json":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3.json","view_paper":"https://pith.science/paper/OIP6RRBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6920&json=true","fetch_graph":"https://pith.science/api/pith-number/OIP6RRBMXOQK4GUNKYUFR6QRW3/graph.json","fetch_events":"https://pith.science/api/pith-number/OIP6RRBMXOQK4GUNKYUFR6QRW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3/action/storage_attestation","attest_author":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3/action/author_attestation","sign_citation":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3/action/citation_signature","submit_replication":"https://pith.science/pith/OIP6RRBMXOQK4GUNKYUFR6QRW3/action/replication_record"}},"created_at":"2026-05-18T02:48:55.489570+00:00","updated_at":"2026-05-18T02:48:55.489570+00:00"}