{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TM4YMBWCZYEI3SKW2NPAXFMRMI","short_pith_number":"pith:TM4YMBWC","canonical_record":{"source":{"id":"1106.2122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T17:11:53Z","cross_cats_sorted":["cs.CC","cs.DS","cs.FL"],"title_canon_sha256":"296d406a98dba7564926d159af6263a80ce7ae633ee27e889d372bc1dd15ee15","abstract_canon_sha256":"eb990d923c555fb1669e00b756a06751be9511dbd1df8fe6727579b9b1f221e1"},"schema_version":"1.0"},"canonical_sha256":"9b398606c2ce088dc956d35e0b9591621f746e3432771ed8089463da0e114fa4","source":{"kind":"arxiv","id":"1106.2122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2122","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2122v1","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2122","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"TM4YMBWCZYEI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TM4YMBWCZYEI3SKW","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TM4YMBWC","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TM4YMBWCZYEI3SKW2NPAXFMRMI","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T17:11:53Z","cross_cats_sorted":["cs.CC","cs.DS","cs.FL"],"title_canon_sha256":"296d406a98dba7564926d159af6263a80ce7ae633ee27e889d372bc1dd15ee15","abstract_canon_sha256":"eb990d923c555fb1669e00b756a06751be9511dbd1df8fe6727579b9b1f221e1"},"schema_version":"1.0"},"canonical_sha256":"9b398606c2ce088dc956d35e0b9591621f746e3432771ed8089463da0e114fa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.612018Z","signature_b64":"TQLdQFns1jTqBUSYUac3qwY0beucaIdNE8r/mw9u80WPqjudI2W9lajovfsOZlPLSwsB/TKWJ1165E1r62IVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b398606c2ce088dc956d35e0b9591621f746e3432771ed8089463da0e114fa4","last_reissued_at":"2026-05-18T04:20:13.611469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.611469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2122","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:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPWlMFb7mlej+0UBsVHA7zE65d/9hEyWwCNf39eUtKUzhzNP8pWSQeTWtCS9dq063WUVeFQj1Nx1u9VeVKg2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:09:10.254311Z"},"content_sha256":"b41ba5ee4a2bacc7cf8958a3320249a61505eacac8a14593331551eb2a780a13","schema_version":"1.0","event_id":"sha256:b41ba5ee4a2bacc7cf8958a3320249a61505eacac8a14593331551eb2a780a13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TM4YMBWCZYEI3SKW2NPAXFMRMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized complexity results for 1-safe Petri nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.FL"],"primary_cat":"cs.LO","authors_text":"Kamal Lodaya, M. Praveen","submitted_at":"2011-06-10T17:11:53Z","abstract_excerpt":"We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we give W[1]-hardness results for many problems about 1-safe Petri nets. As a corollary, this proves a conjecture of Downey et. al. about the hardness of some graph pebbling problems. We consider the parameter benefit depth (that is known to be helpful in getting better algorithms for general Petri nets) and again give W[1]-hardness results for various problems on 1-safe Petri nets. We also consider the stronger paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2122","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:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3gfLBVFcCswY/qb1s6uP2oXympZdjhp5XXTBnc45dHGkmf6kz1OsfkNwvD4oY+jKgIdZbLPZS4dU00J2u/uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:09:10.254677Z"},"content_sha256":"accd52e8ea51223b93b910dc5d452bbb66f9f586d1e4b52f8a42e6a7712ed61e","schema_version":"1.0","event_id":"sha256:accd52e8ea51223b93b910dc5d452bbb66f9f586d1e4b52f8a42e6a7712ed61e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/bundle.json","state_url":"https://pith.science/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/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-07T21:09:10Z","links":{"resolver":"https://pith.science/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI","bundle":"https://pith.science/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/bundle.json","state":"https://pith.science/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM4YMBWCZYEI3SKW2NPAXFMRMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TM4YMBWCZYEI3SKW2NPAXFMRMI","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":"eb990d923c555fb1669e00b756a06751be9511dbd1df8fe6727579b9b1f221e1","cross_cats_sorted":["cs.CC","cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T17:11:53Z","title_canon_sha256":"296d406a98dba7564926d159af6263a80ce7ae633ee27e889d372bc1dd15ee15"},"schema_version":"1.0","source":{"id":"1106.2122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2122","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2122v1","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2122","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"TM4YMBWCZYEI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TM4YMBWCZYEI3SKW","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TM4YMBWC","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:accd52e8ea51223b93b910dc5d452bbb66f9f586d1e4b52f8a42e6a7712ed61e","target":"graph","created_at":"2026-05-18T04:20:13Z","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 associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we give W[1]-hardness results for many problems about 1-safe Petri nets. As a corollary, this proves a conjecture of Downey et. al. about the hardness of some graph pebbling problems. We consider the parameter benefit depth (that is known to be helpful in getting better algorithms for general Petri nets) and again give W[1]-hardness results for various problems on 1-safe Petri nets. We also consider the stronger paramet","authors_text":"Kamal Lodaya, M. Praveen","cross_cats":["cs.CC","cs.DS","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T17:11:53Z","title":"Parameterized complexity results for 1-safe Petri nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2122","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:b41ba5ee4a2bacc7cf8958a3320249a61505eacac8a14593331551eb2a780a13","target":"record","created_at":"2026-05-18T04:20:13Z","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":"eb990d923c555fb1669e00b756a06751be9511dbd1df8fe6727579b9b1f221e1","cross_cats_sorted":["cs.CC","cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T17:11:53Z","title_canon_sha256":"296d406a98dba7564926d159af6263a80ce7ae633ee27e889d372bc1dd15ee15"},"schema_version":"1.0","source":{"id":"1106.2122","kind":"arxiv","version":1}},"canonical_sha256":"9b398606c2ce088dc956d35e0b9591621f746e3432771ed8089463da0e114fa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b398606c2ce088dc956d35e0b9591621f746e3432771ed8089463da0e114fa4","first_computed_at":"2026-05-18T04:20:13.611469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:13.611469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TQLdQFns1jTqBUSYUac3qwY0beucaIdNE8r/mw9u80WPqjudI2W9lajovfsOZlPLSwsB/TKWJ1165E1r62IVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:13.612018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b41ba5ee4a2bacc7cf8958a3320249a61505eacac8a14593331551eb2a780a13","sha256:accd52e8ea51223b93b910dc5d452bbb66f9f586d1e4b52f8a42e6a7712ed61e"],"state_sha256":"020b8da3ab8ed5c7afa53921cd93b785e5a8afb29140136233d841dce75caf27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2K4OgQj7dSx8fMrBpoccNT4qvsvwo8911B49gcxqmHgoBL5MBam2HKeBtg1vy1WGzbPWdSCmIpsYbCseQhSDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:09:10.257986Z","bundle_sha256":"159c4b44e16427d2b790b429dfba1a893b1505e4b32f038598995f72b2266f95"}}