{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BZTQTAJSBYUCYO322KPIVJFTIF","short_pith_number":"pith:BZTQTAJS","schema_version":"1.0","canonical_sha256":"0e670981320e282c3b7ad29e8aa4b3417b80531398a95a2c185a32147e658691","source":{"kind":"arxiv","id":"2106.04633","version":2},"attestation_state":"computed","paper":{"title":"A Quantum Advantage for a Natural Streaming Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"John Kallaugher","submitted_at":"2021-06-08T18:34:22Z","abstract_excerpt":"Data streaming, in which a large dataset is received as a \"stream\" of updates, is an important model in the study of space-bounded computation. Starting with the work of Le Gall [SPAA `06], it has been known that quantum streaming algorithms can use asymptotically less space than their classical counterparts for certain problems. However, so far, all known examples of quantum advantages in streaming are for problems that are either specially constructed for that purpose, or require many streaming passes over the input.\n  We give a one-pass quantum streaming algorithm for one of the best studie"},"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":"2106.04633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-08T18:34:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d8f7ad10f86f44296cc3f367020d5dd41c2d22b2f5c9db070a0b7fe9af9c9b4e","abstract_canon_sha256":"4342e5943305a90a389216447d2beeeb607f67d7acbd1ef0c8b740b771d6bab1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:28.041093Z","signature_b64":"wO8l5T9GYtSromwd0+LF9a/PxKmxRfX95COBwuCZIK6eWTo/iBMN3aLnVY/vyCcG/sqZqsutbo8ugodFV2SWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e670981320e282c3b7ad29e8aa4b3417b80531398a95a2c185a32147e658691","last_reissued_at":"2026-07-05T03:31:28.040596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:28.040596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Advantage for a Natural Streaming Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"John Kallaugher","submitted_at":"2021-06-08T18:34:22Z","abstract_excerpt":"Data streaming, in which a large dataset is received as a \"stream\" of updates, is an important model in the study of space-bounded computation. Starting with the work of Le Gall [SPAA `06], it has been known that quantum streaming algorithms can use asymptotically less space than their classical counterparts for certain problems. However, so far, all known examples of quantum advantages in streaming are for problems that are either specially constructed for that purpose, or require many streaming passes over the input.\n  We give a one-pass quantum streaming algorithm for one of the best studie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04633","kind":"arxiv","version":2},"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/2106.04633/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":"2106.04633","created_at":"2026-07-05T03:31:28.040655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04633v2","created_at":"2026-07-05T03:31:28.040655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04633","created_at":"2026-07-05T03:31:28.040655+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZTQTAJSBYUC","created_at":"2026-07-05T03:31:28.040655+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZTQTAJSBYUCYO32","created_at":"2026-07-05T03:31:28.040655+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZTQTAJS","created_at":"2026-07-05T03:31:28.040655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF","json":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF.json","graph_json":"https://pith.science/api/pith-number/BZTQTAJSBYUCYO322KPIVJFTIF/graph.json","events_json":"https://pith.science/api/pith-number/BZTQTAJSBYUCYO322KPIVJFTIF/events.json","paper":"https://pith.science/paper/BZTQTAJS"},"agent_actions":{"view_html":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF","download_json":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF.json","view_paper":"https://pith.science/paper/BZTQTAJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04633&json=true","fetch_graph":"https://pith.science/api/pith-number/BZTQTAJSBYUCYO322KPIVJFTIF/graph.json","fetch_events":"https://pith.science/api/pith-number/BZTQTAJSBYUCYO322KPIVJFTIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF/action/storage_attestation","attest_author":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF/action/author_attestation","sign_citation":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF/action/citation_signature","submit_replication":"https://pith.science/pith/BZTQTAJSBYUCYO322KPIVJFTIF/action/replication_record"}},"created_at":"2026-07-05T03:31:28.040655+00:00","updated_at":"2026-07-05T03:31:28.040655+00:00"}