{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EJVTQ6J2UJKDD4GZNFJNR3DK7Q","short_pith_number":"pith:EJVTQ6J2","schema_version":"1.0","canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","source":{"kind":"arxiv","id":"1611.00029","version":1},"attestation_state":"computed","paper":{"title":"A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Philipp Woelfel","submitted_at":"2016-10-31T20:20:21Z","abstract_excerpt":"We study randomness properties of graphs and hypergraphs generated by simple hash functions. Several hashing applications can be analyzed by studying the structure of $d$-uniform random ($d$-partite) hypergraphs obtained from a set $S$ of $n$ keys and $d$ randomly chosen hash functions $h_1,\\dots,h_d$ by associating each key $x\\in S$ with a hyperedge $\\{h_1(x),\\dots, h_d(x)\\}$. Often it is assumed that $h_1,\\dots,h_d$ exhibit a high degree of independence. We present a simple construction of a hash class whose hash functions have small constant evaluation time and can be stored in sublinear sp"},"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":"1611.00029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T20:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"6b3cef911441c31f7d8e32a6e9f16f6b559503369f597fec04e69246cc04b8ad","abstract_canon_sha256":"e857a7e7696182263adcb18472be1f53cb2572ca79d888adc8bd40fc24cd1051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:41.551810Z","signature_b64":"Z7k9LQ6+J0H1v2Rp+UH17EiUgNuQatPFwVw91slBffUmRgHvVPJTdjuZMhOyfstlu2ZG33gE5ESVsjME3NjUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","last_reissued_at":"2026-05-18T01:00:41.551187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:41.551187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Philipp Woelfel","submitted_at":"2016-10-31T20:20:21Z","abstract_excerpt":"We study randomness properties of graphs and hypergraphs generated by simple hash functions. Several hashing applications can be analyzed by studying the structure of $d$-uniform random ($d$-partite) hypergraphs obtained from a set $S$ of $n$ keys and $d$ randomly chosen hash functions $h_1,\\dots,h_d$ by associating each key $x\\in S$ with a hyperedge $\\{h_1(x),\\dots, h_d(x)\\}$. Often it is assumed that $h_1,\\dots,h_d$ exhibit a high degree of independence. We present a simple construction of a hash class whose hash functions have small constant evaluation time and can be stored in sublinear sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00029","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":"1611.00029","created_at":"2026-05-18T01:00:41.551269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00029v1","created_at":"2026-05-18T01:00:41.551269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00029","created_at":"2026-05-18T01:00:41.551269+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJVTQ6J2UJKD","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJVTQ6J2UJKDD4GZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJVTQ6J2","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/EJVTQ6J2UJKDD4GZNFJNR3DK7Q","json":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q.json","graph_json":"https://pith.science/api/pith-number/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/graph.json","events_json":"https://pith.science/api/pith-number/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/events.json","paper":"https://pith.science/paper/EJVTQ6J2"},"agent_actions":{"view_html":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q","download_json":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q.json","view_paper":"https://pith.science/paper/EJVTQ6J2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00029&json=true","fetch_graph":"https://pith.science/api/pith-number/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/action/storage_attestation","attest_author":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/action/author_attestation","sign_citation":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/action/citation_signature","submit_replication":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/action/replication_record"}},"created_at":"2026-05-18T01:00:41.551269+00:00","updated_at":"2026-05-18T01:00:41.551269+00:00"}