{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7CVQCEKGJZ74QUFO6Z5I6GEQSO","short_pith_number":"pith:7CVQCEKG","canonical_record":{"source":{"id":"1609.03199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-11T19:22:58Z","cross_cats_sorted":["cs.FL","math.GR"],"title_canon_sha256":"8fa9b8734db0646c588dc7992d6cb1d2728e4b599d2a954bd19a7ec03ea6e379","abstract_canon_sha256":"e4424a6a6fb582f2b0986d308d5fd237bed7d11d4ff62836114c5896c242fc94"},"schema_version":"1.0"},"canonical_sha256":"f8ab0111464e7fc850aef67a8f1890938b11ed5b6e480458698565d5f3767508","source":{"kind":"arxiv","id":"1609.03199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03199","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03199v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03199","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"7CVQCEKGJZ74","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7CVQCEKGJZ74QUFO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7CVQCEKG","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7CVQCEKGJZ74QUFO6Z5I6GEQSO","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-11T19:22:58Z","cross_cats_sorted":["cs.FL","math.GR"],"title_canon_sha256":"8fa9b8734db0646c588dc7992d6cb1d2728e4b599d2a954bd19a7ec03ea6e379","abstract_canon_sha256":"e4424a6a6fb582f2b0986d308d5fd237bed7d11d4ff62836114c5896c242fc94"},"schema_version":"1.0"},"canonical_sha256":"f8ab0111464e7fc850aef67a8f1890938b11ed5b6e480458698565d5f3767508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:47.544753Z","signature_b64":"TsAzuhK0V/Qm8BlTf9z1B9GKBJPAtybooTbr6ldrWpL9yjkqpB1tz2sU8gbQSmoolIPsz9PTgj06GkIVjwrdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ab0111464e7fc850aef67a8f1890938b11ed5b6e480458698565d5f3767508","last_reissued_at":"2026-05-18T01:04:47.544188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:47.544188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03199","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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFrB0yy8PYv7JTaPkFejRdz1jX7x/j2OnX4Bp7xstpAxyAO1P0Dboy9qNxgm90SQtebjMa9NtClxW6QuTMY+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:49:00.957252Z"},"content_sha256":"1a204fadfefd87fc0aff175aa8d9eb274f59bb33455b541b94a6aecf1edd0f89","schema_version":"1.0","event_id":"sha256:1a204fadfefd87fc0aff175aa8d9eb274f59bb33455b541b94a6aecf1edd0f89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7CVQCEKGJZ74QUFO6Z5I6GEQSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.GR"],"primary_cat":"math.CO","authors_text":"Andrei A. Bulatov, Arseny M. Shur, Konstantin Startsev, Olga Karpova","submitted_at":"2016-09-11T19:22:58Z","abstract_excerpt":"The words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let $Sep(n)$ be the minimum number such that for any two words of length $\\le n$ there is a deterministic finite automaton with $Sep(n)$ states, accepting exactly one of them. The problem is to find the asymptotics of the function $Sep$. This problem is inverse to finding the asymptotics of the length of the shortest identity in full transformation semigroups $T_k$. The known lower bound on $Sep$ stems from the unary identity in $T_k$. We find the first series of identities in $T_k$ which a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03199","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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKaq433sMYNzagzd/02f4KW9yGSp+XiBaDqG7wa/4LE+Bv8HeIfS66K6PbpAajGHAFzn/xIStd9zLdX6vOPOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:49:00.957930Z"},"content_sha256":"b51ce442c113f4e2634ebf78714e56d72c8df47561e54ccd0baf1599c8c686e5","schema_version":"1.0","event_id":"sha256:b51ce442c113f4e2634ebf78714e56d72c8df47561e54ccd0baf1599c8c686e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/bundle.json","state_url":"https://pith.science/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/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-27T14:49:00Z","links":{"resolver":"https://pith.science/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO","bundle":"https://pith.science/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/bundle.json","state":"https://pith.science/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CVQCEKGJZ74QUFO6Z5I6GEQSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7CVQCEKGJZ74QUFO6Z5I6GEQSO","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":"e4424a6a6fb582f2b0986d308d5fd237bed7d11d4ff62836114c5896c242fc94","cross_cats_sorted":["cs.FL","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-11T19:22:58Z","title_canon_sha256":"8fa9b8734db0646c588dc7992d6cb1d2728e4b599d2a954bd19a7ec03ea6e379"},"schema_version":"1.0","source":{"id":"1609.03199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03199","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03199v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03199","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"7CVQCEKGJZ74","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7CVQCEKGJZ74QUFO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7CVQCEKG","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b51ce442c113f4e2634ebf78714e56d72c8df47561e54ccd0baf1599c8c686e5","target":"graph","created_at":"2026-05-18T01:04:47Z","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 words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let $Sep(n)$ be the minimum number such that for any two words of length $\\le n$ there is a deterministic finite automaton with $Sep(n)$ states, accepting exactly one of them. The problem is to find the asymptotics of the function $Sep$. This problem is inverse to finding the asymptotics of the length of the shortest identity in full transformation semigroups $T_k$. The known lower bound on $Sep$ stems from the unary identity in $T_k$. We find the first series of identities in $T_k$ which a","authors_text":"Andrei A. Bulatov, Arseny M. Shur, Konstantin Startsev, Olga Karpova","cross_cats":["cs.FL","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-11T19:22:58Z","title":"Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03199","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:1a204fadfefd87fc0aff175aa8d9eb274f59bb33455b541b94a6aecf1edd0f89","target":"record","created_at":"2026-05-18T01:04:47Z","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":"e4424a6a6fb582f2b0986d308d5fd237bed7d11d4ff62836114c5896c242fc94","cross_cats_sorted":["cs.FL","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-11T19:22:58Z","title_canon_sha256":"8fa9b8734db0646c588dc7992d6cb1d2728e4b599d2a954bd19a7ec03ea6e379"},"schema_version":"1.0","source":{"id":"1609.03199","kind":"arxiv","version":1}},"canonical_sha256":"f8ab0111464e7fc850aef67a8f1890938b11ed5b6e480458698565d5f3767508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8ab0111464e7fc850aef67a8f1890938b11ed5b6e480458698565d5f3767508","first_computed_at":"2026-05-18T01:04:47.544188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:47.544188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TsAzuhK0V/Qm8BlTf9z1B9GKBJPAtybooTbr6ldrWpL9yjkqpB1tz2sU8gbQSmoolIPsz9PTgj06GkIVjwrdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:47.544753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a204fadfefd87fc0aff175aa8d9eb274f59bb33455b541b94a6aecf1edd0f89","sha256:b51ce442c113f4e2634ebf78714e56d72c8df47561e54ccd0baf1599c8c686e5"],"state_sha256":"175e34cea66770cc600cf7660992a36d10eaa69c095c2ae2a37bee439e04c25f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0v1xq7YK+WAjbkW/3huX5ClNUh4m/iZWY9HYUXvxGKClaUA8pJI2jo5YJKbzoNL8KqPAtnB26KTYtA1AaDeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:49:00.961022Z","bundle_sha256":"e58bcae2ca55b9361c955209db45635f0a96b2f7590737982249449a8baae8a8"}}