{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O25T4ZHXQ6SSWG3ABEI4NJVAZH","short_pith_number":"pith:O25T4ZHX","canonical_record":{"source":{"id":"1011.3964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6b015814b79915b96710c7a9cfb73d6a18cc1d48cb2a4de9a90bfb39e7ed9c2","abstract_canon_sha256":"89959bdf0194f00993dddfccbcf5291fabc666e12db05f9732d0926620e1c6d1"},"schema_version":"1.0"},"canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","source":{"kind":"arxiv","id":"1011.3964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3964","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3964v1","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3964","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"O25T4ZHXQ6SS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O25T4ZHXQ6SSWG3A","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O25T4ZHX","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O25T4ZHXQ6SSWG3ABEI4NJVAZH","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6b015814b79915b96710c7a9cfb73d6a18cc1d48cb2a4de9a90bfb39e7ed9c2","abstract_canon_sha256":"89959bdf0194f00993dddfccbcf5291fabc666e12db05f9732d0926620e1c6d1"},"schema_version":"1.0"},"canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:47.304173Z","signature_b64":"FEXeg1PAR7Dug71IL/yYphoF2sWKBk9fLlzqnsZPteamYkfBLLG1Ygxiw0MgHmi5pe1cDlYRDMIMS6NSQEM0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","last_reissued_at":"2026-05-18T04:35:47.303596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:47.303596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3964","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:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYIsthnYB0qkQWqcplcsfJapQrnFARycYdvUAq4Ebin+CQ5ua0qZ7pIe7rp9RfJzAl8lmNeH5zBBYfPB+bflDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:27:18.675099Z"},"content_sha256":"d56abb5968ebd4fedba82a0aa12d8dc449360e9086bdb4c406a0ecffd3a4b41a","schema_version":"1.0","event_id":"sha256:d56abb5968ebd4fedba82a0aa12d8dc449360e9086bdb4c406a0ecffd3a4b41a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O25T4ZHXQ6SSWG3ABEI4NJVAZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision Problems for Petri Nets with Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David de Frutos-Escrig, Fernando Rosa-Velardo","submitted_at":"2010-11-17T14:11:53Z","abstract_excerpt":"We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3964","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:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/ie5LIzT/cBN/q+600/FP+JuM3QjXUDCvnVf2JCovlXdT0p974xy5lzpttlVzZ+pwMOi3m6Y2Eo1EZF4ksDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:27:18.675446Z"},"content_sha256":"a10cda086fd96732e9ea6d4f63ded902d0d9b7138758d3108be964ebec99602d","schema_version":"1.0","event_id":"sha256:a10cda086fd96732e9ea6d4f63ded902d0d9b7138758d3108be964ebec99602d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/bundle.json","state_url":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/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-24T19:27:18Z","links":{"resolver":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH","bundle":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/bundle.json","state":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O25T4ZHXQ6SSWG3ABEI4NJVAZH","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":"89959bdf0194f00993dddfccbcf5291fabc666e12db05f9732d0926620e1c6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","title_canon_sha256":"e6b015814b79915b96710c7a9cfb73d6a18cc1d48cb2a4de9a90bfb39e7ed9c2"},"schema_version":"1.0","source":{"id":"1011.3964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3964","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3964v1","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3964","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"O25T4ZHXQ6SS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O25T4ZHXQ6SSWG3A","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O25T4ZHX","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:a10cda086fd96732e9ea6d4f63ded902d0d9b7138758d3108be964ebec99602d","target":"graph","created_at":"2026-05-18T04:35:47Z","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":"We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem","authors_text":"David de Frutos-Escrig, Fernando Rosa-Velardo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","title":"Decision Problems for Petri Nets with Names"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3964","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:d56abb5968ebd4fedba82a0aa12d8dc449360e9086bdb4c406a0ecffd3a4b41a","target":"record","created_at":"2026-05-18T04:35:47Z","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":"89959bdf0194f00993dddfccbcf5291fabc666e12db05f9732d0926620e1c6d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","title_canon_sha256":"e6b015814b79915b96710c7a9cfb73d6a18cc1d48cb2a4de9a90bfb39e7ed9c2"},"schema_version":"1.0","source":{"id":"1011.3964","kind":"arxiv","version":1}},"canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","first_computed_at":"2026-05-18T04:35:47.303596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:47.303596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FEXeg1PAR7Dug71IL/yYphoF2sWKBk9fLlzqnsZPteamYkfBLLG1Ygxiw0MgHmi5pe1cDlYRDMIMS6NSQEM0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:47.304173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d56abb5968ebd4fedba82a0aa12d8dc449360e9086bdb4c406a0ecffd3a4b41a","sha256:a10cda086fd96732e9ea6d4f63ded902d0d9b7138758d3108be964ebec99602d"],"state_sha256":"645a2f5368ce4149978411a1b88a5a548520c8dd2859cea2c62f5b3f0b30be06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyxPuBWgyvOE3PsTzT232klpcrzWpqsnQYPTxvhjwV5Ony0m+z6eFXFXIYR1jxt1ozPpx2echsicS16bUz7WBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:27:18.677355Z","bundle_sha256":"e0ef1583c5ba6b619cfe039664bb5c70a667533c5ecd20770d907beb6fea8691"}}