{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:6IXPBMN3ZEJIPCR6H565AKS2ST","short_pith_number":"pith:6IXPBMN3","schema_version":"1.0","canonical_sha256":"f22ef0b1bbc912878a3e3f7dd02a5a94dddd9ef016149cb3b6aac3a40633bbc1","source":{"kind":"arxiv","id":"cs/0606053","version":2},"attestation_state":"computed","paper":{"title":"Context-Sensitive Languages, Rational Graphs and Determinism","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Antoine Meyer, Arnaud Carayol","submitted_at":"2006-06-12T09:35:18Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0606053","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-06-12T09:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"246b4cc2f307c34392c56048981aac2bad34f632e7ee1acb4c0d177b6f77e9ad","abstract_canon_sha256":"8d58d8a54f4d5fe585492d88c9fb9ce097f89d604300f16930138862bd320437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.383706Z","signature_b64":"GJpTyVYue56WEmjZyL2l80Oum4jwWq4Lo3xg57PAKyT9iSu4aspn60CrhomHRheTN4DXrUix58492GgjhBy8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22ef0b1bbc912878a3e3f7dd02a5a94dddd9ef016149cb3b6aac3a40633bbc1","last_reissued_at":"2026-05-18T00:53:03.383067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.383067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Context-Sensitive Languages, Rational Graphs and Determinism","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Antoine Meyer, Arnaud Carayol","submitted_at":"2006-06-12T09:35:18Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606053","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0606053","created_at":"2026-05-18T00:53:03.383149+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0606053v2","created_at":"2026-05-18T00:53:03.383149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606053","created_at":"2026-05-18T00:53:03.383149+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IXPBMN3ZEJI","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IXPBMN3ZEJIPCR6","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IXPBMN3","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST","json":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST.json","graph_json":"https://pith.science/api/pith-number/6IXPBMN3ZEJIPCR6H565AKS2ST/graph.json","events_json":"https://pith.science/api/pith-number/6IXPBMN3ZEJIPCR6H565AKS2ST/events.json","paper":"https://pith.science/paper/6IXPBMN3"},"agent_actions":{"view_html":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST","download_json":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST.json","view_paper":"https://pith.science/paper/6IXPBMN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0606053&json=true","fetch_graph":"https://pith.science/api/pith-number/6IXPBMN3ZEJIPCR6H565AKS2ST/graph.json","fetch_events":"https://pith.science/api/pith-number/6IXPBMN3ZEJIPCR6H565AKS2ST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST/action/storage_attestation","attest_author":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST/action/author_attestation","sign_citation":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST/action/citation_signature","submit_replication":"https://pith.science/pith/6IXPBMN3ZEJIPCR6H565AKS2ST/action/replication_record"}},"created_at":"2026-05-18T00:53:03.383149+00:00","updated_at":"2026-05-18T00:53:03.383149+00:00"}