{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EZINZ77332HKKBFEXVSLUWFEBK","short_pith_number":"pith:EZINZ773","schema_version":"1.0","canonical_sha256":"2650dcfffbde8ea504a4bd64ba58a40a89f4ce47f5689f8c4d7efd283848e417","source":{"kind":"arxiv","id":"2403.05088","version":1},"attestation_state":"computed","paper":{"title":"Semidirect Product Decompositions for Periodic Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hiroyuki Seki, Kenji Hashimoto, Yusuke Inoue","submitted_at":"2024-03-08T06:30:25Z","abstract_excerpt":"The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\\Sigma\\Sigma)^*$ has period two because the length of a recursion (cycle) in its DFA must be even. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period $P$ if and only if its syntactic monoid is isomorphic to a submonoid of a semidirect product between a specific finite monoid and the cyclic group of order $P$"},"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":"2403.05088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2024-03-08T06:30:25Z","cross_cats_sorted":[],"title_canon_sha256":"331c0270cabceda01922ef5932ee85e9919dbf259b46b981e52bb533d36ee78c","abstract_canon_sha256":"0c6fbf5852ac9afb961a9abef8487722f2638a158a380ed52621d322f6ef9bba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:38.255789Z","signature_b64":"kOO3jwiCMNPeut8Idu6R8zu139D7r1aYMJ1PzCDXWVhk9xtJ7SuKZ4o72+wUNloI7aNaQxwT0vKJ9fgpWgkqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2650dcfffbde8ea504a4bd64ba58a40a89f4ce47f5689f8c4d7efd283848e417","last_reissued_at":"2026-07-05T07:53:38.255312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:38.255312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semidirect Product Decompositions for Periodic Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hiroyuki Seki, Kenji Hashimoto, Yusuke Inoue","submitted_at":"2024-03-08T06:30:25Z","abstract_excerpt":"The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\\Sigma\\Sigma)^*$ has period two because the length of a recursion (cycle) in its DFA must be even. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period $P$ if and only if its syntactic monoid is isomorphic to a submonoid of a semidirect product between a specific finite monoid and the cyclic group of order $P$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05088","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.05088/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.05088","created_at":"2026-07-05T07:53:38.255387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05088v1","created_at":"2026-07-05T07:53:38.255387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05088","created_at":"2026-07-05T07:53:38.255387+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZINZ77332HK","created_at":"2026-07-05T07:53:38.255387+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZINZ77332HKKBFE","created_at":"2026-07-05T07:53:38.255387+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZINZ773","created_at":"2026-07-05T07:53:38.255387+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20030","citing_title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK","json":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK.json","graph_json":"https://pith.science/api/pith-number/EZINZ77332HKKBFEXVSLUWFEBK/graph.json","events_json":"https://pith.science/api/pith-number/EZINZ77332HKKBFEXVSLUWFEBK/events.json","paper":"https://pith.science/paper/EZINZ773"},"agent_actions":{"view_html":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK","download_json":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK.json","view_paper":"https://pith.science/paper/EZINZ773","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05088&json=true","fetch_graph":"https://pith.science/api/pith-number/EZINZ77332HKKBFEXVSLUWFEBK/graph.json","fetch_events":"https://pith.science/api/pith-number/EZINZ77332HKKBFEXVSLUWFEBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK/action/storage_attestation","attest_author":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK/action/author_attestation","sign_citation":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK/action/citation_signature","submit_replication":"https://pith.science/pith/EZINZ77332HKKBFEXVSLUWFEBK/action/replication_record"}},"created_at":"2026-07-05T07:53:38.255387+00:00","updated_at":"2026-07-05T07:53:38.255387+00:00"}