{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N3BE5RWQS5BVIP46LZMWDLK3S7","short_pith_number":"pith:N3BE5RWQ","schema_version":"1.0","canonical_sha256":"6ec24ec6d09743543f9e5e5961ad5b97c800069a71b67fc9b7226aa21c99edb3","source":{"kind":"arxiv","id":"1804.11175","version":2},"attestation_state":"computed","paper":{"title":"Counting Subwords and Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Charles J. Colbourn, Jeffrey Shallit, Ryan E. Dougherty, Thomas F. Lidbetter","submitted_at":"2018-04-30T13:23:39Z","abstract_excerpt":"Let $x$ and $y$ be words. We consider the languages whose words $z$ are those for which the numbers of occurrences of $x$ and $y$, as subwords of $z$, are the same (resp., the number of $x$'s is less than the number of $y$'s, resp., is less than or equal). We give a necessary and sufficient condition on $x$ and $y$ for these languages to be regular, and we show how to check this condition efficiently."},"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":"1804.11175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-30T13:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"58ec7217cc9fa4c541a1e2001d9742114532123acba0f9ca9cf2d4b53465f5c0","abstract_canon_sha256":"3013a795374c053677e5b7a5e76a7f68aa9e26bbbf72e0c1be9b9a8fc408eb1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.152537Z","signature_b64":"aU2Fj5IACR0OthuMYzDI30Mgiw+86MWkx0+F+T55jdal3nk4u8s8/favygTUQTd7AWftcWUdwguC2QU+8qe+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec24ec6d09743543f9e5e5961ad5b97c800069a71b67fc9b7226aa21c99edb3","last_reissued_at":"2026-05-18T00:12:43.151985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.151985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Subwords and Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Charles J. Colbourn, Jeffrey Shallit, Ryan E. Dougherty, Thomas F. Lidbetter","submitted_at":"2018-04-30T13:23:39Z","abstract_excerpt":"Let $x$ and $y$ be words. We consider the languages whose words $z$ are those for which the numbers of occurrences of $x$ and $y$, as subwords of $z$, are the same (resp., the number of $x$'s is less than the number of $y$'s, resp., is less than or equal). We give a necessary and sufficient condition on $x$ and $y$ for these languages to be regular, and we show how to check this condition efficiently."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11175","kind":"arxiv","version":2},"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":"1804.11175","created_at":"2026-05-18T00:12:43.152054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11175v2","created_at":"2026-05-18T00:12:43.152054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11175","created_at":"2026-05-18T00:12:43.152054+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3BE5RWQS5BV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3BE5RWQS5BVIP46","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3BE5RWQ","created_at":"2026-05-18T12:32:40.477152+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/N3BE5RWQS5BVIP46LZMWDLK3S7","json":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7.json","graph_json":"https://pith.science/api/pith-number/N3BE5RWQS5BVIP46LZMWDLK3S7/graph.json","events_json":"https://pith.science/api/pith-number/N3BE5RWQS5BVIP46LZMWDLK3S7/events.json","paper":"https://pith.science/paper/N3BE5RWQ"},"agent_actions":{"view_html":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7","download_json":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7.json","view_paper":"https://pith.science/paper/N3BE5RWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11175&json=true","fetch_graph":"https://pith.science/api/pith-number/N3BE5RWQS5BVIP46LZMWDLK3S7/graph.json","fetch_events":"https://pith.science/api/pith-number/N3BE5RWQS5BVIP46LZMWDLK3S7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7/action/storage_attestation","attest_author":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7/action/author_attestation","sign_citation":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7/action/citation_signature","submit_replication":"https://pith.science/pith/N3BE5RWQS5BVIP46LZMWDLK3S7/action/replication_record"}},"created_at":"2026-05-18T00:12:43.152054+00:00","updated_at":"2026-05-18T00:12:43.152054+00:00"}