{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3HBFD3GX6PZGVP3LC2QZ2BHZNO","short_pith_number":"pith:3HBFD3GX","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"},"canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","source":{"kind":"arxiv","id":"1809.09063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09063","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09063v1","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09063","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"3HBFD3GX6PZG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HBFD3GX6PZGVP3L","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HBFD3GX","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3HBFD3GX6PZGVP3LC2QZ2BHZNO","target":"record","payload":{"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"},"canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","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"},"source_kind":"arxiv","source_id":"1809.09063","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FmBjQoZVWHm+3quEL7GF1qjoJsxjAS2BZakZF8zYBLcmHiovSAMrGZdZ9574NJhwuqfgVyUbWS4G+ryToextBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:03.242059Z"},"content_sha256":"cb0aedf46e0be2c07f7ce65b2182382b13caaada96027b53a5736d6cc84c5269","schema_version":"1.0","event_id":"sha256:cb0aedf46e0be2c07f7ce65b2182382b13caaada96027b53a5736d6cc84c5269"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3HBFD3GX6PZGVP3LC2QZ2BHZNO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8x2/uvw5AuiJ4G6lDfcL0Ho/jcTgbwOyCfpgDpD64Vk5ElINnExIBgVW0oDC5MfP3RcJN0TbXsmhlA+MSissAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:03.242421Z"},"content_sha256":"cedac878f336150d85adaaff126ea7d360d187b0a3f79b014c596a0e8d9df55c","schema_version":"1.0","event_id":"sha256:cedac878f336150d85adaaff126ea7d360d187b0a3f79b014c596a0e8d9df55c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/bundle.json","state_url":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T17:34:03Z","links":{"resolver":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO","bundle":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/bundle.json","state":"https://pith.science/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HBFD3GX6PZGVP3LC2QZ2BHZNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3HBFD3GX6PZGVP3LC2QZ2BHZNO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9b8ef1bcb6bd6759eeeac56270fe7e0d60d63bda9c481668f3dfdc41c4ff3d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T17:12:11Z","title_canon_sha256":"f2e23b27b0e77fc5621a8ebabf08dc0bf9a9cef7825f7362205e781eb1b151b0"},"schema_version":"1.0","source":{"id":"1809.09063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09063","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09063v1","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09063","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"3HBFD3GX6PZG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HBFD3GX6PZGVP3L","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HBFD3GX","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:cedac878f336150d85adaaff126ea7d360d187b0a3f79b014c596a0e8d9df55c","target":"graph","created_at":"2026-05-18T00:05:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Grigory Yaroslavtsev, Kaave Hosseini, Shachar Lovett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T17:12:11Z","title":"Optimality of Linear Sketching under Modular Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09063","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb0aedf46e0be2c07f7ce65b2182382b13caaada96027b53a5736d6cc84c5269","target":"record","created_at":"2026-05-18T00:05:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9b8ef1bcb6bd6759eeeac56270fe7e0d60d63bda9c481668f3dfdc41c4ff3d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-24T17:12:11Z","title_canon_sha256":"f2e23b27b0e77fc5621a8ebabf08dc0bf9a9cef7825f7362205e781eb1b151b0"},"schema_version":"1.0","source":{"id":"1809.09063","kind":"arxiv","version":1}},"canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9c251ecd7f3f26abf6b16a19d04f96b9c2e9182b3ad90b543df129a7caec55a","first_computed_at":"2026-05-18T00:05:01.211091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:01.211091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qef2OV/YXVSN90sqRRdc1qrfomAsKeGxvaEQdBuQ//7R8AYw8+gHXiUh2Jl+gD5N0BzuWNoSWAarktEKFB6gCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:01.211716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb0aedf46e0be2c07f7ce65b2182382b13caaada96027b53a5736d6cc84c5269","sha256:cedac878f336150d85adaaff126ea7d360d187b0a3f79b014c596a0e8d9df55c"],"state_sha256":"bbdddae761b3a9adaa831db89843d8ad3e1aba6b4f7f4865ddfd94df0cc398cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeDvKGf1OAnBEN1gm/BodQ/i9pCJCLDJjg8h6E5tgQkaZyy+ixMBDMk4FrrP2ddtnkSPdRQEU+x87HIHTf/NCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:34:03.244695Z","bundle_sha256":"ceea9e47bae362621f167f37d8c9bd496a24d9504a777535a2d85687b250305f"}}