{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AGHW6Y3EDDHEZARIJ237AEQRJT","short_pith_number":"pith:AGHW6Y3E","canonical_record":{"source":{"id":"1807.04400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T02:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"658bf3372536bc6d68ba87fa39f76976482f7cb3d2a5df48195a999c8658d0c1","abstract_canon_sha256":"9d4561efe4e633335e480404d066fd49d9c569767196a2531aae5ff10b5fa748"},"schema_version":"1.0"},"canonical_sha256":"018f6f636418ce4c82284eb7f012114cefac35413ed909309608ef824295490d","source":{"kind":"arxiv","id":"1807.04400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04400","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04400v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04400","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"AGHW6Y3EDDHE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AGHW6Y3EDDHEZARI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AGHW6Y3E","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AGHW6Y3EDDHEZARIJ237AEQRJT","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T02:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"658bf3372536bc6d68ba87fa39f76976482f7cb3d2a5df48195a999c8658d0c1","abstract_canon_sha256":"9d4561efe4e633335e480404d066fd49d9c569767196a2531aae5ff10b5fa748"},"schema_version":"1.0"},"canonical_sha256":"018f6f636418ce4c82284eb7f012114cefac35413ed909309608ef824295490d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.631063Z","signature_b64":"uDJmaejmFBK35sdEUYA48abrbYiNllNbLlyiiVnZQmckrgYAkMl3n8kfaq/c2WC+J9YSVpZdd+xtHDMuCzcaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018f6f636418ce4c82284eb7f012114cefac35413ed909309608ef824295490d","last_reissued_at":"2026-05-18T00:10:53.630311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.630311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04400","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:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gtp1O1TXAqWpiqhxF1n+KodKLaGV0wreV1I59XFSqmerqbpSHqniT4IihijZItUvdp+lRHaUlvnYCtwJZvuQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:35:51.533874Z"},"content_sha256":"27bd5ea71360d466ee16212cc8ebf34d25045d9fe92f12f8b7d09a230af0344e","schema_version":"1.0","event_id":"sha256:27bd5ea71360d466ee16212cc8ebf34d25045d9fe92f12f8b7d09a230af0344e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AGHW6Y3EDDHEZARIJ237AEQRJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sliding window order statistics in sublinear space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dhruv Rohatgi","submitted_at":"2018-07-12T02:11:34Z","abstract_excerpt":"We extend the multi-pass streaming model to sliding window problems, and address the problem of computing order statistics on fixed-size sliding windows, in the multi-pass streaming model as well as the closely related communication complexity model. In the $2$-pass streaming model, we show that on input of length $N$ with values in range $[0,R]$ and a window of length $K$, sliding window minimums can be computed in $\\widetilde{O}(\\sqrt{N})$. We show that this is nearly optimal (for any constant number of passes) when $R \\geq K$, but can be improved when $R = o(K)$ to $\\widetilde{O}(\\sqrt{NR/K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04400","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:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJpxPczY6z3aMk57wmlwl/mGAcZFlQ+nXXxqamBBkdYSYD91DCnOHH3Kzkfz1vC9si710TuWJzgMmJ+5zuDGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:35:51.534592Z"},"content_sha256":"80d3fdd75bafea8792cf095498b026249e997657db37e99d9bdac525384ffd86","schema_version":"1.0","event_id":"sha256:80d3fdd75bafea8792cf095498b026249e997657db37e99d9bdac525384ffd86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/bundle.json","state_url":"https://pith.science/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/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-05-30T15:35:51Z","links":{"resolver":"https://pith.science/pith/AGHW6Y3EDDHEZARIJ237AEQRJT","bundle":"https://pith.science/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/bundle.json","state":"https://pith.science/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGHW6Y3EDDHEZARIJ237AEQRJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AGHW6Y3EDDHEZARIJ237AEQRJT","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":"9d4561efe4e633335e480404d066fd49d9c569767196a2531aae5ff10b5fa748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T02:11:34Z","title_canon_sha256":"658bf3372536bc6d68ba87fa39f76976482f7cb3d2a5df48195a999c8658d0c1"},"schema_version":"1.0","source":{"id":"1807.04400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04400","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04400v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04400","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"AGHW6Y3EDDHE","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AGHW6Y3EDDHEZARI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AGHW6Y3E","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:80d3fdd75bafea8792cf095498b026249e997657db37e99d9bdac525384ffd86","target":"graph","created_at":"2026-05-18T00:10:53Z","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 extend the multi-pass streaming model to sliding window problems, and address the problem of computing order statistics on fixed-size sliding windows, in the multi-pass streaming model as well as the closely related communication complexity model. In the $2$-pass streaming model, we show that on input of length $N$ with values in range $[0,R]$ and a window of length $K$, sliding window minimums can be computed in $\\widetilde{O}(\\sqrt{N})$. We show that this is nearly optimal (for any constant number of passes) when $R \\geq K$, but can be improved when $R = o(K)$ to $\\widetilde{O}(\\sqrt{NR/K","authors_text":"Dhruv Rohatgi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T02:11:34Z","title":"Sliding window order statistics in sublinear space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04400","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:27bd5ea71360d466ee16212cc8ebf34d25045d9fe92f12f8b7d09a230af0344e","target":"record","created_at":"2026-05-18T00:10:53Z","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":"9d4561efe4e633335e480404d066fd49d9c569767196a2531aae5ff10b5fa748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T02:11:34Z","title_canon_sha256":"658bf3372536bc6d68ba87fa39f76976482f7cb3d2a5df48195a999c8658d0c1"},"schema_version":"1.0","source":{"id":"1807.04400","kind":"arxiv","version":1}},"canonical_sha256":"018f6f636418ce4c82284eb7f012114cefac35413ed909309608ef824295490d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"018f6f636418ce4c82284eb7f012114cefac35413ed909309608ef824295490d","first_computed_at":"2026-05-18T00:10:53.630311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:53.630311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uDJmaejmFBK35sdEUYA48abrbYiNllNbLlyiiVnZQmckrgYAkMl3n8kfaq/c2WC+J9YSVpZdd+xtHDMuCzcaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:53.631063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27bd5ea71360d466ee16212cc8ebf34d25045d9fe92f12f8b7d09a230af0344e","sha256:80d3fdd75bafea8792cf095498b026249e997657db37e99d9bdac525384ffd86"],"state_sha256":"b2b3432c974156159c9c9ecbdfe639bcd503cfa9c50fe05f6c93860af8794ed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3s1uXTTHLH6nyP9pGBPgGrH4POZGEU4b+wKqtJu9s0/Zs9jWAViPd/dRdI0OsK3oRbGk8Ra+MQ7gAGxBGfVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:35:51.537783Z","bundle_sha256":"f22e8e5a6d865d29ae1e833ef892fa0f210de6274b9989003aae7fa3e7d353dc"}}