{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3HBFD3GX6PZGVP3LC2QZ2BHZNO","short_pith_number":"pith:3HBFD3GX","schema_version":"1.0","canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","source":{"kind":"arxiv","id":"1809.09063","version":1},"attestation_state":"computed","paper":{"title":"Optimality of Linear Sketching under Modular Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Grigory Yaroslavtsev, Kaave Hosseini, Shachar Lovett","submitted_at":"2018-09-24T17:12:11Z","abstract_excerpt":"We study the relation between streaming algorithms and linear sketching algorithms, in the context of binary updates. We show that for inputs in $n$ dimensions, the existence of efficient streaming algorithms which can process $\\Omega(n^2)$ updates implies efficient linear sketching algorithms with comparable cost. This improves upon the previous work of Li, Nguyen and Woodruff [LNW14] and Ai, Hu, Li and Woodruff [AHLW16] which required a triple-exponential number of updates to achieve a similar result for updates over integers. We extend our results to updates modulo $p$ for integers $p \\ge 2"},"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":"1809.09063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T17:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"f2e23b27b0e77fc5621a8ebabf08dc0bf9a9cef7825f7362205e781eb1b151b0","abstract_canon_sha256":"9b8ef1bcb6bd6759eeeac56270fe7e0d60d63bda9c481668f3dfdc41c4ff3d28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:01.211716Z","signature_b64":"Qef2OV/YXVSN90sqRRdc1qrfomAsKeGxvaEQdBuQ//7R8AYw8+gHXiUh2Jl+gD5N0BzuWNoSWAarktEKFB6gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","last_reissued_at":"2026-05-18T00:05:01.211091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:01.211091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of Linear Sketching under Modular Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Grigory Yaroslavtsev, Kaave Hosseini, Shachar Lovett","submitted_at":"2018-09-24T17:12:11Z","abstract_excerpt":"We study the relation between streaming algorithms and linear sketching algorithms, in the context of binary updates. We show that for inputs in $n$ dimensions, the existence of efficient streaming algorithms which can process $\\Omega(n^2)$ updates implies efficient linear sketching algorithms with comparable cost. This improves upon the previous work of Li, Nguyen and Woodruff [LNW14] and Ai, Hu, Li and Woodruff [AHLW16] which required a triple-exponential number of updates to achieve a similar result for updates over integers. We extend our results to updates modulo $p$ for integers $p \\ge 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09063","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":"1809.09063","created_at":"2026-05-18T00:05:01.211202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09063v1","created_at":"2026-05-18T00:05:01.211202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09063","created_at":"2026-05-18T00:05:01.211202+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HBFD3GX6PZG","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HBFD3GX6PZGVP3L","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HBFD3GX","created_at":"2026-05-18T12:32:02.567920+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/3HBFD3GX6PZGVP3LC2QZ2BHZNO","json":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO.json","graph_json":"https://pith.science/api/pith-number/3HBFD3GX6PZGVP3LC2QZ2BHZNO/graph.json","events_json":"https://pith.science/api/pith-number/3HBFD3GX6PZGVP3LC2QZ2BHZNO/events.json","paper":"https://pith.science/paper/3HBFD3GX"},"agent_actions":{"view_html":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO","download_json":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO.json","view_paper":"https://pith.science/paper/3HBFD3GX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09063&json=true","fetch_graph":"https://pith.science/api/pith-number/3HBFD3GX6PZGVP3LC2QZ2BHZNO/graph.json","fetch_events":"https://pith.science/api/pith-number/3HBFD3GX6PZGVP3LC2QZ2BHZNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/action/storage_attestation","attest_author":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/action/author_attestation","sign_citation":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/action/citation_signature","submit_replication":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/action/replication_record"}},"created_at":"2026-05-18T00:05:01.211202+00:00","updated_at":"2026-05-18T00:05:01.211202+00:00"}