{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OYSU7AMPPAOJMIBQ5G2EKAX2QW","short_pith_number":"pith:OYSU7AMP","schema_version":"1.0","canonical_sha256":"76254f818f781c962030e9b44502fa859b68fe4d3829200ea0a5df116713f274","source":{"kind":"arxiv","id":"1805.04151","version":1},"attestation_state":"computed","paper":{"title":"Beating Fredman-Koml\\'{o}s for perfect $k$-hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrii Riazanov, Venkatesan Guruswami","submitted_at":"2018-05-10T19:53:55Z","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"},"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":"1805.04151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-10T19:53:55Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.IT"],"title_canon_sha256":"8300878bbd8e98aa6768576ea7d34d777ab6d811161183af659621dd817468da","abstract_canon_sha256":"7554df7fb7968686012b91ef3f321e3b5314cd98a4a17b86d10832eb109491fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:13.477189Z","signature_b64":"J2UkMyNXdDHThYjHrEv7n3Y/czYNKw7FUQ7UUd8vFEWDc12VgKIRGBobaO5N4bD7HEdpbLJHXlR1txAM+mnRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76254f818f781c962030e9b44502fa859b68fe4d3829200ea0a5df116713f274","last_reissued_at":"2026-05-18T00:16:13.476522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:13.476522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating Fredman-Koml\\'{o}s for perfect $k$-hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrii Riazanov, Venkatesan Guruswami","submitted_at":"2018-05-10T19:53:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04151","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":"1805.04151","created_at":"2026-05-18T00:16:13.476640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04151v1","created_at":"2026-05-18T00:16:13.476640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04151","created_at":"2026-05-18T00:16:13.476640+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYSU7AMPPAOJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYSU7AMPPAOJMIBQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYSU7AMP","created_at":"2026-05-18T12:32:43.782077+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/OYSU7AMPPAOJMIBQ5G2EKAX2QW","json":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW.json","graph_json":"https://pith.science/api/pith-number/OYSU7AMPPAOJMIBQ5G2EKAX2QW/graph.json","events_json":"https://pith.science/api/pith-number/OYSU7AMPPAOJMIBQ5G2EKAX2QW/events.json","paper":"https://pith.science/paper/OYSU7AMP"},"agent_actions":{"view_html":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW","download_json":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW.json","view_paper":"https://pith.science/paper/OYSU7AMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04151&json=true","fetch_graph":"https://pith.science/api/pith-number/OYSU7AMPPAOJMIBQ5G2EKAX2QW/graph.json","fetch_events":"https://pith.science/api/pith-number/OYSU7AMPPAOJMIBQ5G2EKAX2QW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW/action/storage_attestation","attest_author":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW/action/author_attestation","sign_citation":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW/action/citation_signature","submit_replication":"https://pith.science/pith/OYSU7AMPPAOJMIBQ5G2EKAX2QW/action/replication_record"}},"created_at":"2026-05-18T00:16:13.476640+00:00","updated_at":"2026-05-18T00:16:13.476640+00:00"}