{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HF3BM35OAGB3IGEA7GLE7UDNOZ","short_pith_number":"pith:HF3BM35O","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"},"canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","source":{"kind":"arxiv","id":"1009.2706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2706","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2706v1","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2706","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"HF3BM35OAGB3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HF3BM35OAGB3IGEA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HF3BM35O","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HF3BM35OAGB3IGEA7GLE7UDNOZ","target":"record","payload":{"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"},"canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","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"},"source_kind":"arxiv","source_id":"1009.2706","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/UgP9iQeg66LvkGz+LbilCP1r20/mgbsKvmW1p+VaSoGSKKweo5Su1EseUHah75o5vRtVPoQ2GMcfdtYFf5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:20:31.243504Z"},"content_sha256":"22610b8439e906892001e9080340cb709099ebacbed9bf5ee56d5b1a5b15439f","schema_version":"1.0","event_id":"sha256:22610b8439e906892001e9080340cb709099ebacbed9bf5ee56d5b1a5b15439f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HF3BM35OAGB3IGEA7GLE7UDNOZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vt0nlDdCnu7mUGePsC56qlExSPui6LIewgnEy7jRBqyschjD3ilDMLoDsG/PCN1UKjskSavzCalQ9Q3p4uNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:20:31.244280Z"},"content_sha256":"02ef6cf3bccd546a8b6d85800c1a9c07503afe32ba5fe89f3de27b8a69fbb2b1","schema_version":"1.0","event_id":"sha256:02ef6cf3bccd546a8b6d85800c1a9c07503afe32ba5fe89f3de27b8a69fbb2b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/bundle.json","state_url":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T08:20:31Z","links":{"resolver":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ","bundle":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/bundle.json","state":"https://pith.science/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HF3BM35OAGB3IGEA7GLE7UDNOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HF3BM35OAGB3IGEA7GLE7UDNOZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fcba401da1854f37d6f13754c26862e178dfeea178b4e62d43533a033ec62d05","cross_cats_sorted":["cs.CC","cs.CL","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-14T16:06:02Z","title_canon_sha256":"cd6d5e675f83e845226b620832a386ce08a4dcb2e8898be1e339f956d8c72287"},"schema_version":"1.0","source":{"id":"1009.2706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2706","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2706v1","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2706","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"HF3BM35OAGB3","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HF3BM35OAGB3IGEA","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HF3BM35O","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:02ef6cf3bccd546a8b6d85800c1a9c07503afe32ba5fe89f3de27b8a69fbb2b1","target":"graph","created_at":"2026-05-18T04:40:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Artiom Alhazov, Sergey Verlan","cross_cats":["cs.CC","cs.CL","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-14T16:06:02Z","title":"Minimization Strategies for Maximally Parallel Multiset Rewriting Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2706","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:22610b8439e906892001e9080340cb709099ebacbed9bf5ee56d5b1a5b15439f","target":"record","created_at":"2026-05-18T04:40:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fcba401da1854f37d6f13754c26862e178dfeea178b4e62d43533a033ec62d05","cross_cats_sorted":["cs.CC","cs.CL","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-14T16:06:02Z","title_canon_sha256":"cd6d5e675f83e845226b620832a386ce08a4dcb2e8898be1e339f956d8c72287"},"schema_version":"1.0","source":{"id":"1009.2706","kind":"arxiv","version":1}},"canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3976166fae0183b41880f9964fd06d7659656fc0b836fa28cc6b145558eec14f","first_computed_at":"2026-05-18T04:40:56.534324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:56.534324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"agkMSmAgzgrc4Hqd5ANxUB83cb3rLfUNOlrMJL28n7AatGqQmZnBS5s2OApVx42ih0gyF/LaSin2OH4sMVtnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:56.535105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22610b8439e906892001e9080340cb709099ebacbed9bf5ee56d5b1a5b15439f","sha256:02ef6cf3bccd546a8b6d85800c1a9c07503afe32ba5fe89f3de27b8a69fbb2b1"],"state_sha256":"e18c868dc562be62fe9172e765d3eb041cd2ed2c5909054b1f71536a259daca5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xghHQJH/upxlyGhcbRxy2Nsw4fHyF7y/hkgSM03iPGBZ7teWwV/fVCRfImNFWu+Q/vsjrye8dVn6l67GRWujBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:20:31.248103Z","bundle_sha256":"fab8aecad8d94a54deda112ed0965b4902176e515603b45f2706b9f1e3a2308e"}}