{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O7M4XOSVTEVGWDOJKTNM2P5MMH","short_pith_number":"pith:O7M4XOSV","schema_version":"1.0","canonical_sha256":"77d9cbba55992a6b0dc954dacd3fac61d1d35a8465d1836d580f6231a4904bf6","source":{"kind":"arxiv","id":"1601.06945","version":2},"attestation_state":"computed","paper":{"title":"Exact Finite-State Machine Identification from Scenarios and Temporal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SE","authors_text":"Anatoly Shalyto, Igor Buzhinsky, Vladimir Ulyantsev","submitted_at":"2016-01-26T09:34:15Z","abstract_excerpt":"Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latter application is associated with the problems of software synthesis and automatic derivation of software models from specification. Smaller synthesized models are more general and are easier to comprehend, yet the problem of minimum FSM identification has received little attention in previous research.\n  This paper presents four exact methods to tackle the problem of minimum FSM identification from a "},"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":"1601.06945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-01-26T09:34:15Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"98898b4e4c0ba985463220afb493e4b7c340f10c7e2f92cd7b1ae24ebb0ebccb","abstract_canon_sha256":"d01ebc9f19a0e129b9587c1f277bbb291ae82c7ae8b609f554bacf25302895bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.054562Z","signature_b64":"r3jhcpEattSwaukf5vmEwyA2LMJcMowV/xb6V5IsNrQDa5x5mrQdwvripc6HPGEve+w9BHbCX5/5WnzRAA/8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77d9cbba55992a6b0dc954dacd3fac61d1d35a8465d1836d580f6231a4904bf6","last_reissued_at":"2026-05-18T00:57:38.053940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.053940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Finite-State Machine Identification from Scenarios and Temporal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SE","authors_text":"Anatoly Shalyto, Igor Buzhinsky, Vladimir Ulyantsev","submitted_at":"2016-01-26T09:34:15Z","abstract_excerpt":"Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latter application is associated with the problems of software synthesis and automatic derivation of software models from specification. Smaller synthesized models are more general and are easier to comprehend, yet the problem of minimum FSM identification has received little attention in previous research.\n  This paper presents four exact methods to tackle the problem of minimum FSM identification from a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06945","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.06945","created_at":"2026-05-18T00:57:38.054024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06945v2","created_at":"2026-05-18T00:57:38.054024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06945","created_at":"2026-05-18T00:57:38.054024+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7M4XOSVTEVG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7M4XOSVTEVGWDOJ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7M4XOSV","created_at":"2026-05-18T12:30:36.002864+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/O7M4XOSVTEVGWDOJKTNM2P5MMH","json":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH.json","graph_json":"https://pith.science/api/pith-number/O7M4XOSVTEVGWDOJKTNM2P5MMH/graph.json","events_json":"https://pith.science/api/pith-number/O7M4XOSVTEVGWDOJKTNM2P5MMH/events.json","paper":"https://pith.science/paper/O7M4XOSV"},"agent_actions":{"view_html":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH","download_json":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH.json","view_paper":"https://pith.science/paper/O7M4XOSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06945&json=true","fetch_graph":"https://pith.science/api/pith-number/O7M4XOSVTEVGWDOJKTNM2P5MMH/graph.json","fetch_events":"https://pith.science/api/pith-number/O7M4XOSVTEVGWDOJKTNM2P5MMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH/action/storage_attestation","attest_author":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH/action/author_attestation","sign_citation":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH/action/citation_signature","submit_replication":"https://pith.science/pith/O7M4XOSVTEVGWDOJKTNM2P5MMH/action/replication_record"}},"created_at":"2026-05-18T00:57:38.054024+00:00","updated_at":"2026-05-18T00:57:38.054024+00:00"}