{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:C3NIVOMR7W7PR5QPVAVHJP7XWT","short_pith_number":"pith:C3NIVOMR","schema_version":"1.0","canonical_sha256":"16da8ab991fdbef8f60fa82a74bff7b4f10803f5d953e6e8239115ab12109bfb","source":{"kind":"arxiv","id":"1011.2571","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.2571","created_at":"2026-05-18T02:23:37.032060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2571v1","created_at":"2026-05-18T02:23:37.032060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2571","created_at":"2026-05-18T02:23:37.032060+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3NIVOMR7W7P","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3NIVOMR7W7PR5QP","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3NIVOMR","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05816","citing_title":"Towards Optimal Moment Estimation in Streaming and Distributed Models","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT","json":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT.json","graph_json":"https://pith.science/api/pith-number/C3NIVOMR7W7PR5QPVAVHJP7XWT/graph.json","events_json":"https://pith.science/api/pith-number/C3NIVOMR7W7PR5QPVAVHJP7XWT/events.json","paper":"https://pith.science/paper/C3NIVOMR"},"agent_actions":{"view_html":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT","download_json":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT.json","view_paper":"https://pith.science/paper/C3NIVOMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2571&json=true","fetch_graph":"https://pith.science/api/pith-number/C3NIVOMR7W7PR5QPVAVHJP7XWT/graph.json","fetch_events":"https://pith.science/api/pith-number/C3NIVOMR7W7PR5QPVAVHJP7XWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/action/storage_attestation","attest_author":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/action/author_attestation","sign_citation":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/action/citation_signature","submit_replication":"https://pith.science/pith/C3NIVOMR7W7PR5QPVAVHJP7XWT/action/replication_record"}},"created_at":"2026-05-18T02:23:37.032060+00:00","updated_at":"2026-05-18T02:23:37.032060+00:00"}