{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UTEL7EQEAZUM4RRAGJUFGECZ2W","short_pith_number":"pith:UTEL7EQE","schema_version":"1.0","canonical_sha256":"a4c8bf92040668ce46203268531059d5a21fd477fc40e0eb443f3b890180b4e3","source":{"kind":"arxiv","id":"1711.00220","version":1},"attestation_state":"computed","paper":{"title":"The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christian Rosenke, Ronny Tredup","submitted_at":"2017-11-01T06:28:52Z","abstract_excerpt":"Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial processes. Given a labeled transition system (TS) $A$, feasibility is the NP-complete decision problem whether $A$ can be equivalently synthesized into an ENS. It is well known that $A$ is feasible if and only if it has the event state separation property (ESSP) and the state separation property (SSP). Recently, these properties have also been studied individually for their practical implications. A fast ESSP algorithm, f"},"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":"1711.00220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-01T06:28:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8be08023af68565ebcc7cad224a08c5fcbc550fdb1f671a65a47b87515e22e46","abstract_canon_sha256":"9c95b7419f1a7126d59bcf2b7ad8b5b68f884c3b1824214b094816d5aa35d9f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.777158Z","signature_b64":"SmaA2pSj9TtcD9Li4fELv6vpgxqiUtBon2Ep80H43vb+ywmAilT5sM5311oI9IbDMeUSEOezNVqmA3QH+7cNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c8bf92040668ce46203268531059d5a21fd477fc40e0eb443f3b890180b4e3","last_reissued_at":"2026-05-18T00:31:34.776446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.776446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Christian Rosenke, Ronny Tredup","submitted_at":"2017-11-01T06:28:52Z","abstract_excerpt":"Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial processes. Given a labeled transition system (TS) $A$, feasibility is the NP-complete decision problem whether $A$ can be equivalently synthesized into an ENS. It is well known that $A$ is feasible if and only if it has the event state separation property (ESSP) and the state separation property (SSP). Recently, these properties have also been studied individually for their practical implications. A fast ESSP algorithm, f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00220","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":"1711.00220","created_at":"2026-05-18T00:31:34.776556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00220v1","created_at":"2026-05-18T00:31:34.776556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00220","created_at":"2026-05-18T00:31:34.776556+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTEL7EQEAZUM","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTEL7EQEAZUM4RRA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTEL7EQE","created_at":"2026-05-18T12:31:49.984773+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/UTEL7EQEAZUM4RRAGJUFGECZ2W","json":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W.json","graph_json":"https://pith.science/api/pith-number/UTEL7EQEAZUM4RRAGJUFGECZ2W/graph.json","events_json":"https://pith.science/api/pith-number/UTEL7EQEAZUM4RRAGJUFGECZ2W/events.json","paper":"https://pith.science/paper/UTEL7EQE"},"agent_actions":{"view_html":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W","download_json":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W.json","view_paper":"https://pith.science/paper/UTEL7EQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00220&json=true","fetch_graph":"https://pith.science/api/pith-number/UTEL7EQEAZUM4RRAGJUFGECZ2W/graph.json","fetch_events":"https://pith.science/api/pith-number/UTEL7EQEAZUM4RRAGJUFGECZ2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W/action/storage_attestation","attest_author":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W/action/author_attestation","sign_citation":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W/action/citation_signature","submit_replication":"https://pith.science/pith/UTEL7EQEAZUM4RRAGJUFGECZ2W/action/replication_record"}},"created_at":"2026-05-18T00:31:34.776556+00:00","updated_at":"2026-05-18T00:31:34.776556+00:00"}