{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NLX3NZQWERMKJQKKLP6J7LEGJH","short_pith_number":"pith:NLX3NZQW","canonical_record":{"source":{"id":"1301.4981","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-21T20:50:48Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a5c8a652ebdccff72f93fd11fbeab9c078cbe833e1fcb6e40b208b2a543c2568","abstract_canon_sha256":"fed0644dae7d5998431e684db88977f011962833b5f4c79c46d20e5580bf9037"},"schema_version":"1.0"},"canonical_sha256":"6aefb6e6162458a4c14a5bfc9fac8649e7b54ae06a1438843f2ea7b800a5445a","source":{"kind":"arxiv","id":"1301.4981","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4981","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4981v6","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4981","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"NLX3NZQWERMK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NLX3NZQWERMKJQKK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NLX3NZQW","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NLX3NZQWERMKJQKKLP6J7LEGJH","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4981","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-21T20:50:48Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a5c8a652ebdccff72f93fd11fbeab9c078cbe833e1fcb6e40b208b2a543c2568","abstract_canon_sha256":"fed0644dae7d5998431e684db88977f011962833b5f4c79c46d20e5580bf9037"},"schema_version":"1.0"},"canonical_sha256":"6aefb6e6162458a4c14a5bfc9fac8649e7b54ae06a1438843f2ea7b800a5445a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.678984Z","signature_b64":"K9LWOFfElcAQ5ZNr4vXwev8B98fw/7N6v7Yj6ZVmTqbGm3iKLWJ8njLIMOLAIMvyZdU+90ryDysMDpdLxoH1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aefb6e6162458a4c14a5bfc9fac8649e7b54ae06a1438843f2ea7b800a5445a","last_reissued_at":"2026-05-18T01:14:09.678386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.678386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4981","source_version":6,"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-18T01:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FK7Dje7fquGKmzbsj1aApz+6B2ufjOmvkswV7pkztaek2ICpjh1Zrzhi855MAYc4+OnzMk4jv7wMa4h14VveAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:22:21.415412Z"},"content_sha256":"3f3d249960d32b5d6f4073213c69d0effe8edf68d7816ff60b8d63b305b79d04","schema_version":"1.0","event_id":"sha256:3f3d249960d32b5d6f4073213c69d0effe8edf68d7816ff60b8d63b305b79d04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NLX3NZQWERMKJQKKLP6J7LEGJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The genus of regular languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Florian Deloup, Guillaume Bonfante","submitted_at":"2013-01-21T20:50:48Z","abstract_excerpt":"The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the genus for regular languages, the following questions are addressed. First, depending on the size of the alphabet, we provide upper and lower bounds on the genus of regular languages : we show that under a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4981","kind":"arxiv","version":6},"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-18T01:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fu6h+pOMGrNL1xp3J4p4/Urm6tJ20FdBROjAztYyJ+kN9SvZIjbGui0aqMH900wuqq9QjolqAUxhh75z4H+pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:22:21.416164Z"},"content_sha256":"6fa2eb0dfc035bcab7d4dd0cdde313b9578e4c8be297748ae743fb342920f03d","schema_version":"1.0","event_id":"sha256:6fa2eb0dfc035bcab7d4dd0cdde313b9578e4c8be297748ae743fb342920f03d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/bundle.json","state_url":"https://pith.science/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/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-31T04:22:21Z","links":{"resolver":"https://pith.science/pith/NLX3NZQWERMKJQKKLP6J7LEGJH","bundle":"https://pith.science/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/bundle.json","state":"https://pith.science/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLX3NZQWERMKJQKKLP6J7LEGJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NLX3NZQWERMKJQKKLP6J7LEGJH","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":"fed0644dae7d5998431e684db88977f011962833b5f4c79c46d20e5580bf9037","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-21T20:50:48Z","title_canon_sha256":"a5c8a652ebdccff72f93fd11fbeab9c078cbe833e1fcb6e40b208b2a543c2568"},"schema_version":"1.0","source":{"id":"1301.4981","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4981","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4981v6","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4981","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"NLX3NZQWERMK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NLX3NZQWERMKJQKK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NLX3NZQW","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:6fa2eb0dfc035bcab7d4dd0cdde313b9578e4c8be297748ae743fb342920f03d","target":"graph","created_at":"2026-05-18T01:14:09Z","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":"The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the genus for regular languages, the following questions are addressed. First, depending on the size of the alphabet, we provide upper and lower bounds on the genus of regular languages : we show that under a r","authors_text":"Florian Deloup, Guillaume Bonfante","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-21T20:50:48Z","title":"The genus of regular languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4981","kind":"arxiv","version":6},"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:3f3d249960d32b5d6f4073213c69d0effe8edf68d7816ff60b8d63b305b79d04","target":"record","created_at":"2026-05-18T01:14:09Z","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":"fed0644dae7d5998431e684db88977f011962833b5f4c79c46d20e5580bf9037","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-21T20:50:48Z","title_canon_sha256":"a5c8a652ebdccff72f93fd11fbeab9c078cbe833e1fcb6e40b208b2a543c2568"},"schema_version":"1.0","source":{"id":"1301.4981","kind":"arxiv","version":6}},"canonical_sha256":"6aefb6e6162458a4c14a5bfc9fac8649e7b54ae06a1438843f2ea7b800a5445a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aefb6e6162458a4c14a5bfc9fac8649e7b54ae06a1438843f2ea7b800a5445a","first_computed_at":"2026-05-18T01:14:09.678386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:09.678386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K9LWOFfElcAQ5ZNr4vXwev8B98fw/7N6v7Yj6ZVmTqbGm3iKLWJ8njLIMOLAIMvyZdU+90ryDysMDpdLxoH1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:09.678984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4981","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3d249960d32b5d6f4073213c69d0effe8edf68d7816ff60b8d63b305b79d04","sha256:6fa2eb0dfc035bcab7d4dd0cdde313b9578e4c8be297748ae743fb342920f03d"],"state_sha256":"c9766dc31c421eaa7fccece43fda205c1236916262a3a7b638c22adab385c228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcVTWrZSP1iH06NKMSlQ1qEZ3QGj5c6lg0b/GKwmGsVrbhKgEnHtikibQlVaaoO4hEA4o8Ns0aqObjOEAa9aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:22:21.419547Z","bundle_sha256":"98c85da23f5322c0558035914bb1ac93620c6494c90319759f4abf18134cd53c"}}