{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MOF5L7GOBARFC44CUYXAS3MX2I","short_pith_number":"pith:MOF5L7GO","schema_version":"1.0","canonical_sha256":"638bd5fcce0822517382a62e096d97d2306fd79d3e87c58b2e99767f15efd048","source":{"kind":"arxiv","id":"1312.4414","version":1},"attestation_state":"computed","paper":{"title":"Small Universal Petri Nets with Inhibitor Arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.FL","authors_text":"Elisabeth Pelz, Sergey Verlan, Sergiu Ivanov","submitted_at":"2013-12-16T15:56:38Z","abstract_excerpt":"We investigate the problem of construction of small-size universal Petri nets with inhibitor arcs. We consider four descriptional complexity parameters: the number of places, transitions, inhibitor arcs, and the maximal degree of a transition, each of which we try to minimize.\n  We give six constructions having the following values of parameters (listed in the above order): $(30,34,13,3)$, $(14, 31, 51, 8)$, $(11, 31, 79, 11)$, $(21,25,13,5)$, $(67, 64, 8, 3)$, $(58, 55, 8, 5)$ that improve the few known results on this topic. Our investigation also highlights several interesting trade-offs."},"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":"1312.4414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-16T15:56:38Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a6204c2743c9b78151a70ddeb05da25f81d5fe49ed4666604110feaf92e3c594","abstract_canon_sha256":"499bf70160bad7e78f7c1a13f0d49729bc390633af256d40ef6004854f7b0e4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:24.767496Z","signature_b64":"w9C3SGVgRes/bjNuC8NXnYK8wu93Avn54KRgnnNzQNEICtBDy7RJ6RNs0SFfrIS7S+FyXDYk7ZBCEyk1i+AkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638bd5fcce0822517382a62e096d97d2306fd79d3e87c58b2e99767f15efd048","last_reissued_at":"2026-05-18T03:04:24.766650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:24.766650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Universal Petri Nets with Inhibitor Arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.FL","authors_text":"Elisabeth Pelz, Sergey Verlan, Sergiu Ivanov","submitted_at":"2013-12-16T15:56:38Z","abstract_excerpt":"We investigate the problem of construction of small-size universal Petri nets with inhibitor arcs. We consider four descriptional complexity parameters: the number of places, transitions, inhibitor arcs, and the maximal degree of a transition, each of which we try to minimize.\n  We give six constructions having the following values of parameters (listed in the above order): $(30,34,13,3)$, $(14, 31, 51, 8)$, $(11, 31, 79, 11)$, $(21,25,13,5)$, $(67, 64, 8, 3)$, $(58, 55, 8, 5)$ that improve the few known results on this topic. Our investigation also highlights several interesting trade-offs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4414","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":"1312.4414","created_at":"2026-05-18T03:04:24.766813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4414v1","created_at":"2026-05-18T03:04:24.766813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4414","created_at":"2026-05-18T03:04:24.766813+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOF5L7GOBARF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOF5L7GOBARFC44C","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOF5L7GO","created_at":"2026-05-18T12:27:52.871228+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/MOF5L7GOBARFC44CUYXAS3MX2I","json":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I.json","graph_json":"https://pith.science/api/pith-number/MOF5L7GOBARFC44CUYXAS3MX2I/graph.json","events_json":"https://pith.science/api/pith-number/MOF5L7GOBARFC44CUYXAS3MX2I/events.json","paper":"https://pith.science/paper/MOF5L7GO"},"agent_actions":{"view_html":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I","download_json":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I.json","view_paper":"https://pith.science/paper/MOF5L7GO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4414&json=true","fetch_graph":"https://pith.science/api/pith-number/MOF5L7GOBARFC44CUYXAS3MX2I/graph.json","fetch_events":"https://pith.science/api/pith-number/MOF5L7GOBARFC44CUYXAS3MX2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I/action/storage_attestation","attest_author":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I/action/author_attestation","sign_citation":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I/action/citation_signature","submit_replication":"https://pith.science/pith/MOF5L7GOBARFC44CUYXAS3MX2I/action/replication_record"}},"created_at":"2026-05-18T03:04:24.766813+00:00","updated_at":"2026-05-18T03:04:24.766813+00:00"}