{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q6FJYVG53VRHHHBEI5EXNAQOXB","short_pith_number":"pith:Q6FJYVG5","schema_version":"1.0","canonical_sha256":"878a9c54dddd62739c24474976820eb84f2c8627f96326440a08b2c3fd72ff56","source":{"kind":"arxiv","id":"1708.04381","version":1},"attestation_state":"computed","paper":{"title":"Streaming Periodicity with Mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Funda Erg\\\"un, Samson Zhou","submitted_at":"2017-08-15T02:12:48Z","abstract_excerpt":"We study the problem of finding all $k$-periods of a length-$n$ string $S$, presented as a data stream. $S$ is said to have $k$-period $p$ if its prefix of length $n-p$ differs from its suffix of length $n-p$ in at most $k$ locations.\n  We give a one-pass streaming algorithm that computes the $k$-periods of a string $S$ using $\\text{poly}(k, \\log n)$ bits of space, for $k$-periods of length at most $\\frac{n}{2}$. We also present a two-pass streaming algorithm that computes $k$-periods of $S$ using $\\text{poly}(k, \\log n)$ bits of space, regardless of period length. We complement these results "},"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":"1708.04381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T02:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"2189e89188eca545afd366c455c77f85442deb7542b4aa42102670303e64c8c2","abstract_canon_sha256":"77234e41938f55fdb6ed7bb6d616b82c1e622892d15d45dd418896131eeadccf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.500222Z","signature_b64":"gzlWzTEokS7r0/Ec5T216TqChKRZ3JW9ZB9IWKD9Y5tt2wzXg12+ONoUZ+ey0cvCRD0ZtTjQSqxykse4VDPIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878a9c54dddd62739c24474976820eb84f2c8627f96326440a08b2c3fd72ff56","last_reissued_at":"2026-05-18T00:37:59.499570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.499570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Periodicity with Mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Funda Erg\\\"un, Samson Zhou","submitted_at":"2017-08-15T02:12:48Z","abstract_excerpt":"We study the problem of finding all $k$-periods of a length-$n$ string $S$, presented as a data stream. $S$ is said to have $k$-period $p$ if its prefix of length $n-p$ differs from its suffix of length $n-p$ in at most $k$ locations.\n  We give a one-pass streaming algorithm that computes the $k$-periods of a string $S$ using $\\text{poly}(k, \\log n)$ bits of space, for $k$-periods of length at most $\\frac{n}{2}$. We also present a two-pass streaming algorithm that computes $k$-periods of $S$ using $\\text{poly}(k, \\log n)$ bits of space, regardless of period length. We complement these results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04381","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":"1708.04381","created_at":"2026-05-18T00:37:59.499686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04381v1","created_at":"2026-05-18T00:37:59.499686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04381","created_at":"2026-05-18T00:37:59.499686+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6FJYVG53VRH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6FJYVG53VRHHHBE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6FJYVG5","created_at":"2026-05-18T12:31:37.085036+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/Q6FJYVG53VRHHHBEI5EXNAQOXB","json":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB.json","graph_json":"https://pith.science/api/pith-number/Q6FJYVG53VRHHHBEI5EXNAQOXB/graph.json","events_json":"https://pith.science/api/pith-number/Q6FJYVG53VRHHHBEI5EXNAQOXB/events.json","paper":"https://pith.science/paper/Q6FJYVG5"},"agent_actions":{"view_html":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB","download_json":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB.json","view_paper":"https://pith.science/paper/Q6FJYVG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04381&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6FJYVG53VRHHHBEI5EXNAQOXB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6FJYVG53VRHHHBEI5EXNAQOXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB/action/storage_attestation","attest_author":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB/action/author_attestation","sign_citation":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB/action/citation_signature","submit_replication":"https://pith.science/pith/Q6FJYVG53VRHHHBEI5EXNAQOXB/action/replication_record"}},"created_at":"2026-05-18T00:37:59.499686+00:00","updated_at":"2026-05-18T00:37:59.499686+00:00"}