{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:22R4YPKE3EEJ2GKRZWCKTC2YWN","short_pith_number":"pith:22R4YPKE","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"},"canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","source":{"kind":"arxiv","id":"1811.06968","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06968","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06968v2","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06968","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"22R4YPKE3EEJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"22R4YPKE3EEJ2GKR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"22R4YPKE","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:22R4YPKE3EEJ2GKRZWCKTC2YWN","target":"record","payload":{"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"},"canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","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"},"source_kind":"arxiv","source_id":"1811.06968","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K0zz09g/aABfIOsE8I6fhf+c0DtObPj+OJ+rloIcjvb39VnYraYyo+RPQk4Zo7zXrX8PHvbUNHav1aGkFx7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:50:43.944141Z"},"content_sha256":"79695ac39f26f6651b6b5d0b046539dfbf46f4e3bf9b9785b1b94312f6383068","schema_version":"1.0","event_id":"sha256:79695ac39f26f6651b6b5d0b046539dfbf46f4e3bf9b9785b1b94312f6383068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:22R4YPKE3EEJ2GKRZWCKTC2YWN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBW8wpzrXMrD2agn/JXmklNPTpDICTRcybwtKQ7T79/IGQCfEjUbM5dGunI3ZyQxD7wtcTdC6Md82SIWrRCoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:50:43.944663Z"},"content_sha256":"8fd12898d51014dc6f7a7af7d40283d03a87ed804678fa778a32a0fc2bb6a7c6","schema_version":"1.0","event_id":"sha256:8fd12898d51014dc6f7a7af7d40283d03a87ed804678fa778a32a0fc2bb6a7c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/bundle.json","state_url":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T01:50:43Z","links":{"resolver":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN","bundle":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/bundle.json","state":"https://pith.science/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22R4YPKE3EEJ2GKRZWCKTC2YWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:22R4YPKE3EEJ2GKRZWCKTC2YWN","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":"ecc5cc52063af41814879b7ea6b9ca2f8e932950eda44bbae994ce86ee7e5594","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-16T18:50:10Z","title_canon_sha256":"19eddfdf164b4d643a28197d01b71c4ffedab2d8b240a9dc7e841bbd89522c41"},"schema_version":"1.0","source":{"id":"1811.06968","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06968","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06968v2","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06968","created_at":"2026-05-17T23:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"22R4YPKE3EEJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"22R4YPKE3EEJ2GKR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"22R4YPKE","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:8fd12898d51014dc6f7a7af7d40283d03a87ed804678fa778a32a0fc2bb6a7c6","target":"graph","created_at":"2026-05-17T23:45:20Z","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":"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","authors_text":"Alexandra Silva, Loris D'Antoni, Matteo Sammartino, Tiago Ferreira","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-16T18:50:10Z","title":"Symbolic Register Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06968","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:79695ac39f26f6651b6b5d0b046539dfbf46f4e3bf9b9785b1b94312f6383068","target":"record","created_at":"2026-05-17T23:45:20Z","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":"ecc5cc52063af41814879b7ea6b9ca2f8e932950eda44bbae994ce86ee7e5594","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-11-16T18:50:10Z","title_canon_sha256":"19eddfdf164b4d643a28197d01b71c4ffedab2d8b240a9dc7e841bbd89522c41"},"schema_version":"1.0","source":{"id":"1811.06968","kind":"arxiv","version":2}},"canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6a3cc3d44d9089d1951cd84a98b58b362139bfad65daa6218812166f4d7013e","first_computed_at":"2026-05-17T23:45:20.542936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:20.542936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjjW2xH5cMsTnrXDr5BiEY3P7ak5PZNZ9Wmm+1mhFh446CU59Af8RVQnbGaX1UjUaUSSjaZibMiS+ZDQGtoxBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:20.543550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06968","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79695ac39f26f6651b6b5d0b046539dfbf46f4e3bf9b9785b1b94312f6383068","sha256:8fd12898d51014dc6f7a7af7d40283d03a87ed804678fa778a32a0fc2bb6a7c6"],"state_sha256":"018befdf4d97934f1c5b062de93dbef946bc4008793d997b7ef1b1dc8940aea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbISb67DAfOOIxB7H7xzrbxhE6sseqYTmbZrZhCU1zO5MLFVjUc/yXIkthyuetpjlMaFHFQPDxTXEeN4k+wmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:50:43.946753Z","bundle_sha256":"c6190842b9b776c3bdb74b9b7971f6f63de714bbf36948c89ed788dc16a59639"}}