{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EJVTQ6J2UJKDD4GZNFJNR3DK7Q","short_pith_number":"pith:EJVTQ6J2","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"},"canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","source":{"kind":"arxiv","id":"1611.00029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00029","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00029v1","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00029","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"EJVTQ6J2UJKD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJVTQ6J2UJKDD4GZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJVTQ6J2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EJVTQ6J2UJKDD4GZNFJNR3DK7Q","target":"record","payload":{"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"},"canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","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"},"source_kind":"arxiv","source_id":"1611.00029","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVBDUY92xJq338amvoh4MlgvgZIW/y/wY/iM4aR183DsfhzooUlBbAl+pQ/w2/8dwlKcEoh+ivJ1Ve2jv3zgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:45:53.882539Z"},"content_sha256":"ce77d79331e89dded11e776f967095f119885041ac10bd0b5401d8d492ffd904","schema_version":"1.0","event_id":"sha256:ce77d79331e89dded11e776f967095f119885041ac10bd0b5401d8d492ffd904"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EJVTQ6J2UJKDD4GZNFJNR3DK7Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4C1l71txZrV5QgqGa74GbQWGYKUnulp59u6qOPTlUInGFUx3sFS5CHoB1cNEv8X8ZXNk4o1uJOjYSgeZ1BYOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:45:53.882883Z"},"content_sha256":"3a89080905b921245fe377b7c91ea778742bf3e1fa52998a592a6ea576befd40","schema_version":"1.0","event_id":"sha256:3a89080905b921245fe377b7c91ea778742bf3e1fa52998a592a6ea576befd40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/bundle.json","state_url":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T23:45:53Z","links":{"resolver":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q","bundle":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/bundle.json","state":"https://pith.science/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJVTQ6J2UJKDD4GZNFJNR3DK7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EJVTQ6J2UJKDD4GZNFJNR3DK7Q","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":"e857a7e7696182263adcb18472be1f53cb2572ca79d888adc8bd40fc24cd1051","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T20:20:21Z","title_canon_sha256":"6b3cef911441c31f7d8e32a6e9f16f6b559503369f597fec04e69246cc04b8ad"},"schema_version":"1.0","source":{"id":"1611.00029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00029","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00029v1","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00029","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"EJVTQ6J2UJKD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJVTQ6J2UJKDD4GZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJVTQ6J2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3a89080905b921245fe377b7c91ea778742bf3e1fa52998a592a6ea576befd40","target":"graph","created_at":"2026-05-18T01:00:41Z","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 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","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Philipp Woelfel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T20:20:21Z","title":"A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00029","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:ce77d79331e89dded11e776f967095f119885041ac10bd0b5401d8d492ffd904","target":"record","created_at":"2026-05-18T01:00:41Z","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":"e857a7e7696182263adcb18472be1f53cb2572ca79d888adc8bd40fc24cd1051","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T20:20:21Z","title_canon_sha256":"6b3cef911441c31f7d8e32a6e9f16f6b559503369f597fec04e69246cc04b8ad"},"schema_version":"1.0","source":{"id":"1611.00029","kind":"arxiv","version":1}},"canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226b38793aa25431f0d96952d8ec6afc37a83cb6784f3dc91e0494d65a0feabc","first_computed_at":"2026-05-18T01:00:41.551187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:41.551187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7k9LQ6+J0H1v2Rp+UH17EiUgNuQatPFwVw91slBffUmRgHvVPJTdjuZMhOyfstlu2ZG33gE5ESVsjME3NjUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:41.551810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce77d79331e89dded11e776f967095f119885041ac10bd0b5401d8d492ffd904","sha256:3a89080905b921245fe377b7c91ea778742bf3e1fa52998a592a6ea576befd40"],"state_sha256":"bf9814ee2df3b8ac021d5cc829b537f8473e76e7f62ff527d0b891a0c203d7eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lgxe47GoPW5Q+j1mdK1KqIZt2akLhgR9w01eAp6LQehstvT4vZiojGUtp1f+nxS5zWDjPX3ovPkRdWGzP9OPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:45:53.884850Z","bundle_sha256":"98ac89c924d4836e1129ec8763a74d3a4f312153dd661f073eb87728ce37b56a"}}