{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3FI3ZVP2KQ2RLNH3SJNDUUOXXY","short_pith_number":"pith:3FI3ZVP2","canonical_record":{"source":{"id":"1404.4495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-17T11:41:27Z","cross_cats_sorted":[],"title_canon_sha256":"34d75b7e42b8f5ea91b0b38d4574518ef52c3c3de8fc47d4079a83604b963991","abstract_canon_sha256":"f4bbebe87131e5bda23085887e40e0c88a1200d26445d4a66c0c4deabb3f2011"},"schema_version":"1.0"},"canonical_sha256":"d951bcd5fa543515b4fb925a3a51d7be210e9b63a9faab5911f158f78749f483","source":{"kind":"arxiv","id":"1404.4495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4495","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4495v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4495","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"3FI3ZVP2KQ2R","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3FI3ZVP2KQ2RLNH3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3FI3ZVP2","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3FI3ZVP2KQ2RLNH3SJNDUUOXXY","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-17T11:41:27Z","cross_cats_sorted":[],"title_canon_sha256":"34d75b7e42b8f5ea91b0b38d4574518ef52c3c3de8fc47d4079a83604b963991","abstract_canon_sha256":"f4bbebe87131e5bda23085887e40e0c88a1200d26445d4a66c0c4deabb3f2011"},"schema_version":"1.0"},"canonical_sha256":"d951bcd5fa543515b4fb925a3a51d7be210e9b63a9faab5911f158f78749f483","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.068418Z","signature_b64":"JnqSb7+/oYuPH4wEghnxgybVSdWZuiy7cWW0/htyupXCgiCXS1VBI1EuLl5Vx2iUFEoQ9ig7uuLYKGqpJzLKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d951bcd5fa543515b4fb925a3a51d7be210e9b63a9faab5911f158f78749f483","last_reissued_at":"2026-05-18T02:48:02.067807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.067807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4495","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuhDR4FXjzRXEIOr611bg+5bxKqKuad5KwuIHIG1mylrMI4hmGH4wbgsjp0GXpkqlYwSLHZUI4IJfcwO03PgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:03:39.489710Z"},"content_sha256":"0d6ea75bc4b932d79b458346858d2107050878976c0eebb29b02bb2397e9c9a7","schema_version":"1.0","event_id":"sha256:0d6ea75bc4b932d79b458346858d2107050878976c0eebb29b02bb2397e9c9a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3FI3ZVP2KQ2RLNH3SJNDUUOXXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Upper and Lower Bounds on the Length of Alternating Towers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Galina Jir\\'askov\\'a, Tom\\'a\\v{s} Masopust, \\v{S}t\\v{e}p\\'an Holub","submitted_at":"2014-04-17T11:41:27Z","abstract_excerpt":"A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower. This problem is relevant to the sep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4495","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-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5iRjOIX2YbfNh+HhZjZrUFGRHdkhbL22KDR9UNHFT0A5kb1BSqVaP8I2JZEwPWWVBsQYot8RgvE5jrwacvYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:03:39.490059Z"},"content_sha256":"7b794422ac30a57c444bb6ac025d3f9335bf7a1bdcd5cc5eec5bf83b85f644dd","schema_version":"1.0","event_id":"sha256:7b794422ac30a57c444bb6ac025d3f9335bf7a1bdcd5cc5eec5bf83b85f644dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/bundle.json","state_url":"https://pith.science/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/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-05T05:03:39Z","links":{"resolver":"https://pith.science/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY","bundle":"https://pith.science/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/bundle.json","state":"https://pith.science/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FI3ZVP2KQ2RLNH3SJNDUUOXXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3FI3ZVP2KQ2RLNH3SJNDUUOXXY","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":"f4bbebe87131e5bda23085887e40e0c88a1200d26445d4a66c0c4deabb3f2011","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-17T11:41:27Z","title_canon_sha256":"34d75b7e42b8f5ea91b0b38d4574518ef52c3c3de8fc47d4079a83604b963991"},"schema_version":"1.0","source":{"id":"1404.4495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4495","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4495v2","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4495","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"3FI3ZVP2KQ2R","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3FI3ZVP2KQ2RLNH3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3FI3ZVP2","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:7b794422ac30a57c444bb6ac025d3f9335bf7a1bdcd5cc5eec5bf83b85f644dd","target":"graph","created_at":"2026-05-18T02:48:02Z","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 tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower. This problem is relevant to the sep","authors_text":"Galina Jir\\'askov\\'a, Tom\\'a\\v{s} Masopust, \\v{S}t\\v{e}p\\'an Holub","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-17T11:41:27Z","title":"On Upper and Lower Bounds on the Length of Alternating Towers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4495","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:0d6ea75bc4b932d79b458346858d2107050878976c0eebb29b02bb2397e9c9a7","target":"record","created_at":"2026-05-18T02:48:02Z","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":"f4bbebe87131e5bda23085887e40e0c88a1200d26445d4a66c0c4deabb3f2011","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-17T11:41:27Z","title_canon_sha256":"34d75b7e42b8f5ea91b0b38d4574518ef52c3c3de8fc47d4079a83604b963991"},"schema_version":"1.0","source":{"id":"1404.4495","kind":"arxiv","version":2}},"canonical_sha256":"d951bcd5fa543515b4fb925a3a51d7be210e9b63a9faab5911f158f78749f483","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d951bcd5fa543515b4fb925a3a51d7be210e9b63a9faab5911f158f78749f483","first_computed_at":"2026-05-18T02:48:02.067807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.067807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnqSb7+/oYuPH4wEghnxgybVSdWZuiy7cWW0/htyupXCgiCXS1VBI1EuLl5Vx2iUFEoQ9ig7uuLYKGqpJzLKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.068418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d6ea75bc4b932d79b458346858d2107050878976c0eebb29b02bb2397e9c9a7","sha256:7b794422ac30a57c444bb6ac025d3f9335bf7a1bdcd5cc5eec5bf83b85f644dd"],"state_sha256":"2af0785b3496f6ac2fbc98712d429352875c0ba83e0e47528c44ab7a4acda6f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swTByZry+93tjMkGaz91MyR1GFbSNdaw37dgD1el8xFymHyXwQ5evYMcHoLhs79OPje8cFO8TvaCuzB2QWl1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:03:39.492181Z","bundle_sha256":"ed41c09d0ab6d86a7fb7ecabef50d9473a0bd9a8fe66770efe7fe4f3b4f56ec6"}}