{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WDLNDKI4KQSNYTUSMJIXU3XAVS","short_pith_number":"pith:WDLNDKI4","canonical_record":{"source":{"id":"1201.0295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-31T18:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"32d87bedfefae029127a70cc155e061f63d625a617a604fcc24235d356d7587d","abstract_canon_sha256":"4ceb456fd08dd7c85f5289ce77c3e192bb3f448fb75d84f5af4220c70e48e247"},"schema_version":"1.0"},"canonical_sha256":"b0d6d1a91c5424dc4e9262517a6ee0acb39d21214fb828dbc50edb5ac8b1487a","source":{"kind":"arxiv","id":"1201.0295","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0295","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0295v2","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0295","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"WDLNDKI4KQSN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WDLNDKI4KQSNYTUS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WDLNDKI4","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WDLNDKI4KQSNYTUSMJIXU3XAVS","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-31T18:04:27Z","cross_cats_sorted":[],"title_canon_sha256":"32d87bedfefae029127a70cc155e061f63d625a617a604fcc24235d356d7587d","abstract_canon_sha256":"4ceb456fd08dd7c85f5289ce77c3e192bb3f448fb75d84f5af4220c70e48e247"},"schema_version":"1.0"},"canonical_sha256":"b0d6d1a91c5424dc4e9262517a6ee0acb39d21214fb828dbc50edb5ac8b1487a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:37.655978Z","signature_b64":"Hg1EYQX1tyFbCA1SEqoIXoIEivikm45m8JgcfuFEq3KTQb5pITCrpvGXr1DxSF1pWjy1JHVm75Qd76MgY9kWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d6d1a91c5424dc4e9262517a6ee0acb39d21214fb828dbc50edb5ac8b1487a","last_reissued_at":"2026-05-18T04:00:37.655188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:37.655188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0295","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-18T04:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BiRWd2foDhslGIPxajBncc8G3H8khauv0exzWpni0/XsDbPsQeNw2D4NwEJ615b+Qg2QSZeZ3kQ0Nf98Q556CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:26:27.117229Z"},"content_sha256":"4d2fc8ca38efcb2dca5ed4410175061e57efd23d87b1c6f93900a36477809473","schema_version":"1.0","event_id":"sha256:4d2fc8ca38efcb2dca5ed4410175061e57efd23d87b1c6f93900a36477809473"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WDLNDKI4KQSNYTUSMJIXU3XAVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quotient Complexities of Atoms of Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hellis Tamm, Janusz Brzozowski","submitted_at":"2011-12-31T18:04:27Z","abstract_excerpt":"An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same as the state complexity of L, is the number of quotients of L. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2^n-1 if r=0 or r=n, and 1+\\sum_{k=1}^{r} \\sum_{h=k+1}^{k+n-r} C_{h}^{n} \\cdot C_{k}^{h} otherwise, where C_j^i is the binomial coe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0295","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-18T04:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1PcBVk7fnoj8Jy9EmOSty3W5fjZ4+cMmADNNPcA0Ds62uOoRv74BOe+4Ki1r1Hhk3bX7psZL4Bg+ht24koMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:26:27.117594Z"},"content_sha256":"55680ead4f4ef335788295b2c2a4016be1ec9ce0a684e49a1b4ffaa7c7d7c18e","schema_version":"1.0","event_id":"sha256:55680ead4f4ef335788295b2c2a4016be1ec9ce0a684e49a1b4ffaa7c7d7c18e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/bundle.json","state_url":"https://pith.science/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/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-30T14:26:27Z","links":{"resolver":"https://pith.science/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS","bundle":"https://pith.science/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/bundle.json","state":"https://pith.science/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDLNDKI4KQSNYTUSMJIXU3XAVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WDLNDKI4KQSNYTUSMJIXU3XAVS","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":"4ceb456fd08dd7c85f5289ce77c3e192bb3f448fb75d84f5af4220c70e48e247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-31T18:04:27Z","title_canon_sha256":"32d87bedfefae029127a70cc155e061f63d625a617a604fcc24235d356d7587d"},"schema_version":"1.0","source":{"id":"1201.0295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0295","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0295v2","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0295","created_at":"2026-05-18T04:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"WDLNDKI4KQSN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WDLNDKI4KQSNYTUS","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WDLNDKI4","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:55680ead4f4ef335788295b2c2a4016be1ec9ce0a684e49a1b4ffaa7c7d7c18e","target":"graph","created_at":"2026-05-18T04:00:37Z","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":"An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same as the state complexity of L, is the number of quotients of L. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2^n-1 if r=0 or r=n, and 1+\\sum_{k=1}^{r} \\sum_{h=k+1}^{k+n-r} C_{h}^{n} \\cdot C_{k}^{h} otherwise, where C_j^i is the binomial coe","authors_text":"Hellis Tamm, Janusz Brzozowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-31T18:04:27Z","title":"Quotient Complexities of Atoms of Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0295","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:4d2fc8ca38efcb2dca5ed4410175061e57efd23d87b1c6f93900a36477809473","target":"record","created_at":"2026-05-18T04:00:37Z","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":"4ceb456fd08dd7c85f5289ce77c3e192bb3f448fb75d84f5af4220c70e48e247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-31T18:04:27Z","title_canon_sha256":"32d87bedfefae029127a70cc155e061f63d625a617a604fcc24235d356d7587d"},"schema_version":"1.0","source":{"id":"1201.0295","kind":"arxiv","version":2}},"canonical_sha256":"b0d6d1a91c5424dc4e9262517a6ee0acb39d21214fb828dbc50edb5ac8b1487a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0d6d1a91c5424dc4e9262517a6ee0acb39d21214fb828dbc50edb5ac8b1487a","first_computed_at":"2026-05-18T04:00:37.655188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:37.655188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hg1EYQX1tyFbCA1SEqoIXoIEivikm45m8JgcfuFEq3KTQb5pITCrpvGXr1DxSF1pWjy1JHVm75Qd76MgY9kWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:37.655978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d2fc8ca38efcb2dca5ed4410175061e57efd23d87b1c6f93900a36477809473","sha256:55680ead4f4ef335788295b2c2a4016be1ec9ce0a684e49a1b4ffaa7c7d7c18e"],"state_sha256":"711bcdd1c55ea2dccc8ea795300d099ef450de7990bfaaf0c7ac7897933bb309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0O+eeKs9YJDzJL1NdGC68E+Oo2CEw3E/BdHxr4W3qEFlk+hiASEIenvNr9toyYrYnufPLuc/j8LwhM8NFR1/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:26:27.119702Z","bundle_sha256":"7bd67c4929eea1187349e85e6c07855add07e06f7e1fe824fab6eafd6ec4e630"}}