{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N3GOQMVWZOKJMZGJG22IILKVUR","short_pith_number":"pith:N3GOQMVW","schema_version":"1.0","canonical_sha256":"6ecce832b6cb949664c936b4842d55a44d4f28e22c6b3c6267c24cb511225074","source":{"kind":"arxiv","id":"1907.05816","version":1},"attestation_state":"computed","paper":{"title":"Towards Optimal Moment Estimation in Streaming and Distributed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram","submitted_at":"2019-07-12T16:10:46Z","abstract_excerpt":"One of the oldest problems in the data stream model is to approximate the $p$-th moment $\\|\\mathcal{X}\\|_p^p = \\sum_{i=1}^n |\\mathcal{X}_i|^p$ of an underlying vector $\\mathcal{X} \\in \\mathbb{R}^n$, which is presented as a sequence of poly$(n)$ updates to its coordinates. Of particular interest is when $p \\in (0,2]$. Although a tight space bound of $\\Theta(\\epsilon^{-2} \\log n)$ bits is known for this problem when both positive and negative updates are allowed, surprisingly there is still a gap in the space complexity when all updates are positive. Specifically, the upper bound is $O(\\epsilon^"},"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":"1907.05816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T16:10:46Z","cross_cats_sorted":[],"title_canon_sha256":"fb57d498e5e0f5a4a6a94c5805a12425c4a93406e55530a92e5fb058a5836d40","abstract_canon_sha256":"aa55a8f13821cdb476ac8080a304c6b9843ec4a420b2ae02d3d62d26937b1a80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:44.330624Z","signature_b64":"ndSKg0YdwGxNN9/uNyskWOlWwbVfCdNfptQq0jFqLddVvNvL3Pp0e0WGKTu4g4g0ujN6rrj2vkek9tUe+UYkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecce832b6cb949664c936b4842d55a44d4f28e22c6b3c6267c24cb511225074","last_reissued_at":"2026-05-17T23:40:44.329936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:44.329936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Moment Estimation in Streaming and Distributed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram","submitted_at":"2019-07-12T16:10:46Z","abstract_excerpt":"One of the oldest problems in the data stream model is to approximate the $p$-th moment $\\|\\mathcal{X}\\|_p^p = \\sum_{i=1}^n |\\mathcal{X}_i|^p$ of an underlying vector $\\mathcal{X} \\in \\mathbb{R}^n$, which is presented as a sequence of poly$(n)$ updates to its coordinates. Of particular interest is when $p \\in (0,2]$. Although a tight space bound of $\\Theta(\\epsilon^{-2} \\log n)$ bits is known for this problem when both positive and negative updates are allowed, surprisingly there is still a gap in the space complexity when all updates are positive. Specifically, the upper bound is $O(\\epsilon^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05816","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":"1907.05816","created_at":"2026-05-17T23:40:44.330037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05816v1","created_at":"2026-05-17T23:40:44.330037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05816","created_at":"2026-05-17T23:40:44.330037+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3GOQMVWZOKJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3GOQMVWZOKJMZGJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3GOQMVW","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR","json":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR.json","graph_json":"https://pith.science/api/pith-number/N3GOQMVWZOKJMZGJG22IILKVUR/graph.json","events_json":"https://pith.science/api/pith-number/N3GOQMVWZOKJMZGJG22IILKVUR/events.json","paper":"https://pith.science/paper/N3GOQMVW"},"agent_actions":{"view_html":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR","download_json":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR.json","view_paper":"https://pith.science/paper/N3GOQMVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05816&json=true","fetch_graph":"https://pith.science/api/pith-number/N3GOQMVWZOKJMZGJG22IILKVUR/graph.json","fetch_events":"https://pith.science/api/pith-number/N3GOQMVWZOKJMZGJG22IILKVUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR/action/storage_attestation","attest_author":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR/action/author_attestation","sign_citation":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR/action/citation_signature","submit_replication":"https://pith.science/pith/N3GOQMVWZOKJMZGJG22IILKVUR/action/replication_record"}},"created_at":"2026-05-17T23:40:44.330037+00:00","updated_at":"2026-05-17T23:40:44.330037+00:00"}