{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YY65JNJY5GWVEO3VPQQBRCJD7V","short_pith_number":"pith:YY65JNJY","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"},"canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","source":{"kind":"arxiv","id":"2310.02393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.02393","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2310.02393v1","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02393","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"YY65JNJY5GWV","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"YY65JNJY5GWVEO3V","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"YY65JNJY","created_at":"2026-07-05T06:56:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YY65JNJY5GWVEO3VPQQBRCJD7V","target":"record","payload":{"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"},"canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","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"},"source_kind":"arxiv","source_id":"2310.02393","source_version":1,"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-07-05T06:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLbZuvdA+SiVcSwhO4IFkT4n3PMN9JHct6IhGXx5odW0K/pHNIjO4S+0KtAm7Ei2G3eXJ5mzkoeCufHNRz54BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:46:49.952554Z"},"content_sha256":"951b2e1758554a1ecb78944ae6c9371cd9c7c19fc9f0416973ebe58e87317006","schema_version":"1.0","event_id":"sha256:951b2e1758554a1ecb78944ae6c9371cd9c7c19fc9f0416973ebe58e87317006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YY65JNJY5GWVEO3VPQQBRCJD7V","target":"graph","payload":{"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"},"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-07-05T06:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUPvesXG9XbpsVeuXd4J9F0eV6huEh9pOyMe+EwblgQJM2MmUDDlxQemvFqp8swPjNe1K4LDrixwM1nue1JqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:46:49.953540Z"},"content_sha256":"93f212b0504c701ae55790e1a2e0cc80933c54d2350ec2a3f2405403c7be9549","schema_version":"1.0","event_id":"sha256:93f212b0504c701ae55790e1a2e0cc80933c54d2350ec2a3f2405403c7be9549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/bundle.json","state_url":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/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-08-18T15:46:49Z","links":{"resolver":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V","bundle":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/bundle.json","state":"https://pith.science/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY65JNJY5GWVEO3VPQQBRCJD7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YY65JNJY5GWVEO3VPQQBRCJD7V","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":"05b1d53d54afa83c60bf8e900990a9df48d5bd40e16609e3ecef03b4ab3fa26a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-10-03T19:27:03Z","title_canon_sha256":"5115f2fe96b462d181b2d4867ba4f072044fe8b3dcaccceda986c084732e2496"},"schema_version":"1.0","source":{"id":"2310.02393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.02393","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2310.02393v1","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02393","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"YY65JNJY5GWV","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"YY65JNJY5GWVEO3V","created_at":"2026-07-05T06:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"YY65JNJY","created_at":"2026-07-05T06:56:56Z"}],"graph_snapshots":[{"event_id":"sha256:93f212b0504c701ae55790e1a2e0cc80933c54d2350ec2a3f2405403c7be9549","target":"graph","created_at":"2026-07-05T06:56:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.02393/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gabriel Ebner, Margus Veanes, Olli Saarikivi, Thomas Ball","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-10-03T19:27:03Z","title":"Symbolic Automata: $\\omega$-Regularity Modulo Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.02393","kind":"arxiv","version":1},"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:951b2e1758554a1ecb78944ae6c9371cd9c7c19fc9f0416973ebe58e87317006","target":"record","created_at":"2026-07-05T06:56:56Z","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":"05b1d53d54afa83c60bf8e900990a9df48d5bd40e16609e3ecef03b4ab3fa26a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-10-03T19:27:03Z","title_canon_sha256":"5115f2fe96b462d181b2d4867ba4f072044fe8b3dcaccceda986c084732e2496"},"schema_version":"1.0","source":{"id":"2310.02393","kind":"arxiv","version":1}},"canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63dd4b538e9ad523b757c20188923fd54a997f754d8db21d74ff3413f9a7274","first_computed_at":"2026-07-05T06:56:56.638123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:56.638123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x62ZZGMjCJ2yECMBWm3CCG4RF3BsbjMwJ5iRuuIJgTTZ33Lwx2N/0HMEEb//BaIaXUgJdb+xYiwxBV9sWw8zDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:56.638529Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.02393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951b2e1758554a1ecb78944ae6c9371cd9c7c19fc9f0416973ebe58e87317006","sha256:93f212b0504c701ae55790e1a2e0cc80933c54d2350ec2a3f2405403c7be9549"],"state_sha256":"fe9ea108145c1f26299dc59506f602e88c82cf7ab9c16c86771336781ade2122"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eplEuLJpN7KK4hxWY32ID0ctwV3X0dlO5Xu15qqEX9IbZvDnu7dLHLN541FxAdtoveVB25k6T1azDio5vWfNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T15:46:49.959309Z","bundle_sha256":"e3f7503c2ae9b37faba348fb1805c5b928b4d9fdefec6777e1cf1eb4ebc9c760"}}