{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LGVHQQ5AEUDK2FHRUABRL2J6LL","short_pith_number":"pith:LGVHQQ5A","canonical_record":{"source":{"id":"1802.05134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-13T12:50:12Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"abed0fe892ad8f230235752ddcf1404e97f17844c3a22458d603ce60e0073bf2","abstract_canon_sha256":"7582636c1ad632de3bc745c7e32508d36bdbb2d4994666f42a3990544abe1c6c"},"schema_version":"1.0"},"canonical_sha256":"59aa7843a02506ad14f1a00315e93e5af0431f61c1562824aed6cc29fd637a50","source":{"kind":"arxiv","id":"1802.05134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05134","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05134v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05134","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"LGVHQQ5AEUDK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGVHQQ5AEUDK2FHR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGVHQQ5A","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LGVHQQ5AEUDK2FHRUABRL2J6LL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-13T12:50:12Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"abed0fe892ad8f230235752ddcf1404e97f17844c3a22458d603ce60e0073bf2","abstract_canon_sha256":"7582636c1ad632de3bc745c7e32508d36bdbb2d4994666f42a3990544abe1c6c"},"schema_version":"1.0"},"canonical_sha256":"59aa7843a02506ad14f1a00315e93e5af0431f61c1562824aed6cc29fd637a50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.046208Z","signature_b64":"eop4/WoROP0nqrqCIq+kHZ19Vx+uJUOnqUkladidHI4ziyA/vcYY+qmAdE4lT9QmfjeR5qZNzIUU2WG2MUKyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59aa7843a02506ad14f1a00315e93e5af0431f61c1562824aed6cc29fd637a50","last_reissued_at":"2026-05-17T23:42:49.045783Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.045783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05134","source_version":2,"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gklHQ1LskDXHGPynYHR/WRVaaiAjcaeti0gXvLfn5ItdW9ARxlgQr4nlqiM/T6YfHcizcQJZUZ9jyaBnGG1qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:42:49.659344Z"},"content_sha256":"c6bd8af5da060ac90a772e2606d3c681bc96d1f3577cb4c2fcba77e160e2940b","schema_version":"1.0","event_id":"sha256:c6bd8af5da060ac90a772e2606d3c681bc96d1f3577cb4c2fcba77e160e2940b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LGVHQQ5AEUDK2FHRUABRL2J6LL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum versus Classical Online Streaming Algorithms with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Alexander Rivosh, Aliya Khadieva, Dmitry Kravchenko, Ilnaz Mannapov, Kamil Khadiev, Mansur Ziatdinov, Ramis Yamilov","submitted_at":"2018-02-13T12:50:12Z","abstract_excerpt":"We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can be solved by quantum online streaming algorithms better than by classical ones in a case of logarithmic or sublogarithmic size of memory, even if classical online algorithms get advice bits. Furthermore, we show that a quantum online algorithm with a constant number of qubits can be better than any deterministic online algorithm with a constant num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05134","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":""},"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMv8plWbAFKQOStx09Ud1ePgTrrWiO3XWCWhOpetvFgIk0ApiVZCe92HfW6jr4CM1OLHBQsfW4YSK06iMIg0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:42:49.660048Z"},"content_sha256":"e862dbe41a785ce91c5fc8f94791f1cf5c45f2e906ec663d16db374badcc610e","schema_version":"1.0","event_id":"sha256:e862dbe41a785ce91c5fc8f94791f1cf5c45f2e906ec663d16db374badcc610e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/bundle.json","state_url":"https://pith.science/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/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-08T16:42:49Z","links":{"resolver":"https://pith.science/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL","bundle":"https://pith.science/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/bundle.json","state":"https://pith.science/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGVHQQ5AEUDK2FHRUABRL2J6LL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LGVHQQ5AEUDK2FHRUABRL2J6LL","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":"7582636c1ad632de3bc745c7e32508d36bdbb2d4994666f42a3990544abe1c6c","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-13T12:50:12Z","title_canon_sha256":"abed0fe892ad8f230235752ddcf1404e97f17844c3a22458d603ce60e0073bf2"},"schema_version":"1.0","source":{"id":"1802.05134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05134","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05134v2","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05134","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"LGVHQQ5AEUDK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LGVHQQ5AEUDK2FHR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LGVHQQ5A","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e862dbe41a785ce91c5fc8f94791f1cf5c45f2e906ec663d16db374badcc610e","target":"graph","created_at":"2026-05-17T23:42:49Z","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 consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can be solved by quantum online streaming algorithms better than by classical ones in a case of logarithmic or sublogarithmic size of memory, even if classical online algorithms get advice bits. Furthermore, we show that a quantum online algorithm with a constant number of qubits can be better than any deterministic online algorithm with a constant num","authors_text":"Alexander Rivosh, Aliya Khadieva, Dmitry Kravchenko, Ilnaz Mannapov, Kamil Khadiev, Mansur Ziatdinov, Ramis Yamilov","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-13T12:50:12Z","title":"Quantum versus Classical Online Streaming Algorithms with Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05134","kind":"arxiv","version":2},"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:c6bd8af5da060ac90a772e2606d3c681bc96d1f3577cb4c2fcba77e160e2940b","target":"record","created_at":"2026-05-17T23:42:49Z","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":"7582636c1ad632de3bc745c7e32508d36bdbb2d4994666f42a3990544abe1c6c","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-13T12:50:12Z","title_canon_sha256":"abed0fe892ad8f230235752ddcf1404e97f17844c3a22458d603ce60e0073bf2"},"schema_version":"1.0","source":{"id":"1802.05134","kind":"arxiv","version":2}},"canonical_sha256":"59aa7843a02506ad14f1a00315e93e5af0431f61c1562824aed6cc29fd637a50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59aa7843a02506ad14f1a00315e93e5af0431f61c1562824aed6cc29fd637a50","first_computed_at":"2026-05-17T23:42:49.045783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.045783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eop4/WoROP0nqrqCIq+kHZ19Vx+uJUOnqUkladidHI4ziyA/vcYY+qmAdE4lT9QmfjeR5qZNzIUU2WG2MUKyDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.046208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6bd8af5da060ac90a772e2606d3c681bc96d1f3577cb4c2fcba77e160e2940b","sha256:e862dbe41a785ce91c5fc8f94791f1cf5c45f2e906ec663d16db374badcc610e"],"state_sha256":"e1987d7c895f4fcff47cb914ce66056d28a348d2c3a4e712bb50ec93ab5ce7e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpSW/nHqIC+Q0iVy6Rf5Ogk3jGS3jm8Pylv2+nx+Cz+EDW0fqZI6iw3KejUpSaCccuSPKhjlDEld6sEgFvCeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:42:49.663856Z","bundle_sha256":"f4e833998baf3da3d6c49af14b683aed2c2ebc1e16dd772aec0534619ef1feb6"}}