{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EP3RGT2O6S3IMDVJFKYIKX52OF","short_pith_number":"pith:EP3RGT2O","canonical_record":{"source":{"id":"1802.07600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T14:58:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02b370e9c8410d079ef2c8ea1ef0d5938e26aa2e202c6f68d2584486000468af","abstract_canon_sha256":"2cd88f77c572b7e2ade32d5c48c924ba2bab37bace3ebb7fc08c5bfa5660332c"},"schema_version":"1.0"},"canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","source":{"kind":"arxiv","id":"1802.07600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07600","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07600v1","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07600","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"EP3RGT2O6S3I","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EP3RGT2O6S3IMDVJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EP3RGT2O","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EP3RGT2O6S3IMDVJFKYIKX52OF","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T14:58:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02b370e9c8410d079ef2c8ea1ef0d5938e26aa2e202c6f68d2584486000468af","abstract_canon_sha256":"2cd88f77c572b7e2ade32d5c48c924ba2bab37bace3ebb7fc08c5bfa5660332c"},"schema_version":"1.0"},"canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.825255Z","signature_b64":"iavrSDau2E94tzHSavxwzHNDOhRAGiMIwMI7gXTG2G5jB04dWBE2CvBbMeeoYoPOOExtdBxxIpMUqgLL2263Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","last_reissued_at":"2026-05-18T00:22:49.824793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.824793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07600","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:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1B4R5ShHRyrRDoVzqIJQ0XPvRQguN5vtSXVORE2ZCqEzybSjfCSYA5RxaNXQghq6mFsh4SZIgz5qXPfd4mhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:53:52.018509Z"},"content_sha256":"c90851f23bdeb9b939848d4c3a15f291e8c9cc5c17f99c063fdd6f0fa94ebe8c","schema_version":"1.0","event_id":"sha256:c90851f23bdeb9b939848d4c3a15f291e8c9cc5c17f99c063fdd6f0fa94ebe8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EP3RGT2O6S3IMDVJFKYIKX52OF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized sliding window algorithms for regular languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Danny Hucke, Markus Lohrey, Moses Ganardi","submitted_at":"2018-02-21T14:58:10Z","abstract_excerpt":"A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most $\\epsilon$, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized by the error bound $\\epsilon$ and the failure ratio $\\phi$: A randomized sliding window algorithm is required to err with probability at most $\\epsilon$ at a portion of $1-\\phi$ of all time instants of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07600","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:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6hDrCVGUpUz3xACzq440czlMjssWcbuh/3VJz4Iyig/wDDTjQ+A0gnl9PyrLifmrj7XOCzS6U06QW0iQJaKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:53:52.019041Z"},"content_sha256":"aa1ecf2ff3cb0aa186f4e997b0c478fb4724a03b5d1699fb6d51e046cdbd211a","schema_version":"1.0","event_id":"sha256:aa1ecf2ff3cb0aa186f4e997b0c478fb4724a03b5d1699fb6d51e046cdbd211a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/bundle.json","state_url":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/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-26T17:53:52Z","links":{"resolver":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF","bundle":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/bundle.json","state":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EP3RGT2O6S3IMDVJFKYIKX52OF","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":"2cd88f77c572b7e2ade32d5c48c924ba2bab37bace3ebb7fc08c5bfa5660332c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T14:58:10Z","title_canon_sha256":"02b370e9c8410d079ef2c8ea1ef0d5938e26aa2e202c6f68d2584486000468af"},"schema_version":"1.0","source":{"id":"1802.07600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07600","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07600v1","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07600","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"EP3RGT2O6S3I","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EP3RGT2O6S3IMDVJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EP3RGT2O","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:aa1ecf2ff3cb0aa186f4e997b0c478fb4724a03b5d1699fb6d51e046cdbd211a","target":"graph","created_at":"2026-05-18T00:22: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":"A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most $\\epsilon$, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized by the error bound $\\epsilon$ and the failure ratio $\\phi$: A randomized sliding window algorithm is required to err with probability at most $\\epsilon$ at a portion of $1-\\phi$ of all time instants of ","authors_text":"Danny Hucke, Markus Lohrey, Moses Ganardi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T14:58:10Z","title":"Randomized sliding window algorithms for regular languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07600","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:c90851f23bdeb9b939848d4c3a15f291e8c9cc5c17f99c063fdd6f0fa94ebe8c","target":"record","created_at":"2026-05-18T00:22: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":"2cd88f77c572b7e2ade32d5c48c924ba2bab37bace3ebb7fc08c5bfa5660332c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T14:58:10Z","title_canon_sha256":"02b370e9c8410d079ef2c8ea1ef0d5938e26aa2e202c6f68d2584486000468af"},"schema_version":"1.0","source":{"id":"1802.07600","kind":"arxiv","version":1}},"canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","first_computed_at":"2026-05-18T00:22:49.824793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:49.824793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iavrSDau2E94tzHSavxwzHNDOhRAGiMIwMI7gXTG2G5jB04dWBE2CvBbMeeoYoPOOExtdBxxIpMUqgLL2263Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:49.825255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c90851f23bdeb9b939848d4c3a15f291e8c9cc5c17f99c063fdd6f0fa94ebe8c","sha256:aa1ecf2ff3cb0aa186f4e997b0c478fb4724a03b5d1699fb6d51e046cdbd211a"],"state_sha256":"c0a18a4aaabe3dc6695f5054b0d0e9df404200e2602b9379897b61d4dbcd24ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtyGFBwOEhuytpM+nrTG3xzPVZrx7/Sw4oOX+jgTZIcPWR7EKCgR9x22S0baOXF1VYrqInYtbkEGdw9h/PwaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:53:52.022735Z","bundle_sha256":"889e58ddf40a3136951fca69b9ff5eb77ac25b5685ef34d481a03cb38b7a3915"}}