{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:C3NIVOMR7W7PR5QPVAVHJP7XWT","short_pith_number":"pith:C3NIVOMR","canonical_record":{"source":{"id":"1011.2571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T06:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"1990eaaad9706157881cadd9299f95a8dc1ed41f7077ff7d83300a1894279db7","abstract_canon_sha256":"18f09d854aafd983e6e25f644e18a357de8ed00ea6ff67eafda42434ebb48a62"},"schema_version":"1.0"},"canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","source":{"kind":"arxiv","id":"1011.2571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2571","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2571v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2571","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3NIVOMR7W7P","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C3NIVOMR7W7PR5QP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C3NIVOMR","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:C3NIVOMR7W7PR5QPVAVHJP7XWT","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T06:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"1990eaaad9706157881cadd9299f95a8dc1ed41f7077ff7d83300a1894279db7","abstract_canon_sha256":"18f09d854aafd983e6e25f644e18a357de8ed00ea6ff67eafda42434ebb48a62"},"schema_version":"1.0"},"canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.032632Z","signature_b64":"NpuO3+q3qLq8eVIykulczjqSQKTpWEklEPRNyctLXDp1Fhrcb06Pjwo5/1i2J9UuI9QKR9shLR4sqf5OhG2RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","last_reissued_at":"2026-05-18T02:23:37.031960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.031960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2571","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLyPY6FfQlaMj02/QFKwtzD2hYR37aynAgohKi2+7p0Rf3kTPKEbso8SZaNQn31eot/1ND/O/9pji9SPaimqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:19.731341Z"},"content_sha256":"e7f0ea1f31c0d149ab593567ebe01eeeb932d6b66a6ae1db9ffb60128c66c494","schema_version":"1.0","event_id":"sha256:e7f0ea1f31c0d149ab593567ebe01eeeb932d6b66a6ae1db9ffb60128c66c494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:C3NIVOMR7W7PR5QPVAVHJP7XWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Sketching For Frequency Moments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Vladimir Braverman","submitted_at":"2010-11-11T06:07:18Z","abstract_excerpt":"In a ground-breaking paper, Indyk and Woodruff (STOC 05) showed how to compute $F_k$ (for $k>2$) in space complexity $O(\\mbox{\\em poly-log}(n,m)\\cdot n^{1-\\frac2k})$, which is optimal up to (large) poly-logarithmic factors in $n$ and $m$, where $m$ is the length of the stream and $n$ is the upper bound on the number of distinct elements in a stream. The best known lower bound for large moments is $\\Omega(\\log(n)n^{1-\\frac2k})$. A follow-up work of Bhuvanagiri, Ganguly, Kesh and Saha (SODA 2006) reduced the poly-logarithmic factors of Indyk and Woodruff to $O(\\log^2(m)\\cdot (\\log n+ \\log m)\\cdo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2571","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/5pPmq5cCnrKAurqNzChuQrdQFCJ4c+oDBD998/zRDtQcnABzjQ5KHoEZP6N15HdDJGb0eGYrc1NiQGKNJlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:19.731741Z"},"content_sha256":"a8a0414f4f97f2c739f4ef005d56f99ae81ea57032d5f5c4aa34614c27ba83cc","schema_version":"1.0","event_id":"sha256:a8a0414f4f97f2c739f4ef005d56f99ae81ea57032d5f5c4aa34614c27ba83cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/bundle.json","state_url":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/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-25T15:08:19Z","links":{"resolver":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT","bundle":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/bundle.json","state":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:C3NIVOMR7W7PR5QPVAVHJP7XWT","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":"18f09d854aafd983e6e25f644e18a357de8ed00ea6ff67eafda42434ebb48a62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T06:07:18Z","title_canon_sha256":"1990eaaad9706157881cadd9299f95a8dc1ed41f7077ff7d83300a1894279db7"},"schema_version":"1.0","source":{"id":"1011.2571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2571","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2571v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2571","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3NIVOMR7W7P","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C3NIVOMR7W7PR5QP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C3NIVOMR","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:a8a0414f4f97f2c739f4ef005d56f99ae81ea57032d5f5c4aa34614c27ba83cc","target":"graph","created_at":"2026-05-18T02:23:37Z","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 a ground-breaking paper, Indyk and Woodruff (STOC 05) showed how to compute $F_k$ (for $k>2$) in space complexity $O(\\mbox{\\em poly-log}(n,m)\\cdot n^{1-\\frac2k})$, which is optimal up to (large) poly-logarithmic factors in $n$ and $m$, where $m$ is the length of the stream and $n$ is the upper bound on the number of distinct elements in a stream. The best known lower bound for large moments is $\\Omega(\\log(n)n^{1-\\frac2k})$. A follow-up work of Bhuvanagiri, Ganguly, Kesh and Saha (SODA 2006) reduced the poly-logarithmic factors of Indyk and Woodruff to $O(\\log^2(m)\\cdot (\\log n+ \\log m)\\cdo","authors_text":"Rafail Ostrovsky, Vladimir Braverman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T06:07:18Z","title":"Recursive Sketching For Frequency Moments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2571","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:e7f0ea1f31c0d149ab593567ebe01eeeb932d6b66a6ae1db9ffb60128c66c494","target":"record","created_at":"2026-05-18T02:23:37Z","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":"18f09d854aafd983e6e25f644e18a357de8ed00ea6ff67eafda42434ebb48a62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-11T06:07:18Z","title_canon_sha256":"1990eaaad9706157881cadd9299f95a8dc1ed41f7077ff7d83300a1894279db7"},"schema_version":"1.0","source":{"id":"1011.2571","kind":"arxiv","version":1}},"canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","first_computed_at":"2026-05-18T02:23:37.031960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.031960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NpuO3+q3qLq8eVIykulczjqSQKTpWEklEPRNyctLXDp1Fhrcb06Pjwo5/1i2J9UuI9QKR9shLR4sqf5OhG2RCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.032632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7f0ea1f31c0d149ab593567ebe01eeeb932d6b66a6ae1db9ffb60128c66c494","sha256:a8a0414f4f97f2c739f4ef005d56f99ae81ea57032d5f5c4aa34614c27ba83cc"],"state_sha256":"fad8f6ee2366c03513d943b78ffd997735235ce70476673264fb128d9f8270ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W47HFLXFzpK2mblw9XFU5dsL1SFNcjdj6DDKX4rDFwXLshSjtP4PPH2Lpcns1HhMgwRwNG7Dvxyjo7+AeBV+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:08:19.734109Z","bundle_sha256":"720ba0857ce8e96de34ed2b5b1e894ca3e1e001eb6fb3d0c1a711056636e871a"}}