{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:6IXPBMN3ZEJIPCR6H565AKS2ST","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":"8d58d8a54f4d5fe585492d88c9fb9ce097f89d604300f16930138862bd320437","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-06-12T09:35:18Z","title_canon_sha256":"246b4cc2f307c34392c56048981aac2bad34f632e7ee1acb4c0d177b6f77e9ad"},"schema_version":"1.0","source":{"id":"cs/0606053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0606053","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0606053v2","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606053","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"6IXPBMN3ZEJI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"6IXPBMN3ZEJIPCR6","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"6IXPBMN3","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:435d41d86bf02db9e4e9817036c8353ca9d58cfaa6ed2726d1ef5ea4d234b189","target":"graph","created_at":"2026-05-18T00:53:03Z","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 investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex to a final vertex. In 2001, Morvan and Stirling proved that rational graphs accept the context-sensitive languages between rational sets of initial and final vertices. This result was later extended to sub-families of rational graphs defined by more restricted classes of transducers. languages.<br><br>\n  Our contribution is to provide syntactical ","authors_text":"Antoine Meyer, Arnaud Carayol","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-06-12T09:35:18Z","title":"Context-Sensitive Languages, Rational Graphs and Determinism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606053","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:4be1c359ced2f80c95834e0615ed9d77fbbca4eab63764bb528f1aea9d258d89","target":"record","created_at":"2026-05-18T00:53:03Z","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":"8d58d8a54f4d5fe585492d88c9fb9ce097f89d604300f16930138862bd320437","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-06-12T09:35:18Z","title_canon_sha256":"246b4cc2f307c34392c56048981aac2bad34f632e7ee1acb4c0d177b6f77e9ad"},"schema_version":"1.0","source":{"id":"cs/0606053","kind":"arxiv","version":2}},"canonical_sha256":"f22ef0b1bbc912878a3e3f7dd02a5a94dddd9ef016149cb3b6aac3a40633bbc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f22ef0b1bbc912878a3e3f7dd02a5a94dddd9ef016149cb3b6aac3a40633bbc1","first_computed_at":"2026-05-18T00:53:03.383067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.383067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GJpTyVYue56WEmjZyL2l80Oum4jwWq4Lo3xg57PAKyT9iSu4aspn60CrhomHRheTN4DXrUix58492GgjhBy8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.383706Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0606053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4be1c359ced2f80c95834e0615ed9d77fbbca4eab63764bb528f1aea9d258d89","sha256:435d41d86bf02db9e4e9817036c8353ca9d58cfaa6ed2726d1ef5ea4d234b189"],"state_sha256":"1c9d77c7adcc18cf0db7dad9adfea05d3be1de64e270bf7ad62ecc92adbaa8b5"}