{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZH6ACGH6M3D3KQGHAG2SXVS6VA","short_pith_number":"pith:ZH6ACGH6","schema_version":"1.0","canonical_sha256":"c9fc0118fe66c7b540c701b52bd65ea82769fc9e282e739e98baadf69dcba829","source":{"kind":"arxiv","id":"1201.0253","version":1},"attestation_state":"computed","paper":{"title":"A Lower Bound for Estimating High Moments of a Data Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Sumit Ganguly","submitted_at":"2011-12-31T12:56:24Z","abstract_excerpt":"We show an improved lower bound for the Fp estimation problem in a data stream setting for p>2. A data stream is a sequence of items from the domain [n] with possible repetitions. The frequency vector x is an n-dimensional non-negative integer vector x such that x(i) is the number of occurrences of i in the sequence. Given an accuracy parameter Omega(n^{-1/p}) < \\epsilon < 1, the problem of estimating Fp is to estimate \\norm{x}_p^p = \\sum_{i \\in [n]} \\abs{x(i)}^p correctly to within a relative accuracy of 1\\pm \\epsilon with high constant probability in an online fashion and using as little spa"},"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":"1201.0253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-31T12:56:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a5bb1dc24af88ec0571c00f24bf791499806b9b0b67655000000dbba063c7e4b","abstract_canon_sha256":"9100265084011e007c4bb31b15e3952c8414e920060974f968cdfcca512ee138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:26.836749Z","signature_b64":"POi98Cod/5X0oWDn+TWqZ01Fd1y9wGv2s3FBIiP3om1Ysiqzzvj/qxDgKc2AqZDP+h3nFa9enuEbr/PGPJOTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9fc0118fe66c7b540c701b52bd65ea82769fc9e282e739e98baadf69dcba829","last_reissued_at":"2026-05-18T02:21:26.835996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:26.835996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound for Estimating High Moments of a Data Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Sumit Ganguly","submitted_at":"2011-12-31T12:56:24Z","abstract_excerpt":"We show an improved lower bound for the Fp estimation problem in a data stream setting for p>2. A data stream is a sequence of items from the domain [n] with possible repetitions. The frequency vector x is an n-dimensional non-negative integer vector x such that x(i) is the number of occurrences of i in the sequence. Given an accuracy parameter Omega(n^{-1/p}) < \\epsilon < 1, the problem of estimating Fp is to estimate \\norm{x}_p^p = \\sum_{i \\in [n]} \\abs{x(i)}^p correctly to within a relative accuracy of 1\\pm \\epsilon with high constant probability in an online fashion and using as little spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0253","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":"1201.0253","created_at":"2026-05-18T02:21:26.836121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0253v1","created_at":"2026-05-18T02:21:26.836121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0253","created_at":"2026-05-18T02:21:26.836121+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZH6ACGH6M3D3","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZH6ACGH6M3D3KQGH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZH6ACGH6","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07599","citing_title":"Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA","json":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA.json","graph_json":"https://pith.science/api/pith-number/ZH6ACGH6M3D3KQGHAG2SXVS6VA/graph.json","events_json":"https://pith.science/api/pith-number/ZH6ACGH6M3D3KQGHAG2SXVS6VA/events.json","paper":"https://pith.science/paper/ZH6ACGH6"},"agent_actions":{"view_html":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA","download_json":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA.json","view_paper":"https://pith.science/paper/ZH6ACGH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0253&json=true","fetch_graph":"https://pith.science/api/pith-number/ZH6ACGH6M3D3KQGHAG2SXVS6VA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZH6ACGH6M3D3KQGHAG2SXVS6VA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA/action/storage_attestation","attest_author":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA/action/author_attestation","sign_citation":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA/action/citation_signature","submit_replication":"https://pith.science/pith/ZH6ACGH6M3D3KQGHAG2SXVS6VA/action/replication_record"}},"created_at":"2026-05-18T02:21:26.836121+00:00","updated_at":"2026-05-18T02:21:26.836121+00:00"}