{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5IJ3ZX2KK25YCA2MXDFWGZQXKD","short_pith_number":"pith:5IJ3ZX2K","schema_version":"1.0","canonical_sha256":"ea13bcdf4a56bb81034cb8cb63661750f48e22596d8c22e0fd26a235ddf088c8","source":{"kind":"arxiv","id":"1809.08985","version":2},"attestation_state":"computed","paper":{"title":"The Containment Problem for Unambiguous Register Automata","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antoine Mottet, Karin Quaas","submitted_at":"2018-09-24T15:04:39Z","abstract_excerpt":"We investigate the complexity of the containment problem \"Does $L(A)\\subseteq L(B)$ hold?\", where $B$ is an unambiguous register automaton and $A$ is an arbitrary register automaton. We prove that the problem is decidable and give upper bounds on the computational complexity in the general case, and when $B$ is restricted to have a fixed number of registers."},"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":"1809.08985","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-09-24T15:04:39Z","cross_cats_sorted":[],"title_canon_sha256":"d29e1af759b195aa8873ee3f106ab0601097aea8a2f4c23da51bd3fc7fc8d01b","abstract_canon_sha256":"798fb0b1fcc464d2f531c8fc585c1686bfea7e9a5e5aa56277a8978b7bdb338c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:55.032831Z","signature_b64":"aLWTcZaW+l0Nw7FxzBUPrVBfCOkZBj0iXIGrUt714Pi5OEzCSardlkQcKyvS4cilea5Wl1XHfTe/AmkBN4SmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea13bcdf4a56bb81034cb8cb63661750f48e22596d8c22e0fd26a235ddf088c8","last_reissued_at":"2026-05-17T23:55:55.032107Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:55.032107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Containment Problem for Unambiguous Register Automata","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antoine Mottet, Karin Quaas","submitted_at":"2018-09-24T15:04:39Z","abstract_excerpt":"We investigate the complexity of the containment problem \"Does $L(A)\\subseteq L(B)$ hold?\", where $B$ is an unambiguous register automaton and $A$ is an arbitrary register automaton. We prove that the problem is decidable and give upper bounds on the computational complexity in the general case, and when $B$ is restricted to have a fixed number of registers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08985","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":"1809.08985","created_at":"2026-05-17T23:55:55.032236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08985v2","created_at":"2026-05-17T23:55:55.032236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08985","created_at":"2026-05-17T23:55:55.032236+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IJ3ZX2KK25Y","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IJ3ZX2KK25YCA2M","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IJ3ZX2K","created_at":"2026-05-18T12:32:08.215937+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/5IJ3ZX2KK25YCA2MXDFWGZQXKD","json":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD.json","graph_json":"https://pith.science/api/pith-number/5IJ3ZX2KK25YCA2MXDFWGZQXKD/graph.json","events_json":"https://pith.science/api/pith-number/5IJ3ZX2KK25YCA2MXDFWGZQXKD/events.json","paper":"https://pith.science/paper/5IJ3ZX2K"},"agent_actions":{"view_html":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD","download_json":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD.json","view_paper":"https://pith.science/paper/5IJ3ZX2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08985&json=true","fetch_graph":"https://pith.science/api/pith-number/5IJ3ZX2KK25YCA2MXDFWGZQXKD/graph.json","fetch_events":"https://pith.science/api/pith-number/5IJ3ZX2KK25YCA2MXDFWGZQXKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD/action/storage_attestation","attest_author":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD/action/author_attestation","sign_citation":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD/action/citation_signature","submit_replication":"https://pith.science/pith/5IJ3ZX2KK25YCA2MXDFWGZQXKD/action/replication_record"}},"created_at":"2026-05-17T23:55:55.032236+00:00","updated_at":"2026-05-17T23:55:55.032236+00:00"}