{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5ORUJSF4ZMSHSHXYTCLH2CM6S4","short_pith_number":"pith:5ORUJSF4","canonical_record":{"source":{"id":"1411.7191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T11:36:15Z","cross_cats_sorted":[],"title_canon_sha256":"7f71698fa1ea4d1cef1358b29f177a90a8f937c02dd89f7790a42fcaee274a7d","abstract_canon_sha256":"cc72e2ee251540299d45b73b2c57aa745f8715369c350615bd83611788235e4c"},"schema_version":"1.0"},"canonical_sha256":"eba344c8bccb24791ef898967d099e971aa4ae2631ca63741c206bdd47b4f5ea","source":{"kind":"arxiv","id":"1411.7191","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7191","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7191v3","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7191","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"5ORUJSF4ZMSH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5ORUJSF4ZMSHSHXY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5ORUJSF4","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5ORUJSF4ZMSHSHXYTCLH2CM6S4","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T11:36:15Z","cross_cats_sorted":[],"title_canon_sha256":"7f71698fa1ea4d1cef1358b29f177a90a8f937c02dd89f7790a42fcaee274a7d","abstract_canon_sha256":"cc72e2ee251540299d45b73b2c57aa745f8715369c350615bd83611788235e4c"},"schema_version":"1.0"},"canonical_sha256":"eba344c8bccb24791ef898967d099e971aa4ae2631ca63741c206bdd47b4f5ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.622359Z","signature_b64":"32KQbtZO+8LCH9JoGgHpa0rMFjV3D3gQOKcZFusOVBYiLr9Qr7XnOweTfGOW9JS2XaLUeWhWeIfYm/L589nkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba344c8bccb24791ef898967d099e971aa4ae2631ca63741c206bdd47b4f5ea","last_reissued_at":"2026-05-18T01:20:50.621755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.621755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7191","source_version":3,"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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlXKlcvXIF3nSWhhQPDmXeK/lm8crJ04iBah2aoPSAybYMGs4SKbGnoJMbLQHVKEiI+INvkOiYVGt2MiwJjRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:43.699436Z"},"content_sha256":"d6c3f4e7b8a3150ed6d48b397146fca0d52c0b77f19ea11a0d87fb8cc1b80130","schema_version":"1.0","event_id":"sha256:d6c3f4e7b8a3150ed6d48b397146fca0d52c0b77f19ea11a0d87fb8cc1b80130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5ORUJSF4ZMSHSHXYTCLH2CM6S4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hashing for statistics over k-partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eva Rotenberg, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup, S{\\o}ren Dahlgaard","submitted_at":"2014-11-26T11:36:15Z","abstract_excerpt":"In this paper we analyze a hash function for $k$-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin.\n  This generic method was originally introduced by Flajolet and Martin~[FOCS'83] in order to save a factor $\\Omega(k)$ of time per element over $k$ independent samples when estimating the number of distinct elements in a data stream. It was also used in the widely used HyperLogLog algorithm of Flajolet et al.~[AOFA'97] and in large-scale machine learning by Li et al.~[NIPS'12] for minwise estimation of set similarity.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7191","kind":"arxiv","version":3},"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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jv9LOq11/WYcDJMfxqv7eknIkExX6XKz6UT0/VDwPFTV9+sSfFZBbyBD3pz/Kz/EMaTAnnTO+WKue79KeKOHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:43.699784Z"},"content_sha256":"f71a559beeaecfb7258f8ec3d3f0376e4a5bd27b52620a8d319c0a6ce7c26d66","schema_version":"1.0","event_id":"sha256:f71a559beeaecfb7258f8ec3d3f0376e4a5bd27b52620a8d319c0a6ce7c26d66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/bundle.json","state_url":"https://pith.science/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/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-05-30T08:33:43Z","links":{"resolver":"https://pith.science/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4","bundle":"https://pith.science/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/bundle.json","state":"https://pith.science/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ORUJSF4ZMSHSHXYTCLH2CM6S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5ORUJSF4ZMSHSHXYTCLH2CM6S4","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":"cc72e2ee251540299d45b73b2c57aa745f8715369c350615bd83611788235e4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T11:36:15Z","title_canon_sha256":"7f71698fa1ea4d1cef1358b29f177a90a8f937c02dd89f7790a42fcaee274a7d"},"schema_version":"1.0","source":{"id":"1411.7191","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7191","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7191v3","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7191","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"5ORUJSF4ZMSH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5ORUJSF4ZMSHSHXY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5ORUJSF4","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:f71a559beeaecfb7258f8ec3d3f0376e4a5bd27b52620a8d319c0a6ce7c26d66","target":"graph","created_at":"2026-05-18T01:20:50Z","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":"In this paper we analyze a hash function for $k$-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin.\n  This generic method was originally introduced by Flajolet and Martin~[FOCS'83] in order to save a factor $\\Omega(k)$ of time per element over $k$ independent samples when estimating the number of distinct elements in a data stream. It was also used in the widely used HyperLogLog algorithm of Flajolet et al.~[AOFA'97] and in large-scale machine learning by Li et al.~[NIPS'12] for minwise estimation of set similarity.\n ","authors_text":"Eva Rotenberg, Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup, S{\\o}ren Dahlgaard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T11:36:15Z","title":"Hashing for statistics over k-partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7191","kind":"arxiv","version":3},"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:d6c3f4e7b8a3150ed6d48b397146fca0d52c0b77f19ea11a0d87fb8cc1b80130","target":"record","created_at":"2026-05-18T01:20:50Z","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":"cc72e2ee251540299d45b73b2c57aa745f8715369c350615bd83611788235e4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T11:36:15Z","title_canon_sha256":"7f71698fa1ea4d1cef1358b29f177a90a8f937c02dd89f7790a42fcaee274a7d"},"schema_version":"1.0","source":{"id":"1411.7191","kind":"arxiv","version":3}},"canonical_sha256":"eba344c8bccb24791ef898967d099e971aa4ae2631ca63741c206bdd47b4f5ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eba344c8bccb24791ef898967d099e971aa4ae2631ca63741c206bdd47b4f5ea","first_computed_at":"2026-05-18T01:20:50.621755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.621755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"32KQbtZO+8LCH9JoGgHpa0rMFjV3D3gQOKcZFusOVBYiLr9Qr7XnOweTfGOW9JS2XaLUeWhWeIfYm/L589nkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.622359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7191","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6c3f4e7b8a3150ed6d48b397146fca0d52c0b77f19ea11a0d87fb8cc1b80130","sha256:f71a559beeaecfb7258f8ec3d3f0376e4a5bd27b52620a8d319c0a6ce7c26d66"],"state_sha256":"6012e7f44e264f02f2e9f4f60afafd27ae39c3649aab67cc69c718d2868a3a43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HonCn3+7tvf6WUcQTdo7F6FLBAnnI4qNn9d444y47etFjTdotGgDXqGBiUL2/5cc65nC9XXKJ7p2/0k7HxCXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:33:43.701758Z","bundle_sha256":"ef28dda28e6d5126719f2b779625964852a82e2845905fa89fd46607c4dac90f"}}