{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EP3RGT2O6S3IMDVJFKYIKX52OF","short_pith_number":"pith:EP3RGT2O","schema_version":"1.0","canonical_sha256":"23f7134f4ef4b6860ea92ab0855fba715be596559695cc9af1d6e570149b8e34","source":{"kind":"arxiv","id":"1802.07600","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.07600","created_at":"2026-05-18T00:22:49.824868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07600v1","created_at":"2026-05-18T00:22:49.824868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07600","created_at":"2026-05-18T00:22:49.824868+00:00"},{"alias_kind":"pith_short_12","alias_value":"EP3RGT2O6S3I","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EP3RGT2O6S3IMDVJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EP3RGT2O","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF","json":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF.json","graph_json":"https://pith.science/api/pith-number/EP3RGT2O6S3IMDVJFKYIKX52OF/graph.json","events_json":"https://pith.science/api/pith-number/EP3RGT2O6S3IMDVJFKYIKX52OF/events.json","paper":"https://pith.science/paper/EP3RGT2O"},"agent_actions":{"view_html":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF","download_json":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF.json","view_paper":"https://pith.science/paper/EP3RGT2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07600&json=true","fetch_graph":"https://pith.science/api/pith-number/EP3RGT2O6S3IMDVJFKYIKX52OF/graph.json","fetch_events":"https://pith.science/api/pith-number/EP3RGT2O6S3IMDVJFKYIKX52OF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/action/storage_attestation","attest_author":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/action/author_attestation","sign_citation":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/action/citation_signature","submit_replication":"https://pith.science/pith/EP3RGT2O6S3IMDVJFKYIKX52OF/action/replication_record"}},"created_at":"2026-05-18T00:22:49.824868+00:00","updated_at":"2026-05-18T00:22:49.824868+00:00"}