{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5R3HLAJGB4DHYS5XBPFVNPTWNM","short_pith_number":"pith:5R3HLAJG","canonical_record":{"source":{"id":"1501.04777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"1e5e2b7fd3f878713e1bedaee052fb51ee56e62eb0f1e7e26403d33f6ae3ce3f","abstract_canon_sha256":"7b1950e7b91a731f1694680d1cad5dbe01e0c456a1eaf21bab3ddb301fad38bd"},"schema_version":"1.0"},"canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","source":{"kind":"arxiv","id":"1501.04777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04777","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04777v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04777","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"5R3HLAJGB4DH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5R3HLAJGB4DHYS5X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5R3HLAJG","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5R3HLAJGB4DHYS5XBPFVNPTWNM","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"1e5e2b7fd3f878713e1bedaee052fb51ee56e62eb0f1e7e26403d33f6ae3ce3f","abstract_canon_sha256":"7b1950e7b91a731f1694680d1cad5dbe01e0c456a1eaf21bab3ddb301fad38bd"},"schema_version":"1.0"},"canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.866839Z","signature_b64":"nJKV+6rXBR+8afksYOfRJp29Y8G6GzOsqMI2NajQhfmCZlZPYEI2LByCN6Gl5LNyZQYxArqUe3CwjtiC/ImFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","last_reissued_at":"2026-05-18T02:29:02.866412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.866412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04777","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N9bHDNMtXY75UJ1nbR6enmal5dGdYoQtnGLWrnJocJJ+9SS48wjidbozaIlWyx5ykPeXxLlia829uAdAkthDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:15:24.914440Z"},"content_sha256":"b2c4fb8cc93bb8df223f8f787e8e3ce1f0a97f5d006d1edae05f009cd8a0c60b","schema_version":"1.0","event_id":"sha256:b2c4fb8cc93bb8df223f8f787e8e3ce1f0a97f5d006d1edae05f009cd8a0c60b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5R3HLAJGB4DHYS5XBPFVNPTWNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transformation From Legal-marking Set to Admissible-marking Set of Petri Nets With Uncontrollable Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Carla Seatsu, Dan You, Mengchu Zhou, Shouguang Wang","submitted_at":"2015-01-20T12:21:13Z","abstract_excerpt":"Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its admissible-marking set given such a net. First, the concepts of an escaping-marking set and a transforming marking set are defined. Based on them, two algorithms are given to compute the admissible-marking set and the transforming marking set, which establish the theoretical foundation for the equivalent transformation of linear constraints. Second, the theory about the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04777","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-18T02:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBn9TFwBjXKNUJBOsS4d4Gj45+sXkavCe3NG24Wx9L+Y6e+s1bP83LH6nuap19LkfDD7K6cQKffJsiSYxRGoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:15:24.914792Z"},"content_sha256":"61226c838aacc99774e072af0b1e3fe6566def744db835fd49d3a69506ca3458","schema_version":"1.0","event_id":"sha256:61226c838aacc99774e072af0b1e3fe6566def744db835fd49d3a69506ca3458"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/bundle.json","state_url":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/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-06-01T15:15:24Z","links":{"resolver":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM","bundle":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/bundle.json","state":"https://pith.science/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5R3HLAJGB4DHYS5XBPFVNPTWNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5R3HLAJGB4DHYS5XBPFVNPTWNM","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":"7b1950e7b91a731f1694680d1cad5dbe01e0c456a1eaf21bab3ddb301fad38bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","title_canon_sha256":"1e5e2b7fd3f878713e1bedaee052fb51ee56e62eb0f1e7e26403d33f6ae3ce3f"},"schema_version":"1.0","source":{"id":"1501.04777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04777","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04777v1","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04777","created_at":"2026-05-18T02:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"5R3HLAJGB4DH","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5R3HLAJGB4DHYS5X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5R3HLAJG","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:61226c838aacc99774e072af0b1e3fe6566def744db835fd49d3a69506ca3458","target":"graph","created_at":"2026-05-18T02:29:02Z","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":"Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its admissible-marking set given such a net. First, the concepts of an escaping-marking set and a transforming marking set are defined. Based on them, two algorithms are given to compute the admissible-marking set and the transforming marking set, which establish the theoretical foundation for the equivalent transformation of linear constraints. Second, the theory about the e","authors_text":"Carla Seatsu, Dan You, Mengchu Zhou, Shouguang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","title":"Transformation From Legal-marking Set to Admissible-marking Set of Petri Nets With Uncontrollable Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04777","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:b2c4fb8cc93bb8df223f8f787e8e3ce1f0a97f5d006d1edae05f009cd8a0c60b","target":"record","created_at":"2026-05-18T02:29:02Z","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":"7b1950e7b91a731f1694680d1cad5dbe01e0c456a1eaf21bab3ddb301fad38bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-20T12:21:13Z","title_canon_sha256":"1e5e2b7fd3f878713e1bedaee052fb51ee56e62eb0f1e7e26403d33f6ae3ce3f"},"schema_version":"1.0","source":{"id":"1501.04777","kind":"arxiv","version":1}},"canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec767581260f067c4bb70bcb56be766b043de81785c8a62394bd0e4b5f33e05f","first_computed_at":"2026-05-18T02:29:02.866412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:02.866412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nJKV+6rXBR+8afksYOfRJp29Y8G6GzOsqMI2NajQhfmCZlZPYEI2LByCN6Gl5LNyZQYxArqUe3CwjtiC/ImFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:02.866839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2c4fb8cc93bb8df223f8f787e8e3ce1f0a97f5d006d1edae05f009cd8a0c60b","sha256:61226c838aacc99774e072af0b1e3fe6566def744db835fd49d3a69506ca3458"],"state_sha256":"03bd1c2e6ab82276d84c8cc5695611c010cff2133c6ecf11d3c65910777b1764"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kDaLquM6g+tRHNxc85OqRpROGlerfjt3IYg9BbXXWDtyCx2wmGKbYgwhkcIcN0gdAk0x8nOeCkcjgavN64gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:15:24.916778Z","bundle_sha256":"ccf0559eb97615f23149ce92bd44b15263a2a594a813359cd8003ad0d2415f44"}}