{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OHH5MZZSZU7DB37KDJVLL2JG2R","short_pith_number":"pith:OHH5MZZS","canonical_record":{"source":{"id":"1306.3492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T19:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"99f6d00be001caa49d883d9117e9cb89a3d1a60412dadfe726882ca01625cda3","abstract_canon_sha256":"937745aa71f272f84af21189bdaced8b60d0a4ca3520f5b64d15fb7b8b809221"},"schema_version":"1.0"},"canonical_sha256":"71cfd66732cd3e30efea1a6ab5e926d44856971aaa7f88d31408b13b80e533b2","source":{"kind":"arxiv","id":"1306.3492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3492","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3492v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3492","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"OHH5MZZSZU7D","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OHH5MZZSZU7DB37K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OHH5MZZS","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OHH5MZZSZU7DB37KDJVLL2JG2R","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T19:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"99f6d00be001caa49d883d9117e9cb89a3d1a60412dadfe726882ca01625cda3","abstract_canon_sha256":"937745aa71f272f84af21189bdaced8b60d0a4ca3520f5b64d15fb7b8b809221"},"schema_version":"1.0"},"canonical_sha256":"71cfd66732cd3e30efea1a6ab5e926d44856971aaa7f88d31408b13b80e533b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:57.537942Z","signature_b64":"3h6qh6PLMTaxjao/1pOOA68rZpvOBuYYPbkAf9FaXxjcUsbLZFqJTdPcUet8qsMfysZGWC5AnTmSCNuw61WFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71cfd66732cd3e30efea1a6ab5e926d44856971aaa7f88d31408b13b80e533b2","last_reissued_at":"2026-05-18T03:20:57.537259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:57.537259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3492","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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFH6/ihPFq1dFl2SSW0yCYllC5B+OlQ+GdK8o3EcGGDjlaxxw1cq35LSONj2CLzGYBbgYUNrlcGUxvdsT27vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:38:23.764833Z"},"content_sha256":"742039871620fe4b42fdbfe79101cee6ab4745fee520bdf0cad5213815e6502d","schema_version":"1.0","event_id":"sha256:742039871620fe4b42fdbfe79101cee6ab4745fee520bdf0cad5213815e6502d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OHH5MZZSZU7DB37KDJVLL2JG2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Syntactic Complexity of Circular Semi-Flower Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"K. V. Krishna, Shubh Narayan Singh","submitted_at":"2013-06-14T19:28:58Z","abstract_excerpt":"We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are accepted by circular semi-flower automata (CSFA). Here, we show that the syntactic complexity of CSFA with at most one `branch point going in' (bpi) is linear. Further, we prove that the syntactic complexity of $n$-state CSFA with two bpis over a binary alphabet is $2n(n+1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3492","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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZmJgvzQ4qx3y20a9TMTATsuQEFodOrm6lfNwfo6CdMoJ4ZE3iaPYy1ctN5kqlbQZHr5USEfBweyLaRlSgnPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:38:23.765171Z"},"content_sha256":"fe23c002ec521b630f14628a018816db96361fceedd890e26d4040e7cd92e3d4","schema_version":"1.0","event_id":"sha256:fe23c002ec521b630f14628a018816db96361fceedd890e26d4040e7cd92e3d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/bundle.json","state_url":"https://pith.science/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/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-24T06:38:23Z","links":{"resolver":"https://pith.science/pith/OHH5MZZSZU7DB37KDJVLL2JG2R","bundle":"https://pith.science/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/bundle.json","state":"https://pith.science/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHH5MZZSZU7DB37KDJVLL2JG2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OHH5MZZSZU7DB37KDJVLL2JG2R","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":"937745aa71f272f84af21189bdaced8b60d0a4ca3520f5b64d15fb7b8b809221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T19:28:58Z","title_canon_sha256":"99f6d00be001caa49d883d9117e9cb89a3d1a60412dadfe726882ca01625cda3"},"schema_version":"1.0","source":{"id":"1306.3492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3492","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3492v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3492","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"OHH5MZZSZU7D","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OHH5MZZSZU7DB37K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OHH5MZZS","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:fe23c002ec521b630f14628a018816db96361fceedd890e26d4040e7cd92e3d4","target":"graph","created_at":"2026-05-18T03:20:57Z","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":"We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are accepted by circular semi-flower automata (CSFA). Here, we show that the syntactic complexity of CSFA with at most one `branch point going in' (bpi) is linear. Further, we prove that the syntactic complexity of $n$-state CSFA with two bpis over a binary alphabet is $2n(n+1)$.","authors_text":"K. V. Krishna, Shubh Narayan Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T19:28:58Z","title":"Syntactic Complexity of Circular Semi-Flower Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3492","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:742039871620fe4b42fdbfe79101cee6ab4745fee520bdf0cad5213815e6502d","target":"record","created_at":"2026-05-18T03:20:57Z","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":"937745aa71f272f84af21189bdaced8b60d0a4ca3520f5b64d15fb7b8b809221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-14T19:28:58Z","title_canon_sha256":"99f6d00be001caa49d883d9117e9cb89a3d1a60412dadfe726882ca01625cda3"},"schema_version":"1.0","source":{"id":"1306.3492","kind":"arxiv","version":1}},"canonical_sha256":"71cfd66732cd3e30efea1a6ab5e926d44856971aaa7f88d31408b13b80e533b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71cfd66732cd3e30efea1a6ab5e926d44856971aaa7f88d31408b13b80e533b2","first_computed_at":"2026-05-18T03:20:57.537259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:57.537259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3h6qh6PLMTaxjao/1pOOA68rZpvOBuYYPbkAf9FaXxjcUsbLZFqJTdPcUet8qsMfysZGWC5AnTmSCNuw61WFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:57.537942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:742039871620fe4b42fdbfe79101cee6ab4745fee520bdf0cad5213815e6502d","sha256:fe23c002ec521b630f14628a018816db96361fceedd890e26d4040e7cd92e3d4"],"state_sha256":"2939f0f728651c8066baae4aeb7f651233f8ea4100c46d96ff6f6f40a0dda550"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAQ8jumliHe0IBRC2ycuxXVHOHItHXv1uVDKllKEUO3DJA4Sc3DHz7h9n+3keOHiA/Os4lQPt2JXLwLnPKcLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:38:23.767043Z","bundle_sha256":"072f14a3d3d1a650a89f6a5f7689bf9e417b97e9818377f5d12188812878e2da"}}