{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YY65JNJY5GWVEO3VPQQBRCJD7V","short_pith_number":"pith:YY65JNJY","schema_version":"1.0","canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","source":{"kind":"arxiv","id":"2310.02393","version":1},"attestation_state":"computed","paper":{"title":"Symbolic Automata: $\\omega$-Regularity Modulo Theories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Gabriel Ebner, Margus Veanes, Olli Saarikivi, Thomas Ball","submitted_at":"2023-10-03T19:27:03Z","abstract_excerpt":"Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo theories), an alphabet is represented by an effective Boolean algebra, supported by a decision procedure for satisfiability. Regular languages over infinite words (so called $\\omega$-regular languages) have a rich history paralleling that of regular languages over finite words, with well known applications to model checking via B\\\"uchi automata and temporal log"},"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":"2310.02393","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-10-03T19:27:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5115f2fe96b462d181b2d4867ba4f072044fe8b3dcaccceda986c084732e2496","abstract_canon_sha256":"05b1d53d54afa83c60bf8e900990a9df48d5bd40e16609e3ecef03b4ab3fa26a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:56.638529Z","signature_b64":"x62ZZGMjCJ2yECMBWm3CCG4RF3BsbjMwJ5iRuuIJgTTZ33Lwx2N/0HMEEb//BaIaXUgJdb+xYiwxBV9sWw8zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","last_reissued_at":"2026-07-05T06:56:56.638123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:56.638123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Automata: $\\omega$-Regularity Modulo Theories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Gabriel Ebner, Margus Veanes, Olli Saarikivi, Thomas Ball","submitted_at":"2023-10-03T19:27:03Z","abstract_excerpt":"Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo theories), an alphabet is represented by an effective Boolean algebra, supported by a decision procedure for satisfiability. Regular languages over infinite words (so called $\\omega$-regular languages) have a rich history paralleling that of regular languages over finite words, with well known applications to model checking via B\\\"uchi automata and temporal log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.02393","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.02393/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.02393","created_at":"2026-07-05T06:56:56.638180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.02393v1","created_at":"2026-07-05T06:56:56.638180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02393","created_at":"2026-07-05T06:56:56.638180+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY65JNJY5GWV","created_at":"2026-07-05T06:56:56.638180+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY65JNJY5GWVEO3V","created_at":"2026-07-05T06:56:56.638180+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY65JNJY","created_at":"2026-07-05T06:56:56.638180+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/YY65JNJY5GWVEO3VPQQBRCJD7V","json":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V.json","graph_json":"https://pith.science/api/pith-number/YY65JNJY5GWVEO3VPQQBRCJD7V/graph.json","events_json":"https://pith.science/api/pith-number/YY65JNJY5GWVEO3VPQQBRCJD7V/events.json","paper":"https://pith.science/paper/YY65JNJY"},"agent_actions":{"view_html":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V","download_json":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V.json","view_paper":"https://pith.science/paper/YY65JNJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.02393&json=true","fetch_graph":"https://pith.science/api/pith-number/YY65JNJY5GWVEO3VPQQBRCJD7V/graph.json","fetch_events":"https://pith.science/api/pith-number/YY65JNJY5GWVEO3VPQQBRCJD7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/action/storage_attestation","attest_author":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/action/author_attestation","sign_citation":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/action/citation_signature","submit_replication":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/action/replication_record"}},"created_at":"2026-07-05T06:56:56.638180+00:00","updated_at":"2026-07-05T06:56:56.638180+00:00"}