{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WRND7JRD65T2RAE52NMTXI5WZX","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":"87c5841337c6c213c0ab2c336f0917c669f0d95396259c3d1ec20c35235429e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-11-28T12:46:03Z","title_canon_sha256":"6b16dd285d4c6f414b67fcd7705d6f4982018e9aa613bced91de1a948a4edc44"},"schema_version":"1.0","source":{"id":"1111.6431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6431","created_at":"2026-05-18T04:07:30Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6431v1","created_at":"2026-05-18T04:07:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6431","created_at":"2026-05-18T04:07:30Z"},{"alias_kind":"pith_short_12","alias_value":"WRND7JRD65T2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WRND7JRD65T2RAE5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WRND7JRD","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:29219dfe7df2e7b0820dc0d77ee3e4af20d3ba050b50a6ba597cb029a770d3c8","target":"graph","created_at":"2026-05-18T04:07:30Z","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":"We revisit the problem of deciding whether a given string is uniquely decodable from its bigram counts by means of a finite automaton. An efficient algorithm for constructing a polynomial-size nondeterministic finite automaton that decides unique decodability is given. Conversely, we show that the minimum deterministic finite automaton for deciding unique decodability has at least exponentially many states in alphabet size.","authors_text":"Ari Trachtenberg, Aryeh Kontorovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-11-28T12:46:03Z","title":"Unique decodability of bigram counts by finite automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6431","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:2b102c349f1f748c9d1ac9e99e5776e66bda074ce37d1f21a9ecf81581a301b5","target":"record","created_at":"2026-05-18T04:07:30Z","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":"87c5841337c6c213c0ab2c336f0917c669f0d95396259c3d1ec20c35235429e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-11-28T12:46:03Z","title_canon_sha256":"6b16dd285d4c6f414b67fcd7705d6f4982018e9aa613bced91de1a948a4edc44"},"schema_version":"1.0","source":{"id":"1111.6431","kind":"arxiv","version":1}},"canonical_sha256":"b45a3fa623f767a8809dd3593ba3b6cde2b493d5893b0f803ebc8bfa2663db51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b45a3fa623f767a8809dd3593ba3b6cde2b493d5893b0f803ebc8bfa2663db51","first_computed_at":"2026-05-18T04:07:30.015538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:30.015538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hO0qCFXH8dzVoLv/uIoolyKDB2MdyDQKe7ec2Njjm/oYi324aeHrkFV0SUrll8wCmHAQW+ohqD37BpgFk6idCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:30.016271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b102c349f1f748c9d1ac9e99e5776e66bda074ce37d1f21a9ecf81581a301b5","sha256:29219dfe7df2e7b0820dc0d77ee3e4af20d3ba050b50a6ba597cb029a770d3c8"],"state_sha256":"96f6132059c0ee61d8c8c982f470380ee69cc8bd7a1f802d8626f42170666e3c"}