{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4HFT5Z7EMMZ5E53CYV575WOXZD","short_pith_number":"pith:4HFT5Z7E","schema_version":"1.0","canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","source":{"kind":"arxiv","id":"1702.03715","version":1},"attestation_state":"computed","paper":{"title":"An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"Bernard Boigelot, Isabelle Mainz, Michel Rigo, Victor Marsault","submitted_at":"2017-02-13T10:51:45Z","abstract_excerpt":"Given an integer base $b>1$, a set of integers is represented in base $b$ by a language over $\\{0,1,...,b-1\\}$. The set is said to be $b$-recognisable if its representation is a regular language. It is known that eventually periodic sets are $b$-recognisable in every base $b$, and Cobham's theorem implies the converse: no other set is $b$-recognisable in every base $b$.\n  We are interested in deciding whether a $b$-recognisable set of integers (given as a finite automaton) is eventually periodic. Honkala showed that this problem decidable in 1986 and recent developments give efficient decision"},"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":"1702.03715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-13T10:51:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d009d677e6a8f28a2eccabeb886789d724b56b80759968cd2bec1cda6b4d6507","abstract_canon_sha256":"799a287f5c1214ddb1062f277467473a495c75a9ed4ccd488a3fdb9d10b32d71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:53.145354Z","signature_b64":"bCjk+4JU47LEDLtLReFBMXVC73QRaNbRYFrptdr4FRpRrNNiYjZzJBMrnCXw5egB6DvcnPFIu07qYKb9aATeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","last_reissued_at":"2026-05-18T00:50:53.144739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:53.144739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"Bernard Boigelot, Isabelle Mainz, Michel Rigo, Victor Marsault","submitted_at":"2017-02-13T10:51:45Z","abstract_excerpt":"Given an integer base $b>1$, a set of integers is represented in base $b$ by a language over $\\{0,1,...,b-1\\}$. The set is said to be $b$-recognisable if its representation is a regular language. It is known that eventually periodic sets are $b$-recognisable in every base $b$, and Cobham's theorem implies the converse: no other set is $b$-recognisable in every base $b$.\n  We are interested in deciding whether a $b$-recognisable set of integers (given as a finite automaton) is eventually periodic. Honkala showed that this problem decidable in 1986 and recent developments give efficient decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03715","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":"1702.03715","created_at":"2026-05-18T00:50:53.144811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03715v1","created_at":"2026-05-18T00:50:53.144811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03715","created_at":"2026-05-18T00:50:53.144811+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HFT5Z7EMMZ5","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HFT5Z7EMMZ5E53C","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HFT5Z7E","created_at":"2026-05-18T12:30:58.224056+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/4HFT5Z7EMMZ5E53CYV575WOXZD","json":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD.json","graph_json":"https://pith.science/api/pith-number/4HFT5Z7EMMZ5E53CYV575WOXZD/graph.json","events_json":"https://pith.science/api/pith-number/4HFT5Z7EMMZ5E53CYV575WOXZD/events.json","paper":"https://pith.science/paper/4HFT5Z7E"},"agent_actions":{"view_html":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD","download_json":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD.json","view_paper":"https://pith.science/paper/4HFT5Z7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03715&json=true","fetch_graph":"https://pith.science/api/pith-number/4HFT5Z7EMMZ5E53CYV575WOXZD/graph.json","fetch_events":"https://pith.science/api/pith-number/4HFT5Z7EMMZ5E53CYV575WOXZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/action/storage_attestation","attest_author":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/action/author_attestation","sign_citation":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/action/citation_signature","submit_replication":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/action/replication_record"}},"created_at":"2026-05-18T00:50:53.144811+00:00","updated_at":"2026-05-18T00:50:53.144811+00:00"}