{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4HFT5Z7EMMZ5E53CYV575WOXZD","short_pith_number":"pith:4HFT5Z7E","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"},"canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","source":{"kind":"arxiv","id":"1702.03715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03715","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03715v1","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03715","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HFT5Z7EMMZ5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4HFT5Z7EMMZ5E53C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4HFT5Z7E","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4HFT5Z7EMMZ5E53CYV575WOXZD","target":"record","payload":{"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"},"canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","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"},"source_kind":"arxiv","source_id":"1702.03715","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQuYQoOmeGLWUXdBIyFuq77d1Q3/G6E+twgeKGdOL3W9hwvnzupwCjQp1VftMOGSKTrs0gjkTwb4kc+lZdU7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:06:06.471765Z"},"content_sha256":"813bd5c35908952d9cc3a5517e41e5d5559a7e77c2507075504df784a991cbd9","schema_version":"1.0","event_id":"sha256:813bd5c35908952d9cc3a5517e41e5d5559a7e77c2507075504df784a991cbd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4HFT5Z7EMMZ5E53CYV575WOXZD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EllFMd3pYm6E4EsaBUPFTqdTcWFRfz/gLOkXNmtvZbVA2/EFg1C+YfDygq0f/zzNrtoAiAJ4c75iEoEjYIA+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:06:06.472121Z"},"content_sha256":"6857814a593433ad255fb331cbbb4432445e4135e0fb24b2c8cbbd4297a04381","schema_version":"1.0","event_id":"sha256:6857814a593433ad255fb331cbbb4432445e4135e0fb24b2c8cbbd4297a04381"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/bundle.json","state_url":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T05:06:06Z","links":{"resolver":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD","bundle":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/bundle.json","state":"https://pith.science/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HFT5Z7EMMZ5E53CYV575WOXZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4HFT5Z7EMMZ5E53CYV575WOXZD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"799a287f5c1214ddb1062f277467473a495c75a9ed4ccd488a3fdb9d10b32d71","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-13T10:51:45Z","title_canon_sha256":"d009d677e6a8f28a2eccabeb886789d724b56b80759968cd2bec1cda6b4d6507"},"schema_version":"1.0","source":{"id":"1702.03715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03715","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03715v1","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03715","created_at":"2026-05-18T00:50:53Z"},{"alias_kind":"pith_short_12","alias_value":"4HFT5Z7EMMZ5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4HFT5Z7EMMZ5E53C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4HFT5Z7E","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:6857814a593433ad255fb331cbbb4432445e4135e0fb24b2c8cbbd4297a04381","target":"graph","created_at":"2026-05-18T00:50:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bernard Boigelot, Isabelle Mainz, Michel Rigo, Victor Marsault","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-13T10:51:45Z","title":"An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03715","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:813bd5c35908952d9cc3a5517e41e5d5559a7e77c2507075504df784a991cbd9","target":"record","created_at":"2026-05-18T00:50:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"799a287f5c1214ddb1062f277467473a495c75a9ed4ccd488a3fdb9d10b32d71","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-13T10:51:45Z","title_canon_sha256":"d009d677e6a8f28a2eccabeb886789d724b56b80759968cd2bec1cda6b4d6507"},"schema_version":"1.0","source":{"id":"1702.03715","kind":"arxiv","version":1}},"canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1cb3ee7e46333d27762c57bfed9d7c8c07a0dde91c9d8db423502848a8b96d3","first_computed_at":"2026-05-18T00:50:53.144739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:53.144739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCjk+4JU47LEDLtLReFBMXVC73QRaNbRYFrptdr4FRpRrNNiYjZzJBMrnCXw5egB6DvcnPFIu07qYKb9aATeAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:53.145354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:813bd5c35908952d9cc3a5517e41e5d5559a7e77c2507075504df784a991cbd9","sha256:6857814a593433ad255fb331cbbb4432445e4135e0fb24b2c8cbbd4297a04381"],"state_sha256":"c3dcaf105a70bdeee57ddbf562e69561bdc36933dc2f131a5d2f89562157d2f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/KBIxEzyOdVfggv0L1xhkMbboN2aiXuMBIX/e3W9VGU0yJ1IjVpaERiXqCEL4dBX0gHfYV3TZIYYNaPD6dnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:06:06.474398Z","bundle_sha256":"113f9450e8ebed96c0ceda200d12ffb6f674c9ef2d207a24b690ddb91e5a975f"}}