{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G4BYJCWDWIU27KPMMJPSFHYD2J","short_pith_number":"pith:G4BYJCWD","canonical_record":{"source":{"id":"1310.1841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T16:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"1041c67cf69d401351e9bf6718db5538e4a90decded5aca966bd9baa6848722d","abstract_canon_sha256":"51d916929576f613e881018abf8ee46ffa20ce6a2128ddc81833c65078727f51"},"schema_version":"1.0"},"canonical_sha256":"3703848ac3b229afa9ec625f229f03d26d41279d584004438b96386e808494c7","source":{"kind":"arxiv","id":"1310.1841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1841","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1841v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1841","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4BYJCWDWIU2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4BYJCWDWIU27KPM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4BYJCWD","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G4BYJCWDWIU27KPMMJPSFHYD2J","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T16:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"1041c67cf69d401351e9bf6718db5538e4a90decded5aca966bd9baa6848722d","abstract_canon_sha256":"51d916929576f613e881018abf8ee46ffa20ce6a2128ddc81833c65078727f51"},"schema_version":"1.0"},"canonical_sha256":"3703848ac3b229afa9ec625f229f03d26d41279d584004438b96386e808494c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.422217Z","signature_b64":"1dyg5ro0hZeYmhXfLGYMGIBXo6dFPoerAkuWZwZLTpDCQj4Gr76A+/W52ekSea0JsOqJe9oN689evsFl+SRLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3703848ac3b229afa9ec625f229f03d26d41279d584004438b96386e808494c7","last_reissued_at":"2026-05-18T03:11:10.421286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.421286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1841","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/mz1nBREPi0vHV6DNYvWlxFK/UClxqT1F7JRNM8gJWZe9Z8mWrRFoM1nxlN8CgEJhHo6YFSVX1gpRIgPzseBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:16:22.012948Z"},"content_sha256":"2aa6b9c9f44f08843bed43dfdcec54f83eb2440792714acc6cfec4651f632f6f","schema_version":"1.0","event_id":"sha256:2aa6b9c9f44f08843bed43dfdcec54f83eb2440792714acc6cfec4651f632f6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G4BYJCWDWIU27KPMMJPSFHYD2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric Groups and Quotient Complexity of Boolean Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Jason Bell, Nelma Moreira, Rog\\'erio Reis","submitted_at":"2013-10-07T16:06:22Z","abstract_excerpt":"The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition semigroups of the minimal deterministic automata accepting L and L' are the symmetric groups S_m and S_n of degrees m and n, respectively. Denote by o any binary boolean operation that is not a constant and not a function of one argument only. For m,n >= 2 with (m,n) not in {(2,2),(3,4),(4,3),(4,4)} we prove that the quotient complexity of LoL' is mn if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1841","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RmyzKZiLOVsuDi6+M055XrUZjQotjEeZayTqLtKk6mLk7xqIBokWHqKUPpC+59qMMlaDMs22lCtkHwJCUk6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:16:22.013304Z"},"content_sha256":"22fb1266654f82ee0a93e8a55ea3010b602442c45c546ad34291c7e82e968c87","schema_version":"1.0","event_id":"sha256:22fb1266654f82ee0a93e8a55ea3010b602442c45c546ad34291c7e82e968c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/bundle.json","state_url":"https://pith.science/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/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-30T07:16:22Z","links":{"resolver":"https://pith.science/pith/G4BYJCWDWIU27KPMMJPSFHYD2J","bundle":"https://pith.science/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/bundle.json","state":"https://pith.science/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4BYJCWDWIU27KPMMJPSFHYD2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G4BYJCWDWIU27KPMMJPSFHYD2J","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":"51d916929576f613e881018abf8ee46ffa20ce6a2128ddc81833c65078727f51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T16:06:22Z","title_canon_sha256":"1041c67cf69d401351e9bf6718db5538e4a90decded5aca966bd9baa6848722d"},"schema_version":"1.0","source":{"id":"1310.1841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1841","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1841v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1841","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4BYJCWDWIU2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4BYJCWDWIU27KPM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4BYJCWD","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:22fb1266654f82ee0a93e8a55ea3010b602442c45c546ad34291c7e82e968c87","target":"graph","created_at":"2026-05-18T03:11:10Z","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 quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition semigroups of the minimal deterministic automata accepting L and L' are the symmetric groups S_m and S_n of degrees m and n, respectively. Denote by o any binary boolean operation that is not a constant and not a function of one argument only. For m,n >= 2 with (m,n) not in {(2,2),(3,4),(4,3),(4,4)} we prove that the quotient complexity of LoL' is mn if","authors_text":"Janusz Brzozowski, Jason Bell, Nelma Moreira, Rog\\'erio Reis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T16:06:22Z","title":"Symmetric Groups and Quotient Complexity of Boolean Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1841","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:2aa6b9c9f44f08843bed43dfdcec54f83eb2440792714acc6cfec4651f632f6f","target":"record","created_at":"2026-05-18T03:11:10Z","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":"51d916929576f613e881018abf8ee46ffa20ce6a2128ddc81833c65078727f51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T16:06:22Z","title_canon_sha256":"1041c67cf69d401351e9bf6718db5538e4a90decded5aca966bd9baa6848722d"},"schema_version":"1.0","source":{"id":"1310.1841","kind":"arxiv","version":1}},"canonical_sha256":"3703848ac3b229afa9ec625f229f03d26d41279d584004438b96386e808494c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3703848ac3b229afa9ec625f229f03d26d41279d584004438b96386e808494c7","first_computed_at":"2026-05-18T03:11:10.421286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.421286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1dyg5ro0hZeYmhXfLGYMGIBXo6dFPoerAkuWZwZLTpDCQj4Gr76A+/W52ekSea0JsOqJe9oN689evsFl+SRLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.422217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa6b9c9f44f08843bed43dfdcec54f83eb2440792714acc6cfec4651f632f6f","sha256:22fb1266654f82ee0a93e8a55ea3010b602442c45c546ad34291c7e82e968c87"],"state_sha256":"155fa0e89a0a22644a08cfef703c2fe28896480b466da9ed622f189033806cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcQztu3zowlf7BLI5GSyJ5Y4BfIspmaBNWVZEWa6xupLzB15wLJAALGGYx+GYq5ZC5u8dWR6oky6IF5Um4PxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:16:22.016727Z","bundle_sha256":"fc09e48a36960502026e81009c7be2447a878604659962c234fce47c3f9c2212"}}