{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G3PWBKDARWD5OYX3XAVD7FPO52","short_pith_number":"pith:G3PWBKDA","schema_version":"1.0","canonical_sha256":"36df60a8608d87d762fbb82a3f95eeee9ebb2f4cc025ba7275f4107d8cbd94a9","source":{"kind":"arxiv","id":"1409.8235","version":1},"attestation_state":"computed","paper":{"title":"On Searching Zimin Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arseny M. Shur, Wojciech Rytter","submitted_at":"2014-09-29T19:01:07Z","abstract_excerpt":"In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$ is introduced here as the maximum rank of a Zimin pattern matching $x$. We show how to compute Zimin type of a word on-line in linear time. Consequently we get a quadratic time, linear-space algorithm for searching Zimin patterns in words. Then we how the Zimin type of the length $n$ prefix of the infinite Fibonacci word is related to the representation of $n"},"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":"1409.8235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T19:01:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"141897a822d882060e679269346ab95d63ec67a1faf2759f90c36d4a3037909b","abstract_canon_sha256":"d0ac21e78e94658afa634c5d3f10c20db185543a2bb3263ec7da0d5f35f05116"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:53.012668Z","signature_b64":"OeXQUVGkGGJBWTQaJ/2irDE8wnFarXJJn+wcBiNmBLpfjwOMTXWxJT2suZ94uFveThQxiFyFf6Wp5GZ9aqqFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36df60a8608d87d762fbb82a3f95eeee9ebb2f4cc025ba7275f4107d8cbd94a9","last_reissued_at":"2026-05-18T02:19:53.012141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:53.012141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Searching Zimin Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Arseny M. Shur, Wojciech Rytter","submitted_at":"2014-09-29T19:01:07Z","abstract_excerpt":"In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$ is introduced here as the maximum rank of a Zimin pattern matching $x$. We show how to compute Zimin type of a word on-line in linear time. Consequently we get a quadratic time, linear-space algorithm for searching Zimin patterns in words. Then we how the Zimin type of the length $n$ prefix of the infinite Fibonacci word is related to the representation of $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8235","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":"1409.8235","created_at":"2026-05-18T02:19:53.012223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8235v1","created_at":"2026-05-18T02:19:53.012223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8235","created_at":"2026-05-18T02:19:53.012223+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3PWBKDARWD5","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3PWBKDARWD5OYX3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3PWBKDA","created_at":"2026-05-18T12:28:28.263976+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/G3PWBKDARWD5OYX3XAVD7FPO52","json":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52.json","graph_json":"https://pith.science/api/pith-number/G3PWBKDARWD5OYX3XAVD7FPO52/graph.json","events_json":"https://pith.science/api/pith-number/G3PWBKDARWD5OYX3XAVD7FPO52/events.json","paper":"https://pith.science/paper/G3PWBKDA"},"agent_actions":{"view_html":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52","download_json":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52.json","view_paper":"https://pith.science/paper/G3PWBKDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8235&json=true","fetch_graph":"https://pith.science/api/pith-number/G3PWBKDARWD5OYX3XAVD7FPO52/graph.json","fetch_events":"https://pith.science/api/pith-number/G3PWBKDARWD5OYX3XAVD7FPO52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52/action/storage_attestation","attest_author":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52/action/author_attestation","sign_citation":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52/action/citation_signature","submit_replication":"https://pith.science/pith/G3PWBKDARWD5OYX3XAVD7FPO52/action/replication_record"}},"created_at":"2026-05-18T02:19:53.012223+00:00","updated_at":"2026-05-18T02:19:53.012223+00:00"}