{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3ZCD6XGNOND4PLAU7TGNMY7TQ","short_pith_number":"pith:E3ZCD6XG","schema_version":"1.0","canonical_sha256":"26f221fae66b9a3e3d60a7e666b31f9c37ee3c496abdf371e11b1109513fba1a","source":{"kind":"arxiv","id":"1601.04807","version":2},"attestation_state":"computed","paper":{"title":"Separating hash families: A Johnson-type bound and new constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2016-01-19T06:35:30Z","abstract_excerpt":"Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory, we solve several open problems and conjectures concerning bounds and constructions for separating hash families. Firstly, we discover that the cardinality of a separating hash family satisfies a Johnson-type inequality. As a result, we obtain a new upper bound, which is superior to all previous ones. Secondly, we present a construction for an infinite class o"},"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":"1601.04807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-19T06:35:30Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"aadb63d0eccdee51fcaa66b6c07f19b8be17f2f286841644c6fc9fc1d0a60c0d","abstract_canon_sha256":"fcd9919d9176260ee909972f7e3d078af786a12719bbc4033ccbc4be17e3bf77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:28.801290Z","signature_b64":"tw2MgG28bC6VmuhacHnbMPjv1utq0rCIYVjcwFrbxKxD6nW1+hzJBiXUxLKjQhYyEOnSc8C/5Yq8prqxhuJqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f221fae66b9a3e3d60a7e666b31f9c37ee3c496abdf371e11b1109513fba1a","last_reissued_at":"2026-05-18T01:01:28.800862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:28.800862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating hash families: A Johnson-type bound and new constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"cs.DM","authors_text":"Chong Shangguan, Gennian Ge","submitted_at":"2016-01-19T06:35:30Z","abstract_excerpt":"Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory, we solve several open problems and conjectures concerning bounds and constructions for separating hash families. Firstly, we discover that the cardinality of a separating hash family satisfies a Johnson-type inequality. As a result, we obtain a new upper bound, which is superior to all previous ones. Secondly, we present a construction for an infinite class o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04807","kind":"arxiv","version":2},"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":"1601.04807","created_at":"2026-05-18T01:01:28.800928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04807v2","created_at":"2026-05-18T01:01:28.800928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04807","created_at":"2026-05-18T01:01:28.800928+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3ZCD6XGNOND","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3ZCD6XGNOND4PLA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3ZCD6XG","created_at":"2026-05-18T12:30:12.583610+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/E3ZCD6XGNOND4PLAU7TGNMY7TQ","json":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ.json","graph_json":"https://pith.science/api/pith-number/E3ZCD6XGNOND4PLAU7TGNMY7TQ/graph.json","events_json":"https://pith.science/api/pith-number/E3ZCD6XGNOND4PLAU7TGNMY7TQ/events.json","paper":"https://pith.science/paper/E3ZCD6XG"},"agent_actions":{"view_html":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ","download_json":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ.json","view_paper":"https://pith.science/paper/E3ZCD6XG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04807&json=true","fetch_graph":"https://pith.science/api/pith-number/E3ZCD6XGNOND4PLAU7TGNMY7TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/E3ZCD6XGNOND4PLAU7TGNMY7TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ/action/storage_attestation","attest_author":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ/action/author_attestation","sign_citation":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ/action/citation_signature","submit_replication":"https://pith.science/pith/E3ZCD6XGNOND4PLAU7TGNMY7TQ/action/replication_record"}},"created_at":"2026-05-18T01:01:28.800928+00:00","updated_at":"2026-05-18T01:01:28.800928+00:00"}