{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:R3QF7MBXRVATRFNBIOYKIAX4VW","short_pith_number":"pith:R3QF7MBX","schema_version":"1.0","canonical_sha256":"8ee05fb0378d413895a143b0a402fcada487ff99675bbad20823d6359cf122f9","source":{"kind":"arxiv","id":"2607.28819","version":1},"attestation_state":"computed","paper":{"title":"A Matrix Factorization Approach in Turnstile Streaming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Bulanek, Jelani Nelson, Raghu Meka, Ravi Kumar, Tamas Sarlos","submitted_at":"2026-07-30T20:21:49Z","abstract_excerpt":"We define the $M$-point query problem in data streams. Given a fixed matrix $M$, the goal is to maintain a vector $x$ under turnstile updates and answer each query $u$ with an estimate $\\widehat{y}_u$ satisfying $|y_u-\\widehat{y}_u| \\leq \\varepsilon \\|x\\|_1$, where $y=Mx$. We show that if $M$ admits a factorization $M=AB$, where $A$ and $B$ have space-efficient representations, then there is a streaming algorithm using $O(\\varepsilon^{-1}\\|A\\|_{2\\rightarrow\\infty}\\|B\\|_{1\\rightarrow 1}+(\\varepsilon^{-1}\\|A\\|_{\\infty\\rightarrow\\infty}\\|B\\|_{1\\rightarrow 1})^{2/3})$ words of memory.\n  An importa"},"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":"2607.28819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T20:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"2f2c74df5f84776d28970590703c1f3534b7d34e3fd5d40a2028b1d764c2f7d6","abstract_canon_sha256":"47c14f59664fdca7cc7aec45985c00947213411d2a278b835cd64d782af29cd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T00:13:08.034978Z","signature_b64":"9t3zxSbSrlcsFHwlftNMZXhwipeYLxB7ZCHEl6QHweO4vdOEQFWDoL83jyWbYQpEmCVSbxrAYCV6LUOfTJSLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee05fb0378d413895a143b0a402fcada487ff99675bbad20823d6359cf122f9","last_reissued_at":"2026-08-03T00:13:08.032608Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T00:13:08.032608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Matrix Factorization Approach in Turnstile Streaming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Bulanek, Jelani Nelson, Raghu Meka, Ravi Kumar, Tamas Sarlos","submitted_at":"2026-07-30T20:21:49Z","abstract_excerpt":"We define the $M$-point query problem in data streams. Given a fixed matrix $M$, the goal is to maintain a vector $x$ under turnstile updates and answer each query $u$ with an estimate $\\widehat{y}_u$ satisfying $|y_u-\\widehat{y}_u| \\leq \\varepsilon \\|x\\|_1$, where $y=Mx$. We show that if $M$ admits a factorization $M=AB$, where $A$ and $B$ have space-efficient representations, then there is a streaming algorithm using $O(\\varepsilon^{-1}\\|A\\|_{2\\rightarrow\\infty}\\|B\\|_{1\\rightarrow 1}+(\\varepsilon^{-1}\\|A\\|_{\\infty\\rightarrow\\infty}\\|B\\|_{1\\rightarrow 1})^{2/3})$ words of memory.\n  An importa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.28819","created_at":"2026-08-03T00:13:08.034244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28819v1","created_at":"2026-08-03T00:13:08.034244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28819","created_at":"2026-08-03T00:13:08.034244+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3QF7MBXRVAT","created_at":"2026-08-03T00:13:08.034244+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3QF7MBXRVATRFNB","created_at":"2026-08-03T00:13:08.034244+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3QF7MBX","created_at":"2026-08-03T00:13:08.034244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08238","citing_title":"A Near-Optimal Lower Bound for Prefix-Matrix Factorizations","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW","json":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW.json","graph_json":"https://pith.science/api/pith-number/R3QF7MBXRVATRFNBIOYKIAX4VW/graph.json","events_json":"https://pith.science/api/pith-number/R3QF7MBXRVATRFNBIOYKIAX4VW/events.json","paper":"https://pith.science/paper/R3QF7MBX"},"agent_actions":{"view_html":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW","download_json":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW.json","view_paper":"https://pith.science/paper/R3QF7MBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28819&json=true","fetch_graph":"https://pith.science/api/pith-number/R3QF7MBXRVATRFNBIOYKIAX4VW/graph.json","fetch_events":"https://pith.science/api/pith-number/R3QF7MBXRVATRFNBIOYKIAX4VW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW/action/storage_attestation","attest_author":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW/action/author_attestation","sign_citation":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW/action/citation_signature","submit_replication":"https://pith.science/pith/R3QF7MBXRVATRFNBIOYKIAX4VW/action/replication_record"}},"created_at":"2026-08-03T00:13:08.034244+00:00","updated_at":"2026-08-03T00:13:08.034244+00:00"}