{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:F6FPFZRHQWE3ZETT6YXHOLKJIW","short_pith_number":"pith:F6FPFZRH","canonical_record":{"source":{"id":"1006.4843","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"53908e6dae4c858cebaaaf4cde76fac9cc75387de0e841fb5eba58b3eef23d48","abstract_canon_sha256":"d1d04e822ce429e3f2f2a7c37cd747dabaa0006c3cb7f3343e0b41aa6ebcf184"},"schema_version":"1.0"},"canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","source":{"kind":"arxiv","id":"1006.4843","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4843","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4843v3","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4843","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"F6FPFZRHQWE3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F6FPFZRHQWE3ZETT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F6FPFZRH","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:F6FPFZRHQWE3ZETT6YXHOLKJIW","target":"record","payload":{"canonical_record":{"source":{"id":"1006.4843","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"53908e6dae4c858cebaaaf4cde76fac9cc75387de0e841fb5eba58b3eef23d48","abstract_canon_sha256":"d1d04e822ce429e3f2f2a7c37cd747dabaa0006c3cb7f3343e0b41aa6ebcf184"},"schema_version":"1.0"},"canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:11.461489Z","signature_b64":"V3durz5LNwTXJwb2UuCJ7MmwSoHI86xOLOr+7htt8azA5ugZrKyd/lFYVLvdHeV8lbBsxleul6DF1Yrw1RKlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","last_reissued_at":"2026-05-18T04:22:11.461095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:11.461095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.4843","source_version":3,"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:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGj9EyrXU16Yq8Bjga5tTZa8Iebk6jWJL5TTJP8LOEfeyi3OAnKSVw4KioWGY5Qmt6FeJw1oDwWopWICCw1sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:21:55.067457Z"},"content_sha256":"e64731699c11c6efd284dcbcbd823563980d2a543eb3dff6af92e51bf3f722e3","schema_version":"1.0","event_id":"sha256:e64731699c11c6efd284dcbcbd823563980d2a543eb3dff6af92e51bf3f722e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:F6FPFZRHQWE3ZETT6YXHOLKJIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Baiyu Li, Galina Jir\\'askov\\'a, Janusz Brzozowski, Joshua Smith","submitted_at":"2010-06-24T17:35:17Z","abstract_excerpt":"A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where \"subword\" means \"subsequence\". A language is bifix-free if it is both prefix- and suffix-free. We study the quotient complexity, more commonly known as state complexity, of operations in the classes of bifix-, factor-, and subword-free regular languages. We find tight upper bounds on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4843","kind":"arxiv","version":3},"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:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bszFUKJB5R7whtnp+bSWYK0o04W94932Dl6UBHqOxp8MoJbM1BRad+jbX8XSFFhOqDlDBWsLDOVUfCQN2QU0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:21:55.067816Z"},"content_sha256":"187665b0945b39eefc696b226af5bddf072fb37db84323c6b6038678deb5bbab","schema_version":"1.0","event_id":"sha256:187665b0945b39eefc696b226af5bddf072fb37db84323c6b6038678deb5bbab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/bundle.json","state_url":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/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-30T19:21:55Z","links":{"resolver":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW","bundle":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/bundle.json","state":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F6FPFZRHQWE3ZETT6YXHOLKJIW","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":"d1d04e822ce429e3f2f2a7c37cd747dabaa0006c3cb7f3343e0b41aa6ebcf184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","title_canon_sha256":"53908e6dae4c858cebaaaf4cde76fac9cc75387de0e841fb5eba58b3eef23d48"},"schema_version":"1.0","source":{"id":"1006.4843","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4843","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4843v3","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4843","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"F6FPFZRHQWE3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F6FPFZRHQWE3ZETT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F6FPFZRH","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:187665b0945b39eefc696b226af5bddf072fb37db84323c6b6038678deb5bbab","target":"graph","created_at":"2026-05-18T04:22:11Z","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":"A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where \"subword\" means \"subsequence\". A language is bifix-free if it is both prefix- and suffix-free. We study the quotient complexity, more commonly known as state complexity, of operations in the classes of bifix-, factor-, and subword-free regular languages. We find tight upper bounds on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of l","authors_text":"Baiyu Li, Galina Jir\\'askov\\'a, Janusz Brzozowski, Joshua Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","title":"Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4843","kind":"arxiv","version":3},"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:e64731699c11c6efd284dcbcbd823563980d2a543eb3dff6af92e51bf3f722e3","target":"record","created_at":"2026-05-18T04:22:11Z","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":"d1d04e822ce429e3f2f2a7c37cd747dabaa0006c3cb7f3343e0b41aa6ebcf184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","title_canon_sha256":"53908e6dae4c858cebaaaf4cde76fac9cc75387de0e841fb5eba58b3eef23d48"},"schema_version":"1.0","source":{"id":"1006.4843","kind":"arxiv","version":3}},"canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","first_computed_at":"2026-05-18T04:22:11.461095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:11.461095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3durz5LNwTXJwb2UuCJ7MmwSoHI86xOLOr+7htt8azA5ugZrKyd/lFYVLvdHeV8lbBsxleul6DF1Yrw1RKlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:11.461489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.4843","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64731699c11c6efd284dcbcbd823563980d2a543eb3dff6af92e51bf3f722e3","sha256:187665b0945b39eefc696b226af5bddf072fb37db84323c6b6038678deb5bbab"],"state_sha256":"a01877b978cc33bb49a3923d99fee2b315f69b67de71ca01a6331a68c86a6605"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dqhFWoDNsJnFvBODPRzHUk7bJdv//7T8oaWopqp8BNSQQcmJ4GrzHmUCjjXU8DRuueKSTMOTD5nVpXuq6IjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:21:55.069929Z","bundle_sha256":"3ca4967a56189e31bea7ecbb59430d20268c2d60e303d25762d179c493408344"}}