{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4P24DV2BTEW6RHQUB7EOUKYRXB","short_pith_number":"pith:4P24DV2B","canonical_record":{"source":{"id":"1012.3962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-17T19:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"935ec69d4c72dd084feb51b8c3f6a0f36f60253903039fccbe4c9d8f42ab612a","abstract_canon_sha256":"b02162ce71c1898632a174af6926ae47528985bb3751c077dc06d8a80aed47b0"},"schema_version":"1.0"},"canonical_sha256":"e3f5c1d741992de89e140fc8ea2b11b870bac297d34ccf5cb626c0eef2f3bd36","source":{"kind":"arxiv","id":"1012.3962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3962","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3962v1","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3962","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"4P24DV2BTEW6","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4P24DV2BTEW6RHQU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4P24DV2B","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4P24DV2BTEW6RHQUB7EOUKYRXB","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-17T19:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"935ec69d4c72dd084feb51b8c3f6a0f36f60253903039fccbe4c9d8f42ab612a","abstract_canon_sha256":"b02162ce71c1898632a174af6926ae47528985bb3751c077dc06d8a80aed47b0"},"schema_version":"1.0"},"canonical_sha256":"e3f5c1d741992de89e140fc8ea2b11b870bac297d34ccf5cb626c0eef2f3bd36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:03.496549Z","signature_b64":"OdrNp+dHjQnFD2wdqvIoa/AE7/DsWfd6099eN9tuj5xwHmIgk+KUTuuIpzl3u2yYLsE4MEPaNSqLl47b7kkPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f5c1d741992de89e140fc8ea2b11b870bac297d34ccf5cb626c0eef2f3bd36","last_reissued_at":"2026-05-18T04:33:03.496058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:03.496058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3962","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-18T04:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbNFUPWIOLwkZsxhl91rtnNlAGSinz33isN2WMZ2n6PuLMOa1CWRDVEs2blrhNqmT5DPpkG3JwGDye78zGvdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:20:16.810221Z"},"content_sha256":"d58956831325d6cf8f5ad7208432018b1bf3705f3b93c7959c9d74f537172809","schema_version":"1.0","event_id":"sha256:d58956831325d6cf8f5ad7208432018b1bf3705f3b93c7959c9d74f537172809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4P24DV2BTEW6RHQUB7EOUKYRXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quotient Complexity of Star-Free Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bo Liu, Janusz Brzozowski","submitted_at":"2010-12-17T19:05:24Z","abstract_excerpt":"The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3962","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-18T04:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZnAJtIL9BTxShqb7i9MzMTYGtNqjxVdqwTmgMr5ALP5CWhyBA2G5P5P0YCrkaYHoS4ZhIOYt02f2kGQySL6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:20:16.810908Z"},"content_sha256":"b3cc8968093a8e914c3c6fc8b0a49f9086f160a10be7730cd998c25712e3a3f6","schema_version":"1.0","event_id":"sha256:b3cc8968093a8e914c3c6fc8b0a49f9086f160a10be7730cd998c25712e3a3f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/bundle.json","state_url":"https://pith.science/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/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-31T18:20:16Z","links":{"resolver":"https://pith.science/pith/4P24DV2BTEW6RHQUB7EOUKYRXB","bundle":"https://pith.science/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/bundle.json","state":"https://pith.science/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4P24DV2BTEW6RHQUB7EOUKYRXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4P24DV2BTEW6RHQUB7EOUKYRXB","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":"b02162ce71c1898632a174af6926ae47528985bb3751c077dc06d8a80aed47b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-17T19:05:24Z","title_canon_sha256":"935ec69d4c72dd084feb51b8c3f6a0f36f60253903039fccbe4c9d8f42ab612a"},"schema_version":"1.0","source":{"id":"1012.3962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3962","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3962v1","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3962","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"4P24DV2BTEW6","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"4P24DV2BTEW6RHQU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"4P24DV2B","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:b3cc8968093a8e914c3c6fc8b0a49f9086f160a10be7730cd998c25712e3a3f6","target":"graph","created_at":"2026-05-18T04:33:03Z","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, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and sta","authors_text":"Bo Liu, Janusz Brzozowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-17T19:05:24Z","title":"Quotient Complexity of Star-Free Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3962","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:d58956831325d6cf8f5ad7208432018b1bf3705f3b93c7959c9d74f537172809","target":"record","created_at":"2026-05-18T04:33:03Z","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":"b02162ce71c1898632a174af6926ae47528985bb3751c077dc06d8a80aed47b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-17T19:05:24Z","title_canon_sha256":"935ec69d4c72dd084feb51b8c3f6a0f36f60253903039fccbe4c9d8f42ab612a"},"schema_version":"1.0","source":{"id":"1012.3962","kind":"arxiv","version":1}},"canonical_sha256":"e3f5c1d741992de89e140fc8ea2b11b870bac297d34ccf5cb626c0eef2f3bd36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3f5c1d741992de89e140fc8ea2b11b870bac297d34ccf5cb626c0eef2f3bd36","first_computed_at":"2026-05-18T04:33:03.496058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:03.496058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OdrNp+dHjQnFD2wdqvIoa/AE7/DsWfd6099eN9tuj5xwHmIgk+KUTuuIpzl3u2yYLsE4MEPaNSqLl47b7kkPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:03.496549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d58956831325d6cf8f5ad7208432018b1bf3705f3b93c7959c9d74f537172809","sha256:b3cc8968093a8e914c3c6fc8b0a49f9086f160a10be7730cd998c25712e3a3f6"],"state_sha256":"aa959e70c1e0e1a4604f2f9fd7289fc6fe34f6085febbb3363a26470c174dd16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmuWI8qH7QkpFtJiSX5oTTpPypI/+9UyWllekaGRiIEEVHmYA7VLjP18aIv4rm1KyvUqUsVjkuXX7CH9FuuEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:20:16.814571Z","bundle_sha256":"49717998272a785176ad92e54ac75cb2135cda3317a01310a6d277ad420641ce"}}