{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CQI3MEY5LKED2VSY6ZZ75IYM4G","short_pith_number":"pith:CQI3MEY5","canonical_record":{"source":{"id":"1405.5611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"0d0c9d96df5ab4c6057e310a73dd370e1e5e2b3828b5d998c93ce6c13738804a","abstract_canon_sha256":"40b46b7dca95a91373d04357327d87395088038664000c13266bb3b6461bdc97"},"schema_version":"1.0"},"canonical_sha256":"1411b6131d5a883d5658f673fea30ce18bbea71db949bc905b82916f1d9c5406","source":{"kind":"arxiv","id":"1405.5611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5611","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5611v1","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5611","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"CQI3MEY5LKED","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CQI3MEY5LKED2VSY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CQI3MEY5","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CQI3MEY5LKED2VSY6ZZ75IYM4G","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"0d0c9d96df5ab4c6057e310a73dd370e1e5e2b3828b5d998c93ce6c13738804a","abstract_canon_sha256":"40b46b7dca95a91373d04357327d87395088038664000c13266bb3b6461bdc97"},"schema_version":"1.0"},"canonical_sha256":"1411b6131d5a883d5658f673fea30ce18bbea71db949bc905b82916f1d9c5406","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:16.148123Z","signature_b64":"ASpyykvIgWR1L4A/TH1jZzvsgFSH9mcBA7oD7plHtflJiGty0SDhsIpe4CTa0FKYNP1W/tfLPpwDY8WczKUuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1411b6131d5a883d5658f673fea30ce18bbea71db949bc905b82916f1d9c5406","last_reissued_at":"2026-05-18T02:51:16.147550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:16.147550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5611","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-18T02:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kEtIcPK8NgxRpEb4ZMUtZWMh2oVjkj2LTor6nddgUDycClSgX/BzAnUqOhRnUqsC/CICi4et3Rb0LDuWaQBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:24:21.632592Z"},"content_sha256":"81535432296ad0a85be9aaa9d467437aac577aa35262db3e8bd322968d465b36","schema_version":"1.0","event_id":"sha256:81535432296ad0a85be9aaa9d467437aac577aa35262db3e8bd322968d465b36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CQI3MEY5LKED2VSY6ZZ75IYM4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Circuit Complexity of Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Maris Valdats","submitted_at":"2014-05-22T02:15:10Z","abstract_excerpt":"In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ exponentially. In some cases minimization of DFA can lead to an exponential increase in BC-complexity, on the other hand BC-complexity of DFAs with a large state space which are obtained by some standard constructions (determinization of NFA, language operations), is reasonably small. But our main result is the analogue of the \"Shannon effect\" for finite auto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5611","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-18T02:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uk3w1TYHcwrgbJZIVMNLDW+qr6yew/b6sAkBYlX3JBOoII6GyaW2KFvoWZHclS9Y1HWQS0WcUZxf6bEqRthwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:24:21.633330Z"},"content_sha256":"d67706af77442de25c74a8a44cb4ca6e1eac1abde535e013ab43f5d346921ac8","schema_version":"1.0","event_id":"sha256:d67706af77442de25c74a8a44cb4ca6e1eac1abde535e013ab43f5d346921ac8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/bundle.json","state_url":"https://pith.science/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/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-12T02:24:21Z","links":{"resolver":"https://pith.science/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G","bundle":"https://pith.science/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/bundle.json","state":"https://pith.science/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQI3MEY5LKED2VSY6ZZ75IYM4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CQI3MEY5LKED2VSY6ZZ75IYM4G","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":"40b46b7dca95a91373d04357327d87395088038664000c13266bb3b6461bdc97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:15:10Z","title_canon_sha256":"0d0c9d96df5ab4c6057e310a73dd370e1e5e2b3828b5d998c93ce6c13738804a"},"schema_version":"1.0","source":{"id":"1405.5611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5611","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5611v1","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5611","created_at":"2026-05-18T02:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"CQI3MEY5LKED","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CQI3MEY5LKED2VSY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CQI3MEY5","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d67706af77442de25c74a8a44cb4ca6e1eac1abde535e013ab43f5d346921ac8","target":"graph","created_at":"2026-05-18T02:51:16Z","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":"In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ exponentially. In some cases minimization of DFA can lead to an exponential increase in BC-complexity, on the other hand BC-complexity of DFAs with a large state space which are obtained by some standard constructions (determinization of NFA, language operations), is reasonably small. But our main result is the analogue of the \"Shannon effect\" for finite auto","authors_text":"Maris Valdats","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:15:10Z","title":"Boolean Circuit Complexity of Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5611","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:81535432296ad0a85be9aaa9d467437aac577aa35262db3e8bd322968d465b36","target":"record","created_at":"2026-05-18T02:51:16Z","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":"40b46b7dca95a91373d04357327d87395088038664000c13266bb3b6461bdc97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:15:10Z","title_canon_sha256":"0d0c9d96df5ab4c6057e310a73dd370e1e5e2b3828b5d998c93ce6c13738804a"},"schema_version":"1.0","source":{"id":"1405.5611","kind":"arxiv","version":1}},"canonical_sha256":"1411b6131d5a883d5658f673fea30ce18bbea71db949bc905b82916f1d9c5406","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1411b6131d5a883d5658f673fea30ce18bbea71db949bc905b82916f1d9c5406","first_computed_at":"2026-05-18T02:51:16.147550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:16.147550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASpyykvIgWR1L4A/TH1jZzvsgFSH9mcBA7oD7plHtflJiGty0SDhsIpe4CTa0FKYNP1W/tfLPpwDY8WczKUuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:16.148123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81535432296ad0a85be9aaa9d467437aac577aa35262db3e8bd322968d465b36","sha256:d67706af77442de25c74a8a44cb4ca6e1eac1abde535e013ab43f5d346921ac8"],"state_sha256":"fcd2443cf79ea7aa78db1becd303bf2557cf672895e4801bd92a51247971dbbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQACDYi0YYQWpVZVC/5Fqe2aKHwiRsOFWXlbq2Jt8vcgwqICtBRuj6OqSEKlNmizi39BRDGUFM9Rf7TQj/o4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:24:21.638127Z","bundle_sha256":"9301c4b25bf3af0caa8d9fd8af3345a12f6ef60798c7a1aa109343132203e23c"}}