{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CNJBNTCJNELR3XFJGWVTJ3J7CU","short_pith_number":"pith:CNJBNTCJ","canonical_record":{"source":{"id":"1301.2691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-12T15:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"a9900308a998366a2c596f1ef2b37a5204a1ac334b2a6bfae7cceb3bfe800123","abstract_canon_sha256":"dab29ebf884aaa65ead5e28d58ecc3d2f2fe49042baa40cf952a2b523da5bf60"},"schema_version":"1.0"},"canonical_sha256":"135216cc4969171ddca935ab34ed3f1534439f791b28dfb30b01d5e74539e2c3","source":{"kind":"arxiv","id":"1301.2691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2691","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2691v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2691","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"CNJBNTCJNELR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CNJBNTCJNELR3XFJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CNJBNTCJ","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CNJBNTCJNELR3XFJGWVTJ3J7CU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-12T15:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"a9900308a998366a2c596f1ef2b37a5204a1ac334b2a6bfae7cceb3bfe800123","abstract_canon_sha256":"dab29ebf884aaa65ead5e28d58ecc3d2f2fe49042baa40cf952a2b523da5bf60"},"schema_version":"1.0"},"canonical_sha256":"135216cc4969171ddca935ab34ed3f1534439f791b28dfb30b01d5e74539e2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.802199Z","signature_b64":"8raXDflEOBUFR9pVz4QOYj114egaj4LkNWCiM6+zgHeyp8SNuHELqB+pp4paXtJb+Lft1BHL2E0UwGUWLriIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"135216cc4969171ddca935ab34ed3f1534439f791b28dfb30b01d5e74539e2c3","last_reissued_at":"2026-05-18T03:21:23.801725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.801725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2691","source_version":2,"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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9Puz93Uhme2wlv9AxEc6VxnWtsymlvmoZSHcfCh40p4HG4EZYleZCCdfNbFh6i/rj0AtGgOWA2KXBTrkGcdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:05:59.548102Z"},"content_sha256":"26b0c3f99e5641269a8482740974a2445befec8a432726b36cb8cd5592e1ed15","schema_version":"1.0","event_id":"sha256:26b0c3f99e5641269a8482740974a2445befec8a432726b36cb8cd5592e1ed15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CNJBNTCJNELR3XFJGWVTJ3J7CU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultimate periodicity of b-recognisable sets : a quasilinear procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jacques Sakarovitch, Victor Marsault","submitted_at":"2013-01-12T15:07:25Z","abstract_excerpt":"It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986.\n  We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description.\n  This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2691","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"},"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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5tYO73WLD5oLd3oNrDldU2/2Kj8uUzZR4+rfZ/p/YtCWsQykDqQSL7+LdgLH+aPbOL8WRwD9mNs7zE12hgSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:05:59.548466Z"},"content_sha256":"42cf6865dbc63f57a9e52852e165ad2ae043bf63b637e72b2fe1b28cbb5aa075","schema_version":"1.0","event_id":"sha256:42cf6865dbc63f57a9e52852e165ad2ae043bf63b637e72b2fe1b28cbb5aa075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/bundle.json","state_url":"https://pith.science/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/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-06-23T17:05:59Z","links":{"resolver":"https://pith.science/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU","bundle":"https://pith.science/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/bundle.json","state":"https://pith.science/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNJBNTCJNELR3XFJGWVTJ3J7CU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CNJBNTCJNELR3XFJGWVTJ3J7CU","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":"dab29ebf884aaa65ead5e28d58ecc3d2f2fe49042baa40cf952a2b523da5bf60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-12T15:07:25Z","title_canon_sha256":"a9900308a998366a2c596f1ef2b37a5204a1ac334b2a6bfae7cceb3bfe800123"},"schema_version":"1.0","source":{"id":"1301.2691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2691","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2691v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2691","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"CNJBNTCJNELR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CNJBNTCJNELR3XFJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CNJBNTCJ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:42cf6865dbc63f57a9e52852e165ad2ae043bf63b637e72b2fe1b28cbb5aa075","target":"graph","created_at":"2026-05-18T03:21:23Z","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":"It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986.\n  We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description.\n  This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers.","authors_text":"Jacques Sakarovitch, Victor Marsault","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-12T15:07:25Z","title":"Ultimate periodicity of b-recognisable sets : a quasilinear procedure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2691","kind":"arxiv","version":2},"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:26b0c3f99e5641269a8482740974a2445befec8a432726b36cb8cd5592e1ed15","target":"record","created_at":"2026-05-18T03:21:23Z","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":"dab29ebf884aaa65ead5e28d58ecc3d2f2fe49042baa40cf952a2b523da5bf60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-12T15:07:25Z","title_canon_sha256":"a9900308a998366a2c596f1ef2b37a5204a1ac334b2a6bfae7cceb3bfe800123"},"schema_version":"1.0","source":{"id":"1301.2691","kind":"arxiv","version":2}},"canonical_sha256":"135216cc4969171ddca935ab34ed3f1534439f791b28dfb30b01d5e74539e2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"135216cc4969171ddca935ab34ed3f1534439f791b28dfb30b01d5e74539e2c3","first_computed_at":"2026-05-18T03:21:23.801725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.801725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8raXDflEOBUFR9pVz4QOYj114egaj4LkNWCiM6+zgHeyp8SNuHELqB+pp4paXtJb+Lft1BHL2E0UwGUWLriIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.802199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26b0c3f99e5641269a8482740974a2445befec8a432726b36cb8cd5592e1ed15","sha256:42cf6865dbc63f57a9e52852e165ad2ae043bf63b637e72b2fe1b28cbb5aa075"],"state_sha256":"e8caedbecc50fedd8e357dba10178870bfbe5635da34c11e7c1cf1e751381691"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfOded2UY5RhsOhxz4jDBCFHV56XWfUxoz1xbeK8cQf8XDga/DgZLYThfJ9VtkgfOQ+QezOvh38zlnAHIb6pDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:05:59.550390Z","bundle_sha256":"f212ddaa75ea1c13e04b84dbec11a1fc95a96518c5a30e10a1dc588f516f6a8a"}}