{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GFTBOFEGXAHQOHCGEQPZKGJ7W6","short_pith_number":"pith:GFTBOFEG","canonical_record":{"source":{"id":"1405.1107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-06T00:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"41cd94925e929243c810cd8eaff6eaebe2256bcd0b1d64774a6200d477242a3a","abstract_canon_sha256":"c0cbf35d254c644f4f8dfc74a3207f64a95e411de276aa96d253fef2c5425a22"},"schema_version":"1.0"},"canonical_sha256":"3166171486b80f071c46241f95193fb799f188783c4cf57cd3c27140daf18f65","source":{"kind":"arxiv","id":"1405.1107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1107","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1107v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1107","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"GFTBOFEGXAHQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFTBOFEGXAHQOHCG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFTBOFEG","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GFTBOFEGXAHQOHCGEQPZKGJ7W6","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-06T00:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"41cd94925e929243c810cd8eaff6eaebe2256bcd0b1d64774a6200d477242a3a","abstract_canon_sha256":"c0cbf35d254c644f4f8dfc74a3207f64a95e411de276aa96d253fef2c5425a22"},"schema_version":"1.0"},"canonical_sha256":"3166171486b80f071c46241f95193fb799f188783c4cf57cd3c27140daf18f65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:33.488903Z","signature_b64":"YtnJSm8XOCgAugQ6O4x8WC/WUHMIYJneEYO0T0LbF/MAm45kaBqBY4vlIVBU8rzNCgF0ZYZ23dGn19p0Tbk4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3166171486b80f071c46241f95193fb799f188783c4cf57cd3c27140daf18f65","last_reissued_at":"2026-05-18T02:52:33.488432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:33.488432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1107","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NAmLExCrmYJh6PjMWZl8YLHyfJklrc75mhdx6kFt+fiuz696xw7219DAcG1VxIqkJJQs62q6VMKlmkncz0lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:27:23.770463Z"},"content_sha256":"bbc9f9f10b5146093a60d222faf5bae96b9bc9cf1b6f5a61ffc050e8eedaf0e4","schema_version":"1.0","event_id":"sha256:bbc9f9f10b5146093a60d222faf5bae96b9bc9cf1b6f5a61ffc050e8eedaf0e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GFTBOFEGXAHQOHCGEQPZKGJ7W6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On state complexity of unions of binary factor-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Szabolcs Ivan","submitted_at":"2014-05-06T00:10:08Z","abstract_excerpt":"It has been conjectured in 2011 by Brzozowski et al. that if $K$ and $L$ are factor-free regular languages over a binary alphabet having state complexity $m$ and $n$, resp, then the state complexity of $K\\cup L$ is at most $mn-(m+n)+3-\\min\\{m,n\\}$.\n  We disprove this conjecture by giving a lower bound of $mn-(m+n)-2-\\lfloor\\frac{\\min\\{m,n\\}-2}{2}\\rfloor$, which exceeds the conjectured bound whenever $\\min\\{m,n\\}\\geq 10$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1107","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qD3w8Ge8TxOSCMZLTMSQQd8q0EhWQ80YzjBn8alUEBaPdG9sl5zfy/rdO8noy1zGE2URnB0bLxEMOnZbDBU7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:27:23.770814Z"},"content_sha256":"1123f8dfda3ed842219b1c52f9f30bb273ae6565817e0a40550836c7f8beb99f","schema_version":"1.0","event_id":"sha256:1123f8dfda3ed842219b1c52f9f30bb273ae6565817e0a40550836c7f8beb99f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/bundle.json","state_url":"https://pith.science/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/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-24T09:27:23Z","links":{"resolver":"https://pith.science/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6","bundle":"https://pith.science/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/bundle.json","state":"https://pith.science/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFTBOFEGXAHQOHCGEQPZKGJ7W6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GFTBOFEGXAHQOHCGEQPZKGJ7W6","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":"c0cbf35d254c644f4f8dfc74a3207f64a95e411de276aa96d253fef2c5425a22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-06T00:10:08Z","title_canon_sha256":"41cd94925e929243c810cd8eaff6eaebe2256bcd0b1d64774a6200d477242a3a"},"schema_version":"1.0","source":{"id":"1405.1107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1107","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1107v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1107","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"GFTBOFEGXAHQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFTBOFEGXAHQOHCG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFTBOFEG","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:1123f8dfda3ed842219b1c52f9f30bb273ae6565817e0a40550836c7f8beb99f","target":"graph","created_at":"2026-05-18T02:52:33Z","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":"It has been conjectured in 2011 by Brzozowski et al. that if $K$ and $L$ are factor-free regular languages over a binary alphabet having state complexity $m$ and $n$, resp, then the state complexity of $K\\cup L$ is at most $mn-(m+n)+3-\\min\\{m,n\\}$.\n  We disprove this conjecture by giving a lower bound of $mn-(m+n)-2-\\lfloor\\frac{\\min\\{m,n\\}-2}{2}\\rfloor$, which exceeds the conjectured bound whenever $\\min\\{m,n\\}\\geq 10$.","authors_text":"Szabolcs Ivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-06T00:10:08Z","title":"On state complexity of unions of binary factor-free languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1107","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:bbc9f9f10b5146093a60d222faf5bae96b9bc9cf1b6f5a61ffc050e8eedaf0e4","target":"record","created_at":"2026-05-18T02:52:33Z","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":"c0cbf35d254c644f4f8dfc74a3207f64a95e411de276aa96d253fef2c5425a22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-06T00:10:08Z","title_canon_sha256":"41cd94925e929243c810cd8eaff6eaebe2256bcd0b1d64774a6200d477242a3a"},"schema_version":"1.0","source":{"id":"1405.1107","kind":"arxiv","version":1}},"canonical_sha256":"3166171486b80f071c46241f95193fb799f188783c4cf57cd3c27140daf18f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3166171486b80f071c46241f95193fb799f188783c4cf57cd3c27140daf18f65","first_computed_at":"2026-05-18T02:52:33.488432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:33.488432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YtnJSm8XOCgAugQ6O4x8WC/WUHMIYJneEYO0T0LbF/MAm45kaBqBY4vlIVBU8rzNCgF0ZYZ23dGn19p0Tbk4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:33.488903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc9f9f10b5146093a60d222faf5bae96b9bc9cf1b6f5a61ffc050e8eedaf0e4","sha256:1123f8dfda3ed842219b1c52f9f30bb273ae6565817e0a40550836c7f8beb99f"],"state_sha256":"2c74ab3c2467da58780fb3d8e47a3d1664412de3553000f422107ed047f4207f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQBnARM4kUVvYe4F00LhdkMPZZpO7r+eF8Z20pwXndCPOvnzsCJ1fqcDy9YWUOBxlPrYlZVOVcbeadpd/UHZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:27:23.772767Z","bundle_sha256":"3b9a56138bedb347b64f3de78990317a99bcca5122fb75d80337e676f488bbfa"}}