{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HF3BM35OAGB3IGEA7GLE7UDNOZ","short_pith_number":"pith:HF3BM35O","schema_version":"1.0","canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","source":{"kind":"arxiv","id":"1009.2706","version":1},"attestation_state":"computed","paper":{"title":"Minimization Strategies for Maximally Parallel Multiset Rewriting Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.DM"],"primary_cat":"cs.FL","authors_text":"Artiom Alhazov, Sergey Verlan","submitted_at":"2010-09-14T16:06:02Z","abstract_excerpt":"Maximally parallel multiset rewriting systems (MPMRS) give a convenient way to express relations between unstructured objects. The functioning of various computational devices may be expressed in terms of MPMRS (e.g., register machines and many variants of P systems). In particular, this means that MPMRS are computationally complete; however, a direct translation leads to quite a big number of rules. Like for other classes of computationally complete devices, there is a challenge to find a universal system having the smallest number of rules. In this article we present different rule minimizat"},"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":"1009.2706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-14T16:06:02Z","cross_cats_sorted":["cs.CC","cs.CL","cs.DM"],"title_canon_sha256":"cd6d5e675f83e845226b620832a386ce08a4dcb2e8898be1e339f956d8c72287","abstract_canon_sha256":"fcba401da1854f37d6f13754c26862e178dfeea178b4e62d43533a033ec62d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:56.535105Z","signature_b64":"agkMSmAgzgrc4Hqd5ANxUB83cb3rLfUNOlrMJL28n7AatGqQmZnBS5s2OApVx42ih0gyF/LaSin2OH4sMVtnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","last_reissued_at":"2026-05-18T04:40:56.534324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:56.534324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization Strategies for Maximally Parallel Multiset Rewriting Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.DM"],"primary_cat":"cs.FL","authors_text":"Artiom Alhazov, Sergey Verlan","submitted_at":"2010-09-14T16:06:02Z","abstract_excerpt":"Maximally parallel multiset rewriting systems (MPMRS) give a convenient way to express relations between unstructured objects. The functioning of various computational devices may be expressed in terms of MPMRS (e.g., register machines and many variants of P systems). In particular, this means that MPMRS are computationally complete; however, a direct translation leads to quite a big number of rules. Like for other classes of computationally complete devices, there is a challenge to find a universal system having the smallest number of rules. In this article we present different rule minimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2706","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":"1009.2706","created_at":"2026-05-18T04:40:56.534460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2706v1","created_at":"2026-05-18T04:40:56.534460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2706","created_at":"2026-05-18T04:40:56.534460+00:00"},{"alias_kind":"pith_short_12","alias_value":"HF3BM35OAGB3","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HF3BM35OAGB3IGEA","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HF3BM35O","created_at":"2026-05-18T12:26:07.630475+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/HF3BM35OAGB3IGEA7GLE7UDNOZ","json":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ.json","graph_json":"https://pith.science/api/pith-number/HF3BM35OAGB3IGEA7GLE7UDNOZ/graph.json","events_json":"https://pith.science/api/pith-number/HF3BM35OAGB3IGEA7GLE7UDNOZ/events.json","paper":"https://pith.science/paper/HF3BM35O"},"agent_actions":{"view_html":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ","download_json":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ.json","view_paper":"https://pith.science/paper/HF3BM35O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2706&json=true","fetch_graph":"https://pith.science/api/pith-number/HF3BM35OAGB3IGEA7GLE7UDNOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HF3BM35OAGB3IGEA7GLE7UDNOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/action/storage_attestation","attest_author":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/action/author_attestation","sign_citation":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/action/citation_signature","submit_replication":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/action/replication_record"}},"created_at":"2026-05-18T04:40:56.534460+00:00","updated_at":"2026-05-18T04:40:56.534460+00:00"}