{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OYSU7AMPPAOJMIBQ5G2EKAX2QW","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":"7554df7fb7968686012b91ef3f321e3b5314cd98a4a17b86d10832eb109491fb","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T19:53:55Z","title_canon_sha256":"8300878bbd8e98aa6768576ea7d34d777ab6d811161183af659621dd817468da"},"schema_version":"1.0","source":{"id":"1805.04151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04151","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04151v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04151","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"OYSU7AMPPAOJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYSU7AMPPAOJMIBQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYSU7AMP","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:a6dc3929a648657efc0b613e7efe6d393dfc3df357e871a123ff76344cc24be1","target":"graph","created_at":"2026-05-18T00:16:13Z","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":"We say a subset $C \\subseteq \\{1,2,\\dots,k\\}^n$ is a $k$-hash code (also called $k$-separated) if for every subset of $k$ codewords from $C$, there exists a coordinate where all these codewords have distinct values. Understanding the largest possible rate (in bits), defined as $(\\log_2 |C|)/n$, of a $k$-hash code is a classical problem. It arises in two equivalent contexts: (i) the smallest size possible for a perfect hash family that maps a universe of $N$ elements into $\\{1,2,\\dots,k\\}$, and (ii) the zero-error capacity for decoding with lists of size less than $k$ for a certain combinatoria","authors_text":"Andrii Riazanov, Venkatesan Guruswami","cross_cats":["cs.DM","cs.DS","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T19:53:55Z","title":"Beating Fredman-Koml\\'{o}s for perfect $k$-hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04151","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:96c18f53468bbf750c11d1debfd8e7ccd280e076018001583b19fe830958cf4a","target":"record","created_at":"2026-05-18T00:16:13Z","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":"7554df7fb7968686012b91ef3f321e3b5314cd98a4a17b86d10832eb109491fb","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T19:53:55Z","title_canon_sha256":"8300878bbd8e98aa6768576ea7d34d777ab6d811161183af659621dd817468da"},"schema_version":"1.0","source":{"id":"1805.04151","kind":"arxiv","version":1}},"canonical_sha256":"76254f818f781c962030e9b44502fa859b68fe4d3829200ea0a5df116713f274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76254f818f781c962030e9b44502fa859b68fe4d3829200ea0a5df116713f274","first_computed_at":"2026-05-18T00:16:13.476522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:13.476522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J2UkMyNXdDHThYjHrEv7n3Y/czYNKw7FUQ7UUd8vFEWDc12VgKIRGBobaO5N4bD7HEdpbLJHXlR1txAM+mnRCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:13.477189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96c18f53468bbf750c11d1debfd8e7ccd280e076018001583b19fe830958cf4a","sha256:a6dc3929a648657efc0b613e7efe6d393dfc3df357e871a123ff76344cc24be1"],"state_sha256":"5a1ba43b176fb05fde0eaf29200a2de64485eb61420301383dc1a440c39454c6"}