{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6PQDVZ6NKTKTOPKJ5QVTK4X5XH","short_pith_number":"pith:6PQDVZ6N","schema_version":"1.0","canonical_sha256":"f3e03ae7cd54d5373d49ec2b3572fdb9cb8017ef593b6343d21526334109acbe","source":{"kind":"arxiv","id":"1401.3173","version":1},"attestation_state":"computed","paper":{"title":"Synthesis of Sequential Extended Regular Expressions for Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ali S. Elzein, Fadi A. Zaraket, Mohamad Noureddine","submitted_at":"2014-01-14T13:09:58Z","abstract_excerpt":"Synthesis techniques take realizable Linear Temporal Logic specifications and produce correct cir- cuits that implement the specifications. The generated circuits can be used directly, or as miters that check the correctness of a logic design. Typically, those techniques generate non-deterministic finite state automata, which can be determinized at a possibly exponential cost. Recent results show multiple advantages of using deterministic automata in symbolic and bounded model checking of LTL safety properties. In this paper, we present a technique with a supporting tool that takes a sequentia"},"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":"1401.3173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-14T13:09:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"84d014d17214899b09dfcd3d253d6d635d686b9a7005fa9b5ee58daabde3416a","abstract_canon_sha256":"572f2798e3c6c66087311d0a1b57c0b2da942da7a30544b3e619e7d2fb22f363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.577215Z","signature_b64":"6+JuZhgnxfFOn6RiJFleC/bF5dNzVMWAfrdxGptDfdqmvO5YBv0kAgulk5LOY1Jwdtv+Itt7UYWRlcmy4r/eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3e03ae7cd54d5373d49ec2b3572fdb9cb8017ef593b6343d21526334109acbe","last_reissued_at":"2026-05-18T03:02:09.576617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.576617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis of Sequential Extended Regular Expressions for Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ali S. Elzein, Fadi A. Zaraket, Mohamad Noureddine","submitted_at":"2014-01-14T13:09:58Z","abstract_excerpt":"Synthesis techniques take realizable Linear Temporal Logic specifications and produce correct cir- cuits that implement the specifications. The generated circuits can be used directly, or as miters that check the correctness of a logic design. Typically, those techniques generate non-deterministic finite state automata, which can be determinized at a possibly exponential cost. Recent results show multiple advantages of using deterministic automata in symbolic and bounded model checking of LTL safety properties. In this paper, we present a technique with a supporting tool that takes a sequentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3173","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":"1401.3173","created_at":"2026-05-18T03:02:09.576713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3173v1","created_at":"2026-05-18T03:02:09.576713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3173","created_at":"2026-05-18T03:02:09.576713+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PQDVZ6NKTKT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PQDVZ6NKTKTOPKJ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PQDVZ6N","created_at":"2026-05-18T12:28:16.859392+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/6PQDVZ6NKTKTOPKJ5QVTK4X5XH","json":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH.json","graph_json":"https://pith.science/api/pith-number/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/graph.json","events_json":"https://pith.science/api/pith-number/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/events.json","paper":"https://pith.science/paper/6PQDVZ6N"},"agent_actions":{"view_html":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH","download_json":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH.json","view_paper":"https://pith.science/paper/6PQDVZ6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3173&json=true","fetch_graph":"https://pith.science/api/pith-number/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/graph.json","fetch_events":"https://pith.science/api/pith-number/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/action/storage_attestation","attest_author":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/action/author_attestation","sign_citation":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/action/citation_signature","submit_replication":"https://pith.science/pith/6PQDVZ6NKTKTOPKJ5QVTK4X5XH/action/replication_record"}},"created_at":"2026-05-18T03:02:09.576713+00:00","updated_at":"2026-05-18T03:02:09.576713+00:00"}