{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XET3RJIKMH2XW7CZ2G2UTXWZ6H","short_pith_number":"pith:XET3RJIK","canonical_record":{"source":{"id":"1705.07001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"33550b5ea02b46d8d9042ce5a7559e524e374108ab113a16d22ba9393d16c18c","abstract_canon_sha256":"1da202934d1115e2f88ec32890af407343db25f1ebb157b67c2342f3c5724642"},"schema_version":"1.0"},"canonical_sha256":"b927b8a50a61f57b7c59d1b549ded9f1e1908debf6b255f3450fae81c09c19c7","source":{"kind":"arxiv","id":"1705.07001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07001","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07001v2","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07001","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"XET3RJIKMH2X","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XET3RJIKMH2XW7CZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XET3RJIK","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XET3RJIKMH2XW7CZ2G2UTXWZ6H","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"33550b5ea02b46d8d9042ce5a7559e524e374108ab113a16d22ba9393d16c18c","abstract_canon_sha256":"1da202934d1115e2f88ec32890af407343db25f1ebb157b67c2342f3c5724642"},"schema_version":"1.0"},"canonical_sha256":"b927b8a50a61f57b7c59d1b549ded9f1e1908debf6b255f3450fae81c09c19c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.508401Z","signature_b64":"ljwquxJI8L+mZl36k+viTfN7ThHvnPCKvuqegYs2J4we/EEJySb+DgQqRPMo7hME7qDLeidqK/MuDnz+xq+BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b927b8a50a61f57b7c59d1b549ded9f1e1908debf6b255f3450fae81c09c19c7","last_reissued_at":"2026-05-18T00:44:06.507863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.507863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07001","source_version":2,"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-18T00:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTApWjpX5tlR4XSrrydsLxNmNjVvwSfcIpvFp2Ml61Ikmjh2JmtoFFwkvogy7DYmruUCC0Ih2csqPnWo8jBGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:40.720744Z"},"content_sha256":"b803cf3c2e26b697000bd6e8e0e75ec89c364ec58ca8c044437b3d18f561193f","schema_version":"1.0","event_id":"sha256:b803cf3c2e26b697000bd6e8e0e75ec89c364ec58ca8c044437b3d18f561193f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XET3RJIKMH2XW7CZ2G2UTXWZ6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A High-Performance Algorithm for Identifying Frequent Items in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Anderson, Edo Liberty, Justin Thaler, Kevin Lang, Lee Rhodes, Pryce Bevan","submitted_at":"2017-05-19T14:01:53Z","abstract_excerpt":"Estimating frequencies of items over data streams is a common building block in streaming data measurement and analysis. Misra and Gries introduced their seminal algorithm for the problem in 1982, and the problem has since been revisited many times due its practicality and applicability. We describe a highly optimized version of Misra and Gries' algorithm that is suitable for deployment in industrial settings. Our code is made public via an open source library called DataSketches that is already used by several companies and production systems.\n  Our algorithm improves on two theoretical and p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07001","kind":"arxiv","version":2},"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-18T00:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ywKOF8Sow8XU3x8TfDoaEhc11JPso0evvubwQhWcL5ccrSTjhHO6zXpafRVDOLjlyTU7TFXdz1i6JoFSxsUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:40.721242Z"},"content_sha256":"d4e12dc5431924c3e5f8fe395ecf1cab9904458b6e277793f978d2d037c2ff3c","schema_version":"1.0","event_id":"sha256:d4e12dc5431924c3e5f8fe395ecf1cab9904458b6e277793f978d2d037c2ff3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/bundle.json","state_url":"https://pith.science/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/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-26T08:49:40Z","links":{"resolver":"https://pith.science/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H","bundle":"https://pith.science/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/bundle.json","state":"https://pith.science/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XET3RJIKMH2XW7CZ2G2UTXWZ6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XET3RJIKMH2XW7CZ2G2UTXWZ6H","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":"1da202934d1115e2f88ec32890af407343db25f1ebb157b67c2342f3c5724642","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:01:53Z","title_canon_sha256":"33550b5ea02b46d8d9042ce5a7559e524e374108ab113a16d22ba9393d16c18c"},"schema_version":"1.0","source":{"id":"1705.07001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07001","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07001v2","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07001","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"XET3RJIKMH2X","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XET3RJIKMH2XW7CZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XET3RJIK","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:d4e12dc5431924c3e5f8fe395ecf1cab9904458b6e277793f978d2d037c2ff3c","target":"graph","created_at":"2026-05-18T00:44:06Z","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":"Estimating frequencies of items over data streams is a common building block in streaming data measurement and analysis. Misra and Gries introduced their seminal algorithm for the problem in 1982, and the problem has since been revisited many times due its practicality and applicability. We describe a highly optimized version of Misra and Gries' algorithm that is suitable for deployment in industrial settings. Our code is made public via an open source library called DataSketches that is already used by several companies and production systems.\n  Our algorithm improves on two theoretical and p","authors_text":"Daniel Anderson, Edo Liberty, Justin Thaler, Kevin Lang, Lee Rhodes, Pryce Bevan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:01:53Z","title":"A High-Performance Algorithm for Identifying Frequent Items in Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07001","kind":"arxiv","version":2},"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:b803cf3c2e26b697000bd6e8e0e75ec89c364ec58ca8c044437b3d18f561193f","target":"record","created_at":"2026-05-18T00:44:06Z","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":"1da202934d1115e2f88ec32890af407343db25f1ebb157b67c2342f3c5724642","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:01:53Z","title_canon_sha256":"33550b5ea02b46d8d9042ce5a7559e524e374108ab113a16d22ba9393d16c18c"},"schema_version":"1.0","source":{"id":"1705.07001","kind":"arxiv","version":2}},"canonical_sha256":"b927b8a50a61f57b7c59d1b549ded9f1e1908debf6b255f3450fae81c09c19c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b927b8a50a61f57b7c59d1b549ded9f1e1908debf6b255f3450fae81c09c19c7","first_computed_at":"2026-05-18T00:44:06.507863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:06.507863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ljwquxJI8L+mZl36k+viTfN7ThHvnPCKvuqegYs2J4we/EEJySb+DgQqRPMo7hME7qDLeidqK/MuDnz+xq+BCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:06.508401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b803cf3c2e26b697000bd6e8e0e75ec89c364ec58ca8c044437b3d18f561193f","sha256:d4e12dc5431924c3e5f8fe395ecf1cab9904458b6e277793f978d2d037c2ff3c"],"state_sha256":"c7b94ebbd3144d325dbe161b37beb6538b1438a4a662fa90c1a9bf102292703f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6Ue8ajgtCf3MSHa1gSTQsFqa/LLHZjks+mwZ7bRc8Ter5dmW9R8wUtnk8RMCbD/ZJyf0gCdmePngRtWIaHWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:49:40.723883Z","bundle_sha256":"08ab52a6e0e762b0199120c80de9bd818c37b8270fe3cc3f7396df7bdb2a600d"}}