{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:22R4YPKE3EEJ2GKRZWCKTC2YWN","short_pith_number":"pith:22R4YPKE","schema_version":"1.0","canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","source":{"kind":"arxiv","id":"1811.06968","version":2},"attestation_state":"computed","paper":{"title":"Symbolic Register Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexandra Silva, Loris D'Antoni, Matteo Sammartino, Tiago Ferreira","submitted_at":"2018-11-16T18:50:10Z","abstract_excerpt":"Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms"},"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":"1811.06968","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-16T18:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"19eddfdf164b4d643a28197d01b71c4ffedab2d8b240a9dc7e841bbd89522c41","abstract_canon_sha256":"ecc5cc52063af41814879b7ea6b9ca2f8e932950eda44bbae994ce86ee7e5594"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:20.543550Z","signature_b64":"mjjW2xH5cMsTnrXDr5BiEY3P7ak5PZNZ9Wmm+1mhFh446CU59Af8RVQnbGaX1UjUaUSSjaZibMiS+ZDQGtoxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","last_reissued_at":"2026-05-17T23:45:20.542936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:20.542936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Register Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexandra Silva, Loris D'Antoni, Matteo Sammartino, Tiago Ferreira","submitted_at":"2018-11-16T18:50:10Z","abstract_excerpt":"Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06968","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":"1811.06968","created_at":"2026-05-17T23:45:20.543039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06968v2","created_at":"2026-05-17T23:45:20.543039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06968","created_at":"2026-05-17T23:45:20.543039+00:00"},{"alias_kind":"pith_short_12","alias_value":"22R4YPKE3EEJ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"22R4YPKE3EEJ2GKR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"22R4YPKE","created_at":"2026-05-18T12:31:59.375834+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/22R4YPKE3EEJ2GKRZWCKTC2YWN","json":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN.json","graph_json":"https://pith.science/api/pith-number/22R4YPKE3EEJ2GKRZWCKTC2YWN/graph.json","events_json":"https://pith.science/api/pith-number/22R4YPKE3EEJ2GKRZWCKTC2YWN/events.json","paper":"https://pith.science/paper/22R4YPKE"},"agent_actions":{"view_html":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN","download_json":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN.json","view_paper":"https://pith.science/paper/22R4YPKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06968&json=true","fetch_graph":"https://pith.science/api/pith-number/22R4YPKE3EEJ2GKRZWCKTC2YWN/graph.json","fetch_events":"https://pith.science/api/pith-number/22R4YPKE3EEJ2GKRZWCKTC2YWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/action/storage_attestation","attest_author":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/action/author_attestation","sign_citation":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/action/citation_signature","submit_replication":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/action/replication_record"}},"created_at":"2026-05-17T23:45:20.543039+00:00","updated_at":"2026-05-17T23:45:20.543039+00:00"}