{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7F5YQZ23M5UATLEBYC6ZH5SY4E","short_pith_number":"pith:7F5YQZ23","schema_version":"1.0","canonical_sha256":"f97b88675b676809ac81c0bd93f658e139ffbe3d6fe404270195e913794a0734","source":{"kind":"arxiv","id":"1610.01722","version":1},"attestation_state":"computed","paper":{"title":"A Symbolic Decision Procedure for Symbolic Alternating Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fang Wang, Loris D'Antoni, Zachary Kincaid","submitted_at":"2016-10-06T02:51:41Z","abstract_excerpt":"We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in sharp contrast with the quadratic cost of intersection and union for non-alternating symbolic automata. Due to this succinctness, emptiness and equivalence checking are PSpace-hard.\n  We introduce an algorithm for checking the equivalence of two s-AFAs based on bisimulation up to congruence. This algorithm allows us to exploit the power of SAT and SMT solvers"},"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":"1610.01722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-06T02:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"7db7c1ff51f61f7cf36bc687a549aa8ae161a5546ee9ab0adec3b8713276982f","abstract_canon_sha256":"2321edca1420315e8776c3c4b837848af3528879c3c1d58bf75bed15816b8694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:05.072654Z","signature_b64":"AfTfAkHavzg003ToeKKpXQrMQhugmLSuGtm7QKlMbBIHgXJ4eeB8R75NYJNFoUiH0RpP8YR0HeWQsny525C5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97b88675b676809ac81c0bd93f658e139ffbe3d6fe404270195e913794a0734","last_reissued_at":"2026-05-18T01:03:05.072040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:05.072040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Symbolic Decision Procedure for Symbolic Alternating Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fang Wang, Loris D'Antoni, Zachary Kincaid","submitted_at":"2016-10-06T02:51:41Z","abstract_excerpt":"We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in sharp contrast with the quadratic cost of intersection and union for non-alternating symbolic automata. Due to this succinctness, emptiness and equivalence checking are PSpace-hard.\n  We introduce an algorithm for checking the equivalence of two s-AFAs based on bisimulation up to congruence. This algorithm allows us to exploit the power of SAT and SMT solvers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01722","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":""},"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":"1610.01722","created_at":"2026-05-18T01:03:05.072127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01722v1","created_at":"2026-05-18T01:03:05.072127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01722","created_at":"2026-05-18T01:03:05.072127+00:00"},{"alias_kind":"pith_short_12","alias_value":"7F5YQZ23M5UA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7F5YQZ23M5UATLEB","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7F5YQZ23","created_at":"2026-05-18T12:30:04.600751+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/7F5YQZ23M5UATLEBYC6ZH5SY4E","json":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E.json","graph_json":"https://pith.science/api/pith-number/7F5YQZ23M5UATLEBYC6ZH5SY4E/graph.json","events_json":"https://pith.science/api/pith-number/7F5YQZ23M5UATLEBYC6ZH5SY4E/events.json","paper":"https://pith.science/paper/7F5YQZ23"},"agent_actions":{"view_html":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E","download_json":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E.json","view_paper":"https://pith.science/paper/7F5YQZ23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01722&json=true","fetch_graph":"https://pith.science/api/pith-number/7F5YQZ23M5UATLEBYC6ZH5SY4E/graph.json","fetch_events":"https://pith.science/api/pith-number/7F5YQZ23M5UATLEBYC6ZH5SY4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E/action/storage_attestation","attest_author":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E/action/author_attestation","sign_citation":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E/action/citation_signature","submit_replication":"https://pith.science/pith/7F5YQZ23M5UATLEBYC6ZH5SY4E/action/replication_record"}},"created_at":"2026-05-18T01:03:05.072127+00:00","updated_at":"2026-05-18T01:03:05.072127+00:00"}