{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KHDQDBJPZKGFM46MTLN5C5BZ7I","short_pith_number":"pith:KHDQDBJP","schema_version":"1.0","canonical_sha256":"51c701852fca8c5673cc9adbd17439fa21ee78c7582d0902c8e85cbd424db79e","source":{"kind":"arxiv","id":"1704.06710","version":3},"attestation_state":"computed","paper":{"title":"Continuous monitoring of $\\ell_p$ norms in data streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaros{\\l}aw B{\\l}asiok, Jelani Nelson, Jian Ding","submitted_at":"2017-04-21T20:41:43Z","abstract_excerpt":"In insertion-only streaming, one sees a sequence of indices $a_1, a_2, \\ldots, a_m\\in [n]$. The stream defines a sequence of $m$ frequency vectors $x^{(1)},\\ldots,x^{(m)}\\in\\mathbb{R}^n$ with $(x^{(t)})_i = |\\{j : j\\in[t], a_j = i\\}|$. That is, $x^{(t)}$ is the frequency vector after seeing the first $t$ items in the stream. Much work in the streaming literature focuses on estimating some function $f(x^{(m)})$. Many applications though require obtaining estimates at time $t$ of $f(x^{(t)})$, for every $t\\in[m]$. Naively this guarantee is obtained by devising an algorithm with failure probabili"},"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":"1704.06710","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T20:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"86cfb37bed008fda5cc80abaa0151a99f9d7b26c1ea9f1fe9f34cd7f631b6a99","abstract_canon_sha256":"6279b8caf7fb5add675c3ddae1acdf42bf3cebc8c5c55d8009d3d2837689c921"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:59.957164Z","signature_b64":"sBVDi1XjKIPZwCvPJ3+usQlTxlUV9z7/alyHQgh+49P84nz+eP0YM9gL3htqoxVH0pfIb20y6IcmA3woLCLZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c701852fca8c5673cc9adbd17439fa21ee78c7582d0902c8e85cbd424db79e","last_reissued_at":"2026-05-18T00:30:59.956465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:59.956465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous monitoring of $\\ell_p$ norms in data streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaros{\\l}aw B{\\l}asiok, Jelani Nelson, Jian Ding","submitted_at":"2017-04-21T20:41:43Z","abstract_excerpt":"In insertion-only streaming, one sees a sequence of indices $a_1, a_2, \\ldots, a_m\\in [n]$. The stream defines a sequence of $m$ frequency vectors $x^{(1)},\\ldots,x^{(m)}\\in\\mathbb{R}^n$ with $(x^{(t)})_i = |\\{j : j\\in[t], a_j = i\\}|$. That is, $x^{(t)}$ is the frequency vector after seeing the first $t$ items in the stream. Much work in the streaming literature focuses on estimating some function $f(x^{(m)})$. Many applications though require obtaining estimates at time $t$ of $f(x^{(t)})$, for every $t\\in[m]$. Naively this guarantee is obtained by devising an algorithm with failure probabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06710","kind":"arxiv","version":3},"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":"1704.06710","created_at":"2026-05-18T00:30:59.956574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06710v3","created_at":"2026-05-18T00:30:59.956574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06710","created_at":"2026-05-18T00:30:59.956574+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHDQDBJPZKGF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHDQDBJPZKGFM46M","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHDQDBJP","created_at":"2026-05-18T12:31:24.725408+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":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I","json":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I.json","graph_json":"https://pith.science/api/pith-number/KHDQDBJPZKGFM46MTLN5C5BZ7I/graph.json","events_json":"https://pith.science/api/pith-number/KHDQDBJPZKGFM46MTLN5C5BZ7I/events.json","paper":"https://pith.science/paper/KHDQDBJP"},"agent_actions":{"view_html":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I","download_json":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I.json","view_paper":"https://pith.science/paper/KHDQDBJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06710&json=true","fetch_graph":"https://pith.science/api/pith-number/KHDQDBJPZKGFM46MTLN5C5BZ7I/graph.json","fetch_events":"https://pith.science/api/pith-number/KHDQDBJPZKGFM46MTLN5C5BZ7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I/action/storage_attestation","attest_author":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I/action/author_attestation","sign_citation":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I/action/citation_signature","submit_replication":"https://pith.science/pith/KHDQDBJPZKGFM46MTLN5C5BZ7I/action/replication_record"}},"created_at":"2026-05-18T00:30:59.956574+00:00","updated_at":"2026-05-18T00:30:59.956574+00:00"}